• 한국국방경영분석학회지
• /
• 제2권1호
• /
• pp.177-184
• /
• 1976

As the organizational size of a military service or business increases and its management becomes complex, the success in its management depends less on static type of management but more on careful, dynamic type of management. In this thesis, an operations research technique is applied to the problems of determining optimal air traffic control rule and of optimal capacity of air base for a military air base. An airport runway is regarded as the service facility in a queueing mechanism, used by landing, low approach, and departing aircraft. The usual order of service gives priority different classes of aircraft such as landings, departures, and low approaches; here service disciplines are considered assigning priorities to different classes of aricraft grouped according to required runway time. Several such priority rules are compared by means of a steady-state queueing model with non-preemptive priorities. From the survey conducted for the thesis development, it was found that the flight pattern such as departure, law approach, and landing within a control zone, follows a Poisson distribution and the service time follows an Erlang distribution. In the problem of choosing the optimal air traffic control rule, the control rule of giving service priority to the aircraft with a minimum average waiting cost, regardless of flight patterns, was found to be the optimal one. Through a simulation with data collected at K-O O Air Base, the optimal take-off interval and the optimal capacity of aircraft to be employed were determined.

• 한국통신학회논문지
• /
• 제19권10호
• /
• pp.1945-1956
• /
• 1994

본 논문에서는 기존의 통신망을 통합하여 고속 멀티미디어 통신이 가능하도록 하는 다중 액세스망 프로토콜을 제시하였다. 향후 구축될 광대역 종합통신망과의 접속을 위해서는 새로운 구조 및 형식에 대한 정의가 필요하며, 이를 위해 기존의 고속링 프로토콜인 ATMR 및 MetaRing에 대해 알아보고, 그 기본 구성의 문제점을 분석하여 새로운 액세스 매커니즘을 제안하였다. ATMR은 윈도우 크기를 재설정하기 위한 리셋시간이 요구되므로 채널효율이 떨어지며, MetaRing의 경우에는 채널의 효율은 증가되지만 파라미터가 고정되어 있어 트래픽의 변화에 따라 성능이 크게 좌우된다. 이에 반해 제안된 프로토콜은 트래픽의 변화에 따라 파라미터를 능동적으로 변화시킴으로서 최적의 상태로 트래픽 제어가 가능하게 되며, 우선순위 기법을 적용하여 동기 및 비동기 트래픽의 통합 제어가 가능하도록 하였다. 본 메카니즘은 기존망의 통합 및 ATM 망을 구성하는 괴도단계의 시범방 구성에 응용될 수 있을 것으로 기대된다.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2007년도 추계 종합학술대회 논문집
• /
• pp.60-64
• /
• 2007

VoIP, 영상회의, DMB, IPTV 등과 같은 멀티미디어 서비스의 활용이 급증하여 네트워크 트래픽이 증가되므로 흐름제어에 관한 실시간 트래픽 메커니즘이 요구되고 있다. 이에 따라 실시간 멀티미디어 데이터를 전송하기 위해 주기적으로 피드백되는 RTP/RTCP 패킷을 통해 수신측의 패킷 손실률과 패킷 지연시간으로 측정되는 네트워크 상태정보를 이용하여 전송률을 조절할 수 있다. 본 연구에서는 멀티캐스트에 효율적인 흐름제어와 RTCP를 기반으로 피드백 전송지연의 오차율을 줄이고, 네트워크의 실시간 트래픽에 대한 동적 변화에 적응할 수 있는 기법을 제안한다. 본 연구의 시뮬레이션 결과, 네트워크 상태에 적응적으로 전송률을 조절하며 대역폭의 최대 활용과 패킷 손실의 최소화를 이룰 수 있다.

• 한국콘텐츠학회논문지
• /
• 제8권8호
• /
• pp.57-64
• /
• 2008

지연시간으로 인한 부정확한 네트워크 상태정보로 발생되는 문제점을 해결하기 위해 단방향 지연시간을 이용하여 정확한 지연정보로 네트워크 상황을 판단하고 TFRC 흐름제어를 기반으로 네트워크 상태변화에 따란 실시간 멀티미디어 데이터의 전송율을 적절하게 조절할 수 있는 흐름제어 기법을 제안한다. 본 논문의 시뮬레이션 결과, 네트워트 상태 정보 측정을 위해 RTT와 $OWD{\times}2$를 비교하여 평균적으로 약 12% 차이를 보였다. RTT를 사용하였을 경우 TFRC가 TCP보다 약 32%정도 더 많은 대역폭을 사용하였으며, OWD를 사용하였을 경우 3%정도의 오차를 보이고 링크의 공정한 대역폭을 사용할 수 있다. 네트워크 상황을 판단하고 TFRC 기반으로 네트워크 상태변화에 따라 TCP와 공정한 대역폭을 사용하면서 실시간 데이터 전송에 맞게 전송율을 적절하게 조절하여 사용자들에게 고품질의 서비스를 제공할 수 있다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(1)
• /
• pp.221-224
• /
• 2000

