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



Similar documents
Final for ECE374 05/06/13 Solution!!

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

Transport Layer Protocols

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

TCP in Wireless Mobile Networks

TCP for Wireless Networks

Data Networks Summer 2007 Homework #3

1. The subnet must prevent additional packets from entering the congested region until those already present can be processed.

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

How To Provide Qos Based Routing In The Internet

Mobile Communications Chapter 9: Mobile Transport Layer

TCP over Wireless Networks

BCS THE CHARTERED INSTITUTE FOR IT. BCS HIGHER EDUCATION QUALIFICATIONS BCS Level 5 Diploma in IT COMPUTER NETWORKS

EECS 489 Winter 2010 Midterm Exam

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

Network layer: Overview. Network layer functions IP Routing and forwarding

Classful IP Addressing (cont.)

18: Enhanced Quality of Service

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

EINDHOVEN UNIVERSITY OF TECHNOLOGY Department of Mathematics and Computer Science

Visualizations and Correlations in Troubleshooting

CS 268: Lecture 13. QoS: DiffServ and IntServ

Computer Network Foundation. Chun-Jen (James) Chung. Arizona State University

High Performance VPN Solutions Over Satellite Networks

Networking Test 4 Study Guide

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

Using Fuzzy Logic Control to Provide Intelligent Traffic Management Service for High-Speed Networks ABSTRACT:

IP addressing and forwarding Network layer

IP Subnetting and Addressing

(Refer Slide Time: 02:17)

Introduction to LAN/WAN. Network Layer (part II)

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

Congestion Control Review Computer Networking. Resource Management Approaches. Traffic and Resource Management. What is congestion control?

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

Lecture Computer Networks

8.2 The Internet Protocol

Overview : Computer Networking. Components of Integrated Services. Service Interfaces RSVP. Differentiated services

ECSE-6600: Internet Protocols Exam 2

Master Course Computer Networks IN2097

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

Mobile Computing/ Mobile Networks

QoS Parameters. Quality of Service in the Internet. Traffic Shaping: Congestion Control. Keeping the QoS

CS 348: Computer Networks. - IP addressing; 21 st Aug Instructor: Sridhar Iyer IIT Bombay

King Fahd University of Petroleum & Minerals Computer Engineering g Dept

Internet Packets. Forwarding Datagrams

The Quality of Internet Service: AT&T s Global IP Network Performance Measurements

Lecture 33. Streaming Media. Streaming Media. Real-Time. Streaming Stored Multimedia. Streaming Stored Multimedia

Congestions and Control Mechanisms n Wired and Wireless Networks

Network layer" 1DT066! Distributed Information Systems!! Chapter 4" Network Layer!! goals: "

IP Addressing. IP Addresses. Introductory material.

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

Answers to Sample Questions on Network Layer

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

Network management and QoS provisioning - QoS in the Internet

Variable length subnetting

Final Exam. Route Computation: One reason why link state routing is preferable to distance vector style routing.

Asynchronous Transfer Mode: ATM. ATM architecture. ATM: network or link layer? ATM Adaptation Layer (AAL)

IP and Mobility. Requirements to a Mobile IP. Terminology in Mobile IP

RARP: Reverse Address Resolution Protocol

Lecture 16: Quality of Service. CSE 123: Computer Networks Stefan Savage

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

Computer Networks. Chapter 5 Transport Protocols

CS 457 Lecture 19 Global Internet - BGP. Fall 2011

Quality of Service. Traditional Nonconverged Network. Traditional data traffic characteristics:

IP SAN Best Practices

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

A Preferred Service Architecture for Payload Data Flows. Ray Gilstrap, Thom Stone, Ken Freeman

Ref: A. Leon Garcia and I. Widjaja, Communication Networks, 2 nd Ed. McGraw Hill, 2006 Latest update of this lecture was on

Internet Protocol: IP packet headers. vendredi 18 octobre 13

1. How many unique network IDs are there in class A addresses? # of unique hosts?

Internet Quality of Service

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

Analysis of IP Network for different Quality of Service

Quality of Service using Traffic Engineering over MPLS: An Analysis. Praveen Bhaniramka, Wei Sun, Raj Jain

Scaling the Network: Subnetting and Other Protocols. Networking CS 3470, Section 1

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

A Review on Quality of Service Architectures for Internet Network Service Provider (INSP)

Transport layer issues in ad hoc wireless networks Dmitrij Lagutin,

Internet Control Protocols Reading: Chapter 3

IP - The Internet Protocol

