Simulation of TCP for Orbiting Spacecraft Through the TDRS Satellite System
|
|
- Gwendolyn Rodgers
- 6 years ago
- Views:
Transcription
1 1 Simulation of TCP for Orbiting Spacecraft Through the TDRS Satellite System Marco Duarte, Ken Fisher, Abdul Kabbani Rice University {duarte, krfisher, Abstract In recent years NASA engineers have designed an interface system that connects the Space Shuttle and Space Station communication system to the Internet on Earth. Such a system allows for the astronauts to use services like the World Wide Web and Electronic Mail. This application provides a scenario with unique latency and throughput parameters that the standard TCP/IP protocol was not designed for. We discuss the changes to the TCP protocol for acceptable performance in this scenario. Simulations of the behavior of the modified TCP protocol over the Space Station or Space Shuttle links are performed using ns 2. This paper describes the method and results of those simulations. I. INTRODUCTION In recent years NASA engineers have found a way to connect the Space Shuttle and Space Station communication system to the Internet. This was accomplished by first designing an interface card that looks like an Ethernet adaptor to the PC, but sends data signals compatible with the existing Ku- Band communication system already present on the Shuttle and Station. These communication systems were designed from 197 s and 198 s technology and were never designed for computer networking of any kind. Since the distance through the satellite relay link is on the order of 5, miles, the TCP protocol needed to be modified, particularly in the way that the congestion control mechanisms are implemented. Once this was accomplished, the astronauts were able to use TCP to surf the Internet and send anywhere on the Internet. The performance of the network link will be adversely affected by the increased propagation delay. The delay will be varied depending on the position of the craft in its orbit in relation to the geostationary relay satellite. The roundtrip delays will be on the order of 1-2 seconds. The RF signal must travel from the orbiter, which is at an altitude of 1 to 2 miles, to the relay satellite (located at an altitude of about 22,3 miles) then down to the ground station in White Sands, New Mexico. From there, the signal must be relayed to the NASA mission control center in Houston. Our simulation does not include the trip from the ground station to Houston, but only from the mobile orbiter through TDRS (Tracking and Data Relay Satellite) to the ground station. In order to provide greater connectivity during one complete orbit, the communication system requires east and west satellites and the implementation of handovers between the two. Each satellite must maintain line of sight to the ground station. Therefore, they are positioned approximately 12 to 13 degrees apart in geostationary orbits around the Equator. As a result, there is also a zone of exclusion on the opposite side of the Earth, since the range of these satellites will not cover the Equator completely. In our simulations we use ns [1] to determine a maximum theoretical data rate through the link based on a data rate of 2 Mbps and a packet size of 512 bytes. We observed a variation in this rate using TCP based on the position of the orbiter around its orbit and also measured the actual latency using CBR packets. We also observe the behavior during the east to west satellite handover and going into, during, and coming out of the zone of exclusion. The system is being used currently by NASA, and we expect that the obtained simulation data will be useful for the enhancement and development of communication systems for future Spacecraft. The paper is organized as follows. Section II describes our implementation of the scenario for the simulation. Section III describes the necessary changes made to the ns 2 simulator. Section IV presents our simulation results and Section V offers conclusions.
2 2 Fig. 1. Graphic 3-D depiction of the simulation scenario. II. IMPLEMENTATION In order to accomplish this simulation, we first developed a program to model the position of the nodes in xyz space. This program is a modification of a graphics program that was developed for a previous project. The program allows us to set up objects such as a sphere (representing the Earth) a circle (representing the orbit), and points in space (representing the relay satellites) and then draw a graphic of them like the one shown in Figure 1. The graphic shows the Earth and the two TDRS satellites with solid rays drawn to the ground station on the Z axis (actually used as the Y axis in ns). One satellite looks like it is at a higher altitude, but that is just an illusion created by the viewing reference point. The orbiter is positioned on its initial point on the X axis. The orbit circle cannot be seen in this picture because it is so close to the Earth (2 miles) compared to the altitude of the satellites (22,3 miles). At each increment the orbiter takes around its orbit, the program determines if each satellite is in line-of-sight. This is depicted on the graphic by drawing a solid line to the satellite if it s in lineoff-sight, and drawing a dotted line if it is not in line-of-sight. The program is run off-line and generates.tcl script commands that will place the node in a specific position at a simulation time t. The program will generate a file with commands in the following format: $ns at t1 "$node (3) setdest x1 y " ;#LOS1:1 LOS2: These can be incorporated into the main.tcl script to simulate the orbit around the earth. The off-line program also sets flags to indicate if the orbiter has line of sight to the relay satellites or not. This is printed as a comment with LOS1:1 indicating that there is line-of-sight to satellite 1 and LOS2: indicating that there is not line-ofsight to satellite 2. The number is the velocity of the orbiter in meters per second. This corresponds to a velocity of 17,5 miles/hr, which is the approximate velocity of the obiter for a 9 minute orbit. We set the increment to be 1 minute, so we generate 9 setdest commands per orbit. We also modified the ns-2 source code to allow longer propagation delays and longer ranges. This required modifications to both the TCP protocol implementation and the physical wireless channel implementation. In our problem, we assume that the communication link is in range as long as there is line-of-sight. We also assume no interference between the relaying satellites. We then implement the positioning of objects in wireless scenarios in order to simulate the effect of the line-of-sight loss between the orbiter and the satellite due to the Earth. For our case, the obstruction object type is a sphere. We also implement the handoff between relaying satellites manually using a static routine table. The routing is changed based on the simulation time. These times are determined by the LOS1 and LOS2 flags that are calculated on the off-line program. III. SIMULATOR MODIFICATIONS In this section we describe the changes made to the ns simulator for our scenario. These changes can be grouped into changes to the routing protocol, changes to the physical layer, changes to the MAC protocol, changes to the TCP protocol A. Routing Protocol For our project, we assumed the satellites to be using DSR only for the simplicity of using DSR for implementing a static routing protocol as far as our simulations are concerned. We had the same functions inside the DSRAgent class unchanged, with the exception of the rcv function. This is the function that handles the static routing scheme that we have for our project. This was implemented
3 3 by introducing a couple of nested if statements that can handle the different combinations of the current node, the destination node, and the reachability status (in terms of time) when this might be an involved factor. The reachability status was implemented in terms of time only because of the path predictability for our shuttle s motion, i.e., because of its periodicity. Just before proceeding, we are going to define the node numbers that we used in our function: Node : Earth Station in White Sands, New Mexico Node; Node 1: TDRS Satellite West Node; Node 2: TDRS Satellite East; Node 3: Orbiter. We saw that nodes, 1, and 2 are supposed to be able to communicate with each other always no matter where our orbiter s position is (i.e., irrespective of time). Note that we don t need to have all what we had in our actual code below for other nonexistent paths as far as our project is concerned (for example between nodes and 2 or 1 and 2), nevertheless, we had that just for completeness. The parts in our code corresponding to what has been mentioned are shown below where iph->daddr() is the address of the destination node, and cmh->next hop() is the node to which we want or are supposed to forward to: For node if (iph->daddr() == 1){ cmh->next hop() = 1; else if(iph->daddr() == 2){ cmh->next hop() = 2; For node 1 if (iph->daddr() == ){ cmh->next hop() = ; else if(iph->daddr() == 2){ cmh->next hop() = ; For node 2 if (iph->daddr() == ){ cmh->next hop() = ; else if(iph->daddr() == 1){ cmh->next hop() = ; For node 3 // All routes are time-dependent On the other hand, and when the time factor is involved (i.e., when the path between either one of the satellites and the shuttle is involved), we had the periodicity of the connections (in terms of the handover procedures and the blockage) by taking our time modulo the orbit period (equal to 54 seconds). Whenever one node was not supposed to be in reach of another one while carrying a packet destined to it, that node would drop that packet. Using the line of sight calculations from the offline program described earlier, we found out that during the intervals [, 87] and [351, 54] the orbiter would be in line of sight with TDRS Satellite East; during the interval [171, 447] the orbiter would be in line of sight with TDRS Satellite West; and therefore during the interval [87, 171] we will have the zone of exclusion. Therefore, the interval [351,447] is the overlap period when the orbiter has simultaneous line of sight to both satellites. We define in our source code for the routing protocol the times when line of sight begins and ends: #define SAT1 START 171 #define SAT1 STOP 447 #define SAT2 START 351 #define SAT2 STOP 87 On the other hand, we can have the handover from TDRS Satellite West to Satellite East at any time during the overlap period ([351,447]). We can set up the TDRS Satellite West to acquire the signal when the orbiter comes out of the zone of exclusion at any time during the zone of exclusion period ([87, 171]). We set up the handovers to occur at the middle of each time range. This assures optimal throughput behavior as described in Section IV. The code that defines the handover time is as shown below: hand21 = ((int)sat2 STOP + (int)sat1 START) / 2; hand12 = ((int)sat1 STOP + (int)sat2 START) / 2; The source code that implements our static routing tables is shown in Figure 2 where iph->daddr() and cmh->next hop are the same as defined before. B. Physical Layer We assume that as long as line of sight exists between two nodes, the signal will be received
4 4 Fig. 2. Source code for the static routing table.
5 5 correctly; the satellites are positioned so that they always have line of sight to the earth station, while the line of sight from the orbiter to the satellites is dependent to its position in the orbit. In addition, we assume that the nodes will always send packets at sufficient high power for the destination to detect and decode the packet successfully. To account for the huge distances involved, we set the receive power threshold to zero to ensure that the packet is accepted at the receiver despite the transmission power levels used in the simulator. C. MAC Protocol In our scenario, due to its physical configuration, the connections between nodes are point-to-point, and thus no channel access arbitration is required. Thus, we used the generic MAC layer available in the simulator for our case, which passes the packets to the next layer with no processing. This allows for all senders to have continuous access to the transmission channel without any need for access control. D. TCP Protocol Based on the transmission distances involved, our round trip times vary from.52 sec to.62 sec. This special characteristic of our scenario led us to consider changes in some of the parameters of a TCP connection; specifically, the parameters relevant to the congestion control mechanism (RTT estimate, congestion window size, etc.). We expected that setting the initial RTT estimate to our projected value would improve throughput at the beginning of the simulation due to the exponential weighted averaging algorithm to estimate RTT in TCP; we found that it did not affect the performance of the scenario since the first calculation of the RTT is drawn from the actual round trip time delay for the synchronization packet sent at the initialization of the TCP connection. Another parameter that affects the throughput and is sensitive to the round trip time of the communication is the congestion window size. The optimal maximum size is equal to the amount of packets that can be in flight during a round trip time; this will allow for full utilization of the channel bandwidth while an acknowledgement is received by the sender. In the NS simulator, the original value of this parameter was very low for our scenario (4 packets). We estimate the number of packets N that can be sent during a round trip time as follows: N = RT T BW/P SIZE = /(8 512) 254 (1) The throughput then will not be constrained by the maximum congestion window size if its value is set larger than 254; we set it to 4 for our simulations. We proceed to consider the effect of the initial congestion window size; we expected the throughput to increase if the initial congestion window size is set to the maximum instead of the default value of 1. We then considered that since the window size is doubled every round trip time, the calculated maximum value for the congestion window should be reached in approximately 8 RT T = 4.16 seconds. Thus, the throughput will improve only for a very small section of the orbit period. IV. RESULTS We perform simulations for a FTP application that originates at the orbiter and ends at the earth station. Our simulator follows all the modifications described previously; our main design space considerations are the timing of the handover between the two relaying satellites. We first evaluate the performance of the TCP protocol for this application using all the enhancements described earlier, and setting the handover times to the middle point of the permissible ranges. We evaluate the throughput of the connection in packets per second; the results are shown in Figure 3. We observe that the throughput per second increases up to 225 packets per second, which is equivalent to 9 kbps. We observe no throughput period during the zone of exclusion period ( seconds), which is expected. However, we observe a limited throughput phenomenon right after the acquisition of line of sight for Satellite 1 (at 171 seconds) and after the satellite handoff (at 399 seconds). We explored several different possible reasons for this behavior. To test the correctness of the physical and link layers, we simulated a CBR connection over our same scenario to test packet reachability and propagation delay. The round trip time results are shown in Figure 4; the throughput is shown in Figure 5.
6 6 3 Congestion Window Size, Packets Throughput, packets per second Fig Fig. 6. Congestion window of TCP connection for standard settings. Throughput for TCP connection for standard settings..56 Round Trip Fig Round Trip Time for CBR traffic for standard settings. 45 Throughput, Packets per Second Fig Throughput for CBR traffic for standard settings. 6 These figures show an expected behavior for the latency of packet transmission, which varies according to the position of the active satellite. We see that the throughput to the satellite is stable, which shows that the characteristics of the channel are not dependent on the position of the satellite. This allows us to rule out simulation bugs in the physical and link layers. We also notice that the reduction in throughput occurs only during the period where the distance from the orbiter to the active satellite and thus, the RTT is decreasing. At the approximate point of minimum latency the expected throughput is restored, and the throughput oscillates continuously between 1 and 225 packets per second. After examining the simulator traces, we see that packet drops occur only during the zone of exclusion; thus, we assume that the reduction in rate is due to congestion window resetting due to duplicate ACKs or retransmission timeout. Figure 6 shows the size of the congestion window and Figure 7 shows the number of duplicate ACKs received by the orbiter as a function of time. From this data we see that the throughput falls repeatedly during the simulation due to the duplicate ACKs caused when a packet is sent out of order. We also see a frequent occurrence of three duplicate ACKs during the periods of low throughput. The reason behind this behavior is unknown to us at this point. We conjecture that out of order reception of packets has a large effect on the congestion control mechanism due to the large latency of a round trip time.
7 Number of consecutive duplicate ACKs Throughput, packets per second Fig. 7. Number of duplicate ACKs for standard settings. Fig. 9. Throughput for TCP connection for maximum handoff times. Throughput, packets per second Round Trip Fig. 8. Throughput for TCP connection for minimum handoff times. Fig. 1. Round trip time for minimum handoff times. We also evaluate the effect of the satellite handover time on the throughput. We can set one of the handovers to any time during the zone of exclusion; the second one can be set to any time during the period when the orbiter has line of sight with both relaying satellites. Figure 8 shows the throughput when the handovers times are set to the minimum possible values, while Figure 9 shows the throughput when the handover times are set to the maximum possible values. We expect both of these schemes to perform worse than the selected scheme due to the sudden changes in round trip time. The round trip time for the second scheme is shown in Figure 1; the change in round trip time during handoff is propor- tional to the change of distance between the orbiter and the satellites. The problem is critical when the round trip time increases suddenly, triggering several timeouts and retransmissions. Furthermore, a new problem arises if the handover time is set to the maximum for the second handover. The packets that are sent to the satellite by the earth station close to the end of line of sight may be received by it after the line of sight is not present, and they will thus be dropped, causing reduction in the throughput as seen in Figure 9. This leads to our reasoning of performing handover at the middle of the feasible interval, where the distance to each of the satellites from the orbiter will be the same.
8 8 V. CONCLUSIONS AND FUTURE WORK We have modeled the Internet connection of the Space Shuttle and Space Station using the ns 2 simulator, and studied its behavior for typical TCP applications. Some unexpected behavior was observed regarding out-of-order transmission of packets, but theoretical figures for the performance of the system were obtained. We have not been able to determine whether this behavior is inherent to the behavior of TCP for our scenario or is introduced by errors in the modified simulator. If the former is the case, we expect that a mechanism at the TCP protocol that would delay acknowledgements for some packets that are delivered out of order would allow us to reach the optimal throughput level throughout the simulation period. We have concluded that handoff should occur at the middle point of the overlap of line of sights to cause the smallest disturbance possible to the congestion control mechanism state. We have also concluded that a large part of the loss in potential performance is due to the effect of the congestion control mechanism during the zone of exclusion, in which no communication is possible. Since the orbit cycle of the orbiter is ninety minutes, applications that would require continuous connectivity for a larger interval will suffer. We expect that mechanisms similar to [2] that set the TCP connection to stand-by state during periods without connectivity, which was proposed for ad-hoc wireless networks, should improve the performance in this scenario as well. We remain interested in determining the reasons behind the erratic behavior observed in the simulations, and would welcome suggestions regarding these issues. VI. ACKNOWLEDGEMENTS We thank Shu Du and Khoa To for their invaluable suggestions regarding the implementation of the handoff schemes. REFERENCES [1] (24) The network simulator - ns-2. [Online]. Available: [2] G. Holland and N. Vaidya, Analysis of TCP performance over mobile ad hoc networks, in Proceedings of the Fifth Annual International Conference on Mobile Computing and Networking (MOBICOM), Seattle, WA, August 1999.
Wireless TCP Performance Issues
Wireless TCP Performance Issues Issues, transport layer protocols Set up and maintain end-to-end connections Reliable end-to-end delivery of data Flow control Congestion control Udp? Assume TCP for the
More informationRouting Protocols in MANETs
Chapter 4 Routing Protocols in MANETs 4.1 Introduction The main aim of any Ad Hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an
More informationTCP Strategies. Keepalive Timer. implementations do not have it as it is occasionally regarded as controversial. between source and destination
Keepalive Timer! Yet another timer in TCP is the keepalive! This one is not required, and some implementations do not have it as it is occasionally regarded as controversial! When a TCP connection is idle
More information3. Evaluation of Selected Tree and Mesh based Routing Protocols
33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in
More informationChapter 7 CONCLUSION
97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in
More informationCIS 632 / EEC 687 Mobile Computing
CIS 632 / EEC 687 Mobile Computing TCP in Mobile Networks Prof. Chansu Yu Contents Physical layer issues Communication frequency Signal propagation Modulation and Demodulation Channel access issues Multiple
More informationWITH the evolution and popularity of wireless devices,
Network Coding with Wait Time Insertion and Configuration for TCP Communication in Wireless Multi-hop Networks Eiji Takimoto, Shuhei Aketa, Shoichi Saito, and Koichi Mouri Abstract In TCP communication
More informationPRACTICE QUESTIONS ON RESOURCE ALLOCATION
PRACTICE QUESTIONS ON RESOURCE ALLOCATION QUESTION : Internet Versus Station Wagon A famous maxim, sometimes attributed to Dennis Ritchie, says Never underestimate the bandwidth of a station wagon full
More informationTCP over ad hoc networks
TCP over ad hoc networks Ad Hoc Networks will have to be interfaced with the Internet. As such backward compatibility is a big issue. One might expect that the TCP/IP suite of protocols be applicable to
More informationTCP 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 informationTCP 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 informationPerformance Evaluation of TCP Westwood. Summary
Summary This project looks at a fairly new Transmission Control Protocol flavour, TCP Westwood and aims to investigate how this flavour of TCP differs from other flavours of the protocol, especially TCP
More informationTCP WITH FASTER RECOVERY. Claudio Casetti Mario Gerla Scott Seongwook Lee Saverio Mascolo Medy Sanadidi
TCP WITH FASTER RECOVERY Claudio Casetti Mario Gerla Scott Seongwook Lee Saverio Mascolo Medy Sanadidi Computer Science Department University of California, Los Angeles, USA ABSTRACT Among the problems
More informationTRANSMISSION 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 informationCS 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 informationProblem 7. Problem 8. Problem 9
Problem 7 To best answer this question, consider why we needed sequence numbers in the first place. We saw that the sender needs sequence numbers so that the receiver can tell if a data packet is a duplicate
More information6.033 Spring 2015 Lecture #11: Transport Layer Congestion Control Hari Balakrishnan Scribed by Qian Long
6.033 Spring 2015 Lecture #11: Transport Layer Congestion Control Hari Balakrishnan Scribed by Qian Long Please read Chapter 19 of the 6.02 book for background, especially on acknowledgments (ACKs), timers,
More informationEE 122 Fall st Midterm. Professor: Lai Stoica
EE 122 Fall 2001 1 st Midterm Professor: Lai Stoica Question 1 (15 pt) Layering is a key design principle in computer networks. Name two advantages, and one disadvantage to layering. Explain. Use no more
More informationCSCI 466 Midterm Networks Fall 2011
CSCI 466 Midterm Networks Fall 2011 Name: This exam consists of 7 problems on the following 9 pages. You may use your single- sided hand- written 8 ½ x 11 note sheet and a calculator during the exam. No
More informationTCP over Wireless PROF. MICHAEL TSAI 2016/6/3
TCP over Wireless PROF. MICHAEL TSAI 2016/6/3 2 TCP Congestion Control (TCP Tahoe) Only ACK correctly received packets Congestion Window Size: Maximum number of bytes that can be sent without receiving
More informationWireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 25: Wireless Networking
Wireless Challenges 15-441: Computer Networking Lecture 25: Wireless Networking Force us to rethink many assumptions Need to share airwaves rather than wire Don t know what hosts are involved Host may
More informationImproving TCP End to End Performance in Wireless LANs with Snoop Protocol
Improving TCP End to End Performance in Wireless LANs with Snoop Protocol Dejan Jaksic, Zeljko Ilic and Alen Bazant Department of Telecommunications, Faculty of Electrical Engineering and Computing Unska
More informationReview: Performance Evaluation of TCP Congestion Control Mechanisms Using Random-Way-Point Mobility Model
Review: Performance Evaluation of TCP Congestion Control Mechanisms Using Random-Way-Point Mobility Model Rakesh K Scholar (M.Tech) The Oxford College of Engineering Bangalore Mrs. Kalaiselvi Asst. Prof,
More informationECE 610: Homework 4 Problems are taken from Kurose and Ross.
ECE 610: Homework 4 Problems are taken from Kurose and Ross. Problem 1: Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes up through byte 248. Suppose
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 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 information8. 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 informationPerformance Enhancement Of TCP For Wireless Network
P a g e 32 Vol. 10 Issue 12 (Ver. 1.0) October 2010 Global Journal of Computer Science and Technology Performance Enhancement Of TCP For Wireless Network 1 Pranab Kumar Dhar, 2 Mohammad Ibrahim Khan, 3
More informationECEN Final Exam Fall Instructor: Srinivas Shakkottai
ECEN 424 - Final Exam Fall 2013 Instructor: Srinivas Shakkottai NAME: Problem maximum points your points Problem 1 10 Problem 2 10 Problem 3 20 Problem 4 20 Problem 5 20 Problem 6 20 total 100 1 2 Midterm
More informationImproving 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 informationTo see the details of TCP (Transmission Control Protocol). TCP is the main transport layer protocol used in the Internet.
Lab Exercise TCP Objective To see the details of TCP (Transmission Control Protocol). TCP is the main transport layer protocol used in the Internet. The trace file is here: https://kevincurran.org/com320/labs/wireshark/trace-tcp.pcap
More informationLecture - 36 Effect on Higher Layer I
Satellite Communication Systems Prof. Kalyan Kumar Bandyopadhyay Department of Electronics and Electrical Communication Engineering Indian Institute of Technology, Kharagpur Lecture - 36 Effect on Higher
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 informationPERFORMANCE EVALUATION OF TCP OVER ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS
PERFORMANCE EVALUATION OF TCP OVER ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS Md. Abdullah-Al-Mamun, M. Mahbubur Rahman Department of Information and Communication Engineering Islamic University Kushtia
More informationFINAL May 21, minutes
CS 421: COMPUTER NETWORKS SPRING 2004 FINAL May 21, 2004 160 minutes Name: Student No: 1) a) Consider a 1 Mbits/sec channel with a 20 msec one-way propagation delay, i.e., 40 msec roundtrip delay. We want
More informationHigh Level View. EE 122: Ethernet and Random Access protocols. Medium Access Protocols
High Level View EE 122: Ethernet and 802.11 Ion Stoica September 18, 2002 Goal: share a communication medium among multiple hosts connected to it Problem: arbitrate between connected hosts Solution goals:
More informationc) 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 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 informationPerformance Of Common Data Communications Protocols Over Long Delay Links An Experimental Examination 1. Introduction
Performance Of Common Data Communications Protocols Over Long Delay Links An Experimental Examination Hans Kruse McClure School of Communication Systems Management Ohio University 9 S. College Street Athens,
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 informationThere are 10 questions in total. Please write your SID on each page.
Name: SID: Department of EECS - University of California at Berkeley EECS122 - Introduction to Communication Networks - Spring 2005 to the Final: 5/20/2005 There are 10 questions in total. Please write
More informationChapter 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 informationTCP. 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 informationImproving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness Xin Yu Department of Computer Science Courant Institute of Mathematical Sciences New York University,
More informationCERIAS Tech Report A Simulation Study on Multi-Rate Mobile Ad Hoc Networks by G Ding, X Wu, B Bhar Center for Education and Research
CERIAS Tech Report 2004-115 A Simulation Study on Multi-Rate Mobile Ad Hoc Networks by G Ding, X Wu, B Bhar Center for Education and Research Information Assurance and Security Purdue University, West
More informationNET ID. CS519, Prelim (March 17, 2004) NAME: You have 50 minutes to complete the test. 1/17
CS519, Prelim (March 17, 2004) NAME: You have 50 minutes to complete the test. 1/17 Q1. 2 points Write your NET ID at the top of every page of this test. Q2. X points Name 3 advantages of a circuit network
More informationPoonam kori et al. / International Journal on Computer Science and Engineering (IJCSE)
An Effect of Route Caching Scheme in DSR for Vehicular Adhoc Networks Poonam kori, Dr. Sanjeev Sharma School Of Information Technology, RGPV BHOPAL, INDIA E-mail: Poonam.kori@gmail.com Abstract - Routing
More informationPERFORMANCE COMPARISON OF THE DIFFERENT STREAMS IN A TCP BOTTLENECK LINK IN THE PRESENCE OF BACKGROUND TRAFFIC IN A DATA CENTER
PERFORMANCE COMPARISON OF THE DIFFERENT STREAMS IN A TCP BOTTLENECK LINK IN THE PRESENCE OF BACKGROUND TRAFFIC IN A DATA CENTER Vilma Tomço, 1 Aleksandër Xhuvani 2 Abstract: The purpose of this work is
More informationSimulating satellite Internet performance on a small island
Simulating satellite Internet performance on a small island Ulrich Speidel Lei Qian Department of Computer Science August 2018 Fibre connectivity in the Pacific From: www.submarinecablemap.com Fibre connectivity
More informationDepartment of EECS - University of California at Berkeley EECS122 - Introduction to Communication Networks - Spring 2005 Final: 5/20/2005
Name: SID: Department of EECS - University of California at Berkeley EECS122 - Introduction to Communication Networks - Spring 2005 Final: 5/20/2005 There are 10 questions in total. Please write your SID
More informationCongestion control in TCP
Congestion control in TCP If the transport entities on many machines send too many packets into the network too quickly, the network will become congested, with performance degraded as packets are delayed
More informationExamining Mobile-IP Performance in Rapidly Mobile Environments: The Case of a Commuter Train.
Examining Mobile-IP Performance in Rapidly Mobile Environments: The Case of a Commuter Train. Edwin Hernandez and Abdelsalam (Sumi) Helal Department of Computer and Information Science and Engineering
More informationTransport 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 informationEE 122: Ethernet and
EE 122: Ethernet and 802.11 Ion Stoica September 18, 2002 (* this talk is based in part on the on-line slides of J. Kurose & K. Rose) High Level View Goal: share a communication medium among multiple hosts
More informationECE 653: Computer Networks Mid Term Exam all
ECE 6: Computer Networks Mid Term Exam 16 November 004. Answer all questions. Always be sure to answer each question concisely but precisely! All questions have points each. 1. What are the different layers
More informationKing Fahd University of Petroleum and Minerals College of Computer Sciences and Engineering Department of Computer Engineering
Student Name: Section #: King Fahd University of Petroleum and Minerals College of Computer Sciences and Engineering Department of Computer Engineering COE 344 Computer Networks (T072) Final Exam Date
More informationSurvey Topic: WiFi On The Move Presented by - Abhinav Tekumalla (atekumal) Bahula Gupta (bahulag)
Outline Survey Topic: WiFi On The Move Presented by - Abhinav Tekumalla (atekumal) Bahula Gupta (bahulag) WiFi on the move : Challenges VanLAN ViFi Cabernet HSPDA/ WiMax WiFi on the move Providing WiFi
More informationStrengthening Unlicensed Band Wireless Backhaul
be in charge Strengthening Unlicensed Band Wireless Backhaul Use TDD/TDMA Based Channel Access Mechanism WHITE PAPER Strengthening Unlicensed Band Wireless Backhaul: Use TDD/TDMA Based Channel Access Mechanism
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 informationCross-layer TCP Performance Analysis in IEEE Vehicular Environments
24 Telfor Journal, Vol. 6, No. 1, 214. Cross-layer TCP Performance Analysis in IEEE 82.11 Vehicular Environments Toni Janevski, Senior Member, IEEE, and Ivan Petrov 1 Abstract In this paper we provide
More informationCHAPTER 5 PROPAGATION DELAY
98 CHAPTER 5 PROPAGATION DELAY Underwater wireless sensor networks deployed of sensor nodes with sensing, forwarding and processing abilities that operate in underwater. In this environment brought challenges,
More informationCOMP/ELEC 429/556 Introduction to Computer Networks
COMP/ELEC 429/556 Introduction to Computer Networks The TCP Protocol Some slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang T. S. Eugene Ng eugeneng at cs.rice.edu
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 informationAn Implementation of Cross Layer Approach to Improve TCP Performance in MANET
An Implementation of Cross Layer Approach to Improve TCP Performance in MANET 1 Rajat Sharma Pursuing M.tech(CSE) final year from USIT(GGSIPU), Dwarka, New Delhi E-mail address: rajatfit4it@gmail.com 2
More informationA Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver
1 A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver Jungmin So Dept. of Computer Science, and Coordinated Science Laboratory University of Illinois
More informationName Student ID Department/Year. Midterm Examination. Introduction to Computer Networks Class#: 901 E31110 Fall 2006
Name Student ID Department/Year Midterm Examination Introduction to Computer Networks Class#: 901 E31110 Fall 2006 9:20-11:00 Tuesday November 14, 2006 Prohibited 1. You are not allowed to write down the
More informationIssues of Long-Hop and Short-Hop Routing in Mobile Ad Hoc Networks: A Comprehensive Study
Issues of Long-Hop and Short-Hop Routing in Mobile Ad Hoc Networks: A Comprehensive Study M. Tarique, A. Hossain, R. Islam and C. Akram Hossain Dept. of Electrical and Electronic Engineering, American
More informationDelayed ACK Approach for TCP Performance Improvement for Ad Hoc Networks Using Chain Topology
Delayed ACK Approach for TCP Performance Improvement for Ad Hoc Networks Using Chain Topology Prashant Kumar Gupta M.Tech. Scholar, Computer Networks, Bhilai Institute of Technology, Durg (C.G.), India
More informationAnswers to Sample Questions on Transport Layer
Answers to Sample Questions on Transport Layer 1) Which protocol Go-Back-N or Selective-Repeat - makes more efficient use of network bandwidth? Why? Answer: Selective repeat makes more efficient use of
More informationICE 1332/0715 Mobile Computing (Summer, 2008)
ICE 1332/0715 Mobile Computing (Summer, 2008) TCP in Mobile Networks Prof. Chansu Yu http://academic.csuohio.edu/yuc/ c.yu91@csuohio.edu Contents Vinton Cerf and Robert Kahn s paper in 1973 introduces
More informationTelecommunication Services Engineering Lab. Roch H. Glitho
1 Congestion handling in wired TCP: Detailed treatment 1. - Fundamental assumptions and principles - Key parameters - Slow start - Congestion avoidance - Fast re-transmit and fast recovery 2 Fundamental
More informationCSE 473 Introduction to Computer Networks. Exam 2. Your name here: 11/7/2012
CSE 473 Introduction to Computer Networks Jon Turner Exam 2 Your name here: 11/7/2012 1. (10 points). The diagram at right shows a DHT with 16 nodes. Each node is labeled with the first value in its range
More informationSLE experience over unreliable network links
SLE experience over unreliable network links Ciprian Furtuna 1 and Carla Garcia 2 LSE Space GmbH, Argelsrieder Feld 22, 82234, Wessling, Germany Wilfried Kruse 3 Deutsches Zentrum für Luft und Raumfahrt
More informationName Student ID Department/Year. Midterm Examination. Introduction to Computer Networks Class#: 901 E31110 Fall 2012
Name Student ID Department/Year Midterm Examination Introduction to Computer Networks Class#: 901 E31110 Fall 2012 9:30-11:10 Thursday November 8, 2012 Prohibited 1. You are not allowed to write down the
More informationA THROUGHPUT ANALYSIS OF TCP IN ADHOC NETWORKS
A THROUGHPUT ANALYSIS OF TCP IN ADHOC NETWORKS S.P.Valli 1,K.M.Mehata 2 1 vallisp@yahoo.com Department of Computer Science and Engineering B.S.Abdur Rahman University,Chennai. 2 kmmehata@bsauniv.ac.in
More informationSLE experience over unreliable network links
SLE experience over unreliable network links Ciprian Furtuna 1 and Carla Garcia 2 LSE Space GmbH, Argelsrieder Feld 22, 82234, Wessling, Germany Wilfried Kruse 3 Deutsches Zentrum für Luft und Raumfahrt
More informationRandom Assignment Protocols
Random Assignment Protocols Random assignment strategies attempt to reduce problem occur in fixed assignment strategy by eliminating pre allocation of bandwidth to communicating nodes. Random assignment
More informationA Seamless Handover Mechanism for IEEE e Broadband Wireless Access
A Seamless Handover Mechanism for IEEE 802.16e Broadband Wireless Access Kyung-ah Kim 1, Chong-Kwon Kim 2, and Tongsok Kim 1 1 Marketing & Technology Lab., KT, Seoul, Republic of Korea {kka1, tongsok}@kt.co.kr
More informationMEASURING PERFORMANCE OF VARIANTS OF TCP CONGESTION CONTROL PROTOCOLS
MEASURING PERFORMANCE OF VARIANTS OF TCP CONGESTION CONTROL PROTOCOLS Harjinder Kaur CSE, GZSCCET, Dabwali Road, Bathinda, Punjab, India, sidhuharryab@gmail.com Gurpreet Singh Abstract CSE, GZSCCET, Dabwali
More informationUNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. INF3190/INF4190 Data Communications. All printed and written material, calculator
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in Day of examination: 2nd June, 2004 Examination hours: 9.00 12.00 This problem set consists of 6 pages. Appendices: Permitted
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 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 informationTRANSMISSION 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 informationHybrid 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 informationImpact of TCP Window Size on a File Transfer
Impact of TCP Window Size on a File Transfer Introduction This example shows how ACE diagnoses and visualizes application and network problems; it is not a step-by-step tutorial. If you have experience
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 informationa) Adding the two bytes gives Taking the one s complement gives
EE33- solutions for homework #3 (3 problems) Problem 3 Note, wrap around if overflow One's complement = To detect errors, the receiver adds the four words (the three original words and the checksum) If
More informationThe Geostationary Operational Satellite R Series (GOES-R) SpaceWire Implementation
The Geostationary Operational Satellite R Series (GOES-R) SpaceWire Implementation Session: SpaceWire Missions and Applications William H. Anderson NASA Goddard Space Flight Center/MEI Technologies E-mail:
More informationEE122 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 informationCS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP
CS 5520/ECE 5590NA: Network Architecture I Spring 2008 Lecture 13: UDP and TCP Most recent lectures discussed mechanisms to make better use of the IP address space, Internet control messages, and layering
More informationCS 421: COMPUTER NETWORKS FALL FINAL January 12, minutes
CS 421: COMPUTER NETWORKS FALL 2011 FINAL January 12, 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 informationHomework 3 1 DNS. A root. A com. A google.com
Homework 3 1 DNS Suppose you have a Host C, a local name server L, and authoritative name servers A root, A com, and A google.com, where the naming convention A x means that the name server knows about
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 informationENSC 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 informationCMSC 417. Computer Networks Prof. Ashok K Agrawala Ashok Agrawala. October 30, 2018
CMSC 417 Computer Networks Prof. Ashok K Agrawala 2018 Ashok Agrawala October 30, 2018 Message, Segment, Packet, and Frame host host HTTP HTTP message HTTP TCP TCP segment TCP router router IP IP packet
More informationPower Aware Routing using Power Control in Ad Hoc Networks
Power Aware Routing using Power Control in Ad Hoc Networks Eun-Sun Jung and Nitin H. Vaidya Dept. of Computer Science, Texas A&M University, College Station, TX 77843, USA Email: esjung@cs.tamu.edu, Dept.
More informationTCP START-UP BEHAVIOR UNDER THE PROPORTIONAL FAIR SCHEDULING POLICY
TCP START-UP BEHAVIOR UNDER THE PROPORTIONAL FAIR SCHEDULING POLICY J. H. CHOI,J.G.CHOI, AND C. YOO Department of Computer Science and Engineering Korea University Seoul, Korea E-mail: {jhchoi, hxy}@os.korea.ac.kr
More informationReviewed by CeemanB. Vellaithurai WSU ID:
Reviewed by CeemanB. Vellaithurai WSU ID: 11253840 Introduction Smart Grid Communication Infrastructure/Communication Architecture Data Assumptions Simulation Assumptions Good contributions Drawbacks Research
More informationChapter 4. Routers with Tiny Buffers: Experiments. 4.1 Testbed experiments Setup
Chapter 4 Routers with Tiny Buffers: Experiments This chapter describes two sets of experiments with tiny buffers in networks: one in a testbed and the other in a real network over the Internet2 1 backbone.
More informationLecture 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