Scribd
Upload
117 views2 pages

hw01 Soln

This document provides solutions to homework problems about computer networks. It calculates transmission times for files over different bandwidth connections and determines the bandwidth needed for propagation delay to equal transmission delay for various packet sizes on a local area network. It also explains why statistical multiplexing is used for voice networks, frequency division multiplexing for radio/TV, and neither is suitable for general computer networks due to varying flow rates. Finally, it provides formulas for transmission time over a link and calculates delay and delay-bandwidth product for a lunar communications link.

Uploaded by

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

hw01 Soln

This document provides solutions to homework problems about computer networks. It calculates transmission times for files over different bandwidth connections and determines the bandwidth needed for propagation delay to equal transmission delay for various packet sizes on a local area network. It also explains why statistical multiplexing is used for voice networks, frequency division multiplexing for radio/TV, and neither is suitable for general computer networks due to varying flow rates. Finally, it provides formulas for transmission time over a link and calculates delay and delay-bandwidth product for a lunar communications link.

Uploaded by

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

Homework #1 Solutions

cs349 -- Networks
Questions 5, 6, 10, 12 and 13 from page 61.
5) Calculate the total time required to transfer a 1000 KB file in
the following cases, assusing and RTT of 100 ms, a packet size
of 1 KB data and an initial 2 x RTT of handshaking before data is
sent.
a) The bandwidth is 1.5 Mbps and data packets can be sent
continuously.
2 rtts = 200 ms
transmit time per packet = 1 KB / 1.5 Mbps = 5.46 ms
total time = 200 ms + 1000 * 5.46 ms = 5.66 s
b) The bandwidth is 1.5 Mbps, but after we finish sending each
data packet we must wait on RTT before sending the next.
2 handshakes = 200 ms
transmit time per packet = 100ms + 5.46 ms = 105.46 ms
total time = 200 ms + 1000 * 105.46 ms = 105.66 s
c) The bandwidth is infinite, meaning that we take transmit time
to be zero, and up to 20 packets can be sent per RTT.
Whole file can be sent in 1000/20 RTTs = 50 * 100 ms = 5 s
d) The bandwidth in infinite and during the first RTT we can
send one packet, during the second we can send 2, and so on
by powers of two.
After n rounds we have sent 2^n - 1 packets, so after 9
round we have send 511 packets. So the 1000th packet is
sent during the 10th round.
Whole file can be sent in 10 RTTs = 1 s
The point of question 6 is to suggest approximations of network
performance that are appropriate in different circumstances.
If the transmission time of a sequence of packets is limited by
the RTT of the network, we can often ignore transmission times
by pretending the bandwidth is infinite.
6) Consider a LAN with a maximum distance of 2 km. At what
bandwidth would propagation delay (at a speed of 2 x 10^8 m/s)
equal transmit delay for 100 byte packets. What about 512
byte packets.
prop delay = distance / prop speed
= 2 * 10^3 m / 2 * 10^8 mps = 1 * 10^-5 s = 10 us
trans time = size / bandwidth
For an 800 bit packet

= 800 b / x Mbps = 10 us
x = 80 Mbps
For a 4096 bit packet
x = 409.6 Mbps
What is the significance of a packet whose prop delay equals
it's transmit delay?
10) What differences in traffic pattersn account for the fact that
STDM is a cost-effective form of multiplexing for voice telephone
networks and FDM is appropriate for television and radio, but neither
is appropriate for general purpose computer networks?
FDM is appropriate for cable and radio, because we know ahead of time
the total number of channels, and all channels have the same flow
rate, so it is easy to divide up the frequency spectrum.
For voice traffic, STDM is appropriate because, again, all flows have
the same rate, and the rate does not vary in time.
Neither of these is appropriate for general-purpose computer networks
because we don't know the number of channels ahead of time, and the
flow rates vary a lot from channel to channel, and over time for a
given channel.
12) How long does it take to transmit x KB over a y Mbps link?
8192 x bits / y Mbps = .008192 x/y s = 8.192 x/y ms
Memorize this (even if you have to round down to 8 to
conserve memory)!
13) Suppose a 100 Mbps p-to-p link is being set up between the earth
and a new lunar colony. The distance from the moon to earth is
385,000 km and data travels over the link at the speed of light.
a) prop delay = distance / prop speed
= 3.85 * 10^8 m / 3 * 10^8 m/s = 1 s
RTT = 2 * prop delay = 2 s
b) delay * bandwidth = 200 Mb
c) The delay bandwidth product is the amount of data that
is "in flight" before the first acknowledgement comes back
from the receiver.
d) 1s for the request to reach the moon
1s prop delay for the reply
2s transmit delay for the data (200 Mb at 100 Mbps)
Total = 4s

You might also like