Clement Tochukwu Okolo

C00481669
CSCE 513 & INFX 540
Assignment 1

1.
Access Technology Transmission Rate (TR) Comment

Dial-up modems 40 - 56 kbps upstream and Dedicated transmission

downstream rate

HFC 40 Mbps - 1.2 Gbps downstream Shared transmission rate

30 - 100 Mbps upstream

DSL 24-52 Mbps downstream Dedicated transmission

3.5-16 Mbps upstream rate

2. Consider two hosts, A and B, connected by a single link of rate R bps. Suppose that the two
hosts are separated by m meters, and suppose the propagation speed along the link is s meters/
sec. Host A is to send a packet of size L bits to Host B. (15pts)
Answers:
rate = R bps; d = m meters, propagation speed = s meters/ sec; Length = L bits; N=1

a) dprop = d/s = m/s secs

b) dtrans = L/R secs

c) dend-to-end = N * ( dproc + dqueue + dtrans + dprop)

dend-to-end = 1 (0+0+ L/R + m/s)
dend-to-end = L/R + m/s

d) If dprop = 0, the last bit of the packet would be at Host B at time t = dtrans. However, if
dprop = m/s, the last bit of the packet would just be leaving Host A at time t = dtrans.

e) If dprop > dtrans, the first bit of the packet will still be in the link at time t = dtrans.

f) If dprop < dtrans, the first bit would at Host B at time t = dtrans.

8
g) s= 2.5*10
L =120 bits
3
R =56 kbps = 56*10 bps
dprop = dtrans => m/s = L/R => m = (sL)/R
8 3
m = (2.5*10 x 120) / (56*10 )
5
m = 5.4 *10 meters
3. length = L bits
number of links, N = 3
link i, i = 1,2,3 (meaing that the values for i is the same for the other two links)
distance = di
propagation speed = si
R=Ri

dproc = dproc

dqueue=0
In terms of di, si, Ri, (i=1,2,3), and L, the total end-to-end delay for the packet is:
dend-to-end = (N-1)dproc + (N)dtrans + (N)dprop
dend-to-end = (2)dproc + (3)(L/Ri) + (3)(di/si)
dend-to-end = dproc + dproc + L1/R1 + L2/R2 + L3/R3 + d1/s1 + d2/s2 + d3/s3

Suppose:

L = 1500 bytes * 8 = 12,000 bits

R = 2Mbps = 2,000,000 bps
8
s = 2.5*10
6 6 6
d1=5,000 km = 5*10 meters; d2=4,000 km = 4*10 meters; d3=1000 km = 1*10 meters
-3
dproc = 3msec =3*10
dqueue=0
For all three links, (3)dprop = d1/s1 + d2/s2 + d3/s2
6 8 6 8 6 8
(3)dprop = (5*10 /2.5*10 ) + (4*10 /2.5*10 ) + (1*10 /2.5*10 ) = 0.04 sec
-3
dtrans = L/R = 12,000/2,000,000 = 6*10

dend-to-end = (N-1)dproc + (N)dtrans + (N)dprop

-3 -3 -3 -3
dend-to-end = (2)(3*10 ) + (3)(6*10 ) + (0.04) = (6*10 ) + (18*10 ) + (0.04)
dend-to-end= 0.064 secs

4. since R1=R2=R3=R, dtrans=L/R = 12,000 / 2,000,000 = 0.006 secs

dproc=0
since packet switch does not store-and-forward packets, dqueue=0
dprop = d1/s1 + d2/s2 + d3/s2 = 0.04 sec

dend-to-end = dtrans + dprop

dend-to-end = 0.006 + 0.04
dend-to-end = 0.046 secs

5. R = 2Mbps = 2,000,000 bps

 L = 1500 bytes * 8 = 12,000 bits
n, number of packets = 6
The queuing delay for packet 1 = 0
The queuing delay for packet 2 =( ½)L/R
The queuing delay for packet 3 = (3/2) L/R
The queuing delay for packet 4 = (5/2)L/R
The queuing delay for packet 5= (7/2)L/R
The queuing delay for packet 6= (9/2)L/R
Therefore, queuing delay for the packet = (9/2) * (12,000/2,000,000) = 4.5 * 0.006
Queuing delay, dqueue = 0.027 secs

6. Let k be the one path under consideration:

Maximum throughput for one path, k = min{R1k, R2k,..., RNk}

