Homework 2 Solutions

Similar documents
Computer Networks - CS132/EECS148 - Spring

First Midterm for ECE374 03/24/11 Solution!!

First Midterm for ECE374 03/09/12 Solution!!

COMP 3331/9331: Computer Networks and Applications. Lab Exercise 3: TCP and UDP (Solutions)

Data Networks Summer 2007 Homework #3

Answer: that dprop equals dtrans. seconds. a) d prop. b) d trans

First Midterm for ECE374 02/25/15 Solution!!

COMP 361 Computer Communications Networks. Fall Semester Midterm Examination

Chapter 6 Congestion Control and Resource Allocation

Midterm Exam CMPSCI 453: Computer Networks Fall 2011 Prof. Jim Kurose

Final for ECE374 05/06/13 Solution!!

CSE 123: Computer Networks

Stop And Wait. ACK received; transmit frame 2 CS 455 3

TCP Westwood for Wireless

T2-6: Trace File Analysis - The Elephant Coming From Behind: Full Window, Window Update and TCP Keep-Alive s

ECE 333: Introduction to Communication Networks Fall 2002

Computer Networks UDP and TCP

Visualizations and Correlations in Troubleshooting

CSE 473 Introduction to Computer Networks. Exam 2 Solutions. Your name: 10/31/2013

Prefix AggregaNon. Company X and Company Y connect to the same ISP, and they are assigned the prefixes:

TCP over Multi-hop Wireless Networks * Overview of Transmission Control Protocol / Internet Protocol (TCP/IP) Internet Protocol (IP)

Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation

TFTP TRIVIAL FILE TRANSFER PROTOCOL OVERVIEW OF TFTP, A VERY SIMPLE FILE TRANSFER PROTOCOL FOR SIMPLE AND CONSTRAINED DEVICES

Sample Network Analysis Report

TCP Window Size for WWAN Jim Panian Qualcomm

TCP in Wireless Mobile Networks

15-441: Computer Networks Homework 2 Solution

Transport Layer Protocols

B-2 Analyzing TCP/IP Networks with Wireshark. Ray Tompkins Founder of Gearbit

Outline. TCP connection setup/data transfer Computer Networking. TCP Reliability. Congestion sources and collapse. Congestion control basics

Homework 2 assignment for ECE374 Posted: 02/21/14 Due: 02/28/14

Note! The problem set consists of two parts: Part I: The problem specifications pages Part II: The answer pages

Names & Addresses. Names & Addresses. Hop-by-Hop Packet Forwarding. Longest-Prefix-Match Forwarding. Longest-Prefix-Match Forwarding

Computer Networks. Chapter 5 Transport Protocols

ECE 358: Computer Networks. Homework #3. Chapter 5 and 6 Review Questions 1

Simulation-Based Comparisons of Solutions for TCP Packet Reordering in Wireless Network

A Survey: High Speed TCP Variants in Wireless Networks

CSE331: Introduction to Networks and Security. Lecture 9 Fall 2006

2 TCP-like Design. Answer

