• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권11호
• /
• pp.1946-1958
• /
• 2011

Wireless Sensor Network (WSN) is made up of a number of sensor nodes and base stations. Traffic flow in WSN appears self-similar due to its data delivery process, and this impacts queue length greatly and makes queuing delay worse. Active queue management can be designed to improve QoS performance for WSN. In this paper, we propose self-similar traffic rate estimating algorithm named Power-Law Moving Averaging (PLMA) to regulate packet marking probability. This algorithm improves the availability of the rate estimation algorithm under the self-similar traffic condition. Then, we propose an adaptive Proportional Integral algorithm (SSPI) based on the estimation of the Self-Similar traffic rate by PLMA. Simulation results show that SSPI can achieve lower queue length jitter and smaller setting time than PI.

• 디지털산업정보학회논문지
• /
• 제8권2호
• /
• pp.81-94
• /
• 2012

This paper suggests PARED algorithm, a modified RED algorithm, that actively reacts to dynamic changes in network to apply packet drop probability flexibly. The main idea of PARED algorithm is that it compares the target queue length to the average queue length which is the criterion of changes in packet drop probability and feeds the gap into packet drop probability. That is, when the difference between the average queue length and the target queue length is great, it reflects as much as the difference in packet drop probability, and reflects little when the difference is little. By doing so, packet drop probability could be actively controled and effectively dealt with in the network traffic situation. To evaluate the performance of the suggested algorithm, we conducted simulations by changing network traffic into a dynamic stat. At the experiments, the suggested algorithm was compared to the existing RED one and then to ARED one that provided the basic idea for this algorithm. The results proved that the suggested PARED algorithm is superior to the existing algorithms.

• Management Science and Financial Engineering
• /
• 제15권1호
• /
• pp.51-69
• /
• 2009

