0% found this document useful (0 votes)
14 views2 pages

Assignment No. 1

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
14 views2 pages

Assignment No. 1

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd

CCN Assignment 01 10 Marks 10 Feb 09

Due Date: February 17, 2009

In case of any query: Please consult with your TA’s first. Otherwise you can contact
with me during my office hours or by email.

[email protected]

Problem 1

a. Develop an equation for the end-to-end delay along a communications path of n


routers. The only constant that you may assume is the speed of light in the given
transmission medium is 2*108 m/sec. Identify each if the variables in your equation.

b. If the distances between nodes were constant (L) and each node (end systems and
routers are nodes) can transmit R bits per second, what would the equation in (b) look
like?

c. In the Internet, which of these would you expect to remain constant and which of
these would you expect to change. Explain (one sentence). Don’t look for an
obscure answer – choose the most obvious answer.

- the number of routers in the Internet


- distance between a ground station and a satellite in geosynchronous orbit.
- the size of IP packets transmitted in any given HTTP session ( Web browser
connected to Web server).
- the average round trip time in any Internet based client server application.
Round trip time is the interval between the time you send a request and the
time that you receive a response.

Problem 2

We want to transfer a file of size d bytes. Each link has bandwidth b bits/sec and fixed
propagation delay f sec. All routers on the path are store-and-forward. We use packets of
total size P bytes, of which h bytes are occupied by headers. We always pad the last
packet so that it is full. There is no set-up time for the transfer. Packets are sent
continuously and are not lost. There is no queuing delay or processing overhead, and we
ignore acknowledgments sent back by the receiver.

i. How many data packets are sent?


ii. What is the delay (from when the sender starts transmitting until when the
receiver has received everything) to transfer the file across one link?
iii. What is the delay for one packet to arrive at a destination that is n links
away?
iv. What is the delay to transfer the entire file across n links?

Problem 3

Consider a queue at a router with a output link rate (i.e. service rate) of R bits/sec. If N
packets arrive at the router every LN/R seconds and each packet is L bits long, find
average queuing delay for any arbitrary packet. Give a closed form solution.

Chapter 1 (BF) Exercises

20, 21, 22, 23, 24, 25

Chapter 2 (BF) Exercices

24, 25, 29, 30

You might also like