Assume the following parameters for Go-Back-N (GBN): a) N = 5 b) Round Trip Time (RTT) = 10 milliseconds c) Retransmission Timeout period = 40 milliseconds d) Segment Size = 3300 bytes. Suppose that a sender sent 15 data segments, numbered 1 through 15, to a receiver using the GBN mechanism. Suppose that data segment 4 and data segment 10 were lost the first time the sender sent the segments (but reached the receiver correctly when retransmitted). Apart from the above, there were no other segment losses. What is the average throughput obtained in sending all the data segments (in bytes/sec)? Draw a diagram to show the communication of the segments in detail.

Assume the following parameters for Go-Back-N (GBN): a) N = 5 b) Round Trip Time (RTT) = 10 milliseconds c) Retransmission Timeout period = 40 milliseconds d) Segment Size = 3300 bytes. Suppose that a sender sent 15 data segments, numbered 1 through 15, to a receiver using the GBN mechanism. Suppose that data segment 4 and data segment 10 were lost the first time the sender sent the segments (but reached the receiver correctly when retransmitted). Apart from the above, there were no other segment losses. What is the average throughput obtained in sending all the data segments (in bytes/sec)? Draw a diagram to show the communication of the segments in detail.

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

Frames of 1000 bits are sent over a 106 bps duplex link between two hosts. The propagation time is 25 ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link). 1.1 What is the minimum number of bits (1) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.
Unless specified otherwise, use the free space propagation speed of light 3x108 m/s to calculate the propagation delay. For numerical calculations, the results must show the appropriate unit. Show a complete solution for each problem1. Consider a client-server system with the following parameters and requirements. The client transmits 10x10^6 bits of data every minute to the data server connected directly to it. The transmission link speed is 20x10^6 bps. Each packet is 2,000 bytes long which includes a 20-byte packet header.a. Calculate the number of packets generated per second for data transmission at the client node.b. The system requires every packet must be delivered within 4 ms of generating a data packet. Calculate the maximum link distance between the client and the server that still can meet this requirement. Ignore processing and queuing delays.c. Calculate the number of overhead bits transmitted per second from the client to the server.
Consider a full-duplex 256 Kbps satellite link with a 240 millisecond end-to-end delay. The data frames carry a useful payload of size 12,000 bits. Assume that both ACK and data frames have 320 bits of header information, and that ACK frames carry no data. What is the effective data throughput When using sliding windows with a sender window size of W = 5 data frames?
Consider the following scenario: Frames of 12000 bits are sent over a 400kbps channel using a satellite whose propagation delay is 270ms. Acknowledgements are always piggybacked onto data frames. (That is, in the case of stop-and-wait, the next frame cannot be transmitted until the entire frame containing the acknowledgement is received.) Five-bit sequence numbers are used. What is the maximum achievable channel utilization for (a) Stop-and-wait. (b) Protocol 5 (i.e., Go Back N). (c) Protocol 6 (i.e., Selective Repeat)
1.) There is a data that has a file size of 26Mb with an ethernet overhead of 8 Mb. Find the Total amount of data to be transferred and Throughput, if there is an amount of data loss of 15 Mbps due to errors and acknowledgments. 2.) Assume that the distance between the sender and the receiver is 5000 km and that light travels at 1.7 x 108 m/s. What is the propagation time and the transmission time for a 1.44 MB message if the bandwidth of the network is 3 Mbps? 3.) An analog signal has a bit rate of 36000 bps and a baud rate of 1200 baud. How many data elements are carried by each signal element? How many signal elements do we need?
Assume the following parameters for Go-Back-N a) N 3 b) Round Trip Time (RTT)10 ms c) Retransmission Timeout period 40 ms d) Segment Size: 1200 bytes. Suppose that Bob sends 7 segments, numbere1 through 7, to Alice using the Go-Back-N mechanism. Suppose that Segment 3 and Segment are lost the first time the segments are sent to Alice, but reach Alice correctly when retransmitted. Apart from the above, there were no other segment losses. What is the average throughput obtained in sending all segments (in bytes/sec)? Draw a diagram to show your work in detail. 2. Assume the following parameters for Selective Repeat: b) Round Trip Time (RTT)10 ms c) Retransmission Timeout period 40 ms d) Segment Size: 1200 bytes Suppose that Bob sends 6 segments, numbered 1 through 6, to Alice using Selective Repeat. Suppose that Segment 3 gets lost the first time Bob sends it to Alice, but reaches Alice correctly when retransmitted Apart from the above, there were no other segment losses. What is the…
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. If transmission starts at time t=0, at which time (in seconds) does the first bit arrive at the switch connecting link 1 and link 2?
A file of size 20 KiloBytes is transmitted to a destination over a 10 Megabit/s network link (1 Mega = 10^6, 1 Kilo = 10^3, 1 byte = 8 bits). The propagation delay to the destination is 40 milliseconds (1 milli = 10^−3). Assume the queueing delay encountered by packets of the file is negligible. What is the total delay (in milliseconds) for the file to get to its destination?
Use again the network architecture provided in the figure above, were RS, RC and Ri for i = {1,2,3,4}, the transmission rates of the server link, client link and intermediate network links. Consider a message that is 60 · 106 bits long that is to be sent from client to server. Ignore propagation, queuing, and processing delays. a.Now assume that Rc = 60Mbps, Rs = 40Mbps, R1 = R3 = 30Mbps, R2 = 10Mbps and R4 = 20Mbps. Suppose that the message is segmented into 6000 packets, with each packet being 10,000 bits long. How long does it take to move the first packet from source host to the first switch? When the first packet is being sent from the first switch to the second switch, the second packet is being sent from the source host to the first switch. At what time will the second packet be fully received at the first switch? b) How long does it take to move the file from source host to destination host when message segmentation is used if path R3, R4 is chosen?
Suppose that a binary message – either 0 or 1 – must be transmitted by wire from location Ato location B. However, the data sent over the wire are subject to a channel noise disturbance,so to reduce the possibility of error, the value 2 is sent over the wire when the message is1, and the value −2 is sent when the message is 0. If X, X = {−2,2}, is the value sent atlocation A, the value received at location B, denoted as R, is given byR = X + N ,where N is the channel noise disturbance, which is independent of X. When the message isreceived at location B, the receiver decodes it according to the following rule:if R ≥.5, then conclude that message 1 was sentif R < .5, then conclude that message 0 was sentAssuming that the channel noise, N, is a unit normal random variable and that the message0 or 1 is sent with equal probability, what is the probability that we conclude that the wrongmessage was sent? This is the probability of error for this communication channel
Consider a satellite link with a capacity of 1 Mbps, bit error rate 10^-8 , and propagation delay of 270 msec. Assuming selective reject ARQ with a window of 64 and 10,000 bit frames, calculate the maximum link utilization
Consider a network with a data rate of 10 Mbps. Messages sent on this network have a maximum size of 1000 bits, including a 16-bit control field. What is the number of messages required to send a file F of 4 Mbits from one station to another? Assuming that a station cannot send a new message until it receives an acknowledgment of the successful reception of the previously sent message. The acknowledgment takes the form of a 16-bit message. A timer is set to a duration T after the sending of each message. If time T expires before receiving an acknowledgment, the sending station resends the same message. The distance between the two farthest stations in the network is 1 km. The signal propagation speed is v = 200,000 km/s. What is the minimum value of T? (You ignore the queuing time and the processing time and use only the propagation time and the transmission time)