Question

Problem 1. RDT: Sender Utilization (20 pt.) Recall the example of sender utilization when assuming either stop-and-wait or pipelined protocols. Assume a 100 Mbps link with 50 msec propagation delay between two hosts. Also assume the packet length is 1,500 bytes. a. Calculate sender utilization (%) under the assumption of the stop-and-wait protocol. b. Calculate sender utilization (%) under the assumption of the pipelined protocol that can send 30 packets without acknowledgment.

Answer #1

a) Transmission Time = T_{t} =

stop & wait =

= 12000 * 10^{-8}

= 12 * 10^{-5}

= 0.12 msec

%

b) In pipelined protocol , we are sending 30 packets in (
T_{p} + T_{t} ) time

=

= 3.59 %

**I have tried to explain it in very simple language and I
hope that i have answered your question satisfactorily.Leave doubts
in comment section if any.**

Problem 1. RDT: Sender Utilization (20
pt.)
Recall the example of sender
utilization when assuming either stop-and-wait or pipelined
protocols. Assume a 100 Mbps link with 50 msec propagation delay
between two hosts. Also assume the packet length is 1,500
bytes.
a) Calculate sender utilization (%)
under the assumption of the stop-and-wait protocol.
b) Calculate sender utilization (%)
under the assumption of the pipelined protocol that can send 30
packets without acknowledgment.

Assume the propagation delay is 5 ms and data rate is 1 mb/s.
Furthermore assume that we are 1250 bite frames with zero
processing time and transmission time for Ack's. What is the
maximum throughput int bits/sec that the sender can achieve given a
stop-and-wait protocol for the case a)no packets lost, and b)packet
loss probability of 0.01(Hint: use the utilization formula)

1) Assume that, in a Stop-and-Wait ARQ system, the
bandwidth of the line is 64 Mbps, and 1 bit takes 16 ms to make a
round trip. What is the bandwidth-delay product?
If the system data frames are 1500 bits in length and the
utilization percentage of the link 80%. How many frames
that can send up before stopping and worrying about the
acknowledgments?
2) A Hamming code
needs a dataword of at least 24 bits. Calculate the values
of k and n...

Multiple choice questions: Circle the correct answer
1) Suppose two hosts, A and B are separated by 1500 kilometers
and are connected by a link of R = 2 Mbps. Suppose the propagation
speed over the link is 3 x 108 meters/s. Considering sending a file
of 100,000 bits from Host A to Host B. Suppose the file is sent
continuously as one large message. The maximum number of bits that
will be in the link at any time is...

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 51 minutes ago

asked 52 minutes ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 2 hours ago

asked 2 hours ago

asked 2 hours ago

asked 2 hours ago

asked 2 hours ago