• Journal of Satellite, Information and Communications
• /
• v.12 no.4
• /
• pp.131-140
• /
• 2017

Multipath TCP (MPTCP) is a transport layer protocol that simultaneously transmits data using multiple interfaces. MPTCP is superior to existing TCP in network environment with homogeneous subflows, but it shows worse performance compared to existing TCP in network environment with bufferbloat. If a bufferbloat occurs in one of the MPTCP multipaths, the packet will not arrive at the MPTCP receive buffer due to a sudden increase in delay time, resulting in a HoL blocking phenomenon. It makes the receive window of the other path to be zero. In this paper, we apply Adaptive Random Early Detection (ARED), Controlled Delay (CoDel) and Proportional Integral Controller Enhanced (PIE) among the proposed Active Queue Management (AQM) to limit the delay of bufferbloat path. Experiments were conducted to improve the performance of MPTCP in heterogeneous networks. In order to carry out the experiment, we constructed a Linux-based testbed and compared the MPTCP performance with that of the existing droptail.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.867-875
• /
• 2003

Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization in which TCP congestion window size is fluctuated during congestion period. Furthermore, if RTT(Round Trip Time) is increased, three duplicate ACK packets are not correct congestion signals because congestion might already disappear and the host may send more packets until it receives three duplicate ACK packets. Recently there are increasing interests in solving end-to-end congestion control using AQM(Active Queue Management) to improve the performance of TCP protocols. AQM is a variation of RED-based congestion control. In this paper, we first evaluate the effectiveness of the current AQM schemes such as RED, CHOKe, ARED, FRED and SRED, over traffic with different rates and over traffic with mixed responsive and non-responsive flows, respectively. In particular, CHOKe mechanism shows greater unfairness, especially when more unresponsive flows exist in a shared link. We then propose a new AQM scheme using CHOKe mechanism, called DQC(Double Queue CHOKe), which uses two FIFO queues before applying CHOKe mechanism to adaptive congestion control. Simulation shows that it works well in protecting congestion-sensitive flows from congestion-causing flows and exhibits better performances than other AQM schemes. Also we use partial state information, proposed in LRURED, to improve our mechanism.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.181-183
• /
• 2002

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04b
• /
• pp.1345-1348
• /
• 2002

기존의 TCP/IP 네트워크 상에서 혼잡을 제어하는 일반적인 방법은 end-to-end 피드백 방식이다. 혼잡이 발생했는지의 여부는 수신측의 ACK 신호로 예측할 수밖에 없으므로 RTT(round trip time)가 길어질 경우 혼잡처리 시간이 길어지게 된다. Active Network 기술을 이용한 ACC(Active Congestion Control)의 경우 혼잡이 발생한 라우터에서 전송자에게 직접적으로 정보를 전송하기 때문에 보다 빠른 혼잡처리가 가능하다. 비록 코어 라우터에서 패킷을 누락시키는 방법에 있어 상태정보를 필요로 하는 단점이 있지만 모의 실험 결과 향상된 처리량을 보여주었다. 혼잡처리에 있어 새로운 처리 방식은 AQM(Active Queue Management)이다. 이 방식은 RED 를 기본 모델로 변형된 것이 대부분이며 RED 가 갖는 단점을 개선하고 혼잡처리와 공평성(fairness)을 향상 시키는데 목적이 있다. 본 논문에서는 ACC 의 피드백 메커니즘과 AQM 의 융통성 있는 큐 관리 기법을 이용하여 보다 향상된 혼잡제어 기법을 보이겠다.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.89-98
• /
• 2004

AQM (Active Queue Management) techniques such as RED (Random Early Detection) which be proposed to solve the congestion of internet perform congestion control effectively for TCP data. However, in the situation where TCP and UDP share the bottleneck link, they can not solve the problems of the unfairness and long queueing delay. In this paper, we proposed an simple queue management algorithm, called PSRED (Protocol Sensitive RED), that improves fairness and decreases queueing delay. PSRED algorithm improves fairness and decreases average queue length by distinguishes each type of flow in using protocol field of packets and applies different drop functions to them respectively.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.129-137
• /
• 2016

Transmission Control Protocol as a transport layer protocol provides steady data transfer service. There are some serious concerns about the performance of TCP over diverse networks. The vital concern in TCP network environment is congestion which may occur due to quick transmission rates or because of large number of new connections entering the network at the same time. Size of queues in routers grows thus resulting in packet drops. Retransmission of the dropped packets, and reduced throughput can prove costly. Explicit Congestion Notification (ECN) in conjunction with Active Queue Management mechanisms (AQM) such as Random early detection (RED) is used for packet marking rather than dropping. In IP packet header ECN bits can be added as a sign of congestion thus avoiding needless packet drops. The proposed ECN and AQM mechanism can be implemented with help of ns2 simulator and the performance can be tested on different TCP variants.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.121.1-121
• /
• 2001

Congestion control is a critical issue in TCP networks, Recently, active queue management (AQM) was proposed for congestion control at routers. The random early detection RED algorithm is widely known in the AQM algorithms, We present an adaptive nonlinear RED (NRED) algorithm, which has nonlinear drop probability profile. The proposed algorithm enhanced the performance of the RED algorithm by the self-parameterization based on the traffic load Furthermore, the proposed algorithm can effectively adapt itself between he RED and the drop-tail queue management by adopting proper nonlinearity in the drop probability profile. Through simulation, we show the effectiveness of the proposed algorithm comparing with the drop-tail and the original RED algorithm.

• Journal of Korea Multimedia Society
• /
• v.18 no.11
• /
• pp.1375-1382
• /
• 2015

This paper aims to introduce the numerical methods for solving the optimal control theory to model bufferbloat problem. Mathematical tools are useful to provide insight for system engineers and users to understand better about what we are facing right now while experiment in a large-scale testbed can encourage us to implement in realistic scenario. In this paper, we introduce a survey of the numerical methods for solving the optimal control problem. We propose the dynamic optimization sweeping algorithm for optimal control of the active queue management. Simulation results in network simulator ns2 demonstrate that our proposed algorithm can obtain the stability faster than the others while still maintain a short queue length (≈10 packets) and low delay experience for arriving packets (0.4 seconds).

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.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.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.349-352
• /
• 2010

본 논문에서 우리는 DiffServ 환경에서 멀티미디어 서비스가 요구하는 품질 수준을 고려하는 QoS-aware AQM(Active Queue Management) 방안을 제안한다. 지연과 손실에 민감한 IPTV 및 VoIP와 같은 실시간 멀티미디어 서비스의 사용 증가로 인해 QoS 제공은 필수적이며, 이에 따라 응용계층에서 명시된 QoS 요구 수준을 네트워크 계층에서 인식하여 전달망에서 QoS를 제공할 수 있는 큐 관리 방안이 필요하다. 기존 DiffServ의 수정된 DSCP 필드를 이용하여 요청된 QoS 품질 정보를 네트워크 장비에 전달하고 해당 서비스의 지연 및 손실률 요구 수준에 대한 threshold margin을 도출하고 이 범위 내에서 큐의 임계값을 능동적으로 제어함으로써 종단간 IPTV 및 VoIP와 같은 멀티미디어 서비스의 QoS를 보장할 수 있다.