DOCSLIB.ORG

Control Methods for Data Flow in Communication Networks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Control Methods for Data Flow in Communication Networks Control Methods for Data Flow in Communication Networks DISSERTATION Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of The Ohio State University By Peng Yan, M.S. ***** The Ohio State University 2003 Dissertation Committee: Approved by Professor Hitay Ozbay¨ , Adviser Professor Kevin M. Passino Adviser ¨ ¨ Professor Umit Ozg¨uner Department of Electrical Engineering c Copyright by Peng Yan 2003 ABSTRACT In this dissertation, we investigate various control methods for data flow in communica- tion networks. First, we develop a rate-based flow controller for self-similar network traffic, ½ which consists of a robust À control block and an adaptive LMMSE capacity predictor. The controller guarantees robust stability against time-varying time delay uncertainties and improves the transient response by predicting the self-similar cross traffic. Window-based congestion control methods are also explored for TCP traffic on IP networks. We propose a variable structure approach in Active Queue Management (AQM) support Explicit Con- gestion Notification (ECN). By analyzing the robustness and performance of the control scheme for the nonlinear TCP/AQM model, we show that the proposed design has good performance and robustness with respect to the uncertainties of the round-trip time (RTT) and the number of active TCP sessions, which are central to the notion of AQM. Alterna- ½ tively, we design robust À AQM controllers for the linearized TCP/AQM model, with ½ the presence of uncertain time delays. The À performance is analyzed and a switching control scheme is introduced to improve the system performance. Motivated by the Lin- ½ ear Parameter Varying (LPV) nature of the linearized TCP/AQM model, a switching À control method is further investigated for LPV systems where we provide some stability conditions in terms of the dwell time and the average dwell time. ii To my wife, Yang Sun iii ACKNOWLEDGMENTS I would like to thank my adviser, Professor Hitay Ozbay,¨ for his guidance, support, and encouragement throughout the course of my research at The Ohio State University. I also thank Professor Kevin Passino and Professor Umit¨ Ozg¨¨ uner for serving on my committee and for their review of this thesis. I would like to thank Dr. Yuan Gao for his collaboration on the topic of the Variable Structure AQM in Chapter 3 and for providing me with the ns-2 code in the packet-level simulations of Chapter 3. I also thank Dr. Pierre-Franc¸ois Quet for various technical dis- cussions. A special thanks goes to the entire Control group, professors and students, for creating a wonderful academic environment that encourages learning and pursuit of research. I would like to express my gratitude to all my friends for their help and encouragement. Last but not least, I wish to specially thank my family for their love, support and en- couragement throughout my studies. Finally I would like to acknowledge that the financial support for this work came form NSF grants Nos. ANI-9806660, ANI-0073725, SBC/Ameritech Faculty Research Grant, and Air Force Research Laboratory under agreement No. F33615-01-2-3154. iv VITA January 21, 1975 ............................Born - P. R. China 1997 .......................................B.S. Southeast University, Nanjing, P. R. China 1999 .......................................M.S. Southeast University, Nanjing, P. R. China 1999-present ................................Graduate Research Associate, The Ohio State University. PUBLICATIONS Research Publications Peng Yan, Yuan Gao, and Hitay Ozbay¨ Variable Structure Control in Active Queue Man- agement for TCP with ECN. Proceedings of the 8th IEEE Symposium on Computers and Communications, Antalya, TURKEY, July 2003. ¨ ½ Peng Yan and Hitay Ozbay À Performance Analysis of Robust Controllers Designed for AQM. Proceedings of the American Control Conference, Denver, Colorado, USA, June 2003. ¨ ½ Peng Yan and Hitay Ozbay On the À -Based Controllers for Automatic Steering of Vehi- cles with Actuator Delays. Proceedings of the 6th ASME Biennial Conference on Engieer- ing Systems Design and Analysis, Istanbul, Turkey, July 2002. Peng Yan and Hitay Ozbay¨ Flow Controller Design and Performance Analysis for Self- Similar Network Traffic. Proceedings of the 39th Annual Allerton Conference on Commu- nication, Control, and Computing, Monticello, Illinois, USA, October 2001. v FIELDS OF STUDY Major Field: Electrical Engineering vi TABLE OF CONTENTS Page Abstract . ..................................... ii Dedication . ..................................... iii Acknowledgments . .............................. iv Vita........................................... v List of Figures . ..................................... x List of Tables . .....................................xiii Chapters: 1. Introduction . .............................. 1 1.1 Congestion Control in Communication Networks . ............ 2 1.1.1 Rate-Based Control Methods for ATM Traffic . ..... 3 1.1.2 Window-Based Congestion Control Methods for TCP Traffic . 4 1.1.3 Active Queue Management . ................ 5 1.1.4 Stability of Distributed Congestion Control ............ 7 1.2 Problem Definition and Motivation . ................ 8 1.3 Contributions of the Dissertation . ................ 9 1.4 Structure of the Dissertation . ....................... 11 2. Flow Controller Design and Performance Analysis for Self-Similar Network Traffic....................................... 12 2.1 Overview . .............................. 12 2.2 Preliminary definitions . ....................... 14 2.3 Mathematical Model . ....................... 15 vii 2.4 Short-Term Prediction of Self-Similar Traffic . ............ 19 2.5 Simulation Results of the LMMSE Predictor . ............ 20 2.6 System Level Simulations . ....................... 25 2.7 Concluding Remarks . ....................... 29 3. A Variable Structure Control Approach to Active Queue Management for TCP with ECN ..................................... 30 3.1 Overview . .............................. 30 3.2 Variable Structure Control in AQM . ................ 32 3.2.1 Nonlinear TCP dynamics . ................ 32 3.2.2 VS based AQM with ECN . ................ 34 3.3 Robustness and Performance Analysis . ................ 36 3.4 Related Work . .............................. 42 3.5 Packet-Level Simulations . ....................... 47 3.5.1 Simulation Configuration . ................ 47 3.5.2 The Scenario of Single Bottleneck Topology . ..... 48 3.5.3 The Scenario of Multiple Bottleneck Topology . ..... 55 3.6 Concluding Remarks . ....................... 58 ½ 4. Robust Controller Design for AQM and À -Performance Analysis . ..... 61 4.1 Introduction . .............................. 61 4.2 Mathematical Model of TCP/AQM . ................ 62 ½ 4.3 À Controller Design for AQM . ................ 64 4.4 Multiplicative Uncertainty Bound . ................ 66 ½ 4.5 À -Performance Analysis . ....................... 69 4.6 Simulations . .............................. 72 4.6.1 The Case of a Single Controller . ................ 73 4.6.2 The Case of Switching Control . ................ 75 4.7 Conclusions . .............................. 76 ½ 5. On Switching À Controllers for a Class of LPV Systems . ..... 79 5.1 Introduction . .............................. 80 5.2 Problem Definition . ....................... 81 5.3 Main Results . .............................. 84 5.4 Numerical Example . ....................... 92 5.5 Concluding Remarks . ....................... 99 viii 6. Conclusions . ..............................100 6.1 Summary of Results . .......................100 6.2 Future Work . ..............................102 Bibliography . .....................................104 ix LIST OF FIGURES Figure Page 1.1 The flow control model . ....................... 4 1.2 Data flow in communication networks . ................ 8 2.1 LMMSE based feedback control system . ................ 16 2.2 One-step prediction for different values of « ................. 21 2.3 Error for different prediction steps . ................ 22 2.4 Prediction Error and relative error variance in one-step prediction . ..... 23 2.5 Discretized model . .............................. 25 ¼ × 2.6 System responses for ¼ time scale: the middle one denotes the com- parison controller and the bottom one denotes the LMMSE based scheme . 26 2.7 Performance indexes as a function of Ò .................... 28 × 2.8 System response for ½ time scale: The middle one denotes the compar- ison controller and the bottom one denotes the LMMSE one . ..... 29 3.1 Aggregated dynamics of TCP and VS based AQM . ............ 34 3.2 System responses using the VS controller . ................ 42 3.3 Phase portrait of the closed loop system . ................ 43 3.4 Dumbbell network topology for ns simulations . ............ 48 x 3.5 The network topology with multiple bottleneck links ............ 49 3.6 Instantaneous queue size using VS control . ................ 50 3.7 System responses for DropTail, RED, PI and REM . ............ 51 3.8 Queue evolution using RED, PI, REM and VS control ............ 52 3.9 Average queue length w.r.t. the number of TCP flows ............ 53 3.10 Link utilization w.r.t. the number of TCP flows . ............ 54 3.11 Packet loss ratio w.r.t. the number of TCP flows . ............ 55 3.12 Comparison of PI and the VS controller . ................ 56 3.13 Performance in the presence of short-lived TCP flows ............ 57 3.14 Queue evolution using RED, PI, REM and VS control in the scenario with a much
Load more

