Random Early Drop with In & Out (RIO) for Asymmetrical Geostationary Satellite Links

Size: px
Start display at page:

Download "Random Early Drop with In & Out (RIO) for Asymmetrical Geostationary Satellite Links"

Transcription

1 Proc. Joint Int l Conf. IEEE MICC 001, LiSLO 001, ISCE 001, Kuala Lumpur, Malaysia Oct 1-4, 001 Random Early Drop with In & Out (RIO) for Asymmetrical Geostationary Satellite Links Tat Chee Wan, Member, IEEE ComSoc, and Swee Keong Joo Abstract A model of the TCP/IP stack over Asymmetrical Geostationary Satellite links has been developed to evaluate support of prioritized and non-prioritized TCP traffic over the satellite link. Traffic Prioritization is needed to provide end-toend support for Differentiated Services (DiffServ) in a hybrid terrestrial and satellite-based network. Various parameters, such as router buffer size, TCP window size, and performance of Random Early Drop with In & Out (RIO) over the satellite link is examined. Index terms RIO, Satellite Communications, TCP/IP Throughput Enhancement, TCP Traffic Prioritization, Network Simulation. I. INTRODUCTION Geostationary Satellites have been extensively used for wide area communication links for voice, television and high bandwidth data transmission [1]. Nonetheless, the large propagation delays of such links (in the order of 500 ms) adversely affect the performance of windowed flow control protocols such as TCP/IP [],[3],[7]. In addition, the use of asymmetrical bandwidths (Figure 1) in the forward and reverse links places additional constrain on the achievable throughput, especially if Acknowledgement (ACK) packets have to compete with other traffic over the limited reverse link bandwidth. Forward Link techniques such as Reed-Solomon and Turbo Coding [8] has been recommended to enable satellite links to approach the BER performance of copper-based terrestrial links at the expense of higher processing delays [5]. Several approaches have been proposed to address some of the issues inherent in satellite links with large Bandwidth- Delay Products (BDP) []-[7]. ACK-spoofing [5] is less desirable as it affects the TCP end-to-end semantics. This paper focuses on approaches that do not affect the end-toend semantics of TCP. These backward-compatible schemes generally involve modifications to the TCP Congestion Window Slow Start Threshold (ssthresh) size, maximum packet sizes (Path MTU discovery), and large router buffer provisioning (to cater for large BDP) [5]. II. RIO FOR SATELLITE LINKS Quality of Service provisioning using DiffServ is being promoted as the approach for traffic prioritization over the Internet [9]. DiffServ partitions service classes into Premium, Assured and Best Effort services. While the rigid QoS requirements of Premium service may preclude its adoption over satellite links, Assured and Best Effort service classes are supported using statistical flow shaping algorithms such as Random Early Drop (RED), and RED with In and Out (RIO) [9]. The RIO mechanism is enforced at the routers connecting both ends of the satellite link. In this paper, we will investigate the effect of RIO on the satellite link, given different values for forward link bandwidth, packet (MTU) size, and ssthresh sizes [10]. Sender Reverse Link 1 P (drop) Tail Dropping Region Receiver Max Dropping Probability Graduated Dropping Region for Non-Prioritized (Out) traffic Graduated Dropping Region for Prioritized (In) traffic Figure 1: Asymmetrical Forward and Reverse Satellite Links Satellite links are also prone to high Bit Error Rates (BER). Link-level retransmission, while able to address the BER issue, introduces additional delays that may interfere with the flow control function of TCP [5],[6]. More recently, the use of sophisticated Forward Error Control (FEC) Tat Chee Wan (tcwan@cs.usm.my) is with the Network Research Group, School of Computer Sciences, University of Science Malaysia, Minden, Penang, Malaysia. Swee Keong Joo (skjoo@visto.com) was a Research Officer with the Network Research Group, and is currently with Motorola Multimedia (M) Sdn. Bhd. in Kuala Lumpur, Malaysia. min th max th total th Figure : RIO Dropping Mechanism for two traffic classes Avg queue size RIO performs graduated random packet dropping based on the router queue size (Figure ). The dropping probability for Non-prioritized (Out) traffic is bounded by queue size thresholds min th and max th, where the probability increases from 0 to the Max. Dropping Probability. Beyond max th, all Out packets are dropped. Prioritized (In) traffic experiences 1

2 Proc. Joint Int l Conf. IEEE MICC 001, LiSLO 001, ISCE 001, Kuala Lumpur, Malaysia Oct 1-4, 001 graduated packet drops from max th till total th (max. queue size). Beyond total th tail dropping occurs, where all packets (In and Out) will be dropped due to buffer overflow. III. TCP THROUGHPUT OVER SATELLITE LINKS A simulation model was developed in PARSEC [11] to simulate TCP performance over a single hop satellite link. The model implements link-level FEC support to provide reliable transmission even for link BER of up to The model implements Congestion Window growth until the Slow Start Threshold (ssthresh) is reached. Incremental window growth beyond ssthresh is not modeled, since it does not contribute significantly to throughput for larger window sizes. Round Trip Time (RTT) Forward Link Bandwidth ( ) 51 Kbps Reverse Link Bandwidth 1.5 Mbps 1380 bytes (MTU=1500) Router Queue Size (R s) ( =1,, 3.5, 4) 18, 36, 6, 71 Kbytes Slow Start Threshold (ssthresh) 16, 3, 64, 96, 18 Kbytes Mbytes IPERF Link Raw BER 10-3 IPERF Satellite Link FEC Reed Solomon /3 Coding IPERF Effective BER < 10-7 IPERF Router Queue Size (R s) 16 Kbytes IPERF Slow Start Threshold (ssthresh) 16, 3, 64, 96, 18 Kbytes Table : for Satellite Link Validation Test TCP Throughput Validation for 51 Kbps Link 470 The analytical network model in Figure 3 was adopted to compare the impact of different ssthresh on TCP throughput over the satellite link [5]. Source Buffer (B=Rs) Forward Link Bandwidth ( ) RTT (T) Destination IPERF Figure 3: TCP Analytical Network Model A suitable value for ssthresh to achieve fast convergence of the TCP windowing function is given as: [5] B T ssthresh (1) where: B=Buffer (Router Queue) Size = R s, = Forward Link Bandwidth, and T = Round Trip Time (RTT). R s is calculated based on the maximum number of packets in flight (saturated link capacity T/): T R s () where: = scaling factor. The parameters used for simulation are given in Table 1. Round Trip Time (T) Forward Link Bandwidth ( ) Reverse Link Bandwidth Router Queue Size (R s) Slow Start Threshold (ssthresh) 51, 104, 048 Kbps 51 Kbps Variable Variable Variable Mbytes Table 1: General Simulation for Satellite Link Model A. Model Validation The output for the simulation model was compared against the measured throughput over a single hop asymmetric satellite link using IPERF ( Since the routers used were configured with default TCP parameters (ssthresh, buffer size), reliable measured results could only be obtained for forward link bandwidth of 51 Kbps. 370 Figure 4: Validation of TCP Throughput over 51 Kbps Satellite Link using MTU=1500 bytes As shown in Figure 4, the simulation model represents the idealized upper bound for TCP throughput over the satellite link. It is comparable to the performance of the IPERF results for ssthresh of 64 Kbytes and above. Analytical values for R s and ssthresh are: R 51Kbps 570ms s Kbytes (3) ssthresh for = Kbytes 51Kbps /8 570ms 6.7 Kbytes (4) Simulated TCP Throughput for 51 Kbps Link (expanded)! #"%$ &!' Figure 5: Simulated TCP Throughput over 51 Kbps Satellite Link using MTU=1500 bytes (expanded)

3 ( + Proc. Joint Int l Conf. IEEE MICC 001, LiSLO 001, ISCE 001, Kuala Lumpur, Malaysia Oct 1-4, 001 Figure 5 (expanded view of Figure 4), shows the impact of on TCP throughput while throughput increases as ( is varied from 1 to 4, it shows only marginal increase from ( = 3.5 to ( = 4. Consequently, ( = 3.5 was used for subsequent simulations to simplify calculation of R s. for a given Forward Link Bandwidth. The peak link efficiency occurs when ssthresh = (B+1 T)/. From Figure 6, maximum link combined throughput (streams a & b) using 048-byte packet size for 51 Kbps Link is approximately 480 Kbps. Therefore link efficiency is approximately 93.8%. 570ms s * 3.5 ), * ) R (5) for - = 3.5, T =. 500 TCP Throughput for Normal TCP streams over 51 Kbps Link Figure 4 also shows that the IPERF throughput does not increase significantly when a window size greater than 64 Kbytes is used for the 51 kbps forward link. It should be noted that the model does not handle the case of small window sizes (16 & 3 Kbytes) well, as it does not account for other factors such as coding delays (introduced by Reed Solomon FEC) and processing delays due to the number of context switches for small window sizes. However, since we are interested primarily in large window sizes to effectively utilize the large link BDP, this limitation would not be critical to the simulation results that are of interest (B+/ T)/ 51 (a) 51 (b) 51 (a+b) 104 (a) 104 (b) 104 (a+b) 048 (a) 048 (b) 048 (a+b) B. Impact of Router Queue Size (R s ) on TCP Throughput From single TCP stream simulations performed using different values of router queue size, with a minimum size of R s (. = 3.5), to a maximum of 86 Kbytes, it was determined that there was no significant impact on TCP throughput induced by router queue sizes beyond R s (. = 3.5). Consequently, router queue sizes for subsequent simulations were specified based on R s (. = 3.5). C. Flow Control Window and s Round Trip Time (T) Forward Link Bandwidth (/ ) Reverse Link Bandwidth Router Queue Size (R s) (0 = 3.5) Slow Start Threshold (ssthresh) 51, 104, 048 Kbps 51 Kbps 51, 104, 048 bytes R s Kbytes 16, 3, 64, 18, (B+/ T)/ Kbytes Mbytes Table 3: for two competing Normal (Non-Prioritized) streams scenario R s (. = 3.5) was used for all simulations. Different values for ssthresh and packet size were used to determine their effect on throughput experienced by two competing normal (nonprioritized) TCP streams. We also considered the case of ssthresh = (B+1 T)/. This is summarized in Table 4. Forward Link Bandwidth R s ( = 3.5) ssthresh = (B+33 T)/ 51 Kbps 6 Kbytes 50 Kbytes 104 Kbps 15 Kbytes 100 Kbytes 048 Kbps 49 Kbytes 00 Kbytes Table 4: R s and ssthresh for given Forward Link Bandwidths As can be seen from the following graphs, the throughput of each competing non-prioritized stream is more or less equal. As larger packet sizes are used, the percentage of wasted bandwidth decreases, resulting in improved efficiency. For the 048-byte packet size with a 10-byte header, the maximum combined link efficiency (combined throughput of streams a & b) of approximately 94% can be attributed directly to the header overhead. Consequently, header compression could be utilized to improve the link efficiency 00 Figure 6: TCP Throughput for two Normal (Non-Prioritized) streams (a) & (b), for various values of Packet (MTU) size and Congestion Window (ssthresh) size over 51 Kbps link From Figure 7, maximum link combined throughput (streams a & b) using 048-byte packet size for the 104 Kbps Link is approximately 965 Kbps. Therefore link efficiency is approximately 94.% TCP Throughput for Normal TCP streams over 104 Kbps Link 51 (a) 51 (b) 51 (a+b) 104 (a) 104 (b) 104 (a+b) 048 (a) 048 (b) 048 (a+b) (B+/ T)/ Figure 7: TCP Throughput for two Normal (Non-Prioritized) streams (a) & (b), for various values of Packet (MTU) size and Congestion Window (ssthresh) size over 104 Kbps link. From Figure 8, maximum link combined throughput (streams a & b) using 048-byte packet size for the 048 Kbps Link is approximately 1940 Kbps. Therefore link efficiency is approximately 94.7%. 3

4 Proc. Joint Int l Conf. IEEE MICC 001, LiSLO 001, ISCE 001, Kuala Lumpur, Malaysia Oct 1-4, Throughput for Normal TCP streams over 048 Kbps Link Throughput for Prioritized and Non-Prioritized TCP streams over 51 Kbps Link (a) 51 (b) 51 (a+b) 104 (a) 104 (b) 104 (a+b) 048 (a) 048 (b) 048 (a+b) (B+4 T)/ /0.7 (P) 0.3/0.7 (NP) 0.3/0.7 (P+NP) 0./0.8 (P) 0./0.8 (NP) 0./0.8 (P+NP) 0.1/0.9 (P) 0.1/0.9 (NP) 0.1/0.9 (P+NP) Normal (a) Normal (b) Normal (a+b) (B+5 T)/ Q-point Figure 8: TCP Throughput for two Normal (Non-Prioritized) streams (a) & (b), for various values of Packet (MTU) size and Congestion Window (ssthresh) size over 048 Kbps link. IV. IMPACT OF RIO ON TCP THROUGHPUT Round Trip Time (T) Forward Link Bandwidth (5 ) 51, 104, 048 Kbps Reverse Link Bandwidth 51 Kbps 104 bytes (MTU = 1144 bytes) Router Queue Size (R s) (6 =3.5) R s Kbytes Slow Start Threshold (ssthresh) 16, 3, 64, 96, 18, (B+5 T)/ Kbytes Mbytes Max Drop Probability 0.7 {min th, max th} (fraction of R s) {0.3, 0.7}, {0., 0.8}, {0.1, 0.9} Table 5: for competing Prioritized (P) and Non-Prioritized (NP) streams scenario The simulations were performed using R s (7 = 3.5), and packet size of 104 bytes. Various ssthresh values were used, in conjunction with different dropping thresholds {min th, max th } specified as a fraction of R s. Queue Size Fractions R s (88 =3.5) KB 19 KB 43 KB 1 KB 50 KB 6 KB 56 KB 15 KB 38 KB 88 KB 5 KB 100 KB 13 KB 113 KB 49 KB 7 KB 168 KB 48 KB 19 KB 4 KB 16 KB Table 6: Dropping Thresholds for different Router Queue Size (R s) As seen from the following figures (Figure 9 - Figure 11), when RIO is utilized to perform stream prioritization, peak link efficiency no longer occurs when ssthresh = (B+9 T)/. The prioritized stream (P) achieves maximum stream throughput (P throughput ) for the most aggressive RIO setting {0.1, 0.9} when ssthresh is close to (B+9 T)/. However, max. P throughput is not directly related on this value of ssthresh; the optimum ssthresh to achieve max. P throughput depends on the RIO setting. For less aggressive RIO settings, peak P throughput is achieved at a window size beyond (B+9 T)/. Furthermore, Non Prioritized (NP) stream throughputs (NP throughput ) decreases for large ssthresh values. 90 Figure 9: TCP Throughput for Prioritized (P) and Non-Prioritized (NP) streams, for various RIO Dropping Thresholds and Congestion Window (ssthresh) size over 51 Kbps link Throughput for Prioritized and Non-Prioritized TCP streams over 104 Kbps Link 0.3/0.7 (P) 0.3/0.7 (NP) 0.3/0.7 (P+NP) 0./0.8 (P) 0./0.8 (NP) 0./0.8 (P+NP) 0.1/0.9 (P) 0.1/0.9 (NP) 0.1/0.9 (P+NP) Normal (a) Normal (b) Normal (a+b) (B+5 T)/ Q-point Figure 10: TCP Throughput for Prioritized (P) and Non-Prioritized (NP) streams, for various RIO Dropping Thresholds and Congestion Window (ssthresh) size over 104 Kbps link. 4

5 Proc. Joint Int l Conf. IEEE MICC 001, LiSLO 001, ISCE 001, Kuala Lumpur, Malaysia Oct 1-4, Throughput for Prioritized and Non-Prioritized TCP streams over 048 Kbps Link 0.3/0.7 (P) 0.3/0.7 (NP) 0.3/0.7 (P+NP) 0./0.8 (P) 0./0.8 (NP) 0./0.8 (P+NP) 0.1/0.9 (P) 0.1/0.9 (NP) 0.1/0.9 (P+NP) Normal (a) Normal (b) Normal (a+b) (B+: T)/ Q-point therefore not advisable to use ssthresh values beyond the Q- point since that impacts both P throughput and link efficiency. ssthresh = (B+<< T)/ Forward Link Bandwidth (MTU=1144 bytes) % Difference 51 Kbps 104 Kbps 048 Kbps (P-NP)/NP {0.3, 0.7} 49% 58% 57% (P-NP)/NP {0., 0.8} 73% 88% 88% (P-NP)/NP {0.1, 0.9} 108% 133% 147% (P-a)/a {0.3, 0.7} 15% 14% 16% (P-a)/a {0., 0.8} 18% 16% 17% (P-a)/a {0.1, 0.9} 0% 0% 17% Table 8: Percentage Difference in TCP Throughput between Prioritized (P) and Non-Prioritized (NP)/ Normal (a) Streams The more aggressive RIO schemes achieve higher P throughput at the expense of link efficiency (P+NP throughput ). From Table 8, we observe that there is a 50% difference between P throughput and NP throughput for RIO {0.3, 0.7} when ssthresh = (B+; T)/ for the various forward link bandwidths. This increases to between 100% and 150% for RIO {0.1, 0.9} for the various forward link bandwidths. P throughput achieves a premium of at least 15% over Normal (non-prioritized) TCP streams Figure 11: TCP Throughput for Prioritized (P) and Non-Prioritized (NP) streams, for various RIO Dropping Thresholds and Congestion Window (ssthresh) size over 048 Kbps link. In Figure 10, there is an increase in the NP throughput for RIO {0.1, 0.9} when ssthresh = (B+; T)/. This suggests that there are additional non-linear interactions between RIO and ssthresh when ssthresh approaches (B+; T)/. For the 048 Kbps link simulation (Figure 11), packet drops take effect only after the 16 Kbyte window size, resulting in identical throughputs for the RIO and normal streams for ssthresh = 16 Kbytes. There is an inflexion point (Q-point) for P throughput where the various RIO settings intersect. Beyond the Q-point, P throughput for less aggressive RIO schemes ({0.3, 0.7}, {0., 0.8}) exceed the P throughput of the more aggressive schemes. Link ssthresh = (B+<< T)/ Forward Link Bandwidth (MTU=1144 bytes) % Utiliziation 51 Kbps 104 Kbps 048 Kbps (P+NP)/: {0.3, 0.7} 85.9% 83.9% 84.3% (P+NP)/: {0., 0.8} 8.8% 80.6% 79.% (P+NP)/: {0.1, 0.9} 79.% 77.1% 7.5% (a+b)/: {Normal} 89.0% 89.4% 88.% Table 7: Percentage Utilization for link efficiency due to TCP Throughput of Prioritized (P) and Non-Prioritized (NP) Streams From Table 7, it could be seen that the link efficiency (P+NP throughput combined throughput of P+NP) for RIO prioritized streams (P+NP) drops by at least 3% for RIO {0.3, 0.7}, to over 10% for RIO {0.1, 0.9} compared with the normal (non-prioritized) case. In addition, link efficiency drops dramatically when ssthresh exceeds the Q-point. It is V. CONCLUSION From the simulations, it can be shown that with the use of sophisticated FEC algorithms such as Reed Solomon or Turbo Coding, the link efficiency is greatly improved when the header overhead is reduced. This means that larger packet sizes, or equivalently header compression, would result in better throughput. This is consistent with other reported results [5]. However, this has to be balanced with the ability of existing routers to support large MTU sizes. When normal TCP streams are used, peak link efficiency is achieved when ssthresh = (B+; T)/. Again, this is consistent with other reported results. However, this is no longer true when RIO is utilized to provide prioritized TCP streams. Link efficiency is sacrificed in order to achieve prioritization; increasing ssthresh values result in lower link efficiencies. for ssthresh should not exceed the Q- point, as it would result in lowered link efficiency as well as prioritized stream throughput. If the routers were operated using small ssthresh sizes (ssthresh < (B+; T)/), more aggressive RIO settings (e.g., {0.1, 0.9} should be adopted to achieve higher prioritized stream throughput (P throughput ). However, as ssthresh approaches the Q-point, ((B+; T)/ < ssthresh < Q-point), the use of less aggressive RIO settings (e.g., {0.3, 0.7}) results in higher link efficiency without adversely affecting P throughput. The choice of RIO settings is therefore a compromise between maximizing link efficiency and providing higher P throughput. VI. ACKNOWLEDGEMENTS This work is partially funded through IRPA Grants from the Malaysian government. It is done in collaboration with the Asian Internet Interconnection Initiative (AI3) project. 5

6 Proc. Joint Int l Conf. IEEE MICC 001, LiSLO 001, ISCE 001, Kuala Lumpur, Malaysia Oct 1-4, 001 VII. REFERENCES [1] G. Maral, M. Bosquet, Satellite Communications Systems: Systems, Techniques and Technology, 3 rd Ed., J. Wiley & Sons, 1998 [] M. Allman, D. Glover, L. Sanchez, Enhancing TCP Over Satellite Channels using Standard Mechanisms, RFC 488, IETF, January 1999, [3] J. Touch, S. Ostermann, D. Glover, et. al. Ongoing TCP Research Related to Satellites, RFC 760, IETF, February 000, [4] N. Ghani, S. Dixit, TCP/IP Enhancements for Satellite Networks, IEEE Communications Magazine, Vol. 37, No. 7, July 1999 [5] C. Barakat, E. Altman, W. Dabbous, On TCP Performance in a Heterogeneous Network: A Survey, IEEE Communications Magazine, Vol. 38, No. 1, January 000. [6] R. Durst, G. Miller, and E. Travis, TCP Extensions for Space Communications, Proc. ACM MobiCom, November 1996, [7] W. Stevens TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms, RFC 001, IETF, January 1997, [8] B. Sklar, A Primer on Turbo Code Concepts, IEEE Communications Magazine, Vol. 35 No. 1, Sept. 1997, pp [9] X. Xiao, L. M. Ni, Internet QoS: the Big Picture, IEEE Network Magazine, Vol. 13, March [10] S. K. Joo, T. C. Wan, Incorporation of QoS and Mitigated TCP/IP over Satellite Links, Proc. 1 st Asian International Mobile Computing Conference (AMOC 000), Nov. 000, Penang, Malaysia. [11] R. Bagrodia, R. Meyer, et. al., PARSEC: A Parallel Simulation Environment for Complex Systems, IEEE Computer, Vol. 31, No. 10, Oct

Performance of Multicast Traffic Coordinator Framework for Bandwidth Management of Real-Time Multimedia over Intranets

Performance of Multicast Traffic Coordinator Framework for Bandwidth Management of Real-Time Multimedia over Intranets Performance of Coordinator Framework for Bandwidth Management of Real-Time Multimedia over Intranets Chin Hooi Tang, and Tat Chee Wan, Member, IEEE ComSoc. Abstract Quality of Service (QoS) schemes such

More information

On ACK Filtering on a Slow Reverse Channel

On ACK Filtering on a Slow Reverse Channel On ACK Filtering on a Slow Reverse Channel Chadi Barakat and Eitan Altman INRIA, 2004 route des Lucioles, 06902 Sophia Antipolis, France {cbarakat,altman}@sophia.inria.fr Abstract ACK filtering has been

More information

Enhancing TCP Throughput over Lossy Links Using ECN-Capable Capable RED Gateways

Enhancing 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 information

Enhancing TCP Throughput over Lossy Links Using ECN-capable RED Gateways

Enhancing TCP Throughput over Lossy Links Using ECN-capable RED Gateways Enhancing TCP Throughput over Lossy Links Using ECN-capable RED Gateways Haowei Bai AES Technology Centers of Excellence Honeywell Aerospace 3660 Technology Drive, Minneapolis, MN 5548 E-mail: haowei.bai@honeywell.com

More information

CS519: Computer Networks. Lecture 5, Part 4: Mar 29, 2004 Transport: TCP congestion control

CS519: Computer Networks. Lecture 5, Part 4: Mar 29, 2004 Transport: TCP congestion control : Computer Networks Lecture 5, Part 4: Mar 29, 2004 Transport: TCP congestion control TCP performance We ve seen how TCP the protocol works Sequencing, receive window, connection setup and teardown And

More information

Quality of Service (QoS) Whitepaper

Quality of Service (QoS) Whitepaper Quality of Service (QoS) Whitepaper PCS-Series Videoconferencing White Paper www.sonybiz.net/vc Introduction Currently, an estimated 5% of data packets sent over the Internet are lost. In a videoconferencing

More information

c) With the selective repeat protocol, it is possible for the sender to receive an ACK for a packet that falls outside of its current window.

c) With the selective repeat protocol, it is possible for the sender to receive an ACK for a packet that falls outside of its current window. Part 1 Question 1 [0.5 Marks] Suppose an application generates chunks of 40 bytes of data every 20 msec, and each chunk gets encapsulated by a TCP segment and then an IP datagram. What percentage of each

More information

Transmission Control Protocol. ITS 413 Internet Technologies and Applications

Transmission 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 information

Issues related to TCP performance in heterogeneous networks

Issues related to TCP performance in heterogeneous networks Issues related to TCP performance in heterogeneous networks Chadi BARAKAT INRIA Sophia Antipolis, France PLANETE group EPFL Summer Research Institute July 16, 2002 Heterogeneity of networks The Internet

More information

Exercises TCP/IP Networking With Solutions

Exercises TCP/IP Networking With Solutions Exercises TCP/IP Networking With Solutions Jean-Yves Le Boudec Fall 2009 3 Module 3: Congestion Control Exercise 3.2 1. Assume that a TCP sender, called S, does not implement fast retransmit, but does

More information

Analysis of TCP Latency over Wireless Links Supporting FEC/ARQ-SR for Error Recovery

Analysis of TCP Latency over Wireless Links Supporting FEC/ARQ-SR for Error Recovery Analysis of TCP Latency over Wireless Links Supporting FEC/ARQ-SR for Error Recovery Raja Abdelmoumen CRISTAL Laboratory, Tunisia Email: Raja.Abdelmoumen@ensi.rnu.tn Chadi Barakat Projet Planète, INRIA-Sophia

More information

RED behavior with different packet sizes

RED behavior with different packet sizes RED behavior with different packet sizes Stefaan De Cnodder, Omar Elloumi *, Kenny Pauwels Traffic and Routing Technologies project Alcatel Corporate Research Center, Francis Wellesplein, 1-18 Antwerp,

More information

Managing Caching Performance and Differentiated Services

Managing Caching Performance and Differentiated Services CHAPTER 10 Managing Caching Performance and Differentiated Services This chapter explains how to configure TCP stack parameters for increased performance ant throughput and how to configure Type of Service

More information

100 Mbps. 100 Mbps S1 G1 G2. 5 ms 40 ms. 5 ms

100 Mbps. 100 Mbps S1 G1 G2. 5 ms 40 ms. 5 ms The Influence of the Large Bandwidth-Delay Product on TCP Reno, NewReno, and SACK Haewon Lee Λ, Soo-hyeoung Lee, and Yanghee Choi School of Computer Science and Engineering Seoul National University San

More information

TCP PERFORMANCE FOR FUTURE IP-BASED WIRELESS NETWORKS

TCP PERFORMANCE FOR FUTURE IP-BASED WIRELESS NETWORKS TCP PERFORMANCE FOR FUTURE IP-BASED WIRELESS NETWORKS Deddy Chandra and Richard J. Harris School of Electrical and Computer System Engineering Royal Melbourne Institute of Technology Melbourne, Australia

More information

CS268: Beyond TCP Congestion Control

CS268: Beyond TCP Congestion Control TCP Problems CS68: Beyond TCP Congestion Control Ion Stoica February 9, 004 When TCP congestion control was originally designed in 1988: - Key applications: FTP, E-mail - Maximum link bandwidth: 10Mb/s

More information

Why Your Application only Uses 10Mbps Even the Link is 1Gbps?

Why Your Application only Uses 10Mbps Even the Link is 1Gbps? Why Your Application only Uses 10Mbps Even the Link is 1Gbps? Contents Introduction Background Information Overview of the Issue Bandwidth-Delay Product Verify Solution How to Tell Round Trip Time (RTT)

More information

Network Management & Monitoring

Network Management & Monitoring Network Management & Monitoring Network Delay These materials are licensed under the Creative Commons Attribution-Noncommercial 3.0 Unported license (http://creativecommons.org/licenses/by-nc/3.0/) End-to-end

More information

CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS

CHAPTER 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 information

Buffer Requirements for Zero Loss Flow Control with Explicit Congestion Notification. Chunlei Liu Raj Jain

Buffer Requirements for Zero Loss Flow Control with Explicit Congestion Notification. Chunlei Liu Raj Jain Buffer Requirements for Zero Loss Flow Control with Explicit Congestion Notification Chunlei Liu Raj Jain Department of Computer and Information Science The Ohio State University, Columbus, OH 432-277

More information

EE122 MIDTERM EXAM: Scott Shenker, Ion Stoica

EE122 MIDTERM EXAM: Scott Shenker, Ion Stoica EE MITERM EXM: 00-0- Scott Shenker, Ion Stoica Last name Student I First name Login: ee- Please circle the last two letters of your login. a b c d e f g h i j k l m n o p q r s t u v w x y z a b c d e

More information

Does current Internet Transport work over Wireless? Reviewing the status of IETF work in this area

Does current Internet Transport work over Wireless? Reviewing the status of IETF work in this area Does current Internet Transport work over Wireless? Reviewing the status of IETF work in this area Sally Floyd March 2, 2000 IAB Workshop on Wireless Internetworking 1 Observations: Transport protocols

More information

Effect of RED and different packet sizes on Multimedia performance over wireless networks

Effect of RED and different packet sizes on Multimedia performance over wireless networks Effect of RED and different packet sizes on Multimedia performance over wireless networks T. Vu TU Ilmenau, Germany Abstract. We consider the adaptation of random early detection (RED) as an active queue

More information

Priority Traffic CSCD 433/533. Advanced Networks Spring Lecture 21 Congestion Control and Queuing Strategies

Priority Traffic CSCD 433/533. Advanced Networks Spring Lecture 21 Congestion Control and Queuing Strategies CSCD 433/533 Priority Traffic Advanced Networks Spring 2016 Lecture 21 Congestion Control and Queuing Strategies 1 Topics Congestion Control and Resource Allocation Flows Types of Mechanisms Evaluation

More information

Principles of congestion control

Principles of congestion control Principles of congestion control Congestion: Informally: too many sources sending too much data too fast for network to handle Different from flow control! Manifestations: Lost packets (buffer overflow

More information

SCTP over Satellite Networks

SCTP over Satellite Networks SCTP over Satellite Networks Shaojian Fu Mohammed Atiquzzaman School of Computer Science University of Oklahoma, Norman, OK 73019-6151. William Ivancic Satellite Networks & Architectures Branch NASA Glenn

More information

ATM Quality of Service (QoS)

ATM Quality of Service (QoS) ATM Quality of Service (QoS) Traffic/Service Classes, Call Admission Control Usage Parameter Control, ABR Agenda Introduction Service Classes and Traffic Attributes Traffic Control Flow Control Special

More information

Design Issues in Traffic Management for the ATM UBR+ Service for TCP over Satellite Networks: Report II

Design Issues in Traffic Management for the ATM UBR+ Service for TCP over Satellite Networks: Report II Design Issues in Traffic Management for the ATM UBR+ Service for TCP over Satellite Networks: Report II Columbus, OH 43210 Jain@CIS.Ohio-State.Edu http://www.cis.ohio-state.edu/~jain/ 1 Overview! Statement

More information

ENSC 835 project (2002) TCP performance over satellite links. Kenny, Qing Shao Grace, Hui Zhang

ENSC 835 project (2002) TCP performance over satellite links. Kenny, Qing Shao Grace, Hui Zhang ENSC 835 project (2002) TCP performance over satellite links Kenny, Qing Shao Qshao@cs.sfu.ca Grace, Hui Zhang Hzhange@cs.sfu.ca Road map Introduction to satellite communications Simulation implementation

More information

Advanced Computer Networks

Advanced Computer Networks Advanced Computer Networks QoS in IP networks Prof. Andrzej Duda duda@imag.fr Contents QoS principles Traffic shaping leaky bucket token bucket Scheduling FIFO Fair queueing RED IntServ DiffServ http://duda.imag.fr

More information

ECSE-6600: Internet Protocols Spring 2007, Exam 1 SOLUTIONS

ECSE-6600: Internet Protocols Spring 2007, Exam 1 SOLUTIONS ECSE-6600: Internet Protocols Spring 2007, Exam 1 SOLUTIONS Time: 75 min (strictly enforced) Points: 50 YOUR NAME (1 pt): Be brief, but DO NOT omit necessary detail {Note: Simply copying text directly

More information

IJSRD - International Journal for Scientific Research & Development Vol. 2, Issue 03, 2014 ISSN (online):

IJSRD - International Journal for Scientific Research & Development Vol. 2, Issue 03, 2014 ISSN (online): IJSRD - International Journal for Scientific Research & Development Vol. 2, Issue 03, 2014 ISSN (online): 2321-0613 Performance Evaluation of TCP in the Presence of in Heterogeneous Networks by using Network

More information

TCP Congestion Control

TCP Congestion Control TCP Congestion Control What is Congestion The number of packets transmitted on the network is greater than the capacity of the network Causes router buffers (finite size) to fill up packets start getting

More information

TCP Congestion Control

TCP Congestion Control What is Congestion TCP Congestion Control The number of packets transmitted on the network is greater than the capacity of the network Causes router buffers (finite size) to fill up packets start getting

More information

CS Transport. Outline. Window Flow Control. Window Flow Control

CS Transport. Outline. Window Flow Control. Window Flow Control CS 54 Outline indow Flow Control (Very brief) Review of TCP TCP throughput modeling TCP variants/enhancements Transport Dr. Chan Mun Choon School of Computing, National University of Singapore Oct 6, 005

More information

CS321: Computer Networks Congestion Control in TCP

CS321: 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 information

Congestion Control in Communication Networks

Congestion Control in Communication Networks Congestion Control in Communication Networks Introduction Congestion occurs when number of packets transmitted approaches network capacity Objective of congestion control: keep number of packets below

More information

ETSF10 Internet Protocols Transport Layer Protocols

ETSF10 Internet Protocols Transport Layer Protocols ETSF10 Internet Protocols Transport Layer Protocols 2012, Part 2, Lecture 2.1 Kaan Bür, Jens Andersson Transport Layer Protocols Process-to-process delivery [ed.4 ch.23.1] [ed.5 ch.24.1] Transmission Control

More information

ADVANCED COMPUTER NETWORKS

ADVANCED 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 information

QoS for Real Time Applications over Next Generation Data Networks

QoS for Real Time Applications over Next Generation Data Networks QoS for Real Time Applications over Next Generation Data Networks Final Project Presentation December 8, 2000 http://www.engr.udayton.edu/faculty/matiquzz/pres/qos-final.pdf University of Dayton Mohammed

More information

Congestion Control In The Internet Part 2: How it is implemented in TCP. JY Le Boudec 2014

Congestion Control In The Internet Part 2: How it is implemented in TCP. JY Le Boudec 2014 1 Congestion Control In The Internet Part 2: How it is implemented in TCP JY Le Boudec 2014 Contents 1. Congestion control in TCP 2. The fairness of TCP 3. The loss throughput formula 4. Explicit Congestion

More information

Lecture 21: Congestion Control" CSE 123: Computer Networks Alex C. Snoeren

Lecture 21: Congestion Control CSE 123: Computer Networks Alex C. Snoeren Lecture 21: Congestion Control" CSE 123: Computer Networks Alex C. Snoeren Lecture 21 Overview" How fast should a sending host transmit data? Not to fast, not to slow, just right Should not be faster than

More information

8. TCP Congestion Control

8. TCP Congestion Control 8. TCP Congestion Control 1 TCP Congestion Control Slow-start increase Multiplicative decrease Congestion avoidance Measurement of variation Exponential timer backoff 2002 Yanghee Choi 2 Congestion Control

More information

ENSC 835 project (2002) TCP performance over satellite links. Kenny, Qing Shao Grace, Hui Zhang

ENSC 835 project (2002) TCP performance over satellite links. Kenny, Qing Shao Grace, Hui Zhang ENSC 835 project (2002) TCP performance over satellite links Kenny, Qing Shao Qshao@cs.sfu.ca Grace, Hui Zhang Hzhange@cs.sfu.ca Road map Introduction to satellite communications Simulation implementation

More information

Outline Computer Networking. TCP slow start. TCP modeling. TCP details AIMD. Congestion Avoidance. Lecture 18 TCP Performance Peter Steenkiste

Outline Computer Networking. TCP slow start. TCP modeling. TCP details AIMD. Congestion Avoidance. Lecture 18 TCP Performance Peter Steenkiste Outline 15-441 Computer Networking Lecture 18 TCP Performance Peter Steenkiste Fall 2010 www.cs.cmu.edu/~prs/15-441-f10 TCP congestion avoidance TCP slow start TCP modeling TCP details 2 AIMD Distributed,

More information

TRANSMISSION CONTROL PROTOCOL

TRANSMISSION CONTROL PROTOCOL COMP 635: WIRELESS NETWORKS TRANSMISSION CONTROL PROTOCOL Jasleen Kaur Fall 2015 1 Impact of Wireless on Protocol Layers Application layer Transport layer Network layer Data layer Physical layer service

More information

cs/ee 143 Communication Networks

cs/ee 143 Communication Networks cs/ee 143 Communication Networks Chapter 4 Transport Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Recap: Internet overview Some basic mechanisms n Packet switching n Addressing n Routing o

More information

CS 421: COMPUTER NETWORKS SPRING FINAL May 24, minutes. Name: Student No: TOT

CS 421: COMPUTER NETWORKS SPRING FINAL May 24, minutes. Name: Student No: TOT CS 421: COMPUTER NETWORKS SPRING 2012 FINAL May 24, 2012 150 minutes Name: Student No: Show all your work very clearly. Partial credits will only be given if you carefully state your answer with a reasonable

More information

Analytic End-to-End Estimation for the One-Way Delay and Its Variation

Analytic End-to-End Estimation for the One-Way Delay and Its Variation Analytic End-to-End Estimation for the One-Way Delay and Its Variation Jin-Hee Choi and Chuck Yoo Department of Computer Science and Engineering Korea University Email: {jhchoi, hxy}@os.korea.ac.kr Telephone:

More information

Congestion control in TCP

Congestion 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 information

CS 421: COMPUTER NETWORKS SPRING FINAL May 8, minutes

CS 421: COMPUTER NETWORKS SPRING FINAL May 8, minutes CS 421: COMPUTR NTWORKS SPRIN 2016 INL May 8, 2016 150 minutes Name: Student No: Q1 Q2 Q3 TOT 1) a) (6 pts) iven the following parameters for a datagram packet switching network: N: number of hops between

More information

Congestion Control In The Internet Part 2: How it is implemented in TCP. JY Le Boudec 2014

Congestion Control In The Internet Part 2: How it is implemented in TCP. JY Le Boudec 2014 1 Congestion Control In The Internet Part 2: How it is implemented in TCP JY Le Boudec 2014 Contents 1. Congestion control in TCP 2. The fairness of TCP 3. The loss throughput formula 4. Explicit Congestion

More information

Hybrid Control and Switched Systems. Lecture #17 Hybrid Systems Modeling of Communication Networks

Hybrid Control and Switched Systems. Lecture #17 Hybrid Systems Modeling of Communication Networks Hybrid Control and Switched Systems Lecture #17 Hybrid Systems Modeling of Communication Networks João P. Hespanha University of California at Santa Barbara Motivation Why model network traffic? to validate

More information

TRANSMISSION CONTROL PROTOCOL

TRANSMISSION CONTROL PROTOCOL COMP 635: WIRELESS & MOBILE COMMUNICATIONS TRANSMISSION CONTROL PROTOCOL Jasleen Kaur Fall 2017 1 Impact of Wireless on Protocol Layers Application layer Transport layer Network layer Data link layer Physical

More information

TCP. CSU CS557, Spring 2018 Instructor: Lorenzo De Carli (Slides by Christos Papadopoulos, remixed by Lorenzo De Carli)

TCP. CSU CS557, Spring 2018 Instructor: Lorenzo De Carli (Slides by Christos Papadopoulos, remixed by Lorenzo De Carli) TCP CSU CS557, Spring 2018 Instructor: Lorenzo De Carli (Slides by Christos Papadopoulos, remixed by Lorenzo De Carli) 1 Sources Fall and Stevens, TCP/IP Illustrated Vol. 1, 2nd edition Congestion Avoidance

More information

Chapter III: Transport Layer

Chapter III: Transport Layer Chapter III: Transport Layer UG3 Computer Communications & Networks (COMN) Mahesh Marina mahesh@ed.ac.uk Slides thanks to Myungjin Lee and copyright of Kurose and Ross Principles of congestion control

More information

The Transport Layer Congestion control in TCP

The Transport Layer Congestion control in TCP CPSC 360 Network Programming The Transport Layer Congestion control in TCP Michele Weigle Department of Computer Science Clemson University mweigle@cs.clemson.edu http://www.cs.clemson.edu/~mweigle/courses/cpsc360

More information

On the Optimizing of LTE System Performance for SISO and MIMO Modes

On the Optimizing of LTE System Performance for SISO and MIMO Modes 2015 Third International Conference on Artificial Intelligence, Modelling and Simulation On the Optimizing of LTE System Performance for SISO and MIMO Modes Ali Abdulqader Bin Salem, Yung-Wey Chong, Sabri

More information

Congestion Control In The Internet Part 2: How it is implemented in TCP. JY Le Boudec 2015

Congestion Control In The Internet Part 2: How it is implemented in TCP. JY Le Boudec 2015 1 Congestion Control In The Internet Part 2: How it is implemented in TCP JY Le Boudec 2015 Contents 1. Congestion control in TCP 2. The fairness of TCP 3. The loss throughput formula 4. Explicit Congestion

More information

TECHNICAL RESEARCH REPORT

TECHNICAL RESEARCH REPORT TECHNICAL RESEARCH REPORT TCP over Satellite Hybrid Networks: A Survey by Xiaoming Zhou, John S. Baras CSHCN TR 2002-15 (ISR TR 2002-27) The Center for Satellite and Hybrid Communication Networks is a

More information

Direct Link Communication I: Basic Techniques. Data Transmission. ignore carrier frequency, coding etc.

Direct Link Communication I: Basic Techniques. Data Transmission. ignore carrier frequency, coding etc. Direct Link Communication I: Basic Techniques Link speed unit: bps abstraction Data Transmission ignore carrier frequency, coding etc. Point-to-point link: wired or wireless includes broadcast case Interested

More information

ENSC 835 project TCP performance over satellite links. Kenny, Qing Shao Grace, Hui Zhang

ENSC 835 project TCP performance over satellite links. Kenny, Qing Shao Grace, Hui Zhang ENSC 835 project TCP performance over satellite links Kenny, Qing Shao Qshao@cs.sfu.ca Grace, Hui Zhang Hzhange@cs.sfu.ca Road map Introduction to satellite communications Simulation implementation Window

More information

On Network Dimensioning Approach for the Internet

On Network Dimensioning Approach for the Internet On Dimensioning Approach for the Internet Masayuki Murata ed Environment Division Cybermedia Center, (also, Graduate School of Engineering Science, ) e-mail: murata@ics.es.osaka-u.ac.jp http://www-ana.ics.es.osaka-u.ac.jp/

More information

Internet Services & Protocols. Quality of Service Architecture

Internet Services & Protocols. Quality of Service Architecture Department of Computer Science Institute for System Architecture, Chair for Computer Networks Internet Services & Protocols Quality of Service Architecture Dr.-Ing. Stephan Groß Room: INF 3099 E-Mail:

More information

ENHANCING TCP OVER SATELLITE LINKS USING CANIT ALGORITHM

ENHANCING TCP OVER SATELLITE LINKS USING CANIT ALGORITHM ENHANCING TCP OVER SATELLITE LINKS USING CANIT ALGORITHM Hafssa BENABOUD 1, 2 Amine BERQIA 1 Noufissa MIKOU 2 1 CUI, University of Geneva, 24 Rue General Dufour, 1211 Geneva, Switzerland Email: {benaboud,

More information

Delay Performance of the New Explicit Loss Notification TCP Technique for Wireless Networks

Delay Performance of the New Explicit Loss Notification TCP Technique for Wireless Networks Delay Performance of the New Explicit Loss Notification TCP Technique for Wireless Networks Wenqing Ding and Abbas Jamalipour School of Electrical and Information Engineering The University of Sydney Sydney

More information

Characterization of Performance of TCP/IP over PPP and ATM over Asymmetric Links

Characterization of Performance of TCP/IP over PPP and ATM over Asymmetric Links Characterization of Performance of TCP/IP over PPP and ATM over Asymmetric Links Kaustubh S. Phanse Luiz A. DaSilva Kalyan Kidambi (kphanse@vt.edu) (ldasilva@vt.edu) (Kalyan.Kidambi@go.ecitele.com) Bradley

More information

SIMULATION BASED ANALYSIS OF THE INTERACTION OF END-TO-END AND HOP-BY-HOP FLOW CONTROL SCHEMES IN PACKET SWITCHING LANS

SIMULATION BASED ANALYSIS OF THE INTERACTION OF END-TO-END AND HOP-BY-HOP FLOW CONTROL SCHEMES IN PACKET SWITCHING LANS SIMULATION BASED ANALYSIS OF THE INTERACTION OF END-TO-END AND HOP-BY-HOP FLOW CONTROL SCHEMES IN PACKET SWITCHING LANS J Wechta, A Eberlein, F Halsall and M Spratt Abstract To meet the networking requirements

More information

Transport layer. UDP: User Datagram Protocol [RFC 768] Review principles: Instantiation in the Internet UDP TCP

Transport layer. UDP: User Datagram Protocol [RFC 768] Review principles: Instantiation in the Internet UDP TCP Transport layer Review principles: Reliable data transfer Flow control Congestion control Instantiation in the Internet UDP TCP 1 UDP: User Datagram Protocol [RFC 768] No frills, bare bones Internet transport

More information

Transport layer. Review principles: Instantiation in the Internet UDP TCP. Reliable data transfer Flow control Congestion control

Transport layer. Review principles: Instantiation in the Internet UDP TCP. Reliable data transfer Flow control Congestion control Transport layer Review principles: Reliable data transfer Flow control Congestion control Instantiation in the Internet UDP TCP 1 UDP: User Datagram Protocol [RFC 768] No frills, bare bones Internet transport

More information

Computer Networking Introduction

Computer Networking Introduction Computer Networking Introduction Halgurd S. Maghdid Software Engineering Department Koya University-Koya, Kurdistan-Iraq Lecture No.11 Chapter 3 outline 3.1 transport-layer services 3.2 multiplexing and

More information

Transport Layer PREPARED BY AHMED ABDEL-RAOUF

Transport Layer PREPARED BY AHMED ABDEL-RAOUF Transport Layer PREPARED BY AHMED ABDEL-RAOUF TCP Flow Control TCP Flow Control 32 bits source port # dest port # head len sequence number acknowledgement number not used U A P R S F checksum Receive window

More information

Impact of transmission errors on TCP performance. Outline. Random Errors

Impact 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 information

TFRC and RTT Thresholds Interdependence in a Selective Retransmission Scheme

TFRC and RTT Thresholds Interdependence in a Selective Retransmission Scheme TFRC and RTT s Interdependence in a Selective Retransmission Scheme Árpád Huszák, Sándor Imre Budapest University of Technology and Economics, Department of Telecommunications Budapest, Hungary Email:

More information

To address these challenges, extensive research has been conducted and have introduced six key areas of streaming video, namely: video compression,

To address these challenges, extensive research has been conducted and have introduced six key areas of streaming video, namely: video compression, Design of an Application Layer Congestion Control for Reducing network load and Receiver based Buffering Technique for packet synchronization in Video Streaming over the Internet Protocol Mushfeq-Us-Saleheen

More information

Addressing the Challenges of Web Data Transport

Addressing the Challenges of Web Data Transport Addressing the Challenges of Web Data Transport Venkata N. Padmanabhan Microsoft Research UW Whistler Retreat December 1998 Outline Challenges Solutions TCP Session Fast Start Ongoing and Future Work The

More information

Improving TCP Performance over Wireless Networks using Loss Predictors

Improving TCP Performance over Wireless Networks using Loss Predictors Improving TCP Performance over Wireless Networks using Loss Predictors Fabio Martignon Dipartimento Elettronica e Informazione Politecnico di Milano P.zza L. Da Vinci 32, 20133 Milano Email: martignon@elet.polimi.it

More information

Resource allocation in networks. Resource Allocation in Networks. Resource allocation

Resource allocation in networks. Resource Allocation in Networks. Resource allocation Resource allocation in networks Resource Allocation in Networks Very much like a resource allocation problem in operating systems How is it different? Resources and jobs are different Resources are buffers

More information

Investigating the Use of Synchronized Clocks in TCP Congestion Control

Investigating the Use of Synchronized Clocks in TCP Congestion Control Investigating the Use of Synchronized Clocks in TCP Congestion Control Michele Weigle (UNC-CH) November 16-17, 2001 Univ. of Maryland Symposium The Problem TCP Reno congestion control reacts only to packet

More information

TCP CONGESTION CONTROL PROTOCOLS OVER UMTS WCDMA NETWORK

TCP 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 information

Topics. TCP sliding window protocol TCP PUSH flag TCP slow start Bulk data throughput

Topics. TCP sliding window protocol TCP PUSH flag TCP slow start Bulk data throughput Topics TCP sliding window protocol TCP PUSH flag TCP slow start Bulk data throughput 2 Introduction In this chapter we will discuss TCP s form of flow control called a sliding window protocol It allows

More information

Reasons not to Parallelize TCP Connections for Fast Long-Distance Networks

Reasons not to Parallelize TCP Connections for Fast Long-Distance Networks Reasons not to Parallelize TCP Connections for Fast Long-Distance Networks Zongsheng Zhang Go Hasegawa Masayuki Murata Osaka University Contents Introduction Analysis of parallel TCP mechanism Numerical

More information

Congestion Control in TCP

Congestion Control in TCP Congestion Control in TCP Antonio Carzaniga Faculty of Informatics University of Lugano November 11, 2014 Outline Intro to congestion control Input rate vs. output throughput Congestion window Congestion

More information

WRED Explicit Congestion Notification

WRED Explicit Congestion Notification Finding Feature Information, page 1 Prerequisites for WRED-Explicit Congestion Notification, page 1 Information About WRED-Explicit Congestion Notification, page 2 How to Configure WRED-Explicit Congestion

More information

TCP in Asymmetric Environments

TCP in Asymmetric Environments TCP in Asymmetric Environments KReSIT, IIT Bombay Vijay T. Raisinghani TCP in Asymmetric Environments 1 TCP Overview Four congestion control algorithms Slow start Congestion avoidance Fast retransmit Fast

More information

Lecture 15: TCP over wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 13, Thursday

Lecture 15: TCP over wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 13, Thursday Lecture 15: TCP over wireless networks Mythili Vutukuru CS 653 Spring 2014 March 13, Thursday TCP - recap Transport layer TCP is the dominant protocol TCP provides in-order reliable byte stream abstraction

More information

Reliable Transport II: TCP and Congestion Control

Reliable Transport II: TCP and Congestion Control Reliable Transport II: TCP and Congestion Control Stefano Vissicchio UCL Computer Science COMP0023 Recap: Last Lecture Transport Concepts Layering context Transport goals Transport mechanisms and design

More information

DiffServ Architecture: Impact of scheduling on QoS

DiffServ Architecture: Impact of scheduling on QoS DiffServ Architecture: Impact of scheduling on QoS Abstract: Scheduling is one of the most important components in providing a differentiated service at the routers. Due to the varying traffic characteristics

More information

Congestion Control End Hosts. CSE 561 Lecture 7, Spring David Wetherall. How fast should the sender transmit data?

Congestion Control End Hosts. CSE 561 Lecture 7, Spring David Wetherall. How fast should the sender transmit data? Congestion Control End Hosts CSE 51 Lecture 7, Spring. David Wetherall Today s question How fast should the sender transmit data? Not tooslow Not toofast Just right Should not be faster than the receiver

More information

The aim of this unit is to review the main concepts related to TCP and UDP transport protocols, as well as application protocols. These concepts are

The aim of this unit is to review the main concepts related to TCP and UDP transport protocols, as well as application protocols. These concepts are The aim of this unit is to review the main concepts related to TCP and UDP transport protocols, as well as application protocols. These concepts are important requirements for developing programs that

More information

A Survey on Quality of Service and Congestion Control

A Survey on Quality of Service and Congestion Control A Survey on Quality of Service and Congestion Control Ashima Amity University Noida, U.P, India batra_ashima@yahoo.co.in Sanjeev Thakur Amity University Noida, U.P, India sthakur.ascs@amity.edu Abhishek

More information

QoS and System Capacity Optimization in WiMAX Multi-hop Relay Using Flexible Tiered Control Technique

QoS and System Capacity Optimization in WiMAX Multi-hop Relay Using Flexible Tiered Control Technique 2009 International Conference on Computer Engineering and Applications IPCSIT vol.2 (2011) (2011) IACSIT Press, Singapore QoS and System Capacity Optimization in WiMAX Multi-hop Relay Using Flexible Tiered

More information

Fall 2012: FCM 708 Bridge Foundation I

Fall 2012: FCM 708 Bridge Foundation I Fall 2012: FCM 708 Bridge Foundation I Prof. Shamik Sengupta Instructor s Website: http://jjcweb.jjay.cuny.edu/ssengupta/ Blackboard Website: https://bbhosted.cuny.edu/ Intro to Computer Networking Transport

More information

CSCI-1680 Transport Layer III Congestion Control Strikes Back Rodrigo Fonseca

CSCI-1680 Transport Layer III Congestion Control Strikes Back Rodrigo Fonseca CSCI-1680 Transport Layer III Congestion Control Strikes Back Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti, Ion Stoica Last Time Flow Control Congestion Control

More information

Chapter 6. What happens at the Transport Layer? Services provided Transport protocols UDP TCP Flow control Congestion control

Chapter 6. What happens at the Transport Layer? Services provided Transport protocols UDP TCP Flow control Congestion control Chapter 6 What happens at the Transport Layer? Services provided Transport protocols UDP TCP Flow control Congestion control OSI Model Hybrid Model Software outside the operating system Software inside

More information

Communication Networks

Communication 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 information

Module objectives. Integrated services. Support for real-time applications. Real-time flows and the current Internet protocols

Module objectives. Integrated services. Support for real-time applications. Real-time flows and the current Internet protocols Integrated services Reading: S. Keshav, An Engineering Approach to Computer Networking, chapters 6, 9 and 4 Module objectives Learn and understand about: Support for real-time applications: network-layer

More information

Effect of Congestion Control on the Performance of TCP and SCTP over Satellite Networks

Effect of Congestion Control on the Performance of TCP and SCTP over Satellite Networks 1 Effect of Congestion Control on the Performance of TCP and SCTP over Satellite Networks Rumana Alamgir Mohammed Atiquzzaman School of Computer Science University of Oklahoma Norman, OK 73019-6151. William

More information

Chapter 3 Transport Layer

Chapter 3 Transport Layer Chapter 3 Transport Layer 1 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4 Principles of reliable data transfer 3.5 Connection-oriented

More information

CS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP

CS 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 information