A network model and a Genetic Algorithm (GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing a non-linear objective function with the linear constraints. In the model, the flow-conservation constraints are utilized to restrict the solution space and to force the link flows become consistent to the traffic counts. The objective of the model is to minimize the discrepancies between two sets of link flows. One is the set of link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links. The other is the set of link flows those are estimated through the trip distribution and traffic assignment using the path flow estimator in the logit-based SUE. In the proposed GA, a chromosome is defined as a real vector representing a set of Origin-Destination Matrix (ODM), link flows and route-choice dispersion coefficient. Each chromosome is evaluated by the corresponding discrepancies. The population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment technique is used during the crossover and mutation.

• 한국통신학회논문지
• /
• 제29권7B호
• /
• pp.641-649
• /
• 2004

홈 네트워크에서 다양한 응용(application) 트래픽(traffic) 간의 차등화 된 서비스를 제공하기 위해서 트래픽 변화에 따라 적응적으로 우선순위(priority)를 재할당하는 알고리즘을 제안하고, FPGA를 이용하여 구현하였다. 제안된 구조는 QoS를 위한 부가적인 시그널링 프로토콜이 없이도 네트워크 트래픽 조절이 가능하도록 설계되었고, 또한 홈 네트워크 트래픽을 그 특징에 따라 제어 데이터 트래픽, 일반 인터넷이나 데이터 트래픽, 그리고 멀티미디어 데이터 트래픽으로 분류하고 이를 네트워크 트래픽 상황에 적응적으로 차등화 서비스를 제공할 수 있도록 설계되었다. 시뮬레이션을 통하여 제시한 알고리즘의 성능을 검증하고 FPGA구현을 통하여 실현가능성을 제시하였다.

• 디지털산업정보학회논문지
• /
• 제6권2호
• /
• pp.153-167
• /
• 2010

Traffic conditions, in particular number of active TCP flows, change dramatically over time. The main goal of this paper is an adaptive queue management algorithm that can maintain network state of high-throughput and low-delay under changing traffic conditions In this paper, we devise Probability Adaptive RED(PARED) that combines the more effective elements of recent algorithms with a RED core. It automatically adjusts its adaptive marking function to account for changes in traffic load and to keep queue length within the desired target queue length. We simulate that PARED algorithm results in under changes in traffic load and mixed traffic load. The simulation test confirm this stability, and indicate that overall performances of PARED are substantially better than the RED and ARED algorithms.

• 한국경영과학회지
• /
• 제30권2호
• /
• pp.29-40
• /
• 2005

In this research, we propose packet scheduling algorithm considering different QoS characteristics of real-time traffic and non-real-time traffic in the next generation wireless communication system serving the multimedia traffic and a new efficient framing method cooperated with this packet scheduler. When the selected traffic classes of the selected users are transmitted, our proposed framing method can increase the number of serviced traffic classes by mixing the many different traffic classes within one frame considering data rate decided by the allocated AMC (Adaptive Modulation and Coding) option. Using this proposed method, the fairness among the traffic classes can be achieved and the system performance for total throughput and delay can be enhanced. Simulations are performed to analyze the performance of the proposed framing method. Our proposed packet scheduler and framing method will be applied to the next generation multimedia wireless communication system serving many traffic classes.

• ETRI Journal
• /
• 제20권2호
• /
• pp.171-191
• /
• 1998

In this paper, we propose a new heuristic design algorithm for the virtual path (VP)-based ATM network with multiple traffic classes, in which QoS constraints associated with traffic class are taken into account. The minimum bandwidth of VP required to carry given amount of traffic is obtained by utilizing an equivalent bandwidth concept, and the route of each VP is placed so that the network cost is minimized while the QoS requirement is fulfilled To evaluate our design algorithm, we consider two kinds of traffic: voice traffic as low speed service and still picture traffic as high speed service. Through numerical examples, we demonstrate that our design method can achieve an efficient use of network resources, which results in providing a cost-effective VP-based ATM network.

• 대한안전경영과학회지
• /
• 제13권1호
• /
• pp.127-131
• /
• 2011

Even if there are no causing factors such as car crash and road works, traffic congestion come from traffic growth on the road. In this case, estimation of traffic flow helps find the solution of traffic congestion problem. In this paper, we present a optimization model which used on traffic equilibrium problem and studied the problem of inverting shortest path sets for complex traffic system. And we also develop pivotal decomposition algorithm for reliability function of complex traffic system. Several examples are illustrated.

• 한국항행학회논문지
• /
• 제14권2호
• /
• pp.161-169
• /
• 2010

최근 항공교통량의 증가에 따라 보다 효율적인 항공교통흐름제어가 요구되고 있다. 이에 본 논문에서는 효율적인 항공관제를 위하여 항공기의 흐름을 유연하게 하기 위한 알고리즘 기법을 연구하였다. 항공교통 환경은 일반 교통 환경과는 다르게 항공기 기종에 따른 수평 및 수직 분리 간격이 존재한다. 빈센티 공식을 이용하여 항로의 거리를 산출하고 다익스트라 알고리즘을 이용하여 항로의 거리에 교통량을 적용하여 가중치를 생성하고 이를 이용하여 항공기가 연료 및 시간의 낭비를 최소화하는 항로를 선택하도록 하였다. 성능평가 결과 기존의 항로 연산 알고리즘의 단순한 최단항로 산출과는 달리 제안된 알고리즘은 교통량 파악을 통한 최적항로를 선택함으로써 효율적으로 항공교통관제를 할 수 있음을 확인하였다.

• 한국정보과학회논문지:정보통신
• /
• 제31권1호
• /
• pp.70-80
• /
• 2004

현재의 인터넷 라우터는 Drop tail 방식으로 큐 안의 패킷을 관리한다. 따라서 네트워크 트래픽의 지수적인 증가로 인해 발생하는 혼잡 상황을 명시적으로 해결 할 수 없다. 이 문제를 해결하기 위해 IETF(Internet Engineering Task Force)에서는 RED(Random Early Detection) 알고리즘과 같은 능동적인 큐 관리(Active Queue Management)알고리즘을 제시하였다. 하지만 RED 알고리즘은 네트워크 환경에 따른 매개 변수의 설정의 어려움을 가지고 있어 잘못된 매개변수 설정으로 인하여 네트워크 성능을 저하시키는 문제를 발생시키며 전체 망에 불안정한 혼잡제어를 야기 시킬 수 있다. 본 논문에서는 기존의 큐 관리 알고리즘을 개선한 SQM(Stabilized Queue Management) 알고리즘을 제안하였다. SQM 알고리즘은 다양한 네트워크 조건에 대해 좋은 성능을 얻을 수 있도록 쉽게 매개 변수설정이 가능하며 불필요한 패킷 패기율을 줄여 효율적으로 혼잡상황을 제어한다. 제안한 알고리즘의 성능을 검증하기 위해 기존의 방법과 시뮬레이션을 이용하여 비교하였다.