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.

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.

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

Consider TDM-based circuit switching with 8000 frames per second and 32 time slots per frame. During each time slot 8 bits are sent. What is the shortest time possible (in seconds) to transmit a 1 Mbyte file over the given link?
In an asynchronous 8 bit transmission using a UART (8051), the crystal in use is 22.1184 MHz. The required Baud rate is 19200. What is the minimum time to transmit a packet containing 124 bytes? Give the answer in ms.
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 signal in a network has a propagation velocity of 1.77x10" m/s and a delay of 4.3 us introduced by each repeater. If the round trip delay for two computers at either end of a link that includes three repeaters is 52.92 us, calculate the length of this link? Express your answer in kilometers.
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?
A serial transmission T1 uses 8 information bits, 2 start bits, 1 stop bit and 1 parity bit for each character. A synchronous transmission T2 uses 3 eight-bit sync characters followed by 30 eight bit information characters. If the bit rate is 1200 bits/second in both cases, what are the transfer rates of T1 and T2?
800 b frames are sent over a 500 kbps communication channel. The communication channel usesGBN protocol with 3 bit sequence numbers. The propagation delay is 20 ms. Confirmationsare of size 500 b. Headers and control information are negligible in size.What is the maximum efficiency of this channel?
Consider a baseband bus where the average distance between any two stations is 375m with a data rate of 10Mbps and a propagation delay of 200m/μs. If two stations begin to transmit at exactly the same time, how long does it take for each to notice the interference, and how many bit are sent by each station by that time.
Consider a 1Mbps transmission channel. The clock at the receiver has a drift of 1 second in one year. How long asequence of bits (or frame) can be sent before the clock drift could cause a problem? Assume that the sender and receiver are synchronized at the beginning of each frame and that they cannot resynchronize during the frame. Also, assume that the receiver samples the received signal at the middle of each bit duration to detect if it is 0 or 1.
A line has a signal-to-noise ratio of 1000 and a bandwidth of 4000 kHz. What is the maximum data rate supported by this line? If the bandwidth of the channel is 5 kbps, how long does it take to send a frame of 100,000 bits out of this device? What is the maximum data rate of a channel with a bandwidth of 200 kHz if we use four levels of digital signaling?
Assume that, in a Stop-and-Wait system, the length of the line is 10 Km, the volume of the pipe is 5Kbytes, and 1 bit takes 40 milliseconds to make a round trip. What is the bandwidth of the line?