CS 455/655 - Homework 3
Fall 2010
Prof. John Byers
You may discuss this assignment with other students in the class, but the work you submit
must be your own. Please show only the work which is necessary and sucient to arrive at the
solution, i.e. be conc
CS 655 - Term Paper
Fall 2010
Prof. John Byers
Due: 5PM, December 16
Requirements
You are rst expected to read and understand two or three recent research papers in an area of
networking that we have touched upon either in class or in the network seminars
CS455/655 Homework 4 Solutions
Fall 2010
Question 1 (Fragmentation and Reassembly):
(a) An IPv4 header with no option has 32*5=160 bits (20 bytes), and a UDP header has 32*2
28
= 64 bits (8 bytes), so the fraction used for actual UDP payload is 1- 3500 =
CS 455/655 - Homework 5
Fall 2010
Prof. John Byers
You may discuss this assignment with other students in the class, but the work you submit
must be your own. Please show only the work which is necessary and sucient to arrive at the
solution, i.e. be conc
CS 455/655 - Homework 5 Solutions
Fall 2010
Prof. John Byers
Question 1 (Multicast Address Allocation):
(a) Among the numerous problems with this approach are that a centralized solution quickly
becomes a bottleneck as the size of the request pool grows l
CS 455/655 - Homework 4
Fall 2010
Prof. John Byers
You may discuss this assignment with other students in the class, but the work you submit
must be your own. Please show only the work which is necessary and sucient to arrive at the
solution, i.e. be conc
CS 455/655 - Homework 3 Solutions
Fall 2010
Prof. John Byers
Question 1 (Sockets):
For basic EWMA, the timeout occurs after the rst iteration - (0.92 sec) and then it is asymptotically converges to 1.8 secs from below. For the Jacobson/Karels algorithm, t
CS 455/655 - Homework 1 Solutions
Fall 2010
Prof. John Byers
Question 1 (Bandwidth and Delay):
(a) The rst bit of this packet arrives at Y 10 ms later, and its last bit arrives at Y
3KB
5M bps
8M b
1000ms
= 4.8 ms, so the entire packet arrives and is enti
CS 455/655 - Homework 2
Fall 2010
Prof. John Byers
You may discuss this assignment with other students in the class, but the work you submit
must be your own. Please show only the work which is necessary and sucient to arrive at the
solution, i.e. be conc
CS 455/655 - Homework 2 Solutions
Fall 2010
Prof. John Byers
Question 1 (Sockets): Code is provided in Kurose and Ross, Section 2.8.
Question 2 (Stop-and-Wait):
(a) The answer to this question depends on how you interpret the quantity r. The intended
inte
CS 455 Sample Midterm
This exam is CLOSED book and notes. A calculator will not be necessary. Exams must be handed in by 10:50AM. Exam is out of 100 possible points. You may want to do the short answer questions at the back rst. Note: Question 2 was a lit
Your Title Goes Here
You
November 30, 2010
Abstract
In todays lecture, we learned how to Compactly Represent Bags of Integers using
Bloom lters. The formal denition of the problem, and its solution, appear below,
but we rst describe why this is necessary.