The issue of supporting TCP traffic over ATM networks is currently one of the most important issues in the field of data networks. One important part of this issue is congestion control. In general, congestion control uses method such as packet drop to relieve network resource when the network is congested so as to maintain high throughput and low delay. In addition, congestion control is required to ensure fair sharing of resources among all users during congestion. In this paper we propose a new congestion control method using WRED & per-VC accounting mechanism. This packet discard scheme is proposed with the goal to provide both good performance in terms of throughput and fairness in terms of bandwidth exploitation of the output link among all virtual circuits.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2009년도 정보 및 제어 심포지움 논문집
• /
• pp.91-93
• /
• 2009

In this paper, we present the Q-learning method for adaptive traffic signal control on the basis of In this paper, we present the Q-learning method for adaptive traffic signal control on the basis of multi-agent technology. The structure is composed of sixphase agents and one intersection agent. Wireless communication network provides the possibility of the cooperation of agents. As one kind of reinforcement learning, Q-learning is adopted as the algorithm of the control mechanism, which can acquire optical control strategies from delayed reward; furthermore, we adopt dynamic learning method instead of static method, which is more practical. Simulation result indicates that it is more effective than traditional signal system.

• Journal of Communications and Networks
• /
• 제12권3호
• /
• pp.253-265
• /
• 2010

The problem of pricing for a telecommunication network is investigated with respect to the users' sensitivity to the pricing structure. A functional optimization problem is formulated, in order to compute price reallocations as functions of data collected in real time during the network evolution. No a-priori knowledge about the users' utility functions and the traffic demands is required, since adaptive reactions to the network conditions are sought in real time. To this aim, a neural approximation technique is studied to exploit an optimal pricing control law, able to counteract traffic changes with a small on-line computational effort. Owing to the generality of the mathematical framework under investigation, our control methodology can be generalized for other decision variables and cost functionals.

• 전자공학회논문지S
• /
• 제35S권5호
• /
• pp.1-10
• /
• 1998

Satellite communication is getting more important in the coming 21st century because of its wide areas sevice capability, ease of access, and fast channel establishment. As such, satellite communication networks will be the basis of the global communication system in cooperation with the ground ATM networks. In this paper, we consider an efficient transmission methodology of ATM cells over the satellite communication channel. We first analyze possible bottlenecks and performance deterioration factors in the case, and then propose an enhanced cell trasmission mechanism. In order to use satellite channel for ATM cell transmission, the application of complicated channel coding is inevitable. However, the forwared error control such as convolutional encoding brings forth burst errors, which calls for the application of some kind of interleaving mechanism to randomize the burst errors at the receiver. Another aspect which should b econsidered in satellite communication system is the inherent transmission delay, which can be very considered in satellite communication system is te inherent transmission delay, which can be very critical to the delay-sensitive ATM traffic. Therefore, we propose that the processing delay at the block interleaving stage should be controlled propose a variable-size block interleaving mechanism which utilizes the predicted transmission delay for each traffic in the queues of the transmitter. According to the computer simulation, the proposed mechanism could improve the overall performance by drastically reducing the ATM cell drop rate owing to the excessive transmission delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권7호
• /
• pp.2512-2531
• /
• 2014

We propose a new Distributed Denial of Service (DDoS) defense mechanism that protects http web servers from application-level DDoS attacks based on the two methodologies: whitelist-based admission control and busy period-based attack flow detection. The attack flow detection mechanism detects attach flows based on the symptom or stress at the server, since it is getting more difficult to identify bad flows only based on the incoming traffic patterns. The stress is measured by the time interval during which a given client makes the server busy, referred to as a client-induced server busy period (CSBP). We also need to protect the servers from a sudden surge of attack flows even before the malicious flows are identified by the attack flow detection mechanism. Thus, we use whitelist-based admission control mechanism additionally to control the load on the servers. We evaluate the performance of the proposed scheme via simulation and experiment. The simulation results show that our defense system can mitigate DDoS attacks effectively even under a large number of attack flows, on the order of thousands, and the experiment results show that our defense system deployed on a linux machine is sufficiently lightweight to handle packets arriving at a rate close to the link rate.

• Journal of Communications and Networks
• /
• 제11권3호
• /
• pp.297-305
• /
• 2009

Multiprotocol label switching (MPLS) networks require dynamic flow admission control to guarantee end-to-end quality of service (QoS) for each Internet protocol (IP) traffic flow. In this paper, we propose to tackle the joint routing and admission control problem for the IP traffic flows in MPLS networks without rerouting already admitted flows. We propose two mathematical programming models for this problem. The first model includes end-to-end delay constraints and the second one, end-to-end packet loss constraints. These end-to-end QoS constraints are imposed not only for the new traffic flow, but also for all already admitted flows in the network. The objective function of both models is to minimize the end-to-end delay for the new flow. Numerical results show that considering end-to-end delay (or packet loss) constraints for all flows has a small impact on the flow blocking rate. Moreover, we reduces significantly the mean end-to-end delay (or the mean packet loss rate) and the proposed approach is able to make its decision within 250 msec.