Channel utilization with pipelining. Suppose a packet is 10K bits long, the channel transmission rate connecting a sender and receiver is 10 Mbps, and the round-trip propagation delay is 10 ms. What is the channel utilization of a pipelined protocol with an arbitrarily high level of pipelining for this channel? 1.0 0.1 0.001 0.01 10.0

Channel utilization with pipelining. Suppose a packet is 10K bits long, the channel transmission rate connecting a sender and receiver is 10 Mbps, and the round-trip propagation delay is 10 ms. What is the channel utilization of a pipelined protocol with an arbitrarily high level of pipelining for this channel? 1.0 0.1 0.001 0.01 10.0

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

3.4-8 Channel utilization with pipelining. Suppose a packet is 10K bits long, the channel transmission rate connecting a sender and receiver is 10 Mbps, and the round-trip propagation delay is 10 ms. What is the channel utilization of a pipelined protocol with an arbitrarily high level of pipelining for this channel?
Suppose you are hired to design a reliable byte-stream protocol that uses a sliding window (like TCP). This protocol will run over a 50-Mbps network, the RTT of the network is 80 ms and the maximum segment lifetime is 60 seconds. How many bits would you include in the Advertised Window and Sequence Num fields of your protocol header?
Consider sending real-time data from Host A to Host B over a packet-switched network. Host A takes an 8-bit measurement every millisecond, and Host A collects these into 64-byte packets. There is one link between Hosts A and B; its transmission rate is 5 Mbps, its propagation delay is 2 × 108 meters/sec, and its length is 3 km. As soon as Host A gathers a packet, it sends the packet to Host B. How much time elapses from the time that Host A begins to take the first measurement in a packet until the entire packet reaches Host B?
Consider a network connecting two systems located 4000 kilometers apart. The bandwidth of the network is 500 x Mbps. The propagation speed of the media is 4 × 106 meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is 107 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible. What is the minimum size in bits of the sequence number field?
Consider two hosts, A and B that are connected by a transmissions link of2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and the length of the link is 100Km. a. What is the propagation delay from A to B, that is the amount of time from when the first bit of the packet is transmitted at A, until it is received at B? b. What is the transmission time of the packet at A (the time from when the first bit of the packet is sent into the wire and the time at which the last bit is sent into the wire). c. Suppose now that that length of the link is doubled. What is the propagation delay from A to B now and what is the transmission time? d. Now suppose that node C is connected to node B also by a 2 Mbps, 100 Km link. How long does it take from when the first bit is transmitted by A to when the last bit is received at C, assuming B operates in a store-and -forward manner?
Suppose an extension of TCP allows window size much larger than 64 KB. Assume the extended TCP runs over a 100-Mbps link with RTT 100 ms, segment size is 1 KB, and receiving window size is 1 MB. How long does it take to send a 200 KB file?
Assume a small communication network, consisting of two user stations and a base station (BS). The users are recording and transmitting data collected by sensors and are transmitting the data frames using frequency band BW, (uplink). BS only collects data and acknowledges them. It uses a different band BWBs (downlink) for transmissions. The uplink and downlink channels are assumed perfect; no packets are lost due to bit errors. An Aloha protocol is used to access the medium by the BS and users. The users generate traffic following Poisson distribution, with frame generation rate lu. The time duration of data frames is Tf whereas the duration of acknowledgements is TAck: Determine the probability that the frame generated by a user will be lost.
Consider an application that transmits data at a steady rate (for example, the sender generates an N-bit unit of data every k time units, where k is small and fixed) Also, when such an application starts it will continue running for a relatively long period of time. Answer the following questions, briefly justifying your answer a Would a packet-switched network or a circuit-switched network be more appropriate for this application? Why? b. Suppose that a packet-switched network is used and the only traffic in this network comes from such applications as described above Furthermore, assume that the sum of the application data rates is less than the capacities of each and every link is some form of congestion control needed? Why?
. You are hired to design a reliable byte-stream protocol that uses a sliding window (like TCP). This protocol will run over a 1-Gbps network. The RTT of the network is 140 ms, and the maximum segment lifetime is 60 seconds. How many bits would you include in the AdvertisedWindow and SequenceNum fields of your protocol header?
Consider the Go-Back-N (GBN) and Selective Repeat (SR) protocols with a sender window size of 4 and a sequence number range of 1024. For each of these protocols, describe what happens for the following cases: The first packet in the sender window size is lost before reaching the destination. All transmitted packets reached the destination except the third one. Only the first and last packets in the sender window size reached the destination. Only the ACKs of the first and last packets, in the sender window size, reached the destination.
This question deals with the Poisson process and is formulated in terms of a subway station. It could as wellbe formulated in terms of a networking problem. A subway station where different train lines intersect is likeswitch/router in the communication network with the different train lines corresponding to what are calledLabelled Switched Paths (LSPs). As for the trains, you can think of them as packets or burst of packets. Onecan draw this analogy also in optical networks which forms the core of the Internet backbone. Two one-way subway lines, the A train line and the B train line, intersect at a transfer station, A trainsand B trains arrive at the station according to independently operating Poisson processes with rates λA =3 trains/hr and λB = 6 trains/hr. We assume that passenger boarding and un-boarding occurs almostinstantaneously. At a random time, Bart, a prospective passenger, arrives at the station, awaiting an A train.[Note that the superposition of two Poisson processes…
Consider an application which transmits data at a bursty rate (e.g., the sender generates data for short burst of time and the sender is idle almost all the time)Would a packet-switched network or a circuit-switched network be more appropriate for this application?Why?