Recall: k = 1,...M
Maximum throughput all paths, M = [min{R1k, R2k,..., RNk}]/M

7. number of links, N = 2
number of packets, n = 2
size of packets L, L1=L2=L
total dprop = N(dprop) = 2(dprop)

dtrans = L/Rs secs

a) bottleneck = Rs bits/secs; that is, Rs < Rc

since both links have equal dprop, lets assume dprop=0
throughput = Rs
neglecting dprop:
The time last bit of the first packet arrives at the destination = 2L/Rs
The time last bit of the second packet arrives at the destination = 3L/Rs
Packet inter-arrival time at the destination = 3L/Rs - 2L/Rs = L/Rs secs
Therefore, the packet inter-arrival time at the destination is the transmission delay (L/Rs
secs).

b) Assuming bottleneck = Rc bits/secs; that is, Rs > Rc:

Yes, it is possible that the second packet queues at the input queue of the second link
because the arrival rate of the second packet would be greater than the transmission rate of
the first packet. The low propagation rate at second link, Rc is responsible for the low
transmission rate of the first packet.
If the time the first packet arrives at the router is L/Rs + dprop, the time the second packet
arrives at the router and queues = 2L/Rs + dprop
 The time the first packet arrives at the destination = L/Rs +L/Rc + dprop
The time the second packet arrives at the router = T + 2L/Rs + dprop
To ensure there is no queue at the second link, the time of arrival of the second packet at the
router must be greater than or equal to the time the second packet arrives at the router:
T + 2L/Rs + dprop > = L/Rs +L/Rc + dprop
T + L/Rs > = L/Rc
T >= L/Rc - L/Rs
Furthermore, to ensure that there is no queuing before the second link, T must be greater
than or equal to the difference of transmission delay at the second link (L/Rc secs) and the
first link (L/Rs secs).
7 6 8
8. d = 2*10 meters; R = 5*10 bps; s= 2.5 *10 meters/sec

7 8
a) dprop = d/s = (2*10 ) / (2.5*10 ) = 0.08 secs

6 5
bandwidth-delay product, R dprop = (5*10 ) * (0.08) = 4*10 bits
b) L= 8*105 bits
maximum number of bits that will be in the link at any given time = R
dprop
6
maximum number of bits that will be in the link at any given time = (5*10 ) * (0.08)
5
maximum number of bits that will be in the link at any given time = 4*10 bits

c) The bandwidth-delay product can be interpreted as the maximum number of bits in a

transmission link at any given time.

d) The width of one bit in the link, L = s/R = (2.5*108 ) / (5*106) = 50m/bit
Since the length of a football field is 105 meters and the length of 1 bit is 50 meters, a bit is
not longer than a football field.

e) The width of one bit in a link, L = s/R

where: L = width of a bit
s = propagation speed
R = transmission rate
6
9. L = 10 bits
R = 5*106 bps
number of links, N = 3
dprop=0
dqueue=0
dproc=0
6
dtrans=L/R = 10 / (5*106 ) = 0.2 secs

a) Time to move the message from the source host to the first packet switch = dtrans = 0.2 secs
dend-to-end = (N)dtrans = 3(0.2) = 0.6 secs

b) number of packets, n = 100 packets

 L = 10,000 bits
Time to move the first packet from source host to the first switch = dtrans
= 10,000 / (5*106) = 0.002 secs
Time the second packet will be fully received at the first switch = 2* dtrans
= 2* (0.002 secs) = 0.004 secs
c) When message segmentation is used:
Time to move the first packet from source host to destination host = (N)dtrans
= 3*(0.002) secs = 0.006 secs
Time to move the file from source host to destination host = 0.006 + (99*dtrans)
= 0.006 + (99*0.002) = 0.204 secs
Comparing answers in part (a) and part (c), it is apparent the sharing the file with message
segmentation is three times faster than without message segmentation. Message
segmentation significantly reduced delay.

d) Two other reasons to use message segmentation are:

I. A single huge packet does not need to be sent into the network because this would cause
smaller packets to suffer unfair delays.
II. There would be increased reliability of network communication because rather than
retransmitting an entire message due to packet loss or bit error, we would only need to
retransmit a single packet. Also, the individual packets of each message do not need to
travel through the same path from source to destination.

e) The demerits of message segmentation include:

I. Many smaller packets of a single message are created. As a result, the overall file cannot be
read if one segmented packet is missing.
II. Segmented packets have to be put in sequence at the destination.