A 1-km long, 10 Mbps CSMA/CD LAN (not 802.3) has a propagation speed of 200 m/u sec. Repeaters are not allowed in this system. Data frames are 256 bits long, including 32 bits of header, checksum, and other overhead. The first bit slot after a successful transmission is reserved for the receiver to capture the channel in order to send a 32-bit acknowledgement frame. What is the effective data rate, excluding overhead, assuming that there are no collisions? 4. Compute each of the following: round-trip propagation time, the time for transmitter seizing cable, the time of transmitting data, the delay for last bit from the transmitter to get to the end, the time for receiver seizing cable, the time for acknowledgement, and the delay for the last bit from the receiver to get to the end. State the final effective data rate. Solution:

A 1-km long, 10 Mbps CSMA/CD LAN (not 802.3) has a propagation speed of 200 m/u sec. Repeaters are not allowed in this system. Data frames are 256 bits long, including 32 bits of header, checksum, and other overhead. The first bit slot after a successful transmission is reserved for the receiver to capture the channel in order to send a 32-bit acknowledgement frame. What is the effective data rate, excluding overhead, assuming that there are no collisions? 4. Compute each of the following: round-trip propagation time, the time for transmitter seizing cable, the time of transmitting data, the delay for last bit from the transmitter to get to the end, the time for receiver seizing cable, the time for acknowledgement, and the delay for the last bit from the receiver to get to the end. State the final effective data rate. Solution:

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

A 1-km-long, 10-Mbps CSMA/CD LAN (not 802.3) has a propagation speed of 200 m/sec. Repeaters are not allowed in this system Data frames are 256 bits long, including 32 bits of header, checksum, and other overhead. The first bit slot after a successful transmission is reserved for the receiver to capture the channel in order to send a 32-bit acknowledgement frame. What is the effective data rate, excluding overhead, assuming that there are no collisions?
Assume a 10Mbps Ethernet has two nodes, A and B, connected by a 360m cable with threerepeaters in between, and they each have one frame of 1,024 bits to send to each other. Further assumethat the signal propagation speed across the cable is 2*10^8 m/sec, CSMA/CD uses back-off intervals ofmultiples of 512 bits, and each repeater will insert a store-and-forward delay equivalent to 20-bittransmission time. At time t=0, both A and B attempt to transmit. After the first collision, A draws K = 0and B draws K = 1 in the exponential back-off protocol after sending the 48bits jam signal. a. What is the one-way propagation delay (including all repeater delays) between A and B inseconds? At what time is A's packet completely delivered at B? b. Now suppose that only A has a packet to send and that the repeaters are replaced with switches.Suppose that each switch has an 8-bit processing delay in addition to a store-and-forward delay.At what time, in seconds, is A's packet delivered at B?
The distance between two microwave towers, with the link capacity 100 Mbps, is 24 Km and the speed of the signal is 3 x 10^8 m/sec. If the frame size is 50 KB in the GoBack-N protocol, The approximate link utilization is _in %(. Assume that the ACK packets are negligible in the size and there are no errors during communication ) Correct answer will be appreciated , else downvoted.
not handwritten A 3000-km long, 1 Mbps link is used to transmit 1000-bit data packets using the Selective Repeat protocol. If the speed of light in this link is 2 x 105 km/second. What is the minimum number of bits the sequence numbers should be? Assume no flow control, and negligible transmission and processing times for acknowledgments. (Take 1M = 1000,000.)
A frame of 1200 bytes travel through five switches along the path. Each link has a bandwidth of 100 Mbps, a length of 100 m, and a propagation speed of 2 × 10*8 m/sec. Assuming a queuing and processing delay of 2 ms at each switch, what is the approximate end-to-end delay for this packet?
This elementary problem begins to explore propagation delay and transmission delay, twocentral concepts in data networking. Consider two hosts, A and B, connected by a single link ofrate R bps. Suppose that the two hosts are separated by m meters, and suppose the propagationspeed along the link is s meters/sec. Host A is to send a packet of size L bits to Host B.a. Express the propagation delay, dprop, in terms of m and s.b. Determine the transmission time of the packet, dtrans, in terms of Land R.c. Ignoring processing and queuing delays, obtain an expression for the endto-end delay.d. Suppose Host A begins to transmit the packet at time t = 0. At time t = dtrans,where is the last bit of the packet?e. Suppose dprop is greater than dtrans. At time t = dtrans, where is the first bit ofthe packet?f. Suppose dprop is less than dtrans. At time t = dtrans, where is the first bit ofthe packet?g. Suppose s = 2.5 · 108, L = 120 bits, and R = 56 kbps. Find the distance mso that dprop equals…
Computer Science Two flows are transmitting at a constant rate of 4Mbps and 8Mbps and compete for service at a 10Mbps link. If the link adopts an RED policy, what is the expected drop probability for each flow?
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?
A 16 x 16 Router, where each input runs at 7 Gbps. Assume, the average RTT= 120 msec. What is the rule of thumb for the minimum router buffer size in Mbytes?
A 8 X 8 Router, where each input runs at 6 Gbps. Assume, the average RTT = 150 msec. What is the latest recommendation for the minimum router buffer size in Mbytes if you have 64 flows?
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)
The Syldavia TGV is equipped with a computer network with CSMA/ CD-type access protocols. The signal travels at 200,000 kilometers per second. Each transmitted frame is 300 bytes. Speed is 1 Gbit/s. Knowing that the size of each truck that makes up this TGV is 24 m, A:how many trucks can we have at most so that the CSMA/CD protocol can work properly (detailed calculations)? B:If a TGV consists of eight cars travelling at 250 km/h, how far does it travel (collision-free) before the rear of the train receives the frame sent by the head of the train?