This sequence diagram was generated with EventStudio System Designer (

TCP over Wireless Networks

Lecture Objectives. Lecture 07 Mobile Networks: TCP in Wireless Networks. Agenda. TCP Flow Control. Flow Control Can Limit Throughput (1)

EXAMPLES AND PROBLEMS. Competence Based Education Internet Protocols

TCP for Wireless Networks

Computer Networks - CS132/EECS148 - Spring

Advanced Computer Networks Project 2: File Transfer Application

ICOM : Computer Networks Chapter 6: The Transport Layer. By Dr Yi Qian Department of Electronic and Computer Engineering Fall 2006 UPRM

TCP loss sensitivity analysis ADAM KRAJEWSKI, IT-CS-CE

Application Level Congestion Control Enhancements in High BDP Networks. Anupama Sundaresan

TCP Adaptation for MPI on Long-and-Fat Networks

Lecture 15: Congestion Control. CSE 123: Computer Networks Stefan Savage

Mobile Computing/ Mobile Networks

TCP/IP In Cellular Networks

Network support for TCP Fast Open. Christoph Paasch

PART III. OPS-based wide area networks

Mobile Communications Chapter 9: Mobile Transport Layer

Chapter 5. Transport layer protocols

TCP Flow Control. TCP Receiver Window. Sliding Window. Computer Networks. Lecture 30: Flow Control, Reliable Delivery

IP Network Layer. Datagram ID FLAG Fragment Offset. IP Datagrams. IP Addresses. IP Addresses. CSCE 515: Computer Network Programming TCP/IP

TCP and Wireless Networks Classical Approaches Optimizations TCP for 2.5G/3G Systems. Lehrstuhl für Informatik 4 Kommunikation und verteilte Systeme

Multipath TCP in Practice (Work in Progress) Mark Handley Damon Wischik Costin Raiciu Alan Ford

A Survey on Congestion Control Mechanisms for Performance Improvement of TCP

AN IMPROVED SNOOP FOR TCP RENO AND TCP SACK IN WIRED-CUM- WIRELESS NETWORKS

Servicesin ns-3. Outline SIMULACIÓN DE PROTOCOLOS DE ENRUTAMIENTO PARA REDES MÓVILES AD-HOC MEDIANTE HERRRAMIENTA DE SIMULACIÓN NS-3

Analytic Models for the Latency and Steady-State Throughput of TCP Tahoe, Reno and SACK

Pig Laboratory. Additional documentation for the laboratory. Exercises and Rules. Tstat Data

A Congestion Control Algorithm for Data Center Area Communications

TCP/IP Support Enhancements

A Reliable and Fast Data Transfer for Grid Systems Using a Dynamic Firewall Configuration

High-Speed TCP Performance Characterization under Various Operating Systems

The Fundamentals of Intrusion Prevention System Testing

ITL Lab 5 - Performance Measurements and SNMP Monitoring 1. Purpose

CHAPTER 1 PRINCIPLES OF NETWORK MONITORING

Congestions and Control Mechanisms n Wired and Wireless Networks

Network Protocol Design and Evaluation

Home Phone Call Forward Guide

The Problem with TCP. Overcoming TCP s Drawbacks

Per-Flow Queuing Allot's Approach to Bandwidth Management

Note! The problem set consists of two parts: Part I: The problem specifications pages Part II: The answer pages

Data Communications & Networks. Session 6 Main Theme Reliable Data Transfer. Dr. Jean-Claude Franchitti

RTT 60.5 msec receiver window size: 32 KB

Homework 3 assignment for ECE374 Posted: 03/13/15 Due: 03/27/15

Networking part 3: the transport layer

[Prof. Rupesh G Vaishnav] Page 1

CS268 Exam Solutions. 1) End-to-End (20 pts)

Digital Audio and Video Data

APPENDIX 1 USER LEVEL IMPLEMENTATION OF PPATPAN IN LINUX SYSTEM

Direct Link Networks. Introduction. Physical Properties. Lecture - Ethernet 1. Areas for Discussion. Ethernet (Section 2.6)

LESSON Networking Fundamentals. Understand TCP/IP

Data Center Networking with Multipath TCP

Large-Scale TCP Packet Flow Analysis for Common Protocols Using Apache Hadoop

Network Performance: Networks must be fast. What are the essential network performance metrics: bandwidth and latency

SJBIT, Bangalore, KARNATAKA

ETSI TR V1.2.1 ( ) Technical Report

Secure SCTP against DoS Attacks in Wireless Internet

TCP Performance Management for Dummies

Network Probe. Figure 1.1 Cacti Utilization Graph

Access Control: Firewalls (1)

EINDHOVEN UNIVERSITY OF TECHNOLOGY Department of Mathematics and Computer Science

TCP in Wireless Networks

Transcription:

Homework 2 Solutions 1. P25: a. In the second segment from Host A to B, the sequence number is 197, source port number is 302 and destination port number is 80. b. If the first segment arrives before the second, in the acknowledgement of the first arriving segment, the acknowledgement number is 197, the source port number is 80 and the destination port number is 302. c. If the second segment arrives before the first segment, in the acknowledgement of the first arriving segment, the acknowledgement number is 127, indicating that it is still waiting for bytes 127 and onwards. d. Host A Seq = 127, 70 bytes Host B Timeout interval Seq = 197, 50 bytes Ack = 197 Seq = 127, 70 bytes Ack = 247 Timeout interval Ack = 247 2. P34: Note that there is a typo in the textbook. part b, 5 is missing in RTT. If the timeout values for all three protocol are much longer than RTT If the timeout values for all three protocol are much longer than 5 RTT a). GoBackN:

