Consider the following scenario: rdt 3.0 is operating on a link with bandwidth of 100 Mbps. The round trip delay is 50 ms, and packet size is 5000 bits. What would be the link utilization? (write a number with six decimal places) If you were to use pipelining with window size of 5, by what factor could the utilization increase at most? 1

Consider the following scenario: rdt 3.0 is operating on a link with bandwidth of 100 Mbps. The round trip delay is 50 ms, and packet size is 5000 bits. What would be the link utilization? (write a number with six decimal places) If you were to use pipelining with window size of 5, by what factor could the utilization increase at most? 1

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

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?
Describe the signal pattern produced on the medium by the Manchester-encodedpreamble of the IEEE 802.3 MAC frame. Explain the term handoff Assume a system of 32 cells with a cell radius of 1.6 km,a total of 32 cells, a total frequency bandwidth that supports 336 traffic channels,and a reuse factor of N=7. If there are 32 total cells, what geographic area is covered, how many channels are there per cell, and what is the total number of concurrent calls that can be handled. What is the difference between a virtual channel and a virtual path? How does Fast Ethernet differ from 10BASE-T, other than the data rate?
Consider a full-duplex 512 kbps link with length 36,000Km connecting two hosts. The data frames carry a useful payload of size 6000 bits. Assume that both ACK and data frames have 400 bits of header information, and that ACK frames carry no data. The propagation speed along this link is 3×108 m/sec. a) What is the RTT on this link? b) What is the effective useful data throughput, in kbps, when using Stop-and-Wait?
6. Delays. A user in Madagascar, connected to the internet via a 100 Mb/s (b-bits) connection retrieves a 250 KB (B-bytes) web page from a server in Tokyo, where the page references three images of 500 KB each. Assume that the one-way propagation delay is 82 ms and that the user's access link is the bandwidth bottleneck for this connection. a. Approximately how long does it take for the page (including images) to appear on the user's screen, assuming non-persistent HTTP using a single connection at a time? (For this part, you should ignore queueing delay and transmission delays at other links in the network) How long does it take if the connection uses persistent HTTP (single connection)? b. c. Suppose that user's access router has a 4 MB buffer (B-byte) on the link from the router to the user. How much delay does this buffer add during periods when the buffer is full? d. Assume a cache rate of 45% on the information received by the user in Madagascar from the Tokyo server. How does…
a) Consider a CSMA/CD network running at 20 Mb/s over 3-km cable with no repeaters. The signal speed in the cable is 2×108 m/s. Suppose station A starts transmitting a frame of size 400 bytes at time T. i. Can it happen that station A detects a collision at time T+10 us (micro seconds) if there was no collision detected between time T and T+10 μs? Justify your answer. Can it happen that the station detects a collision at time T+20 μs, if there was no collision detected between time T and T+20 us? Justify your answer. iii. Can it happen that the station detects a collision at time T+33 μs, if there was no collision detected between time T and T+33 us?? Justify your answer.
Consider a point to point link 50 km in length. At what bandwidth (Kilo Bytes/second), would propagation delay (at a speed 2 x 108 meters/second) equal transmit delay for 100 byte packets?
Consider a router that transmits bits onto a transmission medium at the rate of 2 Mbps. Let the link be 3 km in length, and bits propagate through the transmission medium at the speed of (approximately) 3x10^8 meters/sec. What is the transmission delay in seconds to transmit a packet of size 2,0o0 bits onto the link? a. 1x10^-5 seconds O b. .001 seconds с. 1 second d. -4 seconds
A router output port is being dimensioned to support a mean packet arrival load of 100 packets per second where the mean packet length is 500 bytes. Determine the minimum output link capacity such only 10% of packets experience a delay greater than 15 ms. Select one: O a. 1.2 Mb/s O b. 4 Mb/s Oc. 1 Mb/s O d. 0.5 Mb/s O e. 0.8 Mb/s
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.)
Computer A uses the Go-back-N ARQ protocol to send a 110 Mbytes file to computer B with a window size of 15. Given each frame carries 100K bytes data. How long does it take to send the whole file (the total time taken from A sending the first bit of the file until A receiving the last acknowledgment)? Given that the transmission rate of the link is 500 Mbps and the propagation time between A and B is 15ms. Assume no data or control frame is lost or damaged and ignore the overhead due to header and trailer.
Consider a system with link utilization is 50%, R.T.T. = 50 µsec, Bandwidth = 10 Mbps. What is data size (in bits).
IN PYTHON Given the following six-node wide area network for which the numbers attached to the links are a measure of the “delay” in using that link (e.g., some lines could be more heavily used than others and therefore have a longer wait time), answer the following question. What is the shortest path from node A to node D, where shortest path is defined as the path with the smallest sum of the delays on each individual link? Explain exactly how you went about finding that path.