Mean Waiting Delay for Web Object Transfer in Wireless SCTP Environment
|
|
- Jocelyn Lucas
- 6 years ago
- Views:
Transcription
1 This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 009 proceedings Mean aiting Delay for eb Object Transfer in ireless Environment Yong-Jin Lee and M.Atiquzzaman Department of Technology Education, Korea ational University of Education School of Computer Science, University of Oklahoma Abstract-Most current web application use HTTP (Hyper Text Transfer Protocol) and (Transmission Control Protocol) to retrieve objects from the Internet. (Stream Control Transmission Protocol) is recently proposed transport protocol with congestion control mechanism similar to that of. aiting delay is an important performance criterion for when transferring web object over the Internet. In this paper, we present an analytical model of mean waiting delay for object transfers over the Internet in a wireless using the as the transport protocol and compare with the mean waiting in using. Validation of the model using experimental results show that the mean waiting delay for HTTP over is less than that for HTTP over. This is caused by the small slow-start time of. I. ITRODUCTIO Most web applications use HTTP (hyper text transfer protocol) as the transfer protocol to retrieve objects in the Internet. HTTP is a connection-oriented protocol and uses (transmission control protocol) as the transport layer protocol. provides a single stream of data and strict ordered delivery. Consequently, when a packet is lost in the network, all subsequent packets arriving at the receiver must wait until the lost packet has been retransmitted from the sender and received at the receiver. This phenomenon, called Head of Line (HOL) blocking, results in waiting delay [] that affects the performance of web transfers. (Stream Control Transmission Protocol) [,3,4] has been proposed by IETF as a new transport layer protocol. The design of absorbed many strengths of, such as window-based congestion control, error detection, and retransmission. Moreover, incorporated several new features that are not available in. Two main new features are multi-streaming and multi-homing. s multistreaming can alleviate the head-of-line blocking when an HTML page contains multiple objects. However, it cannot avoid the waiting delay between packets when single objects are transferred; the end point must hold the received packet from delivery to the upper layer protocol (HTTP) until they are reordered. This waiting delay is affected by slow-start and retransmission policy. Several models [5,6,7] that estimate the mean transfer times of application have been presented in the literature; however, they assumed single packet loss. Furthermore, since the waiting delay was not considered in the transfer time, we cannot extract the waiting delay from the previous models. The objective of this paper is to develop an analytical model to estimate the waiting delay for multiple packet losses when is used in a wireless web environment and compare with the mean waiting delay of. The rest of the paper is organized as follows. Section provides background on the web object transfer in and environment. Section 3 describes the mean waiting delay time in web object transfer. Section 4 presents mean waiting delay comparison of HTTP over and HTTP over. Finally, concluding remarks are given in Section 5. II. EB OBJECT TRASFER I AD EVIROMET Consider the simple case of a web browser displaying a web page with embedded objects. Using HTTP/. that supports persistent and pipelined connections, the browser opens a new transport connection to the server, and sends an HTTP GET request with the desired URI (Uniform Resource Identifier). The request may consist of a specific command, a message containing request parameters, information about the client and may contain URI s of embedded objects. The server returns an HTTP response with the page contents. The response includes status information, a success/error code, and a message containing information about the server and information about the response itself. As responses arrive from the server, the browser displays the web page with its embedded objects. In general, objects embedded within a web page are independent of each other. That is, requesting and displaying each object in the page does not depend on the reception of other embedded objects. This leads to HOL blocking problem that causes performance degradation. To alleviate HOL blocking, web browsers usually open multiple connections to the same web server. Using multiple connections for transferring a single application's data introduces many negative consequences for both the application and the network. It may cause the increased load on web server. Under high loads, some web servers may choose to drop incoming connection requests due to lack of available memory resources. The other drawback is increased connection establishment latency. Each connection goes through a three-way handshake for /09/$ IEEE
2 This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 009 proceedings connection establishment before data transfer is possible. This handshake wastes one round trip for every connection opened to the same web server. Increasing the number of connections increases the chances of losses during connection establishment, thereby increasing the overall average transfer time. The distinguishes different streams of messages within one association. This enables a delivery scheme where only the sequence of messages needs to be maintained per stream (partial in-sequence delivery). The message loss in a particular stream will only hinder delivery of that stream. Therefore, other streams within an association are not affected. By using unordered messages and multi-streaming, eliminates the head-of-the-line blocking problem. hen is used for web page retrieval; it allows multiple streams in an association and independent streaming delivery of web objects. This avoids the HOL blocking experienced when is deployed for web object retrieval. In contrast to the three-way handshake that occurs in, uses a four-way handshake and verification tag to initiate an association. The initialization of an association is completed on both sides after the exchange of four messages (IIT chunk, IIT-ACK chunk, COOK-ECHO chunk and COOKIE-ACK chunk) [6]. The passive side does not allocate resources until the third of these messages has arrived and been validated. hen is deployed for HTTP application this four-way handshake defends against denial-of-service attempts and SY-type attacks experienced by connection. The operates like using window-based flow control with the additional features necessary to transport signaling information. Detection of loss and duplication of data chunks is enabled by numbering all data chunks in the sender with the so-called TS (Transport Sequence umber). The acknowledgements sent from the receiver to the sender are based on these sequence numbers. Retransmissions are timer-controlled. The timer duration is derived from continuous measurements of the round trip delay. henever such a retransmission timer expires, all non-acknowledged data chunks are retransmitted and the timer is started again doubling its initial duration like the. henever the sender receives four consecutive SACKS reporting the same data chunk missing, this data chunk is immediately retransmitted (fast retransmit). Data that is discarded, reordered, duplicated or corrupted can be detected and fast re-transmitting and fast recovery for damaged data can be issued. This congestion control mechanism improves the performance of in wireless environment. The above stated features show that can be best suited for HTTP application with improved performance. III. MEA AITIG DELAY TIME I EB OBJECT TRASFER Fig. depicts the waiting delay problem when packets form an object. In case (x +) th packet is lost, packets,,..,x arrived at client have to wait for the retransmission of packets sent after (x +) th packet in the window to display object. Figure. aiting delay problem in the object transfer Table represents the notations used in our analytical models for HTTP over and. TABLE I. otations Symbol Meaning θ size of an object (bits) maximum transfer unit (bits) data rate between the server and the client (bps) the number of packets in an object p packet loss probability k expected number of packet loss in an object x i the number of packets sent until i th packet loss (i,,..,k) Δ the number of packets resent due to i th packet loss (i,,..,k) in Δ the number of packets resent due to i th packet loss (i,,..,k) in R Λ retransmission time of Δ packets in R Λ retransmission time of Δ packets in S Λ slow-start times for transferring Δ packets in S Λ slow-start times for transferring Δ packets in α the number of times the server would stall in α the number of times the server would stall in β the number of windows that cover the object without packet loss in β the number of windows that cover the object without packet loss in window number when x i packet sent in window number when x i packet sent in y s window size that covers the expected number of packets (x i ) when loss occurs y s window size that covers the expected number of packets (x i ) when loss occurs z the number of packets sent in before the loss in the windows z the number of packets sent in before the loss in the windows RTT round trip time waiting delay due to i th packet loss in waiting delay due to i th packet loss in mean waiting delay for object transfer in mean waiting delay for object transfer in
3 This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 009 proceedings A. Modeling for waiting delay The number of packets () in an object is θ / when θ is size of an object (bits) and is maximum transfer unit (bits). hen p is packet loss probability, by the binomial distribution, the expected number of packet loss is k p. Figure illustrates sending an HTTP request for an object when the first packet is lost in. x represents the number of packets sent until the first packet loss. That is, (x +) th packet is lost in the th window. eb Client initiate connection request object RTT IIT IIT-ACK COOKIE-ECHO(GET object) COOKIE-ACK eb Server first window value four. In this paper, however, we compare the standards tracks, RFC-00 [8] for and RFC-960 [7] for. e obtain slow-start time ( S ) for when packets for an object are transferred by modifying the equation given in [0] S ρ ρ ( RTT + ) ( ) Here, ρ min [α, β -]. α and β are given by RTT α log ( + ) + / () θ β log ( ) + Meanwhile, starts the congestion window from two MTUs (Maximum Transfer Unit). Thus, S,α, and β are given by () x packets second window S ρ ( RTT + ) ( ρ + ) (3) z Δ () y -z packet loss window window size y packets α β log log RTT ( + ) / θ ( ) (4) Figure. HTTP request for an object in environment Let z be the number of packets sent before the packet loss in the th window, and y represent the window size of th window. Our model assumes a wireless environment where fast recovery is not possible because of small window. Thus, when the GB (Go-Back ) is used, the number of resent packets is y - z Δ (). Congestion mechanism resumes the slow-start phase after the packet loss. Therefore, delay due to the first packet loss includes the retransmission time of Δ () packets and slow start time incurred by retransmission, giving a waiting delay of R Λ + S Λ (i,,..,k). B. Slow-start time To derive waiting delay () for and () for corresponding to the first packet loss, we consider the slow-start time for and, respectively. starts the congestion window from one MSS (Maximum Segment Size) [8]. Of course, according to the current congestion control specification, implementations can use an initial congestion window up to four segments [9]. For example, etbsd v.3 uses an initial congestion window with the The expected number of packets sent before first loss is given by ( p) x + ( p) + (5) p In case of packet loss, since we send x packets until the loss, current window number in is given by 0 j min{ j : x} j min{ j : x} min{ j :log ( x + )} log ( x + ) Current window number in is given by j min{ j : + + x j+ min{ j : x + 3} log ( x + ) tcp + } Thus, the s window size (y ) that covers the expected number of packets (x ) when loss occurs is given by (6) (7)
4 This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 009 proceedings ( ) +, if < y (8), otherwise In eqn. (8), is equal to. In the same manner, when, s window size (y ) is given by ( ) +, if < y (9), otherwise The number of packets sent in before the loss in the th windows (when ) is 0 z x ( ) (0) x z for the th windows (when ) is z x ( + + ) () x Since z packets in must wait in the window and Δ () packets are to be retransmitted in the next slow-start time, the number of packets, including the lost packet to be resent, is Δ () y - z. By the same method, Δ () y - z. Substituting Δ () and Δ () into and S S in eqn. () in eqn. (3) respectively, we can obtain the slowstart time when additional Δ () and Δ () packets are retransmitted as eqn. () and eqn. (3), respectively. Δ () S where ρ RTT + - ( ρ ) RTT ρ min log + +, log ( Δ () + ) / Δ () S where C. aiting delay time ρ RTT+ -( ρ+ ) RTT ρ min log +, log ( Δ () + ) / () (3) aiting delay time for the first packet loss in is sum of the transfer time and the slow-start time of Δ () packets. The retransmission time ( R Λ ) is Δ () /; thus the waiting delay time for is given by (4) Δ () Δ () Δ () ( ) R + S Δ() + S The waiting delay time for the first packet loss in is given by (5) Δ() Δ() Δ() ( ) R + S Δ() + S ow, we extend our model to multiple packet losses. Let x, x,.., x k be the number of packets sent until packet loss. hen packet loss occurs, we must retransmit the lost packet and the following packets (Δ for and Δ for : i,..,k) after first, second,, k th packet loss, respectively. Consequently, additional retransmission times, ( R Λ for and R Λ for : i,,..,k) and slow-start times, ( S Λ for and S Λ for ) are required. and represent waiting delay times for the client to wait for the completion of retransmission of Δ packets for and Δ packets for (i,..,k), respectively. In general, for R Λ + S Λ and for, R Λ + S Λ (i,,..,k). In order to find () and (), we set -x + and repeat the above procedure from eqn. (5) to eqn. (5). In the same manner, we can find (3), (3), (4), (4),, (k) and (k). hen number of packets included in object () is sent, the procedure is terminated. Thus, amount of waiting delay time for an and object are k i k i ( i) (6) ( i) (7) and shows the mean waiting delay time for an web object transfer in wireless and environment, respectively. IV. PERFORMACE EVALUATIO In this section, we evaluate the performance of and in terms of its mean waiting delay. Figure 3 and 4 show the mean waiting delay (sec), as a function of data rate () and packet loss probability (p) for θ3.5 KB and 535 B when RTT 56 ms and sec, respectively. As shown in Fig. 3 and 4, mean waiting delay is decreased with an increase of packet loss probability (p). Given the same packet loss probability, mean waiting delay is decreased with an increase of data rate (). Especially, mean waiting delay times of are less than those of in every case. This is caused by the small slow-start time of. In many cases, slow-start time of is close to zero. This implies
5 This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 009 proceedings that the start window size policy of is better than that of in web environment. Our numerical results show that HTTP over is better than HTTP over by % on the average during the slow start-phase. Time (sec) Mean aiting Delay RTT 56 ms Data Rate (Kbps) SCT P (p0.4%) (p0.4%) SCT P(p5%) (p5%) SCT P (p0%) (p0%) Figure 3. Mean waiting delay for RTT 56 ms Time (sec) Mean aiting Delay RTT sec Data Rate (Kbps) Our numerical results show that the mean waiting delay for HTTP over is less than that for HTTP over. This is caused by the small slow-start time of. That is, the slow-start time of HTTP over is less than that of HTTP over by % on the average. Future work includes the derivation of analytical model for the mean object transfer time in environment. REFERECES [] Fu, L. Ma, M. Atiquzzaman and Yong-Jin, Lee, Signaling Cost and Performance of SIGMA, ireless Communications and Mobile Computing, vol. 5, pp , 005. [] Caro, A., Iyengar, J., Amer, P., Ladha, S., Heinz, G. and Shah, K., : A Proposed Standard for Robust Internet Data Transport, IEEE Computer, pp. 0-7, 003. [3] R. Stewart, Q. Xie, K. Morneault, and C. Sharp et. al., Stream Control Transmission Protocol, RFC 960, 000. [4] R. Stewart and Q. Xie, Stream Control Transmission Protocol: A Reference Guide, Addison esley, 000. [5] Cardwell,., Savage, S. and Anderson, T, Modeling Latency, IEEE Infocom, pp , 000. [6] Z. Jiong, Z. Shu-Jing, and Qigang, An Adapted Full Model for Latency, Proceedings of IEEE TECO, pp , 00. [7] J. Padhye, V. Firoiu, D. Towsley and J. Kurose, Modeling Reno Performance: A Simple Model and Its Empirical Validation, ACM Transactions on etworking, Vol. 8, pp.33-45, 000. [8]. Stevens, Slow Start, Congestion Avoidance, Fast Retransmit and Fast Recovery Algorithms, RFC 00, 997. [9] M. Allman, S. Floyd, and C. Partridge, Increasing s Initial indow, RFC 44, 998. [0] J. Kurose and K. Ross, Computer etworking, Third Edition, Addison-esley, pp , 005. (p0.4%) (p0.4%) (p5%) (p5%) (p0%) (p0%) Figure 4. Mean waiting delay for RTT sec. V. COCLUSIOS In this paper, we developed and analytical model to estimate the waiting delay time of HTTP over and in a wireless environment. This model can be used to quantify the side effect and the avoidance mechanism for object transfer in the wireless web application.
Lower Bound for Mean Object Transfer Latency in the Narrowband IoT Environment
International Journal of Applied Engineering Research ISS 0973-456 Volume 1, umber 1 (017) pp. 3365-3369 Lower Bound for Mean Obect Transfer Latency in the arrowband IoT Environment Y. J. Lee Department
More informationTelecommunication & Network Research Lab
SCTP based Framework for Mobile Web Agent Y.J. Lee, Mohammed Atiquzzaman TR-OU-TNRL-05-116 September 2005 Telecommunication & Network Research Lab School of Computer Science THE UNIVERSITY OF OKLAHOMA
More informationImpact of Retransmission Mechanisms on the Performance of SCTP and TCP
Impact of Retransmission Mechanisms on the Performance of SCTP and TCP Rumana Alamgir, Mohammed Atiquzzaman School of Computer Science University of Oklahoma, Norman, OK 7319-611, USA. William Ivancic
More informationPerformance Evaluation of SCTP with Adaptive Multistreaming over LEO Satellite Networks
Performance Evaluation of SCTP with Adaptive Multistreaming over LEO Satellite Networks Hiroshi Tsunoda, Nei Kato, Abbas Jamalipour, and Yoshiaki Nemoto Graduate School of Information Sciences, Tohoku
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 informationEnhancing 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 informationA Survey of the Stream Control Transmission Protocol
A Survey of the Stream Control Transmission Protocol Sivadon Chaisiri Parallel and Distributed Computing Centre (PDCC) School of Computer Engineering Nanyang Technological University, Singapore Email:
More informationTCP Throughput Analysis with Variable Packet Loss Probability for Improving Fairness among Long/Short-lived TCP Connections
TCP Throughput Analysis with Variable Packet Loss Probability for Improving Fairness among Long/Short-lived TCP Connections Koichi Tokuda Go Hasegawa Masayuki Murata Graduate School of Information Science
More informationTelecommunication & Network Research Lab
Performance Modeling of SCTP Multihoming Shaojian Fu, Mohammed Atiquzzaman TR-OU-TNRL-- March Telecommunication & Network Research Lab School of Computer Science THE UNIVERSITY OF OKLAHOMA Felgar Street,
More informationPerformance Modeling of SCTP Multihoming
Performance Modeling of SCTP Multihoming Shaojian Fu and Mohammed Atiquzzaman Telecommunications and Networks Research Lab School of Computer Science University of Oklahoma, Norman, OK -, USA. Email: {sfu,atiq}@ou.edu
More informationStream Control Transmission Protocol
Chapter 13 Stream Control Transmission Protocol Objectives Upon completion you will be able to: Be able to name and understand the services offered by SCTP Understand SCTP s flow and error control and
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 informationTCP/IP Protocol Suite 1
TCP/IP Protocol Suite 1 Stream Control Transmission Protocol (SCTP) TCP/IP Protocol Suite 2 OBJECTIVES: To introduce SCTP as a new transport-layer protocol. To discuss SCTP services and compare them with
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 informationSCTP 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 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 informationNeural-based TCP performance modelling
Section 1 Network Systems Engineering Neural-based TCP performance modelling X.D.Xue and B.V.Ghita Network Research Group, University of Plymouth, Plymouth, United Kingdom e-mail: info@network-research-group.org
More informationImproved Model for a Non-Standard TCP Behavior
IJCSNS International Journal of Computer Science and Network Security, VOL.11 No.10, October 2011 45 Improved Model for a Non-Standard TCP Behavior Mohammed Abdullah Alnuem, King Saud University, Riyadh,
More informationTCP Congestion Control in Wired and Wireless networks
TCP Congestion Control in Wired and Wireless networks Mohamadreza Najiminaini (mna28@cs.sfu.ca) Term Project ENSC 835 Spring 2008 Supervised by Dr. Ljiljana Trajkovic School of Engineering and Science
More informationStream Control Transmission Protocol (SCTP)
Stream Control Transmission Protocol (SCTP) Definition Stream control transmission protocol (SCTP) is an end-to-end, connectionoriented protocol that transports data in independent sequenced streams. SCTP
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 informationSCTP: A new networking protocol for super-computing. Mohammed Atiquzzaman Shaojian Fu Department of Computer Science University of Oklahoma.
SCTP: A new networking protocol for super-computing Mohammed Atiquzzaman Shaojian Fu Department of Computer Science University of Oklahoma. atiq@ou ou.edu Networking Characteristics in Supercomputing High
More informationTCP Congestion Control in Wired and Wireless Networks
TCP Congestion Control in Wired and Wireless Networks ENCS 835 Course Project Spring 2008 April 7, 2008 Presented by: Mohamadreza Najiminaini Professor: Ljiljana Trajkovic 4/16/2008 1 Roadmap Introduction
More informationPath Selection of SCTP Fast Retransmission in Multi-homed Wireless Environments
Path Selection of SCTP Fast Retransmission in Multi-homed Wireless Environments Yuansong Qiao 1, 2, Enda Fallon 1, John Murphy 3, Liam Murphy 3, Austin Hanley 1 1 Applied Software Research Centre, Athlone
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 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 informationA Two-level Threshold Recovery Mechanism for SCTP
A Two-level Threshold Recovery Mechanism for SCTP Armando L. Caro Jr., Janardhan R. Iyengar, Paul D. Amer, Gerard J. Heinz Computer and Information Sciences University of Delaware acaro, iyengar, amer,
More informationSCTP Congestion Window Overgrowth During Changeover
SCTP Congestion Window Overgrowth During Changeover Janardhan R. Iyengar, Armando L. Caro, Jr., Paul D. Amer, Gerard J. Heinz Computer and Information Sciences University of Delaware iyengar, acaro, amer,
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 informationAn Analytical Model for Short-Lived TCP Flows in Heterogeneous Wireless Networks
An Analytical Model for Short-Lived TCP Flows in Heterogeneous Wireless Networks Sameer Bataineh Jordan University of Science and Technology, Irbid, Jordan samir@just.edu.jo Jamal Al-Karaki Hashemite University,
More informationCS 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 informationAn End-to-End Support for Short-Lived TCP Flows in Heterogeneous Wired-cum-Wireless Networks: An Analytical Study
212 The International Arab Journal of Information Technology, Vol. 8, No. 2, April 211 An End-to-End Support for Short-Lived TCP Flows in Heterogeneous Wired-cum-Wireless Networks: An Analytical Study
More informationCSCI 466 Midterm Networks Fall 2013
CSCI 466 Midterm Networks Fall 2013 Name: This exam consists of 6 problems on the following 7 pages. You may use your single-sided hand-written 8 ½ x 11 note sheet and a calculator during the exam. No
More informationTCP: Flow and Error Control
1 TCP: Flow and Error Control Required reading: Kurose 3.5.3, 3.5.4, 3.5.5 CSE 4213, Fall 2006 Instructor: N. Vlajic TCP Stream Delivery 2 TCP Stream Delivery unlike UDP, TCP is a stream-oriented protocol
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 informationNovel web agent framework to support seamless mobility for data networks Y.-J. Lee 1 D.-W. Lee 2 M. Atiquzzaman 3
Published in IET Communications Received on 11th December 2008 Revised on 20th March 2009 ISSN 1751-8628 Novel web agent framework to support seamless mobility for data networks Y.-J. Lee 1 D.-W. Lee 2
More informationCS 716: Introduction to communication networks th class; 7 th Oct Instructor: Sridhar Iyer IIT Bombay
CS 716: Introduction to communication networks - 18 th class; 7 th Oct 2011 Instructor: Sridhar Iyer IIT Bombay Reliable Transport We have already designed a reliable communication protocol for an analogy
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 informationFast Retransmit. Problem: coarsegrain. timeouts lead to idle periods Fast retransmit: use duplicate ACKs to trigger retransmission
Fast Retransmit Problem: coarsegrain TCP timeouts lead to idle periods Fast retransmit: use duplicate ACKs to trigger retransmission Packet 1 Packet 2 Packet 3 Packet 4 Packet 5 Packet 6 Sender Receiver
More informationAnalysis of FTP over SCTP and TCP in Congested Network
Analysis of FTP over SCTP and TCP in Congested Network Lin-Huang Chang Ming-Yi Liao De-Yu Wang Grad. Inst. of Networking and Communication Eng., Chaoyang University of Dept. of Computer Science and Information
More informationTCP based Receiver Assistant Congestion Control
International Conference on Multidisciplinary Research & Practice P a g e 219 TCP based Receiver Assistant Congestion Control Hardik K. Molia Master of Computer Engineering, Department of Computer Engineering
More informationLecture 5: Flow Control. CSE 123: Computer Networks Alex C. Snoeren
Lecture 5: Flow Control CSE 123: Computer Networks Alex C. Snoeren Pipelined Transmission Sender Receiver Sender Receiver Ignored! Keep multiple packets in flight Allows sender to make efficient use of
More informationRED 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 informationTransport Layer. -UDP (User Datagram Protocol) -TCP (Transport Control Protocol)
Transport Layer -UDP (User Datagram Protocol) -TCP (Transport Control Protocol) 1 Transport Services The transport layer has the duty to set up logical connections between two applications running on remote
More informationNovel web agent framework to support seamless mobility for data networks Y.-J. Lee 1 D.-W. Lee 2 M. Atiquzzaman 3
Published in IET Communications Received on 11th December 2008 Revised on 20th March 2009 ISSN 1751-8628 Novel web agent framework to support seamless mobility for data networks Y.-J. Lee 1 D.-W. Lee 2
More informationCS268: 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 informationLecture 4: Congestion Control
Lecture 4: Congestion Control Overview Internet is a network of networks Narrow waist of IP: unreliable, best-effort datagram delivery Packet forwarding: input port to output port Routing protocols: computing
More informationDynamic Deferred Acknowledgment Mechanism for Improving the Performance of TCP in Multi-Hop Wireless Networks
Dynamic Deferred Acknowledgment Mechanism for Improving the Performance of TCP in Multi-Hop Wireless Networks Dodda Sunitha Dr.A.Nagaraju Dr. G.Narsimha Assistant Professor of IT Dept. Central University
More informationProgramming Assignment 3: Transmission Control Protocol
CS 640 Introduction to Computer Networks Spring 2005 http://www.cs.wisc.edu/ suman/courses/640/s05 Programming Assignment 3: Transmission Control Protocol Assigned: March 28,2005 Due: April 15, 2005, 11:59pm
More informationAnalysis 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 informationFall 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 informationECE697AA Lecture 3. Today s lecture
ECE697AA Lecture 3 Transport Layer: TCP and UDP Tilman Wolf Department of Electrical and Computer Engineering 09/09/08 Today s lecture Transport layer User datagram protocol (UDP) Reliable data transfer
More informationCONCURRENT MULTIPATH TRANSFER USING TRANSPORT LAYER MULTIHOMING: PERFORMANCE UNDER VARYING BANDWIDTH PROPORTIONS
CONCURRENT MULTIPATH TRANSFER USING TRANSPORT LAYER MULTIHOMING: PERFORMANCE UNDER VARYING BANDWIDTH PROPORTIONS Janardhan R. Iyengar, Paul D. Amer Protocol Engineering Lab, Computer and Information Sciences,
More informationEffect of SCTP Multistreaming over Satellite Links
Effect of SCTP Multistreaming over Satellite Links Mohammed Atiquzzaman (Co-author: William Ivancic (NASA)) School of Computer Science University of Oklahoma. Email: atiq@ieee.org Web: www.cs.ou.edu/~atiq
More informationTCP-Peach and FACK/SACK Options: Putting The Pieces Together
TCP-Peach and FACK/SACK Options: Putting The Pieces Together Giacomo Morabito, Renato Narcisi, Sergio Palazzo, Antonio Pantò Dipartimento di Ingegneria Informatica e delle Telecomunicazioni University
More informationCS 640 Introduction to Computer Networks Spring 2009
CS 640 Introduction to Computer Networks Spring 2009 http://pages.cs.wisc.edu/~suman/courses/wiki/doku.php?id=640-spring2009 Programming Assignment 3: Transmission Control Protocol Assigned: March 26,
More informationECE 435 Network Engineering Lecture 10
ECE 435 Network Engineering Lecture 10 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 28 September 2017 Announcements HW#4 was due HW#5 will be posted. midterm/fall break You
More informationTCP Flavors Simulation Evaluations over Noisy Environment
International Journal of Information Engineering and Applications 2018; 1(1): 11-17 http://www.aascit.org/journal/information TCP Flavors Simulation Evaluations over Noisy Environment Elsadig Gamaleldeen
More informationA New Path Failure Detection Method for Multi-homed Transport Layer Protocol
ICN 211 : The Tenth International Conference on Networks A New Path Failure Detection Method for Multi-homed Transport Layer Protocol Sinda Boussen, Nabil Tabbane and Sami Tabbane Research Unit MEDIATRON
More informationSCTP: An innovative transport layer protocol for the web
SCTP: An innovative transport layer protocol for the web (Position paper) P. Natarajan, J. Iyengar, P. Amer, & R. Stewart 1 HTTP over TCP Transmission Control Protocol (TCP) has been the default transport
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 informationTransmission Control Protocol (TCP)
TETCOS Transmission Control Protocol (TCP) Comparison of TCP Congestion Control Algorithms using NetSim @2017 Tetcos. This document is protected by copyright, all rights reserved Table of Contents 1. Abstract....
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 informationCost Analysis of Mobility Management Entities for SIGMA
010 International Conference on High Performance Switching and Routing Cost Analysis of Mobility Management Entities for SIGMA Md. Shohrab Hossain Mohammed Atiquzzaman University of Oklahoma, Norman, OK
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 informationTCP Congestion Control
1 TCP Congestion Control Onwutalobi, Anthony Claret Department of Computer Science University of Helsinki, Helsinki Finland onwutalo@cs.helsinki.fi Abstract This paper is aimed to discuss congestion control
More informationTCP congestion control:
TCP congestion control: Probing for usable bandwidth: Ideally: transmit as fast as possible (cwnd as large as possible) without loss Increase cwnd until loss (congestion) Loss: decrease cwnd, then begin
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 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 informationReceiver-initiated Sending-rate Control based on Data Receive Rate for Ad Hoc Networks connected to Internet
Receiver-initiated Sending-rate Control based on Data Receive Rate for Ad Hoc Networks connected to Internet Akihisa Kojima and Susumu Ishihara Graduate School of Engineering, Shizuoka University Graduate
More informationPage 1. Review: Internet Protocol Stack. Transport Layer Services. Design Issue EEC173B/ECS152C. Review: TCP
EEC7B/ECS5C Review: Internet Protocol Stack Review: TCP Application Telnet FTP HTTP Transport Network Link Physical bits on wire TCP LAN IP UDP Packet radio Transport Layer Services Design Issue Underlying
More informationEffect 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 informationFILE TRANSFER IN FCS NETWORKS USING TRANSPORT LAYER MULTISTREAMING*
FILE TRANSFER IN FCS NETWORKS USING TRANSPORT LAYER MULTISTREAMING* Sourabh Ladha, Paul D. Amer, Janardhan Iyengar, Armando L. Caro Jr. Protocol Engineering Lab Computer and Information Sciences University
More informationISSN: Index Terms Wireless networks, non - congestion events, packet reordering, spurious timeouts, reduce retransmissions.
ISSN:2320-0790 A New TCP Algorithm to reduce the number of retransmissions in Wireless Networks A Beulah, R Nita Marie Ann Assistant Professsor, SSN College of Engineering, Chennai PG Scholar, SSN College
More informationCSCD 330 Network Programming
CSCD 330 Network Programming Lecture 10 Transport Layer Continued Spring 2018 Reading: Chapter 3 Some Material in these slides from J.F Kurose and K.W. Ross All material copyright 1996-2007 1 Last Time.
More informationPage 1. Review: Internet Protocol Stack. Transport Layer Services EEC173B/ECS152C. Review: TCP. Transport Layer: Connectionless Service
EEC7B/ECS5C Review: Internet Protocol Stack Review: TCP Application Telnet FTP HTTP Transport Network Link Physical bits on wire TCP LAN IP UDP Packet radio Do you remember the various mechanisms we have
More informationTCP and Congestion Control (Day 1) Yoshifumi Nishida Sony Computer Science Labs, Inc. Today's Lecture
TCP and Congestion Control (Day 1) Yoshifumi Nishida nishida@csl.sony.co.jp Sony Computer Science Labs, Inc 1 Today's Lecture Part1: TCP concept Part2: TCP detailed mechanisms Part3: Tools for TCP 2 1
More informationCSE 4215/5431: Mobile Communications Winter Suprakash Datta
CSE 4215/5431: Mobile Communications Winter 2013 Suprakash Datta datta@cse.yorku.ca Office: CSEB 3043 Phone: 416-736-2100 ext 77875 Course page: http://www.cse.yorku.ca/course/4215 Some slides are adapted
More informationECS-087: Mobile Computing
ECS-087: Mobile Computing TCP over wireless TCP and mobility Most of the Slides borrowed from Prof. Sridhar Iyer s lecture IIT Bombay Diwakar Yagyasen 1 Effect of Mobility on Protocol Stack Application:
More informationimage 3.8 KB Figure 1.6: Example Web Page
image. KB image 1 KB Figure 1.: Example Web Page and is buffered at a router, it must wait for all previously queued packets to be transmitted first. The longer the queue (i.e., the more packets in the
More informationNo book chapter for this topic! Slides are posted online as usual Homework: Will be posted online Due 12/6
Announcements No book chapter for this topic! Slides are posted online as usual Homework: Will be posted online Due 12/6 Copyright c 2002 2017 UMaine School of Computing and Information S 1 / 33 COS 140:
More informationReliable 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 informationTCP Enhancements in Linux. Pasi Sarolahti. Berkeley Summer School Outline
TCP Enhancements in Linux Pasi Sarolahti Berkeley Summer School 6.6.2002 Outline TCP details per IETF RFC s Pitfalls in the specifications Linux TCP congestion control engine Features Discussion on performance
More informationImproving Reliable Transport and Handoff Performance in Cellular Wireless Networks
Improving Reliable Transport and Handoff Performance in Cellular Wireless Networks H. Balakrishnan, S. Seshan, and R. H. Katz ACM Wireless Networks Vol. 1, No. 4, pp. 469-482 Dec. 1995 P. 1 Introduction
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 informationStudy of TCP Variants Compression on Congestion Window and Algorithms in Dynamic Environment
Vol.2, Issue.3, May-June 2012 pp-1039-1045 ISSN: 2249-6645 Study of TCP Variants Compression on Congestion Window and Algorithms in Dynamic Environment er.nishant2012@gmail.com Nishant Chaurasia M.Tech
More informationF-RTO: An Enhanced Recovery Algorithm for TCP Retransmission Timeouts
F-RTO: An Enhanced Recovery Algorithm for TCP Retransmission Timeouts Pasi Sarolahti Nokia Research Center pasi.sarolahti@nokia.com Markku Kojo, Kimmo Raatikainen University of Helsinki Department of Computer
More informationTSIN02 - Internetworking
Lecture 5: SCTP Litterature: RFC3257 SCTP Applicability Statement RFC3286 Introduction to SCTP Forouzan 3 rd ed, Chapter 13 (optional) RFC2960 (optional extra material) RFC3309 (optional extra material)
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 informationcs/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 informationTCP Service Model. Today s Lecture. TCP Support for Reliable Delivery. EE 122:TCP, Connection Setup, Reliability
Today s Lecture How does TCP achieve correct operation? EE 122:TCP, Connection Setup, Reliability Ion Stoica TAs: Junda Liu, DK Moon, David Zats Reliability in the face of IP s best effort service 3-way
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 informationLecture 08: The Transport Layer (Part 2) The Transport Layer Protocol (TCP) Dr. Anis Koubaa
NET 331 Computer Networks Lecture 08: The Transport Layer (Part 2) The Transport Layer Protocol (TCP) Dr. Anis Koubaa Reformatted slides from textbook Computer Networking a top-down appraoch, Fifth Edition
More informationInternet Applications and the Application Layer Material from Kurose and Ross, Chapter 2: The Application Layer
Midterm Study Sheet Below is a list of topics that will be covered on the midterm exam. Some topics may have summaries to clarify the coverage of the topic during the lecture. Disclaimer: the list may
More informationOutline 9.2. TCP for 2.5G/3G wireless
Transport layer 9.1 Outline Motivation, TCP-mechanisms Classical approaches (Indirect TCP, Snooping TCP, Mobile TCP) PEPs in general Additional optimizations (Fast retransmit/recovery, Transmission freezing,
More informationNetworked Systems and Services, Fall 2018 Chapter 3
Networked Systems and Services, Fall 2018 Chapter 3 Jussi Kangasharju Markku Kojo Lea Kutvonen 4. Transport Layer Reliability with TCP Transmission Control Protocol (TCP) RFC 793 + more than hundred other
More informationCS132/EECS148 - Instructor: Karim El Defrawy Midterm Spring 2013 Time: 1hour May 2nd, 2013
CS132/EECS148 - Instructor: Karim El Defrawy Midterm Spring 2013 : 1hour May 2nd, 2013 Total Points: 25 Attempt all problems. Problem #1: (5 points, ½ point each) Choose only one answer. You will not receive
More informationAn Extension to the Selective Acknowledgement (SACK) Option for TCP
Network Working Group Request for Comments: 2883 Category: Standards Track S. Floyd ACIRI J. Mahdavi Novell M. Mathis Pittsburgh Supercomputing Center M. Podolsky UC Berkeley July 2000 An Extension to
More informationOutline. CS5984 Mobile Computing
CS5984 Mobile Computing Dr. Ayman Abdel-Hamid Computer Science Department Virginia Tech Outline Review Transmission Control Protocol (TCP) Based on Behrouz Forouzan, Data Communications and Networking,
More informationMULTIHOMING AND MULTISTREAM PROTOCOL IN COMPUTER NETWORKS
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 3, March 2014,
More information