A Survey on Congestion Control Mechanisms for Performance Improvement of TCP

Per-Flow Queuing Allot's Approach to Bandwidth Management

Future Internet Technologies

The Problem with TCP. Overcoming TCP s Drawbacks

CS 5480/6480: Computer Networks Spring 2012 Homework 4 Solutions Due by 1:25 PM on April 11 th 2012

IP Addressing Introductory material.

Internet Infrastructure Measurement: Challenges and Tools

THE UNIVERSITY OF AUCKLAND

CS 43: Computer Networks IP. Kevin Webb Swarthmore College November 5, 2013

Quality of Service in the Internet. QoS Parameters. Keeping the QoS. Traffic Shaping: Leaky Bucket Algorithm

Network Layer IPv4. Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS. School of Computing, UNF

CS335 Sample Questions for Exam #2

Student, Haryana Engineering College, Haryana, India 2 H.O.D (CSE), Haryana Engineering College, Haryana, India

Measuring IP Performance. Geoff Huston Telstra

Internet Protocol version 4 Part I

Chapter 4. Distance Vector Routing Protocols

Network Friendliness of Mobility Management Protocols

Distributed Systems 3. Network Quality of Service (QoS)

Internet Protocol Address

Transcription:

CS268 Exam Solutions General comments: ) If you would like a re-grade, submit in email a complete explanation of why your solution should be re-graded. Quote parts of your solution if necessary. In person requests for a re-grade will not be accepted. 2) The following solutions are more verbose than we would expect in an actual solution. However, some answers are too terse (e.g., Link layer retransmissions are more efficient. ). Excessively terse answers get partial credit. 3) In many cases, an advantage for one scheme is a disadvantage for another. If a solution contains the same general concept multiple times, we only credit it once. ) End-to-End (20 pts) (a) Retransmission of lost data can be done at the link, transport, and application layers. What are the pros and cons of doing it at each layer? Write no more than three phrases for each advantage/disadvantage. Link layer: + Link layer retransmissions avoid having to retransmit over the entire path. Transport and application layer retransmissions must be sent over the entire path, thus incurring higher latency and wasting bandwidth. + Link layer retransmissions can hide non-congestion losses from higher layer protocols. For example, wireless link layer retransmissions can prevent error losses from being misinterpreted by TCP as congestion losses. - End host to end host retransmissions are still necessary. A packet can be lost can after being successfully received at a router (due to congestion or errors). A route flap can send packets on a path that causes their TTL to expire before arriving at the destination. Some routers may not implement link layer retransmissions. - Link layer retransmissions add some complexity and overhead. (2 pts) - A packet may be retransmitted at multiple layers simultaneously. For example, a packet may be delayed before reaching a wireless link. The link layer protocol retransmits the packet, but the sender has already timed out and retransmits the packet. The link layer s retransmission is superfluous. Transport layer: + Transport layer retransmissions avoid having to reimplement retransmission functionality in applications. Many applications can use the same transport protocol implemented in a library or in the operating system, reducing bugs, implementation time, etc. + Some solutions said that retransmissions and congestion control fit together naturally. This isn t entirely true. (2 pts) Application layer: + Some applications can tolerate loss better than the increased delay of retransmissions. An example is an interactive audio or video application.

+ Data may be lost above the transport layer. An example of this is a buggy proxy cache. It could transfer data correctly from a server, corrupt the data, and then send the corrupt data to the client. Grading: 4 points for each + or - above unless otherwise noted. 2) TCP and Route Fluttering (20 pts) (a) Describe fast retransmission and fast recovery algorithms (pseudocode preferred). (b) Consider a TCP flow implementing fast recovery. Assume the end-to-end delay of each packet is d in both directions. Suppose the 4 th packet transmitted by the sender experiences a delay of d2 > d. Assume the first packet is transmitted at time t. What is the congestion window size at time t + 6*d + ε? Note: Ignore the time it takes to send/receive a packet and assume that the receiver sends an ack as soon as it receives a packet, and the sender sends the next packet as soon as it gets an ack. Assume there are no packets losses. a) Fourth ACK for packet p received: retransmit p; /* fast retransmission */ sstresh = cwnd/2; /* fast recovery */ cwnd = sstresh; /* actually it s sstresh + 3 to account for packets acked by DUPACKs */ b) b.) d = d2; cwnd = 8 b.2) d < d2; cwnd = 2 or 5 (both answers were considered correct) cwnd= cwnd=2 cwnd=4 cwnd=8 ack= 2,3 ack=2,3 4,5,6,7 ack=4,5,6,7 cwnd= cwnd=2 cwnd=4 ack= 2,3 ack=2,3 5,6,7 ack=3,3,3 cwnd=2 (+3) 4 3) Differentiated and Integrated Services (20 pts) How do premium service (Diffserv) and guaranteed service (Intserv) differ in their semantics and implementation?

