• Title/Summary/Keyword: Random Early Detection

Search Result 97, Processing Time 0.042 seconds

A Stabilized Queue Management Algorithm for Internet Congestion Control (인터넷 혼잡제어를 위한 안정적인 큐 관리 알고리즘)

  • 구자헌;정광수
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.70-80
    • /
    • 2004
  • In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection). But, RED configuration has been a problem since its first proposal. This problem is that proposed configuration is only good for the particular traffic conditions studied, but may have detrimental effects if used in other conditions. While active queue management in routers and gateways can potentially reduce packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are unstable for tile various traffic conditions. The inherent problem with these queue management algorithms is that they all use static parameter setting. In this paper, in order to solve this problem, a new active queue management algorithm called SQM(Stabilized Queue Management) is proposed. This paper shows that it is easy to parameterize SQM algorithm to perform well under different congestion scenarios. This algorithm can effectively reduce packet loss while maintaining high link utilizations and is good for the various traffic conditions.

Multipath TCP performance improvement using AQM in heterogeneous networks with bufferbloat (버퍼블로트를 가지는 이종 망에서 AQM을 이용한 Multipath TCP 성능 개선)

  • Hyeon, Dong Min;Jang, Jeong Hun;Kim, Min Sub;Han, Ki Moon;Lee, Jae Yong;Kim, Byung Chul
    • 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.

A Study on State Dependent RED and Dynamic Scheduling Scheme for Real-time Internet Service (실시간 인터넷 서비스를 위한 상태 의존 RED 및 동적 스케줄링 기법에 관한 연구)

  • 유인태;홍인기;서덕영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9B
    • /
    • pp.823-833
    • /
    • 2003
  • To satisfy the requirements of the real-time Internet services, queue management and scheduling schemes should be enhanced to accommodate the delay and jitter characteristic of them. Although the existing queue management schemes can address the congestion problems of TCP flows, they have some problems in supporting real-time services. That is, they show performance degradation when burst traffics are continuously going into the system after the queue is occupied at a predefined threshold level. In addition, under the congestion state, they show large jitter, which is not a desirable phenomenon for real-time transmissions. To resolve these problems, we propose a SDRED (State Dependent Random Early Detection) and dynamic scheduling scheme that can improve delay and jitter performances by adjusting RED parameters such as ma $x_{th}$ and $w_{q}$ according to the queue status. The SDRED is designed to adapt to the current traffic situation by adjusting the max,$_{th}$ and $w_{q}$ to four different levels. From the simulation results, we show that the SDRED decreases packet delays in a queue and has more stable jitter characteristics than the existing RED, BLUE, ARED and DSRED schemes.mes.mes.

Implementation and TCP Performance Measurement of RED scheduler using NetFPGA platform (NetFPGA 플랫폼 기반 RED스케줄러 구현 및 TCP 성능평가)

  • Oh, Min-Kyung;Min, Seok-Hong;Kim, Byung-Chul;Lee, Jae-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.3
    • /
    • pp.27-36
    • /
    • 2012
  • With the increase of various user's requirements, lots of interesting applications on the Internet have been emerging recently. However, Internet has many limitations for providing upcoming new services because it was only designed to provide basic connectivity between research networks and simplified forwarding functions at the first time. Internet has many problems in the aspects of routing scalability, mobility, security and QoS, so lots of researches are being actively performed in many countries to solve these problems. In this paper, we implement RED(Random Early Detection) scheduler using NetFPGA platform and local testbed to provide active queue management. Using the implemented RED scheduler, packets are dropped according to the specified drop probability, so Global Synchronization coming from simultaneous TCP segment losses in a congestion condition can be prevented. With the comparison to the Drop-Tail scheme in the basic router, we show TCP performance can be enhanced in the congestion situation using the NetFPGA-based RED scheduler.

Performance Analysis of TCP Variants using AQM and ECN (AQM과 ECN을 사용한 TCP 변종의 성능 분석)

  • Matten, Ahmad;Anwar, Adnan
    • 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.

QoS Adaptive Flow based Active Queue Management Algorithm and Performance Analysis (QoS 적응형 플로우 기반 Active Queue Management 알고리즘 및 성능분석)

  • Kang, Hyun-Myoung;Choi, Hoan-Suk;Rhee, Woo-Seop
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.3
    • /
    • pp.80-91
    • /
    • 2010
  • Due to the convergence of broadcasting and communications, IPTV services are spotlighted as the that next-generation multimedia services. IPTV services should have functionality such as unlimited channel capacity, extension of media, QoS awareness and are required increasing traffic and quality control technology to adapt the attributes of IPTV service. Consequently, flow based quality control techniques are needed. Therefore, many studies for providing Internet QoS are performed at IETF (Internet Engineering Task Force). As the buffer management mechanism among IP QoS methods, active queue management method such as RED(Random Early Detection) and modified RED algorithms have proposed. However, these algorithms have difficulties to satisfy the requirements of various Internet user QoS. Therefore, in this paper we propose the Flow based AQM(Active Queue Management) algorithm for the multimedia services that request various QoS requirements. The proposed algorithm can converge the packet loss ratio to the target packet loss ratio of required QoS requirements. And we present a performance evaluation by the simulations using the ns-2.

The QoS Adaptive AQM Algorithm and Performance Evaluation for Multimedia Service (멀티미디어 서비스를 위한 QoS 적응형 AQM 알고리즘 및 성능분석)

  • Kang, Hyun-Myoung;Rhee, Woo-Seop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.6B
    • /
    • pp.605-614
    • /
    • 2009
  • Existing Internet services were almost supported by the best effort service such as the data transmission service and were allowed the transmission delay and packet loss. However, recent Internet multimedia services such as Internet phone, Internet broadcasting are required a real-time processing and high bandwidth. Therefore, many studies for providing Internet QoS are performed at IETF (Internet Engineering Task Force). As the buffer management mechanism among IP QoS methods, active queue management method such as RED (Random Early Detection) algorithm has proposed. However, RED algorithm has a limitation of usage of an average buffer length and unfairness. So, many algorithms proposed as the modified algorithm of RED. But these modified algorithms also have difficulties to satisfy the requirements of various Internet user QoS. Therefore, in this paper we propose the QoS adaptive AQM (Active Queue Management) algorithm for the multimedia services that request various QoS requirements and present a performance evaluation by the simulations using the ns-2.

(A New Queue Management Algorithm Improving Fairness of the Internet Congestion Control) (인터넷 혼잡제어에서 공정성 향상을 위한 새로운 큐 관리 알고리즘)

  • 구자헌;최웅철;정광수
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.3
    • /
    • pp.437-447
    • /
    • 2003
  • In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection) algorithm. However, RED algorithm simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control such as UDP flow, but also short round-trip time TCP flows. In this paper, in order to solve this problem, we propose a simple fairness queue management scheme, called AFQM(Approximate Fair Queue Management) algorithm, that discriminate against the flows which submit more packets/sec than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy Since it is a small overhead and easy to implement, AFQM algorithm controls unresponsive or misbehaving flows with a minimum overhead.

A Local Tuning Scheme of RED using Genetic Algorithm for Efficient Network Management in Muti-Core CPU Environment (멀티코어 CPU 환경하에서 능률적인 네트워크 관리를 위한 유전알고리즘을 이용한 국부적 RED 조정 기법)

  • Song, Ja-Young;Choe, Byeong-Seog
    • Journal of Internet Computing and Services
    • /
    • v.11 no.1
    • /
    • pp.1-13
    • /
    • 2010
  • It is not easy to set RED(Random Early Detection) parameter according to environment in managing Network Device. Especially, it is more difficult to set parameter in the case of maintaining the constant service rate according to the change of environment. In this paper, we hypothesize the router that has Multi-core CPU in output queue and propose AI RED(Artificial Intelligence RED), which directly induces Genetic Algorithm of Artificial Intelligence in the output queue that is appropriate to the optimization of parameter according to RED environment, which is automatically adaptive to workload. As a result, AI RED Is simpler and finer than FuRED(Fuzzy-Logic-based RED), and RED parameter that AI RED searches through simulations is more adaptive to environment than standard RED parameter, providing the effective service. Consequently, the automation of management of RED parameter can provide a manager with the enhancement of efficiency in Network management.

Achieving Relative Loss Differentiation using D-VQSDDP with Differential Drop Probability (차별적이니 드랍-확률을 갖는 동적-VQSDDP를 이용한 상대적 손실차별화의 달성)

  • Kyung-Rae Cho;Ja-Whan Koo;Jin-Wook Chung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1332-1335
    • /
    • 2008
  • In order to various service types of real time and non-real time traffic with varying requirements are transmitted over the IEEE 802.16 standard is expected to provide quality of service(QoS) researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The sides of a packet drop rate, an each class to differential drop probability on achieving a low delay and high traffic intensity. Improved a queue management scheme to be enhanced to offer a drop probability is desired necessarily. This paper considers multiple random early detection with differential drop probability which is a slightly modified version of the Multiple-RED(Random Early Detection) model, to get the performance of the best suited, we analyzes its main control parameters (maxth, minth, maxp) for achieving the proportional loss differentiation (PLD) model, and gives their setting guidance from the analytic approach. we propose Dynamic-multiple queue management scheme based on differential drop probability, called Dynamic-VQSDDP(Variable Queue State Differential Drop Probability)T, is proposed to overcome M-RED's shortcoming as well as supports static maxp parameter setting values for relative and each class proportional loss differentiation. M-RED is static according to the situation of the network traffic, Network environment is very dynamic situation. Therefore maxp parameter values needs to modify too to the constantly and dynamic. The verification of the guidance is shown with figuring out loss probability using a proposed algorithm under dynamic offered load and is also selection problem of optimal values of parameters for high traffic intensity and show that Dynamic-VQSDDP has the better performance in terms of packet drop rate. We also demonstrated using an ns-2 network simulation.