DOCSLIB.ORG

Cross-Layer Congestion Control and Quality of Service in Mobile Networks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Cross-Layer Congestion Control and Quality of Service in Mobile Networks 2 2 0 Cross-layer congestion control and T A P quality of service in mobile networks P I 0 The`se de doctorat de l’Institut Polytechnique de Paris 2 0 pre´pare´e a` Telecom Paris 2 : E´ cole doctorale n◦626 E´ cole Doctorale de l’Institut Polytechnique de Paris (IP Paris) T Spe´cialite´ de doctorat : Informatique, Donne´es et Intelligence Artificielle N N The`se pre´sente´e et soutenue a` Palaiseau, le 15/07/2020, par ZHENZHE ZHONG Composition du Jury : Isabel Amigo Assistant Professor,IMT Atlantique Pre´sident M.Lyes Khoukhi Professeur,University of Technology of Troyes Rapporteur M.Pascal Lorenz Professeur, University of Haute Alsace Rapporteur Dominique Gaiti Professeur, University of Technology of Troyes Examinateur Ste´phane Tuffin Gestionnaire de projet, Orange Labs Examinateur Isabelle Hamchaoui inge´nieur de recherche senior, Orange Labs Directeur de the`se(CIFRE) Ahmed Serhrouchni Professeur, Telecom ParisTech Directeur de the`se Rida Khatoun Associate Professor, Telecom ParisTech Co-directeur de the`se 626 Table of contents List of figures5 List of tables9 List of Abbreviations 18 1 Introduction 21 1.1 Context and Objective . 21 1.2 Contributions . 24 1.3 Thesis outline . 25 2 Introduction en Français 27 2.1 Contexte et objectif . 27 2.2 Contributions . 30 2.3 Aperçu de la thèse . 32 3 Overview of Mobile network architecture and congestion control algorithms 33 3.1 Introduction . 33 3.2 LTE mobile network . 34 3.2.1 LTE backhaul . 34 3.2.2 LTE Radio Access Network . 35 3.3 End-to-End Congestion control methods for Quality of Service . 41 3.3.1 Non-Cross-Layer protocols . 42 3.3.2 Cross-layer protocols . 52 3.3.3 Other solutions . 58 3.4 Discussion and conclusion . 59 4 Models and Tools used in Congestion Control Algorithms 63 4.1 Introduction . 63 Table of contents 4.2 Design logics in a Congestion Control Algorithm: a TCP example . 63 4.3 TCP Transmit/Receive Sequence Trace figures . 66 4.4 The STARTUP procedure in bottleneck bandwidth and round trip delay-based congestion control . 69 4.5 DupAck procedure for the lower bound to confirm a trend . 71 4.6 BURSTY traffic and PACING traffic . 72 4.7 Conclusion and discussion . 77 5 Adapt Channel Quality Indicator Control and Bottleneck Bandwidth and RTT congestion control in LTE network in NS3 simulator 79 5.1 Introduction . 79 5.2 TCP BBR . 80 5.2.1 BBR state machine . 80 5.2.2 BBR capacity estimation . 82 5.3 From CQIC in 3G to DCIC/TCP-CQIC-LTE . 82 5.3.1 QUIC-CQIC in HSPA+ . 82 5.3.2 DCIC/TCP-CQIC in LTE . 84 5.3.3 Why Delayed ACK . 87 5.4 DCIC/TCP-CQIC implementation on NS3 . 89 5.5 DCIC/TCP-CQIC-LTE v.s. TCP Westwood and Cubic . 90 5.5.1 Result and discussion . 91 5.6 DCIC/TCP-CQIC v.s. TCP BBR . 95 5.7 Conclusion . 98 6 Toward client driven bandwidth estimation architecture for end-to-end conges- tion control: a protocol design 101 6.1 Introduction . 101 6.2 The pros and cons of tested CCAs . 102 6.3 Bandwidth estimation method in UE . 104 6.3.1 Principle of design . 104 6.3.2 Validate CDBE BWE method with saturated traffic . 107 6.4 CDBE state transition module in server . 107 6.4.1 State definition and impact of parameters . 109 6.4.2 Condition of state transition in CDBE server . 111 6.5 Simulation and result discussion . 113 6.5.1 Simulation configuration . 113 6.5.2 Performance of CDBE server . 114 2 Table of contents 6.5.3 Per-flow analysis . 116 6.5.4 System level result statistics, evaluation and discussion . 116 6.6 Conclusion . 118 7 CDBEv2: Toward ubiquitous congestion control in a mobile network 121 7.1 Introduction . 121 7.2 From CDBE to CDBEv2 . 122 7.2.1 Simplified Client-Side bottleneck bandwidth estimation . 122 7.2.2 Server Side Windowed BWE report utilisation with a dynamic low-pass filter . 123 7.2.3 Advanced features in CDBEv2 state machine . 126 7.2.4 Simulation and analysis of CDBEv2 . 142 7.3 Conclusion and future work . 153 8 Conclusion and Future work 159 8.1 Thesis conclusion . 159 8.2 Perspectives and future direction . 161 References 163 3 List of figures 1.1 Goals and tradeoffs for an ubiquitous CCA design . 23 2.1 Objectifs et compromis pour une conception CCA omniprésente . 30 3.1 LTE interface stacks . 34 3.2 Capacity variation in different generations of Cellular network . 37 3.3 Brief LTE protocol stack . 40 3.4 Simplified LTE Network architecture with RAN, backhaul and gateway . 41 3.5 Categories of congestion control solutions . 42 3.6 Illustrate the basic concept behind loss-based congestion control . 45 3.7 Illustration of ITCP . 50 3.8 Illustration of MTCP . 51 3.9 Mobile throughput Guidance . 51 3.10 CQIC Flowchart . 53 3.11 Improved CQIC Flowchart . 54 3.12 piStream flowchart . 55 3.13 Time consumption in different section of a Mobile edge network . 60 3.14 Goals and tradeoffs for an ubiquitous CCA design . 60 4.1 Abstract of the network assumption in the thesis . 64 4.2 Compare the target operating point and area of loss-based Congestion control and bandwidth/round trip delay based control algorithm . 65 4.3 Reading the TCP Trace figure . 67 4.4 Rough working pattern of Loss-based congestion control. 68 4.5 Simplest case for 3 Dupack . 72 4.6 Birth-death process of a M/M/1 Queue model . 74 4.7 Bandwidth utilisation against the cost in time for poisson type of traffic and bursty traffic . 75 5 List of figures 4.8 Cost of idle, queuing and sum of the two when the pacing data rate is equivalent to bottleneck bandwidth . 75 4.9 The effect of pacing in a network. 76 4.10 Recalling goals and objectives . 78 5.1 Case study example of CQIC and BBR . 83 5.2 DCI in LTE radio link . 84 5.3 Compare CQIC method and DCIC method . 85 5.4 Capacity difference among PHY, RLC and estimations . 88 5.5 CQIC Header report design. 89 5.6 Average Throughput(a), and(b)Average Round Trip Time . 91 5.7 Throughput Cumulative Distributive Function of1MB(a),10MB(b) download 92 5.8 RTT cdf of 1MB(a),10MB(b) download . 92 5.9 (a),Average RLC UL re-transmission (per UE) and (d)Average RLC UL re- transmission (per UE) . 93 5.10 The Maximum sequence of transmitteda,c and ACKed data sequenced,b... 94 5.11 DL, UL and End-to-End traffic . 97 6.1 Illustration of CDBE filter function on UE . 105 6.2 Fixed network topology for CDBE BWE validation . 107 6.3 Validate CDBE BWE method in a wired network with UDP traffic . 108 6.4 Validate CDBE BWE method in LTE with UDP traffic . 108 6.5 CDBE server state transition . 109 6.6 Bandwidth estimation (left), Gain, DSDL and DSDLmin in one experiment (right) . 113 6.7 Simulation topology and concept illustration . 114 6.8 (a) Goodput CDF of CDBE, CQIC, CQIC-S and BBR and (b) RTT samples with 75% and 99% percentiles . 119 7.1 The structure of BW option field in TCP header. 123 7.2 How does b change with RTT on interval RTTmin 2 [20ms;300ms] ...... 125 7.3 Queuing delay caused by STARTUP stage for Gpacing = 2;2:77;2:88 with BW(t0) = 1Mbps ................................ 129 7.4 Overall mean delay for initial bandwidth from 100Kbps to 1Mbps and the STARTUP Gain from 2 to 3 respectively. 130 7.5 The the mean, maximum, minimum delay and lost percentage caused by different pairs of Gpacing and BW(t0) for BWBtlnck 2 [1Mbps;150Mbps] ... 131 6 List of figures 7.6 The the mean, maximum, minimum delay and lost percentage caused by different pairs of Gpacing and BW(t0) for BWBtlnck 2 [150Mbps;500Mbps] .. 132 7.7 Summary of STARTUP Gain pair selection . 133 7.8 Performance of thresholds, evolution of BW0/BW1 and Queue size in bottlneck in BWBtlnck = 1Mbps .............................. 136 7.9 Performance of thresholds, evolution of BW0/BW1 and Queue size in bottlneck in BWBtlnck = 1Mbps .............................. 137 7.10 Performance of thresholds, evolution of BW0/BW1 and Queue size in bottlneck in BWBtlnck = 5Mbps .............................. 138 7.11 Performance of thresholds, evolution of BW0/BW1 and Queue size in bottlneck in BWBtlnck = 20Mbps ............................. 138 7.12 Performance of thresholds, evolution of BW0/BW1 and Queue size in bottlneck in BWBtlnck = 150Mbps ............................. 139 7.13 Performance of thresholds, evolution of BW0/BW1 and Queue.
Load more

Recommended publications
  • TCP Congestion Control: Overview and Survey of Ongoing Research
    Purdue University Purdue e-Pubs Department of Computer Science Technical Reports Department of Computer Science 2001 TCP Congestion Control: Overview and Survey Of Ongoing Research Sonia Fahmy Purdue University, [email protected] Tapan Prem Karwa Report Number: 01-016 Fahmy, Sonia and Karwa, Tapan Prem, "TCP Congestion Control: Overview and Survey Of Ongoing Research" (2001). Department of Computer Science Technical Reports. Paper 1513. https://docs.lib.purdue.edu/cstech/1513 This document has been made available through Purdue e-Pubs, a service of the Purdue University Libraries. Please contact [email protected] for additional information. TCP CONGESTION CONTROL: OVERVIEW AND SURVEY OF ONGOING RESEARCH Sonia Fahmy Tapan Prem Karwa Department of Computer Sciences Purdue University West Lafayette, IN 47907 CSD TR #01-016 September 2001 TCP Congestion Control: Overview and Survey ofOngoing Research Sonia Fahmy and Tapan Prem Karwa Department ofComputer Sciences 1398 Computer Science Building Purdue University West Lafayette, IN 47907-1398 E-mail: {fahmy,tpk}@cs.purdue.edu Abstract This paper studies the dynamics and performance of the various TCP variants including TCP Tahoe, Reno, NewReno, SACK, FACK, and Vegas. The paper also summarizes recent work at the lETF on TCP im­ plementation, and TCP adaptations to different link characteristics, such as TCP over satellites and over wireless links. 1 Introduction The Transmission Control Protocol (TCP) is a reliable connection-oriented stream protocol in the Internet Protocol suite. A TCP connection is like a virtual circuit between two computers, conceptually very much like a telephone connection. To maintain this virtual circuit, TCP at each end needs to store information on the current status of the connection, e.g., the last byte sent.
    [Show full text]
  • A QUIC Implementation for Ns-3
    This paper has been submitted to WNS3 2019. Copyright may be transferred without notice. A QUIC Implementation for ns-3 Alvise De Biasio, Federico Chiariotti, Michele Polese, Andrea Zanella, Michele Zorzi Department of Information Engineering, University of Padova, Padova, Italy e-mail: {debiasio, chiariot, polesemi, zanella, zorzi}@dei.unipd.it ABSTRACT One of the most important novelties is QUIC, a transport pro- Quick UDP Internet Connections (QUIC) is a recently proposed tocol implemented at the application layer, originally proposed by transport protocol, currently being standardized by the Internet Google [8] and currently considered for standardization by the Engineering Task Force (IETF). It aims at overcoming some of the Internet Engineering Task Force (IETF) [6]. QUIC addresses some shortcomings of TCP, while maintaining the logic related to flow of the issues that currently affect transport protocols, and TCP in and congestion control, retransmissions and acknowledgments. It particular. First of all, it is designed to be deployed on top of UDP supports multiplexing of multiple application layer streams in the to avoid any issue with middleboxes in the network that do not same connection, a more refined selective acknowledgment scheme, forward packets from protocols other than TCP and/or UDP [12]. and low-latency connection establishment. It also integrates cryp- Moreover, unlike TCP, QUIC is not integrated in the kernel of the tographic functionalities in the protocol design. Moreover, QUIC is Operating Systems (OSs), but resides in user space, so that changes deployed at the application layer, and encapsulates its packets in in the protocol implementation will not require OS updates. Finally, UDP datagrams.
    [Show full text]
  • Etsi Tr 121 905 V11.2.0 (2012-10)
    ETSI TR 121 905 V11.2.0 (2012-10) Technical Report Digital cellular telecommunications system (Phase 2+); Universal Mobile Telecommunications System (UMTS); LTE; Vocabulary for 3GPP Specifications (3GPP TR 21.905 version 11.2.0 Release 11) 3GPP TR 21.905 version 11.2.0 Release 11 1 ETSI TR 121 905 V11.2.0 (2012-10) Reference RTR/TSGS-0021905vb20 Keywords GSM,LTE,UMTS ETSI 650 Route des Lucioles F-06921 Sophia Antipolis Cedex - FRANCE Tel.: +33 4 92 94 42 00 Fax: +33 4 93 65 47 16 Siret N° 348 623 562 00017 - NAF 742 C Association à but non lucratif enregistrée à la Sous-Préfecture de Grasse (06) N° 7803/88 Important notice Individual copies of the present document can be downloaded from: http://www.etsi.org The present document may be made available in more than one electronic version or in print. In any case of existing or perceived difference in contents between such versions, the reference version is the Portable Document Format (PDF). In case of dispute, the reference shall be the printing on ETSI printers of the PDF version kept on a specific network drive within ETSI Secretariat. Users of the present document should be aware that the document may be subject to revision or change of status. Information on the current status of this and other ETSI documents is available at http://portal.etsi.org/tb/status/status.asp If you find errors in the present document, please send your comment to one of the following services: http://portal.etsi.org/chaircor/ETSI_support.asp Copyright Notification No part may be reproduced except as authorized by written permission.
    [Show full text]
  • An Experimental Evaluation of Low Latency Congestion Control for Mmwave Links
    An Experimental Evaluation of Low Latency Congestion Control for mmWave Links Ashutosh Srivastava, Fraida Fund, Shivendra S. Panwar Department of Electrical and Computer Engineering, NYU Tandon School of Engineering Emails: fashusri, ffund, [email protected] Abstract—Applications that require extremely low latency are −40 expected to be a major driver of 5G and WLAN networks that −45 include millimeter wave (mmWave) links. However, mmWave −50 links can experience frequent, sudden changes in link capacity −55 due to obstructions in the signal path. These dramatic variations RSSI (dBm) in link capacity cause a temporary “bufferbloat” condition −60 0 25 50 75 100 during which delay may increase by a factor of 2-10. Low Time (s) latency congestion control protocols, which manage bufferbloat Fig. 1: Effect of human blocker on received signal strength of by minimizing queue occupancy, represent a potential solution a 60 GHz WLAN link. to this problem, however their behavior over links with dramatic variations in capacity is not well understood. In this paper, we explore the behavior of two major low latency congestion control protocols, TCP BBR and TCP Prague (as part of L4S), using link Link rate: 5 packets/ms traces collected over mmWave links under various conditions. 1ms queuing delay Our evaluation reveals potential problems associated with use of these congestion control protocols for low latency applications over mmWave links. Link rate: 1 packet/ms Index Terms—congestion control, low latency, millimeter wave 5ms queuing delay Fig. 2: Illustration of effect of variations in link capacity on I. INTRODUCTION queueing delay. Low latency applications are envisioned to play a significant role in the long-term growth and economic impact of 5G This effect is of great concern to low-delay applications, and future WLAN networks [1].
    [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]
  • TCP Congestion Control with a Misbehaving Receiver
    TCP Congestion Control with a Misbehaving Receiver Stefan Savage, Neal Cardwell, David Wetherall, and Tom Anderson Department of Computer Science and Engineering University of Washington, Seattle Abstract col modifications, a faulty or malicious receiver can at most cause the sender to transmit data at a slower rate than it otherwise would, In this paper, we explore the operation of TCP congestion control thus harming only itself. Because our work has serious practical when the receiver can misbehave, as might occur with a greedy ramifications for an Internet that depends on trust to avoid conges- Web client. We first demonstrate that there are simple attacks that tion collapse, we also describe backwards-compatible mechanisms allow a misbehaving receiver to drive a standard TCP sender ar- that can be implemented at the sender to mitigate the effects of un- bitrarily fast, without losing end-to-end reliability. These attacks trusted receivers. are widely applicable because they stem from the sender behavior As far as we are aware, the division of trust between sender specified in RFC 2581 rather than implementation bugs. We then and receiver has not been studied previously in the context of con- show that it is possible to modify TCP to eliminate this undesir- gestion control. While end-to-end congestion control protocols as- able behavior entirely, without requiring assumptions of any kind sume that both sender and receiver behave correctly, in many en- about receiver behavior. This is a strong result: with our solution vironments the interests of sender and receiver may differ consid- a receiver can only reduce the data transfer rate by misbehaving, erably – creating significant incentives to violate this “good faith” thereby eliminating the incentive to do so.
    [Show full text]
  • TCP-Friendly Congestion Control for Real-Time Streaming Applications
    MIT Technical Report MIT-LCS-TR-806, May 2000. TCP-friendly Congestion Control for Real-time Streaming Applications Deepak Bansal and Hari Balakrishnan M.I.T. Laboratory for Computer Science Cambridge, MA 02139 g Email: fbansal,hari @lcs.mit.edu Abstract ment in the Internet, however, the protocols used by these applications must implement congestion control algorithms This paper introduces and analyzes a class of nonlinear con- that are stable and interact well with TCP. Such protocols gestion control algorithms called binomial algorithms, moti- are called “TCP compatible” [3] or “TCP fair”. They ensure vated in part by the needs of streaming audio and video ap- that the TCP connections using AIMD get their fair allo- plications for which a drastic reduction in transmission rate cation of bandwidth in the presence of these protocols and upon congestion is problematic. Binomial algorithms gen- vice versa. One notion that has been proposed to capture eralize TCP-style additive-increase by increasing inversely “TCP compatibility” is “TCP-friendliness”. It is well known k proportional to a power of the current window (for TCP, that the throughput of a flow with TCP’s AIMD conges- k =¼ = ½ ) ; they generalize TCP-style multiplicative-decrease tion control (increase factor « packet, decrease factor Ô Ð =½=¾ Ô » Ë=´Ê Ôµ by decreasing proportional to a power of the current win- ¬ ) is related to its loss rate as ,where Ð = ½ dow (for TCP, ). We show that there are an infinite Ë is the packet size [19, 25, 10, 26]. An algorithm is TCP- Ô » Ë=´Ê Ôµ number of deployable TCP-friendly binomial algorithms, all friendly [20] if its throughput with the same · Ð =½ of which satisfy k , and that all binomial algorithms constant of proportionality as for a TCP connection with the converge to fairness under a synchronized-feedback assump- same packet size and round-trip time.
    [Show full text]
  • Better Throughput in TCP Congestion Control Algorithms on Manets
    (IJACSA) International Journal of Advanced Computer Science and Applications, Special Issue on Wireless & Mobile Networks Scalable TCP: Better Throughput in TCP Congestion Control Algorithms on MANETs M.Jehan Dr. G.Radhamani Associate Professor, Department of Computer Science, Professor & Director, Department of Computer Science, D.J.Academy for Managerial Excellence, Dr.G.R.Damodaran College of Science, Coimbatore, India Coimbatore, India Abstract—In the modern mobile communication world the This paper is entirely devoted to evaluating the Control congestion control algorithms role is vital to data transmission Window (cwnd), Round Trip Delay Time (rtt) and Throughput between mobile devices. It provides better and reliable using the TCP BIC, Vegas and Scalable TCP congestion communication capabilities in all kinds of networking control algorithms in the wireless networks. environment. The wireless networking technology and the new kind of requirements in communication systems needs some II. BACKGROUND WORK extensions to the original design of TCP for on coming technology development. This work aims to analyze some TCP congestion A. Congestion Control in Transmission Control Protocol control algorithms and their performance on Mobile Ad-hoc Algorithms Networks (MANET). More specifically, we describe performance TCP (Transmission Control Protocol) is a set of rules behavior of BIC, Vegas and Scalable TCP congestion control (protocol) used along with the Internet Protocol (IP) to send algorithms. The evaluation is simulated through Network data in the form of message units between computers over the Simulator (NS2) and the performance of these algorithms is Internet. It operates at a higher level, concerned only with the analyzed in the term of efficient data transmission in wireless and two end systems.
    [Show full text]
  • Radio Fundamentals for Cellular Networks 3 1 Making Communications Wireless
    Radio fundamentals for cellular networks White paper White paper | Version 02.00 Table of contents Introduction ................................................................................................................3 1 Making communications wireless .....................................................................4 1.1 Evolution of cellular standards ...................................................................................... 4 1.2 GSM: A historical perspective ..................................................................................... 10 2 Overview of radio interface processing ............................................................11 2.1 An overview of the radio interface protocol stack ...................................................... 11 2.2 CDMA based physical layer baseband processing in 3G networks ............................ 15 2.3 OFDM baseband processing in 4G and 5G networks................................................. 20 3 Device network radio interface interactions ...................................................27 3.1 Overview of device operations .................................................................................... 27 3.2 Cell search and cellular network acquisition ............................................................... 28 3.3 Contacting the cellular network: random access ........................................................ 29 3.4 Device core network interactions ............................................................................... 30
    [Show full text]
  • Copa: Practical Delay-Based Congestion Control for the Internet
    Copa: Practical Delay-Based Congestion Control for the Internet Venkat Arun and Hari Balakrishnan, MIT CSAIL https://www.usenix.org/conference/nsdi18/presentation/arun This paper is included in the Proceedings of the 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI ’18). April 9–11, 2018 • Renton, WA, USA ISBN 978-1-939133-01-4 Open access to the Proceedings of the 15th USENIX Symposium on Networked Systems Design and Implementation is sponsored by USENIX. Copa: Practical Delay-Based Congestion Control for the Internet Venkat Arun and Hari Balakrishnan M.I.T. Computer Science and Artificial Intelligence Laboratory Email: fvenkatar,[email protected] Abstract time or low interactive delay). Larger BDPs exacerbate This paper introduces Copa, an end-to-end conges- the \bufferbloat" problem. A more global Internet tion control algorithm that uses three ideas. First, it leads to flows with very different propagation delays sharing a bottleneck (exacerbating the RTT-unfairness shows that a target rate equal to 1=(ddq), where dq is the (measured) queueing delay, optimizes a natural func- exhibited by many current protocols). tion of throughput and delay under a Markovian packet At the same time, application providers and users arrival model. Second, it adjusts its congestion window have become far more sensitive to performance, with in the direction of this target rate, converging quickly to notions of \quality of experience" for real-time and the correct fair rates even in the face of significant flow streaming media, and various metrics to measure Web churn. These two ideas enable a group of Copa flows performance being developed.
    [Show full text]
  • Performance Analysis of Google Congestion Control Algorithm for Webrtc
    Performance Analysis of Google Congestion Control Algorithm for WebRTC M.L. Guerrero Viveros Performance Analysis of Google Congestion Control Algorithm for WebRTC by M.L. Guerrero Viveros in partial fulfilment of the requirements for the degree of Master of Science in Electrical Engineering Track Telecommunications and sensing systems at the Delft University of Technology, to be defended publicly on Thursday November 07, 2019 at 10:00 AM. Student number: 4736605 Project duration: January 1, 2019 – November 07, 2019 Thesis committee: Prof. dr. ir. P. Van Mieghem, TU Delft Dr. P. Pawelczak, TU Delft Ir. R. Noldus, Ericsson, supervisor This thesis is confidential and cannot be made public until November 07, 2019. An electronic version of this thesis is available at http://repository.tudelft.nl/. Abstract Web Real-Time communication (WebRTC) is a technology that enables web browsers to es- tablish real-time communication services without the need of specific software or plug-ins. This technology is gaining popularity and is already supported by popular browsers such as Google Chrome, Firefox and Safari. The quality of real-time communication services depends highly on latency. For this reason, real-time flows have different requirements than conven- tional TCP flows which focus mainly on the transfer of bulk traffic. The IETF created the working group RMCAT (RTP Media Congestion Avoidance Techniques) to define requirements for real-time congestion control algorithms. One of the proposed algorithms is Google Con- gestion Control (GCC). This is the only real-time congestion control algorithm implemented in commercial browsers such as Google Chrome. Unfortunately, the performance of GCC in wireless networks has not been extensively evaluated.
    [Show full text]
  • Techniques for End-To-End Tcp Performance Enhancement Over Wireless Networks
    University of Pennsylvania ScholarlyCommons Publicly Accessible Penn Dissertations 2016 Techniques for End-to-End Tcp Performance Enhancement Over Wireless Networks Bong Ho Kim University of Pennsylvania, [email protected] Follow this and additional works at: https://repository.upenn.edu/edissertations Part of the Computer Sciences Commons, and the Engineering Commons Recommended Citation Kim, Bong Ho, "Techniques for End-to-End Tcp Performance Enhancement Over Wireless Networks" (2016). Publicly Accessible Penn Dissertations. 1813. https://repository.upenn.edu/edissertations/1813 This paper is posted at ScholarlyCommons. https://repository.upenn.edu/edissertations/1813 For more information, please contact [email protected]. Techniques for End-to-End Tcp Performance Enhancement Over Wireless Networks Abstract Today’s wireless network complexity and the new applications from various user devices call for an in- depth understanding of the mutual performance impact of networks and applications. It includes understanding of the application traffic and network yla er protocols to enable end-to-end application performance enhancements over wireless networks. Although Transport Control Protocol (TCP) behavior over wireless networks is well known, it remains as one of the main drivers which may significantly impact the user experience through application performance as well as the network resource utilization, since more than 90% of the internet traffic usesCP T in both wireless and wire-line networks. In this dissertation, we employ application traffic measurement and packet analysis over a commercial Long Term Evolution (LTE) network combined with an in-depth LTE protocol simulation to identify three critical problems that may negatively affect the application performance and wireless network resource utilization: (i) impact of the wireless MAC protocol on the TCP throughput performance, (ii) impact of applications on network resource utilization, and (iii) impact of TCP on throughput performance over wireless networks.
    [Show full text]