A 1 Mbps link is used to transfer packets of each 10,000 bits long. This includes 500 bits header. If the channel is error free and 270 msec is the signal propagation time from the source to destination, obtain the efficiency for, (1) Stop and wait protocol. (i) Sliding window protocol with window size of 500. (iii) Sliding window protocol with window size of 10.

A 1 Mbps link is used to transfer packets of each 10,000 bits long. This includes 500 bits header. If the channel is error free and 270 msec is the signal propagation time from the source to destination, obtain the efficiency for, (1) Stop and wait protocol. (i) Sliding window protocol with window size of 500. (iii) Sliding window protocol with window size of 10.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 8P

See similar textbooks

Similar questions

Computer Science A Go-Back-N (GBN) ARQ scheme has been designed with window-size W = 10 such that it is fully efficient when there are no errors on the channel. Assume that frame size is 20000 bits and the overhead bits are negligible. What is the bit probability error (as seen at Layer 2) that makes the Go-Back-N ARQ 50% efficient?
88. Suppose transmission rate of a channel is 32 kbps. If there are ‘8’ routes from source to destination and each packet p contains 8000 bits. Total end to end delay in sending packet P is ................ a. 2 sec b. 3 sec c. 4 sec d. 1 sec
Suppose you are designing a sliding window protocol for a 2Mbps point to point link to the moon, which has a one way latency of 10 sec. Assume that, each frame carries 1KB of data, what is the minimum number of bits you need for the sequence number?
A channel has a bit rate of 8 kbps and one-way propagation delay of 30 ms. The channel uses Stop and wait protocol. The transmission time of the acknowledgment frame is negligible. To get a channel efficiency of at least 60%, the minimum frame size should be byte.
A channel has a bit rate of 4 kbps and one-way propagation delay of 20 ms. The channel uses stop and wait protocol. The transmission time of the acknowledgement frame is negligible. To get a channel efficiency of at least 50%, the minimum frame size should be
Efficiency Principle:Ethernet V1 access protocol was designed to run at 10 Mbps over 2.5 Km using 1500 Byte packets. This same protocol needs to be used at 100 Mbps at the same efficiency (utilization). What distance can it cover if the frame size is not changed? (Note: be careful with the units.
Suppose that we are sending a 30 Mb MP3 file from a source host to a destination host. All links in the path between source and destination have a transmission rate of 10 Mbps. Assume that the propagation speed is 2 × 108 meters/sec, and the distance between source and destination is 10,000 km. 1. Now suppose there is only one link between source and destination, and there are 10 FDM channels in the link. The MP3 file is sent over one of the channels. What is the end-to-end delay?
We define data link layer communication efficiency as the ratio between a packet transmission time and the sum of the the packet transmission time-and twice of its, propagation time. A channel has a bit rate of 10 kbps and a propagation delay of 10,000 micro-second. For what range of frame sizes (in number of bit) does stop-and-wait give an efficiency of at most 60%?
Assume that the propagation speed in a coaxial cable is 2 ∙108 m/s a. Packets are transmitted using the ABP (alternate bit protocol) over a full-duplex 5-km coaxial cable with a 5 Mbps transmission rate. The packets and ACKs are 1500 bits long. The transmitter and receiver use a CRC chip and their processing time is negligible. How many packets are transmitted every second when there is no transmission error? b. Five transmission lines identical to the one discussed in a) are connected in series. A buffer is used at each connection between the links to store packets as required. How many packets will go through the five lines every second when there are no transmission errors? Now assume that a packet or its acknowledgement is corrupted on any given link with probability p. What is the new packet transmission rate through the five links? Comment. Assume the processing delays and queuing delays for both ends are negligible.
Host A is sending data to host B over a full duplex link. A and B are using the sliding window protocol for flow control. The send and receive window sizes are 5 packets each. Data packets (sent only from A to B) are all 1000 bytes long and the transmission time for such a packet is 50 µs Acknowledgement packets (sent only from B to A) are very small and require negligible transmission time. The propagation delay over the link is 200 Us. What is the maximum achievable throughput in this communication? Discuss on design functionality of sliding window protocol.
What is the delay of sending a data file from a source station to a destination station? Suppose that the length of the data file is 2 Mbytes and the bandwidth of the channel is 1600 bps, and the network link between the sender and receiver is 20000 Km and the speed of the light inside the link is 2x108 meters/second? Assume that the delay is composed of only transmission time and propagation time.
Consider two hosts S and R connected directly by a link. A link has a transmission speed of 107 bits/sec. It uses data packets of size 400 bytes. Data needed to transmitted is 400 bytes. Length of the link is 600 km and the propagation speed are 3 × 108 meter per second. T is the transmission delay and P is the propagation delay. The propagation delay in millisecond and transmission delay in microsecond respectively are