Suppose two nodes, A and B, are attached to opposite ends of a 900 m cable, and that they each have one frame of 1000 bits (including all headers and preambles) to send to each other. Both nodes attempt to transmit at time tO. Suppose there are four repeaters between A and B, each inserting a 20-bit delay. Assume the transmission rate is 10 Mb/s, and CSMA/CD with backoff intervals of multiples of 512 bits is used. After the first collision, A draws K=0 and B draws K=1 in the exponential backoff protocol. Ignore the jam and the 96-bit time delay. What is the one way propagation delay (including repeaters delays) between A and B in seconds? Assume the signal propagation speed is 2*10^8 m/s At what time in seconds is A's packet completely delivered at B?

Suppose two nodes, A and B, are attached to opposite ends of a 900 m cable, and that they each have one frame of 1000 bits (including all headers and preambles) to send to each other. Both nodes attempt to transmit at time tO. Suppose there are four repeaters between A and B, each inserting a 20-bit delay. Assume the transmission rate is 10 Mb/s, and CSMA/CD with backoff intervals of multiples of 512 bits is used. After the first collision, A draws K=0 and B draws K=1 in the exponential backoff protocol. Ignore the jam and the 96-bit time delay. What is the one way propagation delay (including repeaters delays) between A and B in seconds? Assume the signal propagation speed is 2*10^8 m/s At what time in seconds is A's packet completely delivered at B?

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? 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:
Consider two systems are connected with LAN cable. The length of the cable is 3 kilometers and the data transmitted at a rate of 30 MB/s. The signal speed in the cable is 2.5 x 108 m/s. What is the minimum frame size in bits in the CSMA/CD network?
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?
6. Suppose two nodes, A and B, are attached to opposite ends of an 800 m cable, and that they each have one frame of 1,500 bits (including all headers and preambles) to send to each other. Both nodes attempt to transmit at time t=0. Suppose there are four repeaters between A and B, each inserting a 20-bit delay. Assume the transmission rate is 100 Mbps, and CSMA/CD with backoff intervals of multiples of 512 bits is used. After the first collision, A draws K=0 and B draws K=1 in the exponential backoff protocol. Ignore the jam signal and the 96-bit time delay. (a) What is the one-way propagation delay (including repeater delays) between A and B in seconds? Assume that the signal propagation speed is 2.108 m/sec. (b) At what time (in seconds) is As frame completely delivered at B? (c) Now suppose that the repeaters are replaced with switches/routers. That is, each switch incurs a store-and-forward delay in addition to the 20-bit time delay. Also, suppose that only A has a frame to send…
Suppose that there are three inter-media nodes between Host 1 and Host 2, and the transmission rate of each link is 4.096 Mbps. The time of end-to-end circuit established is 0.5 second. How much seconds does it take to send a file of 8.192M byte from host H1 to host H2 over a packet-switched network?
Consider two nodes, A and B are attached to opposite ends of an 1200 meter cable with signal propagation speed is 2 x 10^8 m/sec. Frame size used by both nodes is 1500 bits including header and preambles. Assume transmission rate is 100 Mbps and there are four switches between node A and B each insert 20 bit delay as a processing time in addition to store and forward delay. If only A has packet to send, then the time taken to reach A's packet at B is?
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?
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
Given a link with a maximum transmission rate of 34.1 Mbps. Only two computers, X and Y, wish to transmit starting at time t = 0 seconds. Computer X sends filex (19 MiB) and computer Y sends fileY (222 KiB), both starting at time t = 0. • Statistical multiplexing is used, with details as follows • Packet Payload Size = 1000 Bytes • Packet Header Size = 24 Bytes (overhead) • Ignore Processing and Queueing delays • Assume partial packets (packets consisting of less than 1000 Bytes of data) are padded so that they are the same size as full packets. • Assume continuous alternating-packet transmission. • Computer X gets the transmission medium first. At what time (t = ?) would Filey finish transmitting? Give answer in milliseconds, without units, and round to one decimal places (e.g. for an answer of 0.013777 seconds you would enter "13.8" without the quotes) 1.6
We have a 4 km down CSMA / CD channel with a capacity of 10 Mbps. Assume the average negotiablelength of interval is 2 ∗ ∆ and that the propagation rate is 2 ∗ 10^8 m/s, the length of frames that are transmitted is 50B. What is the efficiency of the network? The result should be rounded to 3 decimal places.
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?
Suppose a system has 50 MB data to send on a network and transmit the data in burst at 8 Mbps, the maximum transmission rate across routers in the network is 6 Mbps, if system uses leaky bucket algorithm, the capacity (in MB) that bucket must hold so that no data is discarded is?.