DOCSLIB.ORG

Revisiting Old Friends: Is Codel Really Achieving What RED Cannot?

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Revisiting Old Friends: Is Codel Really Achieving What RED Cannot? Revisiting Old Friends: Is CoDel Really Achieving What RED Cannot? Nicolas Kuhn Emmanuel Lochin Olivier Mehani IMT Telecom Bretagne Université de Toulouse, ISAE, National ICT Australia 2 Rue de la Châtaigneraie TéSA Level 5, 13 Garden St 35510 Cesson-Sévigné, 10 Avenue Édouard Belin Eveleigh NSW 2015, Australia France 31400 Toulouse, France [email protected] nicolas.kuhn@telecom- [email protected] bretagne.eu ABSTRACT in mobile networks [16]. The use of Active Queue Manage- We use ns-2 simulations to compare RED's gentle_ mode ment (AQM) has been proposed as a way to alleviate Buf- to CoDel in terms of their ability to reduce the latency for ferbloat [e.g., 13, 11]: there has been a renewed interest at various TCP variants. We use a common dumbbell topol- IETF is evaluating AQM; a working group has been cre- ogy with Pareto background traffic, and measure the packet ated in 2013 and produced recommandations for AQM [4]. delays and transmission time of a 10 MB FTP transfer. Most notably, CoDel [23] has been proposed specifically to In our scenarios, we find that CoDel reduces the latency by counter Bufferbloat by ensuring that packets do not remain 87 %, but RED still manages to reduce it by 75 %. However, \too long" in the managed queues. CoDel is said to be the use of CoDel results in a transmission time 42 % longer parameter-less, yet it is arbitrarily configured with two hard than when using RED. In light of its maturity, we therefore coded parameters (target delay and interval). argue that RED could be considered as a good candidate to While CoDel has been specifically designed to tackle Buf- tackle Bufferbloat. ferbloat, other AQMs such as RED [10] could also be used to the same effect. RED has the advantage of having been well both studied and tested. Although past studies used to show Categories and Subject Descriptors that RED remains hard to tune [25, 21], RED parameters C.2.6 [COMPUTER-COMMUNICATION NET- found to be fairly well understood [8] and can be now set WORKS]: Internetworking|Routers or managed automatically [15, 20]. Moreover, the authors of [17] mention that there are lessons to be learned from General Terms the old AQMs as their performance can compete with new AQMs proposals. In this article, we perform ns-2 simula- Performance tions to compare the trade-off between latency and through- put proposed by CoDel and RED, by introducing specific Keywords traffic patterns, metrics and transport protocols. AQM; Bufferbloat; CoDel; ns-2; RED As AQM reduces queues by dropping packets, an evalua- tion of the effectiveness of AQMs against Bufferbloat should 1. INTRODUCTION study the trade-off between a reduced packet delay, and an increased data transmission time (due to losses and retrans- Bufferbloat occurs due to oversized buffers at routers missions). Moreover, not all congestion control (CC) mech- where packets arrive at a faster rate than they can be for- anisms react the same to changed loss rates or delays. These warded [11, 5]. As a result, packets are queued until they AQMs should therefore be studied in light of their impact on are either transmitted, or dropped when the buffers are full. the various transport protocols they are expected to man- As the queues fill, it takes longer for each packet to be trans- age. mitted to its destination. Moreover, most congestion control This paper systematically studies this trade-off. We use mechanisms do not recognise an increase of the delay as a ns-2 to simulate a loaded network where Bufferbloat occurs. congestion event and thus, keep increasing their rate on an We then introduce various AQMs, and observe their impact already-saturated path. on flows transported using various TCP's CC mechanisms. While some contention exists as to whether or not Buffer- We find that both AQMs give the same advantages for all bloat really is a widespread problem [1], it has been observed CC algorithms: be they loss-based or delay-based, they all experience relatively similar conditions. Moreover, we show Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed that RED performs quite well, reducing the packet delay by for profit or commercial advantage and that copies bear this notice and the full cita- a sizeable amount|yet not as much as CoDel. More inter- tion on the first page. Copyrights for components of this work owned by others than estingly, we also find that RED allows for shorter transmis- ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or re- sion times than CoDel does, which suggests that RED might publish, to post on servers or to redistribute to lists, requires prior specific permission be closer to achieving the trade-off of efficiency versus Buf- and/or a fee. Request permissions from [email protected]. ferbloat. CSWS’14, August 18, 2014, Chicago, IL, USA. Copyright 2014 ACM 978-1-4503-2991-0/14/08 ...$15.00. http://dx.doi.org/10.1145/2630088.2630094. The rest of this paper is organised as follows. In the next 2.1.4 PIE section we present and discuss the various elements of our determines a dropping probability that is based on the simulations: AQMs, CCs, topology, and parameters caus- average queueing latency and limit the queuing latency ing Bufferbloat. Section 3 presents the impact of AQM on to a target value. various congestion control mechanisms while Section 4 sum- While it is very relevant to this study, at the time we ran marises our results on transmission and packet delays. We the simulations, no implementation of PIE was available. discuss these results in Section 5, before offering a short con- We therefore focused on the comparison between RED and cluding summary in Section 6. CoDel to evaluate if a new generation of AQM is needed. Future work will consider PIE. 2. SIMULATING BUFFERBLOAT IN NS-2 2.2 Congestion Control Algorithms This section presents the AQM schemes, congestion con- Congestion control (CC) mechanisms may be based on trol, topology, traffic patterns and parameters that trigger loss events or measurements of latency. To better under- Bufferbloat. stand the impact of these AQM mechanisms on CC algo- rithms, we need to consider the following transport layer 2.1 Active Queue Management Mechanisms protocols: This article compares the impacts of various AQM and transport layer protocols. We consider the following AQM. TCP NewReno loss-based CC and baseline for our eval- uations; 2.1.1 DropTail TCP Vegas delay-based CC. In the context of reducing In- DropTail is a default queuing mechanism that drops in- ternet latency, there is a renew interest for delay-based coming packets when the queue is full. This default CC, which are less aggressive but which introduce less queue management is the baseline for our evaluations. delay in the network. Hybrid CC (both delay and loss based) are also of interest; 2.1.2 RED RED [10] drops packets depending on the number of TCP Compound hybrid (loss/delay) CC which is imple- packets in the queue. In order to reduce the occupancy in mented in Windows systems; the gateway and manage the size of the queue when the av- TCP CUBIC loss-based CC which is deployed on a large erage queue size exceeds a threshold, packets are randomly scale in Android/Linux systems. dropped to reduce the throughput of different non cooper- ating sources. We use the native Linux implementations for these protocols We consider the default implementation of RED in ns-2 in ns-2. with gentle_ mode activated. This mode consists of a basic improvement that must be considered,1 as it makes RED 2.3 Topology and traffic more suitable for large scale deployment. Exhaustive performance comparisons between RED ver- Pappl pareto applications sions is beyond the scope of this paper. As a result, we do not evaluate Adaptive RED (ARED) [9]. Gentle RED is al- 0 4 ready adaptive, but differs in that max_p is not adjusted to better control the average queue size, as it is in ARED. 2 3 We use the default values for the parameters of RED, such as the targetdelay (not to be confused with CoDel's target 1 5 value for the queue delay), set to 5 ms. Transmission of B bytes with FTP 2.1.3 CoDel CoDel [23] drops packets depending on the sojourn delay Dc, capacity Cc time of each packet in the queue. CoDel switches between delay Dw, capacitiy Cw its \dropping mode" and \non dropping mode" depending on the measured and maximum authorised sojourn times (set Figure 1: Dumbbell topology used for the simulations. by default to 5 ms). The CeroWRT project [7] implements Background Pareto traffic goes from node 0 to 4, while the CoDel as a way to solve the different problems encountered flow under study is sent from 1 to 5. at a home router, particularly Bufferbloat. A variant of CoDel, Flow-Queuing CoDel (FQ- CoDel) [14], which combines Stochastic Fairness Queueing Figure 1 presents the dumbbell topology and correspond- (SFQ) [22] and CoDel, could not be evaluated in this article, ing notations. This network topology is common to evaluate as the description of this scheduling has just been released the performance of TCP [2]. Nodes 0 and 1 (resp. 4 and as an Informational IETF draft. Moreover, it is not fair to 5) are connected to node 2 (resp. 3) by a link of Dw (ms) consider FQ-CoDel, while other tested AQMs do not inte- one way delay and Cw (Mbps) capacity.
Load more

