Scribd
Upload
107 views3 pages

Homework 1: Due Date: 7 Nov., 2018

This document contains 10 questions about networking concepts such as circuit switching, packet switching, queueing delay, and file distribution. Question 1 involves circuit switching and packet switching with multiple users on a shared link. Question 2 examines voice transmission over a packet switching network. Question 3 considers circuit switching capacity. Questions 4-6 cover topics like queueing delay and HTTP protocols. Questions 7-8 discuss POP3 and DNS protocols. Questions 9-10 analyze client-server and peer-to-peer file distribution schemes.

Uploaded by

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

Homework 1: Due Date: 7 Nov., 2018

This document contains 10 questions about networking concepts such as circuit switching, packet switching, queueing delay, and file distribution. Question 1 involves circuit switching and packet switching with multiple users on a shared link. Question 2 examines voice transmission over a packet switching network. Question 3 considers circuit switching capacity. Questions 4-6 cover topics like queueing delay and HTTP protocols. Questions 7-8 discuss POP3 and DNS protocols. Questions 9-10 analyze client-server and peer-to-peer file distribution schemes.

Uploaded by

Tam Hoang
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Homework 1

Due date: 7th Nov., 2018


Total points: 100

1. Suppose users share a 2 Mbps link. Also suppose each user transmits continuously at 1 Mbps
when transmitting, but each user transmits only 20 percent of the time.
(a) When circuit switching is used, how many users can be supported?
(b) For the reminder of this problem, suppose packet switching is used. Why will there be
essentially no queueing delay before the link if two or fewer users transmit at the same
time? Why will there be a queueing delay if three users transmit at the same time?
(c) Find the probability that a given user is transmitting.
(d) Suppose now there are three users. Find the probability that at any given time, all three
users are transmitting simultaneously. Find the fraction of time during which the queue
grows.

2. We consider sending real-time voice from Host A to Host B over a packet-switching network.
Host A to Host B. Host A converts analog voice to a digital 128 kbps bit stream on the fly. Host
A then groups the bits into 64-byte packets. There is one link between Host A and B; its
transmission rate is 4 Mbps and its propagation delay 8ms. As soon as Host A gathers a packet,
it sends it to Host B. As soon as Host B receives an entire packet, it converts the packet’s bits
to an analog signal.
(a) How much time elapses from the time a bit is created (at Host A) until the bit is decoded
(at Host B)?
(b) What about the second bit?
(c) What about the other bits?

3. A 2 Gbps link supports a maximum of 5,000 users under circuit switching.


(a) At what rate are the users generating data?
(b) Now consider packet switching and a user population of N users. If the probability that a
specific user is active is p, what is the probability that exactly half of the users are sending
data?

4. (a) Suppose N packets arrive simultaneously to a link at which no packets are currently being
transmitted or queued. Each packet is of length L and the link has transmission rate R. What is
the average queueing delay for N packets?
(b) Now suppose that N such packets arrive to the link every LN/R seconds. What is the average
queueing delay of the packet?

1
5. Consider the queueing delay in a router buffer. Let I=La/R denote traffic density. Suppose that
the queueing delay takes the form IL/R (1-I) for I<1.
(a) Provide the formula for the total delay, that is, the queueing delay plus the transmission
delay.
(b) Plot the total delay as a function of L/R.

6. Consider a short, 15-meter link, over which a sender can transmit at a rate of 160 bps in both
directions. Suppose that packets containing data are 200,000 bits long, and packets containing
control (e.g., ACK or handshaking) are 100 bits long. Assume that N parallel connections each
gets 1/N of the link bandwidth. Now consider the HTTP protocol, and suppose that each
downloaded object is 200 kbits long, and that the initial downloaded object contains 10
referenced objects from the same sender.
(a) Would parallel downloads via parallel instances of non-persistent HTTP make sense in this
case? Justify and explain your answer.
(b) Now consider persistent HTTP. Do you expect significant gains over the non-persistent
case? Justify and explain your answer.

7. Consider accessing your e-mail POP3.
(a) Suppose you have configured your POP mail client to operate in the download-and-delete
mode. Complete the following transaction.
C: list
S: 1 498
S: 2 912
S: .
C: retr 1
S: blah blah …
S: .
?
?
(b) Suppose you have configured your POP mail client to operate in the download-and-keep
mode. Complete the following transaction.
C: list
S: 1 498
S: 2 912
S: .
C: retr 1
S: blah blah …

2
S: .
?
?

8. Consider what happens when a browser (an HTTP client), running on some user’s host,
requests the URL www.somesite.com/index.html. In order for the user’s host to be able to send
an HTTP request message to the Web server www.somesite.com, the user’s host must first
obtain the IP address of www.somesite.com. Explain the steps through which the IP address
for such a hostname is obtained by the client.

9. Consider distributing a file of F bits to N peers using a client-server architecture. Assume a


fluid model where the server can simultaneously transmit to multiple peers, transmitting to
each peer at different rates, as long as the combined rate does not exceed us.
(a) Suppose that us/N≤dmin. Specify a distribution scheme that has a distribution time of NF/us.
(b) Suppose that us/N≥dmin. Specify a distribution scheme that has a distribution time of F/dmin.
(c) Conclude that the minimum distribution time is in general given by max{NF/us, F/dmin}.

10. Consider distributing a file of F bits to N peers using a P2P architecture. Assume a fluid model.
For simplicity assume that dmin is very large, so that peer download bandwidth is never a
bottleneck.
(a) Suppose that us≤(us+u1+…+uN)/N. Speficy a distribution scheme that has a distribution
time of F/us.
(b) Suppose that us≥(us+u1+…+uN)/N. Speficy a distribution scheme that has a distribution
time of NF/(us+u1+…+uN).
(c) Conclude that the minimum distribution time is in general given by max{F/us,
NF/(us+u1+…+uN)}.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy