Performance of UMTS Radio Link Control
|
|
- Shanon Milo Goodwin
- 6 years ago
- Views:
Transcription
1 Performance of UMTS Radio Link Control Qinqing Zhang, Hsuan-Jung Su Bell Laboratories, Lucent Technologies Holmdel, NJ 77 Abstract- The Radio Link Control (RLC) protocol in Universal Mobile Telecommunication System (UMTS) contains a suite of features and options which make the protocol very flexible and adaptive to operation in different radio environments and for various applications. In this paper, we analyze the various features and functions associated with the RLC protocol and evaluate the performance over UMTS specific physical link through simulations. Specifically, we examine the detail behavior of the protocol under various conditions and options, including polling, status transmission mechanism, and packet discard functions. We compare different and examine their impacts on the delay and throughput as well as acknowledgement overhead. We also compare different discard parameters and service rates and evaluate their impacts on the overall performance. Finally we provide quantitative results for web-browsing traffic which is considered as one of the future applications in G wireless networks. I. INTRODUCTION Universal Mobile Telecommunication System (UMTS) is a rd generation (G) wireless system based on WCDMA technology to support voice, high-speed data and multimedia services. In UMTS, the Radio Link Control (RLC) stands on top of the physical and Media Access Control (MAC) layer to provide reliable data transmissions over the radio link. The RLC specification in GPP standards [] contains a suite of features and options which make the protocol very flexible and adaptive to operation in different radio environments and for various applications. This imposes a challenging task for protocol design and performance evaluation. In this paper, we analyze the various features and functions associated with the RLC protocol. We model four layers to pursue a comprehensive study, i.e., the physical layer, the MAC layer, the RLC layer and the upper layer. We focus on the acknowledged mode (AM) where retransmission is performed. The retransmission scheme in RLC specification for Release99 is Type I hybrid ARQ. For the purpose of performance evaluation, a simulation model was built to realize the full operations of the RLC protocol. The performance metric is throughput, delay, acknowledgment overhead and packet loss rate. We examine the behavior of the protocol under various conditions and options, including polling, status transmission mechanism and packet discard functions. We compare different and examine their impacts on the delay and throughput as well as acknowledgement overhead. We also compare different discard parameters and service rates, and evaluate their impacts on performance. Finally we provide quantitative results for web-browsing traffic which is considered as one of the future applications in G wireless networks. II. OVERVIEW OF UMTS RADIO LINK CONTROL PROTOCOL A. Retransmission schemes of RLC Basic concept The basic scheme consists of the transmitter sending polls to the receiver, and the receiver sending status report back to the transmitter indicating which of the RLC Protocol Data Units (PDU) have been successfully received and which have not. Upon receipt of the status report, the transmitter retransmits the PDUs which were negatively acknowledged. Many additional features have been included in RLC to reduce the retransmission delay, prevent unnecessary retransmission, reduce the overhead of acknowledgements, and prevent deadlock of the protocol. Type of retransmission The current UMTS RLC protocol uses type I hybrid ARQ as the error recovery scheme for the AM mode. There are three types of hybrid ARQ schemes, stop-and-wait (SAW), go-back-n (GBN) and selective repeat (SR), which have been studied and analyzed intensively in the past. RLC can use any one of the retransmission schemes by configuring the transmission window and acknowledgement format appropriately. Polling mechanism RLC is a transmitter driven protocol via the polling mechanism. The transmitter sends the polling request to the receiver by setting the poll bit in the AM mode data (AMD) PDU. The receiver responds by sending the status report (in a number of STATUS PDUs) back to the transmitter. Retransmission is triggered if a negative acknowledgement is indicated in a status report. There are total eight different polling triggers defined in the RLC specification: last PDU in transmission buffer, last PDU in retransmission buffer, Poll timer, every Poll_PDU PDU, every SDU, timer based, window based, polling prohibit. Last PDU in transmission buffer and last PDU in retransmission buffer polling triggers can avoid deadlock of the RLC entities. Polling request should be sent frequently to reduce the acknowledgment feedback delay. Upon receipt of the acknowledgment through status reports, the transmitter can either retransmit the lost PDUs, or remove the PDUs which are successfully received from the retransmission buffer and move the transmitter window to avoid protocol stalling. The delay performance will be improved with fast polling request. However, the more frequently the polling request is triggered, the more frequently the status report is generated. The status reports cause overhead by occupying the link bandwidth on the reverse direction. It also introduces interference to other users (other RLC entities) in a CDMA system. The throughput and delay performance of each individual entity will be degraded with more frequent status reports. Clearly there is a trade-off of the frequency polling //$7. IEEE
2 The different polling triggers defined in the standards provide the flexibility and allow the network to control the polling frequency based on the network conditions, such as traffic load, link quality, quality of service requirements, etc. Status transmission mechanism Upon receipt of a poll request, the receiver always sends back a status report which is carried by one or multiple STATUS PDUs. The following triggers are optional for the status transmission: detection of missing PDUs, timer based status transmission, Estimated PDU Counter (EPC) mechanism, status prohibit. Detection of missing PDUs and Timer based status transmission triggers are receiver driven and allow the receiver to send status reports more aggressively. The EPC mechanism and Status prohibit functions prohibit excessive status message exchange between the transmitter and the receiver. SDU discard function The Service Data Unit (SDU) is the data unit exchanged between the RLC layer and the upper layer. The SDU discard function allows the transmitter to discard the RLC PDUs associated with a SDU from the retransmission buffer in case the transmission of those RLC PDUs is unsuccessful for a long period. This function provides a mechanism to avoid buffer overflow and reduce the maximum transmission delay from an arbitrary large value. There are two SDU discard functions that are controlled by the network: timer based discard, with explicit signaling, SDU discard after MaxDAT number of retransmissions. Timer based discard function discards the SDU after a timer expires. It controls the exact maximum delay each SDU may experience. It is insensitive to the variation of the channel transmission rate and error rate. As such, the SDU loss rate increases as SDUs are discarded. SDU discard after MaxDAT number of retransmissions is an alternative discard function. It tries to keep the SDU loss rate constant. However, its delay performance is dependent on the channel condition. The network will decide which SDU discard function to be used according to the QoS requirement of the Radio Access Bearer. B. Interaction between RLC and other layers The interaction between RLC and other layers is performed by exchanging logical and control information through primitives. The detail definition of all the data and control primitives is described in the standard []. In general, upper layers send request to the RLC layer for transmission of higher layer SDUs. RLC confirms and delivers to the higher layers RLC SDUs that have been received. RLC also indicates to higher layers which RLC SDUs have been discarded. The procedure of communications between RLC and MAC layer can be found in []. In summary, MAC layer selects the appropriate Transport Format Combination (TFC) for each transport channel depending on the instantaneous source rate. MAC informs RLC the number of PDUs per Transmission Time Interval (TTI). MAC also schedules and coordinates the transmission of each RLC entity on common and shared channels. III. SIMULATION DESCRIPTION A. Overview In order to maintain simulation efficiency, the simulation focuses on the transmitting side. The major functions at the transmitter, such as segmentation/concatenation, padding, transmission and retransmission buffer management, acknowledgement handling, etc, are all implemented. The functions at the receiver side are fulfilled without explicitly implementing the individual modules. For example, the status reports in the reverse link are only given properties such as error probability and propagation and processing delay, which are defined in the Reverse Channel block (as shown in Fig. ) and determined using link layer simulation results. Traffic SDU Segmentation Concatenation New PDU Poll Triggers MUX Set Poll Bit MAC Retx PDU PDU Request Status Report Reverse Channel Forward Channel Receiver Fig. Simulation block diagram The simulation details are illustrated in Fig.. The transmitting side includes a Traffic module which can generate the incoming traffic. The incoming traffic packets are stored as SDUs in the SDU. These SDUs are then segmented or concatenated into PDUs, added RLC header, and stored in the New PDU. Padding of PDU is switched off. In addition to the New PDU, there is a Retransmission PDU. A Multiplexer (MUX) following the two PDU buffers can receive requests from the MAC layer to determine how many PDUs to output in a given TTI and which PDU buffer to take PDUs from. A PDU in the Retransmission PDU can be transmitted only when the corresponding NACK has been received. The retransmitted PDUs always have higher priority than new PDUs. If the MUX decides on a new PDU, this new PDU will be removed from the New PDU and placed in the Retransmission PDU after being transmitted. Before a PDU is handed to the MAC layer, the Poll Trigger conditions are checked to determined whether the Poll Bit should be set or not. Network decides which Poll Triggers to be switched on or off. In the simulation, the MAC module requests a constant number of PDUs for every TTI depending on the service rate. However, the actual number of PDUs 7
3 transmitted depends on whether there are PDUs in the buffers that are eligible for transmission. The eligible PDUs are forwarded to a Forward Channel module which determines the forward link delay and whether the PDU is in error. If the PDU is deemed correctly received, the receiver counters, states and performance metrics are updated accordingly. Otherwise, no action is taken. If the Poll Bit of a correctly received PDU is set, a Status Report containing ACKs and NACKs of the PDUs in the current receiving window, up to the highest received sequence number, is initiated at the receiver and passed through the Reverse Channel. The Reverse Channel gives each Status Report a reverse link delay and determines whether it is correctly received. A correctly received Status Report is used to update the transmitter counters, states, SDU, and whether and when a PDU will become eligible for retransmission. An erroneous Status Report will not have any effect on the transmitter. To avoid redundant retransmissions and system instability, a NACK received within a round trip delay of the transmission of the corresponding PDU is ignored. B. MAC and Physical layer model We consider the UMTS specific physical layer model where the transport block error probabilities are obtained from the link level simulation results. Compared to the Additive White Gaussian Noise (AWGN) channel, the UMTS specific channel model has more bursty errors. We consider two service rates for packet data services: kbps and 8 kbps. We assume that only one service rate is applicable for a user and is chosen at the radio bearer setup procedure. The rate cannot be re-negotiated during the session once the connection is established. Once the service rate is determined, MAC selects the TFC, the size of transport block (TB) and the number of TBs per TTI. The detailed parameters are discussed in section V. C. Upper layer traffic model The SDU traffic arrival process is another important factor in the RLC performance. The traffic statistics affects the buffer occupancy distribution in conjunction with the transmission and retransmission methods. The performance metrics such as delay and throughput are related to the traffic characteristics as well. We use the traffic model [] for Web browsing application to study the performance of the RLC protocol. There are in total three phases to characterize the web browsing procedure. Session: The session arrival process is modeled as a Poisson process. The inter-arrival time depends on the cell loading and user behavior. Packet call: During a Web browsing session, each packet call corresponds to a user downloading a web page. The number of packet calls per session follows Log-Normal distribution with mean of and standard deviation of. The think time between packet calls is modeled by a Gamma distribution with mean of seconds and standard deviation of seconds. Packet: Round trip delay includes the propagation delay and processing time at both forward and reverse links. Each packet call generates a sequence of packets. For example, the information in a web page is transmitted through a number of packets. Each packet corresponds to a distinct object in a web page. The inter-arrival time between packets is Geometrically distributed with mean of.7 ms. The number of packets per packet call is Pareto distributed with mean of. For single RLC entity, we simulate two phases, packet call and packet, to generate the SDU traffic arrival. Each packet is treated as one SDU. Since the think time starts after a Web page (packet call) is completely downloaded, all the SDUs will be dismissed from the buffer before the user starts to download the next web page. In other words, for each page downloading, the user will see an empty RLC buffer. It should be noted that upper layer protocols, e.g., TCP/IP, may vary the SDU traffic characteristics at certain level. The interaction between RLC and TCP layer flow control will be included in our future study. D. Performance metrics The performance metrics is described as follows. Throughput Throughput is defined as the average number of information bits transmitted divided by the total time duration. Delay Packet call delay is defined as the difference between the first packet arrival time at the transmitter and the time the last packet in a packet call is received successfully at the receiver. The delay for packet calls corresponds to the average page downloading time. SDU Error Rate Because of the SDU discard function, the receipt of the SDUs will not be error free. The SDU error rate versus different parameter settings is given. Acknowledgement overhead The acknowledgment overhead is calculated as the average ratio of the number of status reports to the number of PDUs transmitted per TTI. IV. SIMULATION RESULTS A. Simulation parameters and assumptions The simulation parameters and assumptions are summarized in Table. TABLE Simulation Parameters Parameter Assumption SDU Traffic model Web browsing Physical layer UMTS link level results channel RLC Block error rate 8.% RLC PDU bytes TTI ms Service Rate (PDUs per TTI) kbps or 8 kbps ( or PDUs per TTI) Tx_Window_Size 7 Rx_Window_Size 7 SDU Discard Timer based discard function Round Trip Delay ms 8
4 B. Performance results We have performed intensive simulations to evaluate the performance of the RLC protocol by varying different parameters and choosing different options. In this section, we summarize and highlight the results. Effect of polling mechanism One of our main objectives is to investigate the effect of various polling triggers and examine their impacts on the performance. Since our main interest is the delay and throughput of web page downloading, we used the poll every POLL_SDU trigger. Other polling triggers, such as poll every POLL_PDU, periodic polling, etc, can achieve similar results with the right parameter settings. We are also interested in the other two polling triggers, last PDU in transmission buffer and last PDU in retransmission buffer, since these two triggers can prevent protocol deadlock. With the last PDU in retransmission buffer trigger, whenever a PDU is the last in the retransmission buffer that is eligible for retransmission, its poll bit is set to one. Fig. and Fig. shows the simulation results of packet call throughput and delay versus different value of POLL_SDU, with and without the other two last PDU polling triggers. The SDU discard timer is set to seconds. We can see that without the two last PDU polling triggers, the throughput decreases as the polling interval increases. The throughput drops more than % from polling every SDU to polling every SDU. The delay performance also degraded with the increase of polling interval. The average packet call delay increases about % from polling every SDU to polling every SDU. Kbytes/s Packet Call Throughput Fig. Comparison of packet call throughput with different It is interesting to notice that with the two last PDU triggers, the performance degradation is not that much with large value of, the reason being that although the polling interval is large, the two last PDU triggers happen quite frequently. They trigger enough polling messages and compensate the lack of polling by. It is evident that frequent polling improves the performance. However it generates status reports which occupy the reverse link bandwidth. Fig. shows the status report overhead versus different. With the poll every trigger alone, the status report overhead drops from % to.% with polling interval of SDU to SDU. In conjunction of the last PDU polling triggers, the status report overhead drops from.% to.% instead. This indicates that the polling messages generated by the two last PDU triggers have almost the same amount as those triggered by polling every SDU. ms Packet Call Delay 8 Fig. Comparison of packet call delay with different Another important performance metric is the SDU discard rate. As mentioned earlier, we use the timer based SDU discard function to reduce the protocol deadlock and stalling. Fig. shows the SDU discard rate versus different polling interval. It is shown that the SDU discard rate increases from % to 7% with polling interval of SDU to SDU. The waiting time of each outstanding PDU increases as the polling interval increases. As a result, the probability that a SDU waiting time exceeds the threshold and gets discarded increases. When the two last PDU triggers are enabled, the SDU discard rate decreases by as much as 9% with of. % Status Report Overhead 8 Fig. Comparison of status report overhead with different SDU Discard Rate 8 Fig. Comparison of SDU discard rate with different 9
5 Effect of SDU discard timer Next we evaluate the effect of SDU discard function on the performance. Fig. to Fig. 9 shows the performance results with different discard timer thresholds: and seconds. We can see that the throughput does not change much with different discard timer values. The status report overhead also remains the same. However, the packet call delay increases from around.7 seconds to. seconds, more than % increase. The reason is that with the current traffic loading and kbps link capacity, the delay is dominated by the queuing delay. The larger the discard timer is, more packets are waiting in the buffer. A newly arrived packet (SDU) has to wait longer before it can get the chance to be transmitted. Thus it results in a larger average delay per packet call. Larger discard timer can reduce the packet drop rate. This is evident in Fig. 9. We can see that the SDU discard rate drops % to 7%. With polling every SDU, the SDU discard rate is around %. Kbytes/s 8 7 Packet Call Throughput 8K sec Discard Timer 8 Fig. Comparison of packet call throughput with different ms Packet Call Delay 8K sec Discard Timer 8 Fig. 7 Comparison of packet call delay with different Effect of service rate In these figures, we also examine the RLC performance with a higher service rate, 8 kbps. It is shown that the both throughput and delay performance improve quite much with a higher service rate. The SDU discard rate drops tremendously. This is due to the fact that with a large link capacity, the queuing delay of each SDU is very small under the current loading of web browsing traffic. The SDU discard probability is thus very small. It is interesting to notice that We consider the status report generated from the receiver only. The status report associated with SDU discard from the transmitter is not included here. the status report overhead is actually higher with 8 kbps service rate, the reason being that the buffer is drained at a much higher rate which triggers the last PDU in transmission and retransmission buffer polling very frequently. The two last PDU triggers dominate the polling and cause the polling overhead almost invariant with different poll SDU intervals. % Status Report Overhead 8K sec Discard Timer 8 Fig. 8 Comparison of status report overhead with different SDU Discard Rate 8 8K sec Discard Timer Fig. 9 Comparison of SDU discard rate with different V. CONCLUSIONS In this paper, we have evaluated the various features and options of the UMTS RLC protocol through intensive simulations. We investigated the performance of the RLC layer for web browsing application. We found that with polling every SDU in conjunction with the last PDU in transmission and retransmission buffer polling, we could achieve very good performance results with limited amount of overhead. In addition, we found that large service rate can produce very good performance, especially for web browsing application. ACKNOWLEDGMENT The authors would like to thank Andrew Zaporozhets for providing UMTS link level simulation results. REFERENCES [] GPP TS. v.., RLC protocol specification. [] GPP TS., MAC protocol specification. [] Lucent Internal document, UMTS Specific Traffic Model.
RLC protocol performance over TCP SACK
PUBLISHED IN: PROCEEDINGS OF THE WIOPT 28, PP. 4 RLC protocol performance over Michael Makidis and George Xylomenos mmakidis5@cs.aueb.gr and xgeorge@aueb.gr Mobile Multimedia Laboratory Athens University
More informationPerformance Evaluation of the Radio Link Control Protocol in 3G UMTS
1 Performance Evaluation of the Radio Link Control Protocol in 3G UMTS Jun Li School of Mathematics & Statistics, Carleton University, 1125 Colonel By Dr. Ottawa, Ontario, Canada K1S 5B6 Phone: (613)520-2600
More informationIP-Packet Service Time Distributions in UMTS Radio Access Networks
IP-Packet Service Time Distributions in UMTS Radio Access Networks Arthur Mutter, Marc C. Necker, Stephan Lück Abstract This work deals with the service time of IP-packets within the UMTS Terrestrial Radio
More informationSIMULATION FRAMEWORK MODELING
CHAPTER 5 SIMULATION FRAMEWORK MODELING 5.1 INTRODUCTION This chapter starts with the design and development of the universal mobile communication system network and implementation of the TCP congestion
More informationMakidis Michael.
Makidis Michael mmakidis05@aueb.gr RLC protocol overview procedures Simulation setup Performance of applications without contention Performance of applications with contention Performance of CBR Media
More informationData Link Control Protocols
Protocols : Introduction to Data Communications Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 23 May 2012 Y12S1L07, Steve/Courses/2012/s1/its323/lectures/datalink.tex,
More informationEvaluation of End-to-End TCP performance over WCDMA
Evaluation of End-to-End TCP performance over WCDMA Liang Hu Department of Communications, Optics & Materials Technical University of Denmark, Lyngby, Denmark Email:{lh}@com.dtu.dk Abstract this article
More informationEvaluation of UMTS RLC Parameters for MPEG-4 Video Streaming
56 ECTI TRANSACTIONS ON COMPUTER AND INFORMATION TECHNOLOGY VOL.3, NO.1 MAY 2007 Evaluation of UMTS RLC Parameters for MPEG-4 Video Streaming Arisa Panchaem, Sinchai Kamolpiwong, Mallika Unhawiwat, and
More informationLixia Zhang M. I. T. Laboratory for Computer Science December 1985
Network Working Group Request for Comments: 969 David D. Clark Mark L. Lambert Lixia Zhang M. I. T. Laboratory for Computer Science December 1985 1. STATUS OF THIS MEMO This RFC suggests a proposed protocol
More informationCongestion control in TCP
Congestion control in TCP If the transport entities on many machines send too many packets into the network too quickly, the network will become congested, with performance degraded as packets are delayed
More informationEvaluation of End-to-End TCP Performance over WCDMA
Evaluation of End-to-End TCP Performance over WCDMA Liang Hu Network Group, COM Centre Technical University of Denmark Outline Recall background knowledge Why study TCP over WCDMA Performance Evaluation
More informationUNIT 2 TRANSPORT LAYER
Network, Transport and Application UNIT 2 TRANSPORT LAYER Structure Page No. 2.0 Introduction 34 2.1 Objective 34 2.2 Addressing 35 2.3 Reliable delivery 35 2.4 Flow control 38 2.5 Connection Management
More informationPolitecnico di Milano Scuola di Ingegneria Industriale e dell Informazione. Link Layer. Fundamentals of Communication Networks
Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione Link Layer Fundamentals of Communication Networks Data Link layer o It is the first logical layer in the protocol stack o Functions
More informationPerformance Analysis of AAL2 switching/multiplexing in the I ub interface in UMTS Network
Performance Analysis of AAL2 switching/multiplexing in the I ub interface in UMTS Network Bong Ho Kim and David J Houck Bell Labs Advanced Technologies, Lucent Technologies Holmdel, NJ 07733 U.S.A And
More informationA QoS Control Scheme for Voice and Data Services in cdma2000 System
A QoS Control Scheme for Voice and Data Services in cdma System Omneya Issa and Jean-Charles Grégoire INRS-EMT, Place Bonaventure, 8, de la Gauchetière Ouest, bureau 69 Montréal (Québec), H5A 1K6 Canada
More informationTransport Protocols and TCP: Review
Transport Protocols and TCP: Review CSE 6590 Fall 2010 Department of Computer Science & Engineering York University 1 19 September 2010 1 Connection Establishment and Termination 2 2 1 Connection Establishment
More informationTransport Layer. Application / Transport Interface. Transport Layer Services. Transport Layer Connections
Application / Transport Interface Application requests service from transport layer Transport Layer Application Layer Prepare Transport service requirements Data for transport Local endpoint node address
More informationTransmission Control Protocol. ITS 413 Internet Technologies and Applications
Transmission Control Protocol ITS 413 Internet Technologies and Applications Contents Overview of TCP (Review) TCP and Congestion Control The Causes of Congestion Approaches to Congestion Control TCP Congestion
More informationMPEG4 VIDEO OVER PACKET SWITCHED CONNECTION OF THE WCDMA AIR INTERFACE
MPEG4 VIDEO OVER PACKET SWITCHED CONNECTION OF THE WCDMA AIR INTERFACE Jamil Y. Khan 1, Pratik Das 2 School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW 238,
More informationThe Effect of Code-Multiplexing on the High Speed Downlink Packet Access (HSDPA) in a WCDMA Network
The Effect of Code-Multiplexing on the High Speed Downlink Packet Access (HSDPA) in a WCDMA Network Raymond Kwan, Peter H. J. Chong 2, Eeva Poutiainen, Mika Rinne Nokia Research Center, P.O. Box 47, FIN-45
More informationPerformance of Hybrid ARQ Techniques for WCDMA High Data Rates
Performance of Hybrid ARQ Techniques for WCDMA High Data Rates Esa Malkamalu, Deepak Mathew, Seppo Hamalainen Nokia Research Center P.O. Box 47, FN-45 Nokia Group, Finland esa.malkamaki @nokia.com Abstract
More informationCHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS
28 CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS Introduction Measurement-based scheme, that constantly monitors the network, will incorporate the current network state in the
More informationThe Impact of Delay Variations on TCP Performance
INSTITUT FÜR KOMMUNIKATIONSNETZE UND RECHNERSYSTEME Prof. Dr.-Ing. Dr. h. c. mult. P. J. Kühn The Impact of Delay Variations on TCP Performance Michael Scharf scharf@ikr.uni-stuttgart.de ITG FG 5.2.1 Workshop,
More informationImpact of transmission errors on TCP performance. Outline. Random Errors
Impact of transmission errors on TCP performance 1 Outline Impact of transmission errors on TCP performance Approaches to improve TCP performance Classification Discussion of selected approaches 2 Random
More informationECE 333: Introduction to Communication Networks Fall 2001
ECE 333: Introduction to Communication Networks Fall 2001 Lecture 28: Transport Layer III Congestion control (TCP) 1 In the last lecture we introduced the topics of flow control and congestion control.
More informationUser Datagram Protocol (UDP):
SFWR 4C03: Computer Networks and Computer Security Feb 2-5 2004 Lecturer: Kartik Krishnan Lectures 13-15 User Datagram Protocol (UDP): UDP is a connectionless transport layer protocol: each output operation
More informationTCP/IP-2. Transmission control protocol:
TCP/IP-2 Transmission control protocol: TCP and IP are the workhorses in the Internet. In this section we first discuss how TCP provides reliable, connectionoriented stream service over IP. To do so, TCP
More informationTransport Protocols and TCP
Transport Protocols and TCP Functions Connection establishment and termination Breaking message into packets Error recovery ARQ Flow control Multiplexing, de-multiplexing Transport service is end to end
More informationCS321: Computer Networks Congestion Control in TCP
CS321: Computer Networks Congestion Control in TCP Dr. Manas Khatua Assistant Professor Dept. of CSE IIT Jodhpur E-mail: manaskhatua@iitj.ac.in Causes and Cost of Congestion Scenario-1: Two Senders, a
More informationDualRTT: Enhancing TCP Performance During Delay Spikes
DualRTT: Enhancing TCP Performance During Delay Spikes Ph.D. School of Computer Science University of Oklahoma. Email: atiq@ieee.org Web: www.cs.ou.edu/~atiq Presentation at Tohoku University, Sendai,
More informationNetwork management and QoS provisioning - revise. When someone have to share the same resources is possible to consider two particular problems:
Revise notes Multiplexing & Multiple Access When someone have to share the same resources is possible to consider two particular problems:. multiplexing;. multiple access. The first one is a centralized
More informationTCP Performance Enhancement for UMTS Access Network
Downloaded from orbit.dtu.dk on: May 09, 2018 TCP Performance Enhancement for UMTS Access Network Hu, Liang Published in: SERSC Link to article, DOI: 10.1109/FGCNS.2008.159 Publication date: 2008 Document
More informationCHAPTER 5. QoS RPOVISIONING THROUGH EFFECTIVE RESOURCE ALLOCATION
CHAPTER 5 QoS RPOVISIONING THROUGH EFFECTIVE RESOURCE ALLOCATION 5.1 PRINCIPLE OF RRM The success of mobile communication systems and the need for better QoS, has led to the development of 3G mobile systems
More informationChapter 24 Congestion Control and Quality of Service 24.1
Chapter 24 Congestion Control and Quality of Service 24.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 24-1 DATA TRAFFIC The main focus of congestion control
More informationCS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007
CS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007 Question 344 Points 444 Points Score 1 10 10 2 10 10 3 20 20 4 20 10 5 20 20 6 20 10 7-20 Total: 100 100 Instructions: 1. Question
More informationAdaptive Mechanism for Aggregation with fragments retransmission in high-speed wireless networks
Int. J. Open Problems Compt. Math., Vol. 4, No. 3, September 2011 ISSN 1998-6262; Copyright ICSRS Publication, 2011 www.i-csrs.org Adaptive Mechanism for Aggregation with fragments retransmission in high-speed
More informationPerformance of Lucent CDMA2000 3G1X Packet Data Experimental System
Performance of Lucent CDMA2 3G1X Packet Data Experimental System Gang Li, Ming Lu, Martin Meyers, Devesh Patel, James Stekas, and Andrea Tonello Bell Laboratories, Lucent Technologies Inc. 67 Whippany
More informationTransport Protocols & TCP TCP
Transport Protocols & TCP CSE 3213 Fall 2007 13 November 2007 1 TCP Services Flow control Connection establishment and termination Congestion control 2 1 TCP Services Transmission Control Protocol (RFC
More informationFast, Efficient, and Robust Multicast in Wireless Mesh Networks
fast efficient and robust networking FERN Fast, Efficient, and Robust Multicast in Wireless Mesh Networks Ian Chakeres Chivukula Koundinya Pankaj Aggarwal Outline IEEE 802.11s mesh multicast FERM algorithms
More informationCMPE 257: Wireless and Mobile Networking
CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 10 CMPE 257 Spring'15 1 Student Presentations Schedule May 21: Sam and Anuj May 26: Larissa
More informationPeer-to-Peer Protocols and Data Link Layer. Chapter 5 from Communication Networks Leon-Gracia and Widjaja
Peer-to-Peer Protocols and Data Link Layer Chapter 5 from Communication Networks Leon-Gracia and Widjaja Peer-to-Peer Protocols At each layer two (or more) entities execute These are peer processes For
More informationCMPE150 Midterm Solutions
CMPE150 Midterm Solutions Question 1 Packet switching and circuit switching: (a) Is the Internet a packet switching or circuit switching network? Justify your answer. The Internet is a packet switching
More informationUNIT IV -- TRANSPORT LAYER
UNIT IV -- TRANSPORT LAYER TABLE OF CONTENTS 4.1. Transport layer. 02 4.2. Reliable delivery service. 03 4.3. Congestion control. 05 4.4. Connection establishment.. 07 4.5. Flow control 09 4.6. Transmission
More informationCSE 473 Introduction to Computer Networks. Final Exam. Your name here: 12/17/2012
CSE 473 Introduction to Computer Networks Jon Turner Final Exam Your name here: 12/17/2012 1. (8 points). The figure below shows a network path connecting a server to a client. 200 km 2000 km 2 km X Y
More informationData Link Control. Outline. DLC functions
Data Link Control #8 1 Outline functions Framing Error and flow control Performance of Example of a standard protocol- >H Open loop flow control 2 Data Link Layer Functions Data Link layer provides a error
More informationEnd-to-End QoS Improvement of HSDPA End-User Multi-flow Traffic Using RAN Buffer Management
End-to-End QoS Improvement of HSDPA End-User Multi-flow Traffic Using RAN Buffer Management Suleiman Y. Yerima and Khalid Al-Begain Integrated Communications Research Centre, University of Glamorgan Pontypridd
More informationComputer Networking. Reliable Transport. Reliable Transport. Principles of reliable data transfer. Reliable data transfer. Elements of Procedure
Computer Networking Reliable Transport Prof. Andrzej Duda duda@imag.fr Reliable Transport Reliable data transfer Data are received ordered and error-free Elements of procedure usually means the set of
More informationSubject: Adhoc Networks. Navodaya Institute of Technology, Raichur Page 1
FEEDBACK BASED TCP (TCP F) Improves performance of TCP. Uses a feedback based approach. The routing protocol is expected to repair the broken path within a reasonable time period Operation: In TCP-F, an
More information******************************************************************* *******************************************************************
ATM Forum Document Number: ATM_Forum/96-0518 Title: Performance of TCP over UBR and buffer requirements Abstract: We study TCP throughput and fairness over UBR for several buffer and maximum window sizes.
More information3. Evaluation of Selected Tree and Mesh based Routing Protocols
33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in
More informationCSCD 330 Network Programming Winter 2015
CSCD 330 Network Programming Winter 2015 Lecture 11a Transport Layer Reading: Chapter 3 Some Material in these slides from J.F Kurose and K.W. Ross All material copyright 1996-2007 1 Chapter 3 Sections
More informationThe Transport Layer Reliability
The Transport Layer Reliability CS 3, Lecture 7 http://www.cs.rutgers.edu/~sn4/3-s9 Srinivas Narayana (slides heavily adapted from text authors material) Quick recap: Transport Provide logical communication
More informationCommunication Networks
Communication Networks Spring 2018 Laurent Vanbever nsg.ee.ethz.ch ETH Zürich (D-ITET) April 30 2018 Materials inspired from Scott Shenker & Jennifer Rexford Last week on Communication Networks We started
More informationII. Principles of Computer Communications Network and Transport Layer
II. Principles of Computer Communications Network and Transport Layer A. Internet Protocol (IP) IPv4 Header An IP datagram consists of a header part and a text part. The header has a 20-byte fixed part
More informationEnd-to-end UMTS Network Performance Modeling. 1. Introduction
End-to-end UMTS Network Performance Modeling Authors: David Houck*, Bong Ho Kim, Jae-Hyun Kim Lucent Technologies 101 Crawfords Corner Rd., Room 4L431 Holmdel, NJ 07733, USA Phone: +1 732 949 1290 Fax:
More informationEnhancing TCP Throughput over Lossy Links Using ECN-Capable Capable RED Gateways
Enhancing TCP Throughput over Lossy Links Using ECN-Capable Capable RED Gateways Haowei Bai Honeywell Aerospace Mohammed Atiquzzaman School of Computer Science University of Oklahoma 1 Outline Introduction
More informationERROR AND FLOW CONTROL. Lecture: 10 Instructor Mazhar Hussain
ERROR AND FLOW CONTROL Lecture: 10 Instructor Mazhar Hussain 1 FLOW CONTROL Flow control coordinates the amount of data that can be sent before receiving acknowledgement It is one of the most important
More informationDRAFT - QoS Sensitive Roaming Principles 1.0 August 2004
Official Document IR.68 DRAFT - QoS Sensitive Roaming Principles 1.0 August 2004 This is a binding permanent reference document of the GSM Association. Security Classification Category (See next page):
More informationTCP CONGESTION CONTROL PROTOCOLS OVER UMTS WCDMA NETWORK
International Journal of Computer Science Engineering and Information Technology Research (IJCSEITR) ISSN(P): 2249-6831; ISSN(E): 2249-7943 Vol. 4, Issue 5, Oct 2014, 83-90 TJPRC Pvt. Ltd. TCP CONGESTION
More informationADVANCED COMPUTER NETWORKS
ADVANCED COMPUTER NETWORKS Congestion Control and Avoidance 1 Lecture-6 Instructor : Mazhar Hussain CONGESTION CONTROL When one part of the subnet (e.g. one or more routers in an area) becomes overloaded,
More informationAnalysis and Heuristics for the Characterization of Selective Repeat ARQ Delay Statistics Over Wireless Channels
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 52, NO. 5, SEPTEMBER 2003 1365 Analysis and Heuristics for the Characterization of Selective Repeat ARQ Delay Statistics Over Wireless Channels Michele Rossi,
More informationETSF05/ETSF10 Internet Protocols Transport Layer Protocols
ETSF05/ETSF10 Internet Protocols Transport Layer Protocols 2016 Jens Andersson Transport Layer Communication between applications Process-to-process delivery Client/server concept Local host Normally initialiser
More informationPrinciples of Reliable Data Transfer
Principles of Reliable Data Transfer 1 Reliable Delivery Making sure that the packets sent by the sender are correctly and reliably received by the receiver amid network errors, i.e., corrupted/lost packets
More informationUnderstanding the Available Bit Rate (ABR) Service Category for ATM VCs
Understanding the Available Bit Rate (ABR) Service Category for ATM VCs Document ID: 10415 Contents Introduction Prerequisites Requirements Components Used Conventions What is ABR? Resource Management
More informationConsidering Spurious Timeout in Proxy for Improving TCP Performance in Wireless Networks
Considering Spurious Timeout in Proxy for Improving TCP Performance in Wireless Networks YuChul Kim Telecommunication R&D Center, Samsung Electronics,Co., Ltd yuchul.kim@samsung.com DongHo Cho Communication
More informationTransport Protocols. ISO Defined Types of Network Service: rate and acceptable rate of signaled failures.
Transport Protocols! Type A: ISO Defined Types of Network Service: Network connection with acceptable residual error rate and acceptable rate of signaled failures. - Reliable, sequencing network service
More informationChapter 2 - Part 1. The TCP/IP Protocol: The Language of the Internet
Chapter 2 - Part 1 The TCP/IP Protocol: The Language of the Internet Protocols A protocol is a language or set of rules that two or more computers use to communicate 2 Protocol Analogy: Phone Call Parties
More informationLTE Radio Interface Architecture
3G Evolution Chapte r: 15 LTE Radio Interface Architecture Department of Electrical and Information Technology Johan Löfgren 2009-03-19 3G Evolution - HSPA and LTE for Mobile Broadband 1 Outline Architecture
More informationARQ and HARQ inter-working for IEEE m system
ARQ and HARQ inter-working for IEEE 802.16m system Document Number: IEEE C802.16m-08/1053r1 Date Submitted: 2008-09-17 Source: Xiangying Yang (xiangying.yang@intel.com) Yuan Zhu Muthaiah Venkatachalam
More informationReceiver-Based Flow Control Mechanism with Interlayer Collaboration for Real-Time Communication Quality in W-CDMA Networks
Receiver-Based Flow Control Mechanism with Interlayer Collaboration for Real-Time Communication Quality in W-CDMA Networks Hiroyuki Koga 1, Katsuyoshi Iida 1, and Yuji Oie 2 1 Graduate School of Information
More informationH3C S9500 QoS Technology White Paper
H3C Key words: QoS, quality of service Abstract: The Ethernet technology is widely applied currently. At present, Ethernet is the leading technology in various independent local area networks (LANs), and
More informationS Capacity enhancement methods for radio interface ARQ Schemes
ARQ Schemes, March 26 2004 1 S-72.630 Capacity enhancement methods for radio interface ARQ Schemes Markku Liinaharja March 25, 2004 ARQ Schemes, March 26 2004 2 Outline Classification of error control
More informationFACULTY OF COMPUTING AND INFORMATICS
namibia UniVERSITY OF SCIEnCE AnD TECHnOLOGY FACULTY OF COMPUTING AND INFORMATICS DEPARTMENT OF COMPUTER SCIENCE QUALIFICATION: Bachelor of Computer Science {Honours) QUALIFICATION CODE: 08BCSH LEVEL:
More informationLecture 7: Flow Control"
Lecture 7: Flow Control" CSE 123: Computer Networks Alex C. Snoeren No class Monday! Lecture 7 Overview" Flow control Go-back-N Sliding window 2 Stop-and-Wait Performance" Lousy performance if xmit 1 pkt
More informationTransport Protocols Reading: Sections 2.5, 5.1, and 5.2
Transport Protocols Reading: Sections 2.5, 5.1, and 5.2 CE443 - Fall 1390 Acknowledgments: Lecture slides are from Computer networks course thought by Jennifer Rexford at Princeton University. When slides
More informationEnhanced Packet Scheduling Algorithm Providing QoS in High Speed Downlink Packet Access
Enhanced Packet Scheduling Algorithm Providing QoS in High Speed Downlink Packet Access Ohyun Jo, Jong-Wuk Son, Soo-Yong Jeon Dong-Ho Cho Department of Electrical Engineering and Computer Science Korea
More informationChapter 24. Transport-Layer Protocols
Chapter 24. Transport-Layer Protocols 23.1 Introduction 23.2 User Datagram Protocol 23.3 Transmission Control Protocol 23.4 SCTP Computer Networks 24-1 Position of Transport-Layer Protocols UDP is an unreliable
More informationSimulation of 3G DCHs Supporting TCP Traffic: Design, Experiments and Insights on Parameter Tuning
Simulation of 3G DCHs Supporting TCP Traffic: Design, Experiments and Insights on Parameter Tuning Juan J. Alcaraz, Gaspar Pedreño, Fernando Cerdán and Joan García-Haro Department of Information Technologies
More informationError Control System for Parallel Multichannel Using Selective Repeat ARQ
Error Control System for Parallel Multichannel Using Selective Repeat ARQ M.Amal Rajan 1, M.Maria Alex 2 1 Assistant Prof in CSE-Dept, Jayamatha Engineering College, Aralvaimozhi, India, 2 Assistant Prof
More informationKey Performance Aspects of an LTE FDD based Smart Grid Communications Network
Key Performance Aspects of an LTE FDD based Smart Grid Communications Network Presented by: Ran Zhang Supervisors: Prof. Sherman(Xuemin) Shen, Prof. Liang-liang Xie Main Reference Jason Brown, and Jamil
More informationCC-SCTP: Chunk Checksum of SCTP for Enhancement of Throughput in Wireless Network Environments
CC-SCTP: Chunk Checksum of SCTP for Enhancement of Throughput in Wireless Network Environments Stream Control Transmission Protocol (SCTP) uses the 32-bit checksum in the common header, by which a corrupted
More informationChapter III. congestion situation in Highspeed Networks
Chapter III Proposed model for improving the congestion situation in Highspeed Networks TCP has been the most used transport protocol for the Internet for over two decades. The scale of the Internet and
More informationTransport layer issues
Transport layer issues Dmitrij Lagutin, dlagutin@cc.hut.fi T-79.5401 Special Course in Mobility Management: Ad hoc networks, 28.3.2007 Contents Issues in designing a transport layer protocol for ad hoc
More informationDepartment of Computer and IT Engineering University of Kurdistan. Data Communication Netwotks (Graduate level) Data Link Layer
Department of Computer and IT Engineering University of Kurdistan Data Communication Netwotks (Graduate level) Data Link Layer By: Dr. Alireza Abdollahpouri Data Link Layer 2 Data Link Layer Application
More informationTCP START-UP BEHAVIOR UNDER THE PROPORTIONAL FAIR SCHEDULING POLICY
TCP START-UP BEHAVIOR UNDER THE PROPORTIONAL FAIR SCHEDULING POLICY J. H. CHOI,J.G.CHOI, AND C. YOO Department of Computer Science and Engineering Korea University Seoul, Korea E-mail: {jhchoi, hxy}@os.korea.ac.kr
More informationTSG-RAN Working Group 2 (Radio layer 2 and Radio layer 3) TSGR2#2(99)085 Stockholm 8th to 11th March 1999
TSG-RAN Working Group 2 (Radio layer 2 and Radio layer 3) TSGR2#2(99)085 Stockholm 8th to 11th March 1999 Agenda Item: 8.3.2 Source: Title: Document for: Siemens AG ARQ error control techniques Decision
More informationLecture 7: Sliding Windows. CSE 123: Computer Networks Geoff Voelker (guest lecture)
Lecture 7: Sliding Windows CSE 123: Computer Networks Geoff Voelker (guest lecture) Please turn in HW #1 Thank you From last class: Sequence Numbers Sender Receiver Sender Receiver Timeout Timeout Timeout
More informationENRICHMENT OF SACK TCP PERFORMANCE BY DELAYING FAST RECOVERY Mr. R. D. Mehta 1, Dr. C. H. Vithalani 2, Dr. N. N. Jani 3
Research Article ENRICHMENT OF SACK TCP PERFORMANCE BY DELAYING FAST RECOVERY Mr. R. D. Mehta 1, Dr. C. H. Vithalani 2, Dr. N. N. Jani 3 Address for Correspondence 1 Asst. Professor, Department of Electronics
More informationCIS 632 / EEC 687 Mobile Computing
CIS 632 / EEC 687 Mobile Computing TCP in Mobile Networks Prof. Chansu Yu Contents Physical layer issues Communication frequency Signal propagation Modulation and Demodulation Channel access issues Multiple
More information"Filling up an old bath with holes in it, indeed. Who would be such a fool?" "A sum it is, girl," my father said. "A sum. A problem for the mind.
We were doing very well, up to the kind of sum when a bath is filling at the rate of so many gallons and two holes are letting the water out, and please to say how long it will take to fill the bath, when
More informationCS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP
CS 5520/ECE 5590NA: Network Architecture I Spring 2008 Lecture 13: UDP and TCP Most recent lectures discussed mechanisms to make better use of the IP address space, Internet control messages, and layering
More informationLABORATORY 3 INTERNETWORKING: FLOW CONTROL ALGORITHMS AND TCP/IP
94462 COMPUTER COMMUNICATIONS LABORATORY 3 INTERNETWORKING: FLOW CONTROL ALGORITHMS AND TCP/IP SEPTEMBER 1998 COPYRIGHT BY MATTHIAS FALKNER 1998 (All rights reserved: No part of this publication may be
More informationOutline. Basic ARQ schemes. S Capacity enhancement methods for radio interface ARQ Schemes. Classification of error control strategies
ARQ Schemes, March 26 24 ARQ Schemes, March 26 24 2 Outline Classification of error control strategies S-7263 Capacity enhancement methods for radio interface ARQ Schemes Markku Liinaharja March 25, 24
More informationHSDPA Protocols & Resource Allocation: Contents
HSDPA Protocols & Resource Allocation: Contents HSDPA Transport Channel: HSDPA Protocol Architecture tasks/hsdpa Resource Allocation: Fast Packet Scheduling Fast Link Adaptation Fast H-ARQ () controls
More informationResource Sharing for QoS in Agile All Photonic Networks
Resource Sharing for QoS in Agile All Photonic Networks Anton Vinokurov, Xiao Liu, Lorne G Mason Department of Electrical and Computer Engineering, McGill University, Montreal, Canada, H3A 2A7 E-mail:
More informationCS457 Transport Protocols. CS 457 Fall 2014
CS457 Transport Protocols CS 457 Fall 2014 Topics Principles underlying transport-layer services Demultiplexing Detecting corruption Reliable delivery Flow control Transport-layer protocols User Datagram
More informationETSI TS V ( )
TS 138 322 V15.3.0 (2018-09) TECHNICAL SPECIFICATION 5G; NR; Radio Link Control (RLC) protocol specification (3GPP TS 38.322 version 15.3.0 Release 15) 1 TS 138 322 V15.3.0 (2018-09) Reference RTS/TSGR-0238322vf30
More informationQPPS : Qos Provision Packet Scheduling Algorithm in High Speed. Downlink Packet Access
QPPS : Qos Provision Packet Scheduling Algorithm in High Speed Downlink Packet Access YING-HONG WANG, KUO-FENG HUANG Depart of Computer Science and Information Engineering Tamkang University 151 Ying-chuan
More informationCongestion / Flow Control in TCP
Congestion and Flow Control in 1 Flow Control and Congestion Control Flow control Sender avoids overflow of receiver buffer Congestion control All senders avoid overflow of intermediate network buffers
More informationRequest for Comments: 1007 June 1987
Network Working Group Wayne McCoy Request for Comments: 1007 June 1987 MILITARY SUPPLEMENT TO THE ISO TRANSPORT PROTOCOL Status of this Memo This RFC is being distributed to members of the Internet community
More information