Semantic differences: - The guaranteed service is end-to-end; the premium service is ingress-to-egress (i.e., the premium service is defined on a domain basis) - The guaranteed service provides both per-flow delay and bandwidth guarantees; the premium service provides only per-flow bandwidth guarantees Implementation differences - Premium service (and Diffserv in general) is deployed on a domain basis, and differentiate between edge and core routers - With the guaranteed service, every router maintains per-flow state and performs per-flow packet processing and admission control; with the premium service, core routers maintain no per-flow state - With the guaranteed service, the admission control is totally distributed; with the premium service, the admission control is centralized within each domain (i.e., it is done by the bandwidth broker) 4) Internet Addressing (20 pts) (a) Classless Inter-Domain Routing (CIDR) allows the allocation of any power of 2 sized IP address range, instead of fixed size class A, B, and C subnets. Name two advantages of using CIDR. CIDR allocates the address space ) more efficiently and 2) reduces routing table size. For example, before CIDR, an organization with 2^0 hosts would get one class B (2^6) subnet or four class C (2^8 addresses) subnets. With one class B subnet, the organization would leave many addresses unused, thus reducing the overall efficiency of the IPv4 32 bit address space. With four class C subnets, those subnets could have different prefixes, resulting in four separate entries in routing tables. With CIDR, the organization could have one 0 bit address space, which it can use efficiently and which only occupies one entry in the routing table. Grading: 4 points for each of the above. (b) A mobile host travels to foreign networks while retaining its home IP address. To support this, mobile hosts advertise their home IP address to foreign routers, who would propagate this information to other routers during routing updates. Name two advantages and disadvantages of this scheme compared to Mobile IP. New scheme: + This enables more efficient routing than Mobile IP. Mobile IP suffers the inefficiency of triangle routing. + Avoid the packet header overhead of encapsulation. + This is more fault tolerant than Mobile IP. The home agent in Mobile IP is a single point of failure.

+ The mobile host does not need to allocate an address in the foreign network. - The new scheme would propagate routing updates slowly. - The new scheme requires modifying routers. Routers would have to be modified to handle the new advertisements from hosts. - If large numbers of mobile hosts use this scheme, routing tables would become very large. Every mobile host would create an entry in the routing table. Currently, this does not happen because all the hosts in a subnet can be aggregated into one routing table entry. - The new scheme does not preserve location privacy. Anyone can use traceroute to determine which network the mobile host is connected to, which may give away the mobile host s geographic location. Grading: 3 points for each of the above unless otherwise noted. 5) TCP Congestion Control (20 pts) c (a) A TCP flow s throughput is approximately, where c is a constant, r is the round r s trip time, and s is the probability that a segment is lost. Assuming that the probability of packet loss is p, and each segment is split into n fragments, what is the TCP throughput? c ( p) n r For a TCP segment to be useful, all of its fragments must arrive at the receiver. The probability that one fragment arrives is p. The probability that n fragments arrive is ( p) n. Therefore, the probability that a segment is lost is ( p) n Grading: 8 points. (b) What are the pros and cons of explicit and implicit signals for congestion? Implicit: + An Implicit congestion signal does not require router support. + Transport protocols always need to adapt to implicit congestion signals anyway. Explicit congestion signals can be lost, so a lack of an explicit signal does not imply a lack of congestion. + Some explicit signals require sending an extra packet to signal congestion. This can cause control traffic congestion collapse. + Some explicit signaling schemes set a congestion bit in packets. Selfish receivers can subvert this by not sending the bit back the sender. Explicit: + An explicit congestion signal can be used for congestion avoidance. Routers can signal congestion when their queues grow long, but before they have to drop packets.

+ An explicit congestion signal requires lower latency to interpret than implicit congestion signals. For example, TCP requires 3 duplicate acknowledgements to determine that a packet has been lost. + An explicit congestion signal distinguishes congestion loss from other loss. Wireless networks may drop packets because of signal fading or interference. Route fluttering can send packets into oblivion. This sources of packet loss can be misinterpreted by an implicit congestion signal scheme. Grading: 3 points for each of the above, unless otherwise noted.