Recommended publications
  • An Adaptive Active Queue Management Algorithm in Internet
    UNIVERSITÉ DU QUÉBEC À CHICOUTIMI AN ADAPTIVE ACTIVE QUEUE MANAGEMENT ALGORITHM IN INTERNET MÉMOIRE PRÉSENTÉ COMME EXIGENCE PARTIELLE DE LA MAÎTRISE EN INFORMATIQUE EXTENSIONNÉE DE L'UNIVERSITÉ DU QUÉBEC À MONTRÉAL PAR WANG JIANG JUIN 2006 UNIVERSITÉ DU QUÉBEC À MONTRÉAL Service des bibliothèques Avertissement La diffusion de ce mémoire se fait dans le respect des droits de son auteur, qui a signé le formulaire Autorisation de reproduire et de diffuser un travail de recherche de cycles supérieurs (SDU-522 - Rév.01-2006). Cette autorisation stipule que «conformément à l'article 11 du Règlement no 8 des études de cycles supérieurs, [l'auteur] concède à l'Université du Québec à Montréal une licence non exclusive d'utilisation et de publication de la totalité ou d'une partie importante de [son] travail de recherche pour des fins pédagogiques et non commerciales. Plus précisément, [l'auteur] autorise l'Université du Québec à Montréal à reproduire, diffuser, prêter, distribuer ou vendre des copies de [son] travail de recherche à des fins non commerciales sur quelque support que ce soit, y compris l'Internet. Cette licence et cette autorisation n'entraînent pas une renonciation de [la] part [de l'auteur] à [ses] droits moraux ni à [ses] droits de propriété intellectuelle. Sauf entente contraire, [l'auteur] conserve la liberté de diffuser et de commercialiser ou non ce travail dont [il] possède un exemplaire.» ABSTRACT Random Ear1y Detection (RED) algorithm a recommended active queue management scheme, that is expected to provide several Internet performance advantages such as minimizing packet loss and router queueing delay, avoiding global synchronization of sources, guaranteeing high link utilization and fairness.
    [Show full text]
  • TCP and Queue Management
    White Paper TCP and Queue Management Agilent N2X TCP and Queue Management Background and Motivation Slow start – The slow start mechanism was a direct attempt to avoid congestion collapse by increasing the packet rate Transmission Control Protocol (TCP) and various queue of a connection in a controlled fashion – slowly at first, management algorithms such as tail drop and random faster later on - until congestion is detected (i.e. packets are early detection (RED), etc. are intimately related topics. dropped), and ultimately arrive at a steady packet rate, or Historically, the two evolved together and have had a equilibrium. To achieve this goal, the designers of the slow symbiotic relationship. However, a poor understanding of start mechanism chose an exponential ramp-up function to the relationship between TCP and queue-management successively increase the window size. Slow start introduces algorithms is at the root of why measured performance in a new parameter called the congestion window or cwnd, routers is dramatically different from the actual performance which specifies the number of packets that can be sent of live networks, leading to a need for massive over- without needing a response from the server. TCP starts off provisioning. Explanations of how the various components slowly (hence the name “slow start”) by sending just one of TCP work, and the effect various queuing schemes have packet, then waits for a response (an ACK) from the receiver. on TCP, tends to be isolated on specific topics and scattered. These ACKs confirm that it is safe to send more packets This paper attempts to bring the key concepts together in into the network (i.e.
    [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 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]
  • Congestion Control and Active Queue Management During Flow Startup
    Department of Computer Science Series of Publications A Report A-2019-7 Congestion Control and Active Queue Management During Flow Startup Ilpo J¨arvinen Doctoral dissertation, to be presented for public examination with the permission of the Faculty of Science of the University of Helsinki, in Auditorium A129, Chemicum building, Kumpula, Helsinki, on the 14th of November, 2019 at 12 o’clock. University of Helsinki Finland Supervisor Markku Kojo, University of Helsinki, Finland Sasu Tarkoma, University of Helsinki, Finland Pre-examiners Pasi Sarolahti, Aalto University, Finland Michael Welzl, University of Oslo, Norway Opponent Anna Brunstr¨om,Karlstad University, Sweden Custos Sasu Tarkoma, University of Helsinki, Finland Contact information Department of Computer Science P.O. Box 68 (Pietari Kalmin katu 5) FI-00014 University of Helsinki Finland Email address: [email protected].fi URL: http://cs.helsinki.fi/ Telephone: +358 2941 911 Copyright c 2019 Ilpo J¨arvinen ISSN 1238-8645 ISBN 978-951-51-5585-6 (paperback) ISBN 978-951-51-5586-3 (PDF) Helsinki 2019 Unigrafia Congestion Control and Active Queue Management During Flow Startup Ilpo J¨arvinen Department of Computer Science P.O. Box 68, FI-00014 University of Helsinki, Finland [email protected].fi PhD Thesis, Series of Publications A, Report A-2019-7 Helsinki, November 2019, 87+48 pages ISSN 1238-8645 ISBN 978-951-51-5585-6 (paperback) ISBN 978-951-51-5586-3 (PDF) Abstract Transmission Control Protocol (TCP) has served as the workhorse to trans- mit Internet traffic for several decades already. Its built-in congestion con- trol mechanism has proved reliable to ensure the stability of the Internet, and congestion control algorithms borrowed from TCP are being applied largely also by other transport protocols.
    [Show full text]
  • Random Early Detection (RED) Mechanism for Congestion Control
    Rochester Institute of Technology RIT Scholar Works Theses 7-2-2015 TCP – Random Early Detection (RED) mechanism for Congestion Control Asli Sungur [email protected] Follow this and additional works at: https://scholarworks.rit.edu/theses Recommended Citation Sungur, Asli, "TCP – Random Early Detection (RED) mechanism for Congestion Control" (2015). Thesis. Rochester Institute of Technology. Accessed from This Thesis is brought to you for free and open access by RIT Scholar Works. It has been accepted for inclusion in Theses by an authorized administrator of RIT Scholar Works. For more information, please contact [email protected]. R.I.T TCP – Random Early Detection (RED) mechanism for Congestion Control by ASLI SUNGUR This thesis is presented as part of the Degree of Master of Science in Network and System Administration with emphasis in Networking Committee Members: Ali Raza Muhieddin Amer Nirmala Shenoy Information Science and Technologies Department, B. Thomas Golisano College of Computing & Information Sciences Rochester Institute of Technology Rochester, NY July 2, 2015 i Table of Contents Abstract ........................................................................................................................................................ iv Acknowledgement ........................................................................................................................................ v List of Figures .............................................................................................................................................
    [Show full text]
  • With Deficit Round Robin (DRR) to Overcome Bufferbloat Problem in Wired Network
    International Journal of Current Engineering and Technology E-ISSN 2277 – 4106, P-ISSN 2347 – 5161 ©2015INPRESSCO®, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Comparative Analysis of Controlled Delay (CoDel) with Deficit Round Robin (DRR) to Overcome Bufferbloat Problem in Wired Network Hashim Ali†* Samiullah Khan† and Muhammad Quaid† †Department of Computer Science, Institute of Business and Management Sciences (IBMS), The University of Agriculture Peshawar Pakistan Accepted 10 Oct 2015, Available online13 Oct 2015, Vol.5, No.5 (Oct 2015) Abstract Bufferbloat is a problem in a packet-switched network which can happen due to increase in buffer size usage with increase in internet traffic. This creates high latency in network which ultimately degrades network performance. The active queue management (AQM) is considered to be solution for bufferbloat problem. The usage of larger size buffer in networks increases the queuing delay. This delay becomes more severe when the buffer remains full persistently behave as bad queue. The transport layer protocol misinterprets this large delay with congestion in networks which degrade their sending rate. This research study focuses on evaluation of CoDel performance for solving bufferbloat problem in wired networks. CoDel was compared with DRR in bandwidth and maximum transmission unit (MTU) simulation scenarios using network simulator-2 (ns-2).The range of packet delay and dropped rate parameters are used to analysis the Codel in above mentioned scenarios for its strengthen and weakness. The results revealed that CoDel has efficiently overcome bufferbloat problem as compare to DRR by having less packet delay. Keywords: Bufferbloat, active queue management, Controlled Delay, Deficit Round Robin, network simulator-2 1.
    [Show full text]
  • The Yellow Active Queue Management Algorithm in ICN Routers Based on the Monitoring of Bandwidth Competition
    electronics Article The Yellow Active Queue Management Algorithm in ICN Routers Based on the Monitoring of Bandwidth Competition Li Zeng 1,2 , Hong Ni 1,2 and Rui Han 1,2,* 1 National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21 North Fourth Ring Road, Haidian District, Beijing 100190, China; [email protected] (L.Z.); [email protected] (H.N.) 2 School of Electronic, Electrical and Communication Engineering, University of Chinese Academy of Sciences, No. 19A Yuquan Road, Shijingshan District, Beijing 100049, China * Correspondence: [email protected]; Tel.: +86-1-381-107-7380 Abstract: Deploying the active queue management (AQM) algorithm on a router is an effective way to avoid packet loss caused by congestion. In an information-centric network (ICN), routers not only play a role of packets forwarding but are also content service providers. Congestion in ICN routers can be further summarized as the competition between the external forwarding traffic and the internal cache response traffic for limited bandwidth resources. This indicates that the traditional AQM needs to be redesigned to adapt to ICN. In this paper, we first demonstrated mathematically that allocating more bandwidth for the upstream forwarding flow could improve the quality of service (QoS) of the whole network. Secondly, we propose a novel AQM algorithm, YELLOW, which predicts the bandwidth competition event and adjusts the input rate of request and the marking probability adaptively. Afterwards, we model YELLOW through the totally asymmetric simple exclusion process (TASEP) and deduce the approximate solution of the existence condition for each Citation: Zeng, L.; Ni, H.; Han, R.
    [Show full text]
  • Active Queue Management As Quality of Service Enabler for 5G Networks
    Active Queue Management as Quality of Service Enabler for 5G Networks Mikel Irazabal, Elena Lopez-Aguilera and Ilker Demirkol Dept. of Network Engineering, Universitat Politecnica` de Catalunya, Barcelona, Spain Email: [email protected], [email protected], [email protected] Abstract—5G is envisioned as the key technology for guaran- with a bulky TCP traffic for the network resources. Experi- teeing low-latency wireless services. Packets will be marked with mental results expose the benefits that AQM brings into delay- QoS Flow Indicators (QFI) for different forwarding treatment. sensitive traffic, and corroborate that AQM mechanisms will 3GPP defines the end-to-end delay limits, but leaves the QoS provisioning methods as implementation dependent. Different be key enablers to guarantee the QoS criteria defined by 3GPP. services with different constraints will inevitably share queues at some network entity. On the one hand, maintaining the shared II. RELATED WORK queues uncongested will guarantee a rapid packet delivery to the The softwarization process [3] of telecommunication net- subsequent entity. A brief sojourn time is indispensable for an works is leading to new and heterogeneous business models on time low-latency priority traffic delivery. On the other hand, if shared queues are maintained undersized, throughput will be with different constraints and challenges. Thus, the QoS squandered. In this paper, we propose the use of AQM techniques scenario for the 5G standalone network proposed by the in 5G networks to guarantee delay limits of QoS flows. Through 3GPP is challenging. Even though slicing has emerged as the the evaluation of realistic delay-sensitive and background traffic, correct tool for virtualizing the 5G stack, the QoS problems we compare different possible solutions.
    [Show full text]
  • Performance Evaluation of Various Active Queue Management for Bufferbloat
    International Journal of Engineering and Advanced Technology (IJEAT) ISSN: 2249 – 8958, Volume-5, Issue-4, April 2016 Performance Evaluation of Various Active Queue Management for Bufferbloat Kanu Monga, Krishan Kumar Abstract - Due to unprotected large buffers in network devices, In this paper, an experimental study is carried out to the Internet is suffering from high latency and jitter which leads evaluate the performance of CoDel and its variants in a to decreased throughput. The perseveringly full buffer problem, wide range of Internet scenarios. The performance of same recently exposed as “bufferbloat” [1] [2] has been observed for decades, but is still with us. As a solution to this problem, several is also compared to that of DropTail [3]. The evaluation new AQM algorithms CoDel, sfqCoDel and CoDel-DT have been parameters of this study are bottleneck link utilization, mean proposed. This paper aims to evaluate these AQM algorithms by queue length at the bottleneck router and overall packet drop carrying out simulations in ns-2 and compares their performance rate. Rest of the paper is classified as follows: Section II with that of DropTail. sfqCoDel outperforms various peer briefly explains the working of these AQM algorithms. solutions in variety of scenarios in terms of bottleneck link Section III presents the details about simulation scenarios, utilization, packet drop rate and mean queue length. performance evaluation metrics etc. Section IV Keywords- AQM, RED, CoDel, Droptail, Bufferbloat demonstrates the results and based on the comparative study, inferences have been deduced in Section V. Finally, I. INTRODUCTION Section VI concludes the paper. Over the past few years, the usage of Internet has grown to phenomenal levels and this has led to heavy congestion in II.
    [Show full text]
  • Bufferbloat and Beyond
    The elephant symbo- lises a big download, The topic of this thesis is the performance of computer networks in commonly referred to general, and the internet in particular. While network performance as an ”elephant flow”, which has generally improved with time, over the last several years we have blocks the link with its bulk so seen examples of performance barriers limiting network performance. everything has to wait behind it. In this work we explore such performance barriers and look for solutions. The mice are smaller Our exploration takes us through three areas where performance barriers flows, such as web are found: The bufferbloat phenomenon of excessive queueing latency, the pages, that take up little space performance anomaly in WiFi networks and related airtime resource sharing but should be able to move problems, and the problem of implementing high-speed programmable freely. Through better queue packet processing in an operating system. In each of these areas we present management, the mice are solutions that significantly advance the state of the art. guided around the elephant, The work in this thesis spans all three aspects of the field of computing, so they don’t have to wait; namely mathematics, engineering and science. We perform mathematical and interactivity is restored. analysis of algorithms, engineer solutions to the problems we explore, The penguin is Tux, and perform scientific studies of the network itself. All our solutions are the Linux mascot, who implemented as open source software, including both contributions to the stands at the bottleneck upstream Linux kernel, as well as the Flent test tool, developed to support and directs traffic onto the the measurements performed in the rest of the thesis.
    [Show full text]
  • Congestion Control and Active Queue Management During Flow Startup
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Helsingin yliopiston digitaalinen arkisto Department of Computer Science Series of Publications A Report A-2019-7 Congestion Control and Active Queue Management During Flow Startup Ilpo J¨arvinen Doctoral dissertation, to be presented for public examination with the permission of the Faculty of Science of the University of Helsinki, in Auditorium A129, Chemicum building, Kumpula, Helsinki, on the 14th of November, 2019 at 12 o’clock. University of Helsinki Finland Supervisor Markku Kojo, University of Helsinki, Finland Sasu Tarkoma, University of Helsinki, Finland Pre-examiners Pasi Sarolahti, Aalto University, Finland Michael Welzl, University of Oslo, Norway Opponent Anna Brunstr¨om,Karlstad University, Sweden Custos Sasu Tarkoma, University of Helsinki, Finland Contact information Department of Computer Science P.O. Box 68 (Pietari Kalmin katu 5) FI-00014 University of Helsinki Finland Email address: [email protected].fi URL: http://cs.helsinki.fi/ Telephone: +358 2941 911 Copyright c 2019 Ilpo J¨arvinen ISSN 1238-8645 ISBN 978-951-51-5585-6 (paperback) ISBN 978-951-51-5586-3 (PDF) Helsinki 2019 Unigrafia Congestion Control and Active Queue Management During Flow Startup Ilpo J¨arvinen Department of Computer Science P.O. Box 68, FI-00014 University of Helsinki, Finland [email protected].fi PhD Thesis, Series of Publications A, Report A-2019-7 Helsinki, November 2019, 87+48 pages ISSN 1238-8645 ISBN 978-951-51-5585-6 (paperback) ISBN 978-951-51-5586-3 (PDF) Abstract Transmission Control Protocol (TCP) has served as the workhorse to trans- mit Internet traffic for several decades already.
    [Show full text]