Scribd
Upload
26 views

Computer Network Solution

This document summarizes the solutions to 6 problems from the homework assignment for EE 357: Computer Networks. 1. It calculates the time required to generate, transmit, and receive a 56-bit packet over a network with a transmission rate of 2Mbps. The total delay is 24.224 milliseconds. 2. It determines that a network can support 20 users with a packet loss probability of 0.1%. 3. It calculates bandwidth-delay products and transmission times for a given link. 4. It compares the delays of store-and-forward switching and message segmentation for a network with 3 switches. Message segmentation results in much lower delay. 5. It applies Shannon's theorem to

Uploaded by

9s2vvbzwmn
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
26 views

Computer Network Solution

This document summarizes the solutions to 6 problems from the homework assignment for EE 357: Computer Networks. 1. It calculates the time required to generate, transmit, and receive a 56-bit packet over a network with a transmission rate of 2Mbps. The total delay is 24.224 milliseconds. 2. It determines that a network can support 20 users with a packet loss probability of 0.1%. 3. It calculates bandwidth-delay products and transmission times for a given link. 4. It compares the delays of store-and-forward switching and message segmentation for a network with 3 switches. Message segmentation results in much lower delay. 5. It applies Shannon's theorem to

Uploaded by

9s2vvbzwmn
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/ 2

Spring 21, EE 357: Computer Networks

Homework 1

Solution to problem 1
Consider the first bit in a packet. Before this bit can be transmitted, all of the bits in
the packet must be generated. This requires
56 × 8
sec = 7msec (1)
64 × 103
The time required to transmit the packet is
56 × 8
sec = 224µsec (2)
2 × 106
Propagation delay = 10 msec.
A similar analysis shows that decoding we need 7msec.
So the delay until decoding is

7msec + 224µsec + 10msec + 7msec = 24.224msec (3)

Solution to problem 2
a) 20 users can be supported
b) p = 0.1
( )
120 n
c) p (1 − p)120−n
n
( )
∑20 120 n
d) 1 − n=0 p (1 − p)120−n = 1 − 0.992 = 0.008
n
Solution to problem 3
a) 160000 bits
b) 160000 bits
c) The bandwidth-delay product of a link is the maximum number of bits that can be in
the link.
d) The width of a bit = length of link / bandwidth-delay product, so 1 bit is 125 meters
long, which is longer than a football field
e) s/R
Solution to problem 4

1
6
a) Time to send message from source host to first packet switch = 8×10
2×106
sec = 4sec. With
store-and-forward switching, the total time to move message from source host to destination
host 4sec × 3 = 12sec.
3
b) Time to send 1st packet from source host to first packet switch = 2×10
2×106
sec = 1msec.
nd st
Time at which 2 packet is received at the first switch = time at which 1 packet is received
at the second switch 2 × 1msec = 2msec.
c) Time at which 1st packet is received at the destination host = 1msec × 3 = 3msec.
After this, every 1msec one packet will be received; thus time at which last (4000th ) packet
is received = 3msec + 3999 × 1msec = 4.002sec. It can be seen that delay in using message
segmentation is significantly less (almost 31 ).
d) Drawbacks:

• Packets have to be put in sequence at the destination.

• Message segmentation results in many smaller packets. Since header size is usually
the same for all packets regardless of their size, with message segmentation the total
amount of header bytes is more.

Solution to problem 5
According to Shannon theorem, the maximum data rate of this channel = 4k × log2 (1 +
S/N ) = 4k × log2 (1 + 1000) ≈ 4k × 10 = 40kbps. So it’s impossible to provide 56kbps data
rate service on this channel.
Solution to problem 6
The total delay of the circuit-switched network= circuit setup time + transmission delay
+ propagation delay = s + x/b + k × d.
For the packet-switched network, the total delay of the packet-switched network = the
end-to-end delay of the first packet + transmission delay of all the packets except the first
one = x/b + (k − 1)p/b + k × d
So compare these two delays, we can conclude that if (k − 1)p < b × s , then the packet
network has a lower delay.

You might also like