A sends 9 segments in total. They are initially sent segments 1, 2, 3, 4, 5 and later re-sent segments 2, 3, 4, and 5. B sends 8 ACKs. They are 4 ACKS with sequence number 1, and 4 ACKS with sequence numbers 2, 3, 4, and 5. Selective Repeat: A sends 6 segments in total. They are initially sent segments 1, 2, 3, 4, 5 and later re-sent segments 2. B sends 5 ACKs. They are 4 ACKS with sequence number 1, 3, 4, 5. And there is one ACK with sequence number 2. TCP: A sends 6 segments in total. They are initially sent segments 1, 2, 3, 4, 5 and later re-sent segments 2. B sends 5 ACKs. They are 4 ACKS with sequence number 2. There is one ACK with sequence numbers 6. Note that TCP always send an ACK with expected sequence number. b). TCP. This is because TCP uses fast retransmit without waiting until time out. 3. P43: Let W denote the max measured in segments. Then, W*MSS/RTT = 10Mbps, as packets will be dropped if the maximum sending rate exceeds link capacity. Thus, we have W*1500*8/0.1=10*10^6, then W is about 84 (ceiling of 83.3) segments. As congestion varies from W/2 to W, then the average is 0.75W=63 segments. Average throughput is 63*1500*8/0.1=7.56Mbps. 84/2 *0.1= 4.2 seconds, as the number of RTTs (that this TCP connections needs in order to increase its from W/2 to W) is given by W/2. Recall the increases by one in each RTT. 4. P47: a. The key difference between C1 and C2 is that C1 s RTT is only half of that of C2. Thus C1 adjusts its after 100 msec, but C2 adjusts its after 200 msec. Assume that whenever a loss event happens, C1 receives it after 100msec and C2 receives it after 200msec. We further have the following simplified model of TCP. After each RTT, a connection determines if it should increase or not. For C1, we compute the average rate in the link in the previous 100 msec. If that rate exceeds the link capacity, then we assume that C1 detects loss and reduces its. But for C2, we compute the average rate in the link in the

previous 200msec. If that rate exceeds the link capacity, then we assume that C2 detects loss and reduces its. Note that it is possible that the average sending rate higher than the link capacity, but the average sending rate 200msec is smaller than or equal to the link capacity, then in this case, we assume that C1 will experience loss event but C2 will not. The following table describes the evolution of s and sending rates based on the above assumptions. C1 C2 Time (msec) Window Size (num. of segments sent in next 100msec) Average data sending rate (segments per second, =Window/0.1) Window Size(num. of segments sent in next 200msec) Average data sending rate (segments per second, =Window/0.2) 0 10 100 (in [0-100]msec] 10 50 (in [0-100]msec) 100 5 50 (in [100-200]msec] 50 (in [100-200]msec) 200 2 150= 100+50) 20 5 total sending rate to the link in last 200msec is 25

100= 50+50) 125= (100+50)/2 + (50+50)/2) 300 1 10 25 400 1 45= (20+25) (no further decrease, as is already 1) 10 2 total sending rate to the link in last 200msec is 40= (20+10)/2 + (25+25)/2) 10 500 2 20 10 600 3 30 3 15 700 1 10 15 800 2 20 1 5 900 3 30 5 1000 1 10 2 (increases 10

35= (30+5) total sending rate to the link in last 200msec is 30= (20+30)/2 + (5+5)/2) 1100 2 20 10 1200 3 30 3 15 1300 1 10 15 1400 2 20 1 5 1500 3 30 5 1600 1 10 2 10 1700 2 20 10 1800 3 30 3 15 1900 1 10 15 2000 2 20 1 5 2100 3 30 5 2200 1 10 2 10 Based on the above table, we find that after 2200 msec, C1 s is 1 segment and C2 s is 2 segments. b. No. In the long run, C1 s bandwidth share is roughly twice as that of C2 s, because C1 has shorter RTT, only half of that of C2, so C1 can adjust its twice as fast as C2. If we look at the above table, we can see a cycle every 600msec, e.g. from 1400msec to 1900msec, inclusive. Within a cycle, the sending rate of C1 is (20+30+10+20+30+10)/6 = 120, which is twice as large as the sending of C2 given by (5+5+10+10+15+15)/6=60.

5. Socket Programming Assignment 1: See the separate html file. 6. Wireshark TCP: See the separate pdf file.