CNT 6107 Advanced Computer Networks, Spring 2011

Assignment 1
given by
Jonathan C.L. Liu

Out: Jan. 28 (Friday), 2011

Due: Beginning of the lecture on Feb. 04 (Friday), 2011

• The problem sets form an important part of the learning in this course. Thus you are
required to do them in order to pass.

• Try to be as clear and precise as possible in your presentation. Sloppy answers may be at
a disadvantage, i.e., likely to receive fewer points.

• No late assignments are accepted !!

Problem 1

A system has an n-layer protocol hierarchy. Applications generate messages of length M bytes.
At each of the layers, an h-byte header is added. What fraction of the network bandwidth is
filled with headers? Try some practical values of n, M and h to get the rough estimation (in
term of percentage) of the header overhead.

Problem 2

In most networks, transmission errors are handled by requesting the damaged packets to be
re-transmitted. If the probability of a packet being damaged is p, what is the mean number of
transmissions required to send a packet if acknowledgments are never lost?

Problem 3

Two Ethernet CSMA/CD stations are trying to transmit a few long video files. After each frame
is sent, they contend for the channel using the binary exponential back-off algorithm. What is
the probability that the contention ends on round k, and what is the mean number of rounds
per contention period? Please calculate first few terms to get the approximated answer.

Problem 4

Go to IETF’s website, www.ietf.org, to see what they are doing. Pick a project that you like
and write an one-page summary on the problem and the proposed solution(s). Please make sure
to use your own words for the writing.