Recommended publications
  • A Letter to the FCC [PDF]
    Before the FEDERAL COMMUNICATIONS COMMISSION Washington, DC 20554 In the Matter of ) ) Amendment of Part 0, 1, 2, 15 and 18 of the ) ET Docket No. 15­170 Commission’s Rules regarding Authorization ) Of Radio frequency Equipment ) ) Request for the Allowance of Optional ) RM­11673 Electronic Labeling for Wireless Devices ) Summary The rules laid out in ET Docket No. 15­170 should not go into effect as written. They would cause more harm than good and risk a significant overreach of the Commission’s authority. Specifically, the rules would limit the ability to upgrade or replace firmware in commercial, off­the­shelf home or small­business routers. This would damage the compliance, security, reliability and functionality of home and business networks. It would also restrict innovation and research into new networking technologies. We present an alternate proposal that better meets the goals of the FCC, not only ensuring the desired operation of the RF portion of a Wi­Fi router within the mandated parameters, but also assisting in the FCC’s broader goals of increasing consumer choice, fostering competition, protecting infrastructure, and increasing resiliency to communication disruptions. If the Commission does not intend to prohibit the upgrade or replacement of firmware in Wi­Fi ​ ​ devices, the undersigned would welcome a clear statement of that intent. Introduction We recommend the FCC pursue an alternative path to ensuring Radio Frequency (RF) compliance from Wi­Fi equipment. We understand there are significant concerns regarding existing users of the Wi­Fi ​ spectrum, and a desire to avoid uncontrolled change. However, we most strenuously advise against prohibiting changes to firmware of devices containing radio components, and furthermore advise against allowing non­updatable devices into the field.
    [Show full text]
  • Evaluation of Priority Scheduling and Flow Starvation for Thin Streams with FQ-Codel
    2015 European Conference on Networks and Communications (EuCNC) Evaluation of Priority Scheduling and Flow Starvation for Thin Streams with FQ-CoDel Eduard Grigorescu, Chamil Kulatunga, Gorry Nicolas Kuhn Fairhurst Télécom Bretagne, IRISA School of Engineering, University of Aberdeen, UK [email protected] {eduard, chamil, gorry}@erg.abdn.ac.uk Abstract— Bufferbloat is the result of oversized buffers and algorithms, managing packet scheduling and isolation/capacity induced high end-to-end latency experienced by applications allocation among flows, can be introduced. As one example of across the Internet. This additional delay can adversely impact a scheme that mixes both classes, FlowQueue-CoDel (FQ- thin streams that frequently exchange small amounts of data, but CoDel) [7] is a scheduling scheme that features prioritization have stringent latency requirements. Active Queue Management and flow isolation. FQ-CoDel creates one sub-queue per flow (AQM) techniques, such as Controlled Delay (CoDel), can control and applies CoDel on each of them. The awareness of the the queuing delay in a network device to ensure low latency by dropping packets to indicate incipient congestion. FlowQueue- latency resulting from over-provisioned buffers has been CoDel (FQ-CoDel) is a scheduling scheme that creates one sub- accompanied by an increase in real-time applications such as queue per flow and applies CoDel on each of them. FQ-CoDel Voice over Internet Protocol, gaming or financial trading features: (1) priority scheduling for low-rate traffic; (2) flow applications. As one example, the latency experienced by isolation; (3) queue management with CoDel. First, this paper gamers can directly impact the perceived value of the network fills a gap in the understanding of FQ-CoDel by analyzing what service [10].
    [Show full text]
  • AQM Algorithms and Their Interaction with TCP Congestion Control Mechanisms
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Universidad Carlos III de Madrid e-Archivo Grado Universitario en Ingenier´ıaTelem´atica 2016/2017 Trabajo Fin de Grado Control de Congesti´onTCP y mecanismos AQM Sergio Maeso Jim´enez Tutor/es Celeste Campo V´azquez Carlos Garc´ıaRubio Legan´es,2 de Octubre de 2017 Esta obra se encuentra sujeta a la licencia Creative Commons Reconocimiento - No Comercial - Sin Obra Derivada Control de Congesti´onTCP y mecanismos AQM By Sergio Maeso Jim´enez Directed By Celeste Campo V´azquez Carlos Garc´ıaRubio A Dissertation Submitted to the Department of Telematic Engineering in Partial Fulfilment of the Requirements for the BACHELOR'S DEGREE IN TELEMATICS ENGINEERING Approved by the Supervising Committee: Chairman Marta Portela Garc´ıa Chair Carlos Alario Hoyos Secretary I~naki Ucar´ Marqu´es Deputy Javier Manuel Mu~noz Garc´ıa Grade: Legan´es,2 de Octubre de 2017 iii iv Acknowledgements I would like to thanks my tutors Celeste Campo and Carlos Garcia for all the support they gave me while I was doing this thesis with them. To my parents, who believe in me against all odds. v vi Abstract In recent years, the relevance of delay over throughput has been particularly emphasized. Nowadays our networks are getting more and more sensible to latency due to the proliferation of applications and services like VoIP, IPTV or online gaming where a low delay is essential for a proper performance and a good user experience. Most of this unnecessary delay is created by the misbehaviour of many buffers that populate Internet.
    [Show full text]
  • Auto-Tuning Active Queue Management
    2017 9th International Conference on Communication Systems and Networks (COMSNETS) Auto-Tuning Active Queue Management Joe H. Novak Sneha Kumar Kasera University of Utah University of Utah Abstract not require pre-specification of even those parameters including 3 Active queue management (AQM) algorithms preemptively EWMA weights or protocol timer intervals that are routinely drop packets to prevent unnecessary delays through a network specified in protocol design and implementation. while keeping utilization high. Many AQM ideas have been When we view the network link in terms of utilization proposed, but none have been widely adopted because these rely and the queue corresponding to the link in terms of delay on pre-specification or pre-tuning of parameters and thresholds (Fig. 1 shows a typical delay-utilization curve), we see that that do not necessarily adapt to dynamic network conditions. as utilization increases, delay also increases. At a certain point, We develop an AQM algorithm that relies only on network however, there is a very large increase in delay for only a small runtime measurements and a natural threshold, the knee on improvement in utilization. This disproportionate increase in the delay-utilization curve. We call our AQM algorithm Delay delay is of little to no value to the applications at the endpoints. Utilization Knee (DUK) based on its key characteristic of We want to avoid this unstable region of high increase in delay keeping the system operating at the knee of the delay-utilization with little increase in utilization. As a result, a natural threshold curve. We implement and evaluate DUK in the Linux kernel in becomes apparent.
    [Show full text]
  • Controlling Queuing Delays for Real-Time Communication: the Interplay of E2E and AQM Algorithms
    Controlling Queuing Delays for Real-Time Communication: The Interplay of E2E and AQM Algorithms Gaetano Carlucci Luca De Cicco Saverio Mascolo Politecnico di Bari, Italy Politecnico di Bari, Italy Politecnico di Bari, Italy [email protected] [email protected] [email protected] ABSTRACT control algorithm; the other placed in the network routers, Real-time media communication requires not only i.e. the Active Queue Management (AQM) algorithm. congestion control, but also minimization of queuing delays When designing end-to-end congestion control algorithms to provide interactivity. In this work we consider the case of for video conference, UDP is a natural choice, since real-time communication between web browsers (WebRTC) such applications cannot tolerate large latencies due to and we focus on the interplay of an end-to-end delay-based TCP packet retransmissions. Additionally, delay-based congestion control algorithm, i.e. the Google congestion congestion control algorithms are usually preferred to control (GCC), with two delay-based AQM algorithms, loss-based ones since they can detect congestion before namely CoDel and PIE, and two flow queuing schedulers, packets are lost due to buffer overflow. i.e. SFQ and Fq Codel. Experimental investigations show On the other hand, AQM schemes control the router that, when only GCC flows are considered, the end-to-end buffers by dropping the packets or marking them if ECN algorithm is able to contain queuing delays without AQMs. is used [21]. Despite the fact that many AQM algorithms Moreover the interplay of GCC flows with PIE or CoDel have been proposed over the past two decades [7], the leads to higher packet losses with respect to the case of a adoption of these algorithms has been hampered by two DropTail queue.
    [Show full text]
  • Controlling Queuing Delays for Real-Time Communication: the Interplay of E2E and AQM Algorithms
    Controlling Queuing Delays for Real-Time Communication: The Interplay of E2E and AQM Algorithms Gaetano Carlucci Luca De Cicco Saverio Mascolo Politecnico di Bari, Italy Politecnico di Bari, Italy Politecnico di Bari, Italy [email protected] [email protected] [email protected] ABSTRACT requirements can be met by employing two complementary control Real-time media communication requires not only congestion algorithms: one placed at the end points, namely the end-to-end control, but also minimization of queuing delays to provide congestion control algorithm; the other placed in the network interactivity. In this work we consider the case of real-time routers, i.e. the Active Queue Management (AQM) algorithm. communication between web browsers (WebRTC) and we focus When designing end-to-end congestion control algorithms on the interplay of an end-to-end delay-based congestion control for video conference, UDP is the natural choice, since such algorithm, i.e. the Google congestion control (GCC), with two applications cannot tolerate large latencies due to TCP packet delay-based AQM algorithms, namely CoDel and PIE, and two retransmissions. Additionally, delay-based congestion control flow queuing schedulers, i.e. SFQ and Fq_Codel. Experimental algorithms are usually preferred to loss-based ones since they can investigations show that, when only GCC flows are considered, detect congestion before packets are lost due to buffer overflow. the end-to-end algorithm is able to contain queuing delays without On the other hand, AQM schemes control the router buffers AQMs. Moreover the interplay of GCC flows with PIE or CoDel by dropping the packets or marking them if ECN is used [21].
    [Show full text]
  • Packet Mark Methodology for Reduce the Congestion
    Forn International Journal of Scientific Research in Computer Science and Engineering Review Paper VolVolVol-Vol ---1,1, IssueIssue----3333 ISSN: 2322320000––––76397639 Packet Mark Methodology for Reduce the Congestion V.Ganesh Babu and K.Saraswathi Department of CS, Government College for Women, Maddur, Mandya Dt Karnataka, INDIA Department of CS, Nehru Memorial College, Puthanampatti, Trichy Dt. Tamil Nadu, INDIA Available online at www.isroset.org Received: 17 March 2013 Revised: 22 March 2013 Accepted: 16 May 2013 Published: 30 June 2013 Abstract-Congestion is one of the major problems of a communication network in routing. The function of a routing is to guide packets through the communication network to their correct destinations. Optimal Routing has been widely studied for interconnection networks. This paper provides two methodologies ECN and QBER for reduce the congestion. Keywords- Routing, congestion, ECN, QBER 1. INTRODUCTION packet. This act is referred to as “marking” and its purpose is to inform the receiving endpoint of impending The first methodology Explicit Congestion Notification congestion. At the receiving endpoint, this congestion (ECN) is an extension to the Internet protocol and to the indication is handled by the upper layer protocol (transport Transmission Control Protocol and is defined in layer protocol) and needs to be echoed back to the RFC3168(2001). ECN allows end-to-end notification of transmitting node in order to signal it to reduce its network congestion without dropping packets. ECN is an transmission rate. optional feature that is only used when both endpoints support it and are willing to use it. It is only effective when 2.2 Operation of ECN with TCP supported by the underlying network.
    [Show full text]
  • Piece of CAKE: a Comprehensive Queue Management Solution for Home Gateways
    Piece of CAKE: A Comprehensive Queue Management Solution for Home Gateways Toke Høiland-Jørgensen Dave Täht Jonathan Morton Dept. of Computer Science Teklibre Karlstad University, Sweden Los Gatos, California Somero, Finland [email protected] [email protected] [email protected] Abstract—The last several years has seen a renewed interest compelling benefit of CAKE is that it takes state of the art in smart queue management to curb excessive network queueing solutions and integrates them to provide: delay, as people have realised the prevalence of bufferbloat in • a high-precision rate-based bandwidth shaper that in- real networks. However, for an effective deployment at today’s last mile cludes overhead and link layer compensation features for connections, an improved queueing algorithm is not enough in various link types. itself, as often the bottleneck queue is situated in legacy systems • a state of the art fairness queueing scheme that simulta- that cannot be upgraded. In addition, features such as per-user neously provides both host and flow isolation. fairness and the ability to de-prioritise background traffic are • a Differentiated Services (DiffServ) prioritisation scheme often desirable in a home gateway. with rate limiting of high-priority flows and work- In this paper we present Common Applications Kept Enhanced (CAKE), a comprehensive network queue management system conserving bandwidth borrowing behaviour. designed specifically for home Internet gateways. CAKE packs • TCP ACK filtering that increases achievable throughput several compelling features into an integrated solution, thus on highly asymmetrical links. easing deployment. These features include: bandwidth shaping CAKE is implemented as a queueing discipline (qdisc) for with overhead compensation for various link layers; reasonable DiffServ handling; improved flow hashing with both per-flow and the Linux kernel.
    [Show full text]
  • Evaluation of the Impact of Packet Drops Due to AQM Over Capacity Limited Paths
    Evaluation of the Impact of Packet Drops due to AQM over Capacity Limited Paths Eduard Grigorescu, Chamil Kulatunga, Gorry Fairhurst Electronics Research Group, School of Engineering, University of Aberdeen, Aberdeen, AB24 3UE, United Kingdom {eduard, chamil, gorry}@erg.abdn.ac.uk Abstract - For many years Internet routers have been designed and interactive applications, and impairing the quality of real-time benchmarked in ways that encourage the use of large buffers. When (e.g. voice) and near-real-time traffic (e.g. live streaming). these buffers accumulate a large standing queue, this can lead to high network path latency. Two AQM algorithms: PIE and CoDel, The solution to high latency requires two elements: 1) a have been recently proposed to reduce buffer latency by avoiding strategy to signal the transport protocol to "slow down", the drawbacks of previous AQM algorithms like RED. This paper necessary to keep queues small; and 2) packet scheduling explores the performance of these new algorithms in simulated rural broadband networks where capacity is limited. We compared between flows (sharing capacity between different types of the new algorithms using Adaptive RED as a reference. We observe network flows). These solutions become more necessary at the that to achieve a small queuing delay PIE and CoDel both increase edge of the network, where speed of links is less and therefore packet loss. We therefore explored this impact on the quality of head of line blocking becomes more significant. experience for loss-sensitive unreliable multimedia applications, such as real-time and near-real-time video. The results from One way to prevent or minimise latency is to intelligently simulations show that PIE performs better than CoDel in terms of manage the queue of packets so that a router does not build a packet loss rates affecting video quality.
    [Show full text]
  • TCP Congestion Control Macroscopic Behavior for Combinations of Source and Router Algorithms
    TCP Congestion Control Macroscopic Behavior for Combinations of Source and Router Algorithms Mulalo Dzivhani1, 2, Dumisa Ngwenya3, 4, Moshe Masonta1, Khmaies Ouahada2 Council for Scientific and Industrial Research (CSIR), Meraka Institute1, Pretoria Faculty of Engineering and Built Environment, University of Johannesburg2, Johannesburg SENTECH3, Johannesburg University of Pretoria4, Pretoria South Africa Emails: [email protected] 1, 2, [email protected] 3, 4, [email protected], [email protected] Abstract—The network side of Transmission Control Protocol Most widely used TCP variant over the decades has been TCP (TCP) congestion control is normally considered a black-box in New Reno, evolving from TCP Tahoe and TCP Reno. TCP performance analysis. However, the overall performance of New Reno has proved to be efficient in fixed low speed TCP/IP networks is affected by selection of congestion control networks and networks with low BDP. However, as shown by mechanisms implemented at the source nodes as well as those [1], TCP as implemented is showing performance in high-speed implemented at the routers. The paper presents an evaluation of macroscopic behaviour of TCP for various combinations of source wide-area networks, in wireless links and for real-time flows. algorithms and router algorithms using a Dumbbell topology. In For this reason a number of source based algorithms have been particular we are interested in the throughput and fairness index. proposed in the past two decades. TCP Cubic is one of those TCP New Reno and TCP Cubic were selected for source nodes. that has gained popularity for high speed networks. Packet First-in-First-out (PFIFO) and Controlled Delay (CoDel) mechanisms were selected for routers.
    [Show full text]
  • An Extension of the Codel Algorithm
    Proceedings of the International MultiConference of Engineers and Computer Scientists 2015 Vol II, IMECS 2015, March 18 - 20, 2015, Hong Kong Hard Limit CoDel: An Extension of the CoDel Algorithm Fengyu Gao, Hongyan Qian, and Xiaoling Yang Abstract—The CoDel algorithm has been a significant ad- II. BACKGROUND INFORMATION vance in the field of AQM. However, it does not provide bounded delay. Rather than allowing bursts of traffic, we argue that a Nowadays the Internet is suffering from high latency and hard limit is necessary especially at the edge of the Internet jitter caused by unprotected large buffers. The “persistently where a single flow can congest a link. Thus in this paper we full buffer problem”, recently exposed as “bufferbloat” [1], proposed an extension of the CoDel algorithm called “hard [2], has been observed for decades, but is still with us. limit CoDel”, which is fairly simple but effective. Instead of number of packets, this extension uses the packet sojourn time When recognized the problem, Van Jacobson and Sally as the metric of limit. Simulation experiments showed that the Floyd developed a simple and effective algorithm called RED maximum delay and jitter have been well controlled with an (Random Early Detection) in 1993 [3]. In 1998, the Internet acceptable loss on throughput. Its performance is especially Research Task Force urged the deployment of active queue excellent with changing link rates. management in the Internet [4], specially recommending Index Terms—bufferbloat, CoDel, AQM. RED. However, this algorithm has never been widely deployed I. INTRODUCTION because of implementation difficulties. The performance of RED depends heavily on the appropriate setting of at least The CoDel algorithm proposed by Kathleen Nichols and four parameters: Van Jacobson in 2012 has been a great innovation in AQM.
    [Show full text]
  • A Hybrid Loss-Delay Gradient Congestion Control Algorithm for the Internet
    A Hybrid Loss-Delay Gradient Congestion Control Algorithm for the Internet Rasool Al-Saadi School of Software and Electrical Engineering Swinburne University of Technology This thesis is submitted for the degree of Doctor of Philosophy Faculty of Science, Engineering and October 2019 Technology I dedicate this thesis to my loving parents, my beloved wife Dalia and my sons Ridha and Yousif. Declaration I declare that this thesis submitted for the degree of Doctor of Philosophy contains no ma- terial that has been accepted for the award to the candidate of any other degree or diploma, except where due reference made a in the text of the examinable outcome. To the best of the candidate’s knowledge contains no material previously published or written by another person except where due reference is made in the text of the examinable outcome. Where the work is based on joint research or publications, discloses the relative contributions of the respective creators or authors. Rasool Al-Saadi October 2019 Acknowledgements I would like to express my thanks and appreciation to all the people and institutions who helped, guided, advised and supported me during my PhD journey. I would like to thank my supervisors Prof. Grenville Armitage, Dr. Jason But and Assoc. Prof. Philip Branch for their insight, patience, friendship, encouragement, continuous support and valuable advice during my PhD candidature. I had the honour of being a student under their wise supervision. Without their support, this work would never have seen the light of day. I am greatly indebted to my family, especially my wife Dalia Al-Zubaidy, my parents, my brother and my sister for their patience, persevering support and advice.
    [Show full text]