Description
-
(10 points) In this problem, we consider sending real-time voice from Host A to Host B over a packet-switched network (VoIP). Host A converts analog voice to a digital 64 kbps bit stream on the fly. Host A then groups the bits into 56-byte packets and when a packet is formed, it is send to host B. There is one link between Hosts A and B; its transmission rate is 2 Mbps and its propagation delay is 10 msec. What’s the elapsed time since when the first bit is formed (from the original analog signal at Host A) until the bit is received at host B?
-
(32 points) Suppose two hosts, A and B, are separated by 20,000 kilometers and are connected by a direct link of = 2 Mbps. Suppose the propagation speed over the link is 2.5 ∙ 108 / .
-
Calculate the propagation (delay) time
-
Calculate the bandwidth-delay product, i. e. simply do ∙
-
What is the maximum number of bits that will be in the link (propagating from Host A to Host B) at any given time?
-
How long does a single bit propagate in meters for the time needed to transmit a single bit (known as the width – in meters – of a bit in the link)?
-
Derive a general expression for the width of a bit in terms of the propagation speed , the transmission rate , and the length of the link . You can use d) for some help and hints.
-
A file of 100 KB (1KB = 1000 B) is send from host A to host B. After Host B receives the whole file, it sends a single acknowledgment (ACK) to Host A. How long does it take for Host A to receive the ACK from Host B after sending the file, assuming that the file is send continuously? ACK size is neglectable.
-
Suppose now the file of 100 KB is broken up into 20 packets with each packet containing 40,000 bits. Suppose that each packet is acknowledged by the receiver and the transmission time of an acknowledgment packet is negligible. Finally, assume that the sender cannot send a packet until the preceding one is acknowledged (stop and wait). How long does it take to send the file? You can neglect header sizes.
-
compare the results from f) and g)
-
(8 points) Suppose within your Web browser you click on a link to obtain a Web page. The IP address for the associated URL is not cached in your local host, so a DNS lookup is necessary to
obtain the IP address. Suppose that DNS servers are visited before your host receives the IP address from DNS; the successive visits incur an RTT of 1, 2, … , . Further suppose that
the Web page (consisting of a small amount of HTML text) associated with the link contains exactly eight small objects of neglectable size. Let 0 denote the RTT between the local host and the server containing the Web page and the objects. Assuming zero transmission time per object, how much time elapses from when the client clicks on the link until the client receives the object if we use:
-
Non-persistent HTTP with no parallel TCP connections?
-
Non-persistent HTTP with the browser configured for 5 parallel connections?
-
Persistent HTTP with no parallel connections?
-
Persistent HTTP with 8 parallel connections?
-
(20 points) Consider distributing a file of F= 15 to N peers. The server has an upload rate of =30 Mbps, and each peer has a download rate of = 2 Mbps and an upload rate of . For N=10, 100, and 1,000 and = 300 Kbps, 700 Kbps, and 2 Mbps, prepare a chart giving the minimum distribution time for each of the combinations of N and for both client-server distribution and P2P distribution. Show your work!
-
(10 points) UDP and TCP use 1s complement for their checksums. Suppose you have the following three 8-bit bytes: 01010011, 01100110, 01110100. What is the 1s complement of the sum of these 8-bit bytes? (Note that although UDP and TCP use 16-bit words in computing the checksum, for this problem you are being asked to consider 8-bit sums) Show all work!
-
(10 points) A TCP machine is sending full windows of 65,535 bytes over a 1-Gbps channel that has a 10-msec one-way delay. What is the maximum throughput achievable? What is the line efficiency?
CS408 Team (Artrim Kjamilji, Sama Habibi)
