Suppose hosts A and B are connected by a link. Host A continuously transmits the current time from a high-precision clock, at a regular rate, fast enough to consume all the available bandwidth. Host B reads these time values and writes them each paired with its own time from a local clock synchronized with A's. Give qualitative examples of B's output assuming the link has (a) High bandwidth, high latency, low jitter. (b) Low bandwidth, high latency, high jitter. (c) High bandwidth, low latency, low jitter, occasional lost data. For example, a link with zero jitter, a bandwidth high enough to write on every other clock tick, and a latency of 1 tick might yield something like (0000,0001), (0002, 0003), (0004, 0005).

Suppose hosts A and B are connected by a link. Host A continuously transmits the current time from a high-precision clock, at a regular rate, fast enough to consume all the available bandwidth. Host B reads these time values and writes them each paired with its own time from a local clock synchronized with A's. Give qualitative examples of B's output assuming the link has (a) High bandwidth, high latency, low jitter. (b) Low bandwidth, high latency, high jitter. (c) High bandwidth, low latency, low jitter, occasional lost data. For example, a link with zero jitter, a bandwidth high enough to write on every other clock tick, and a latency of 1 tick might yield something like (0000,0001), (0002, 0003), (0004, 0005).

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 two hosts, A and B, connected by a single link of rate R bps. Suppose that the two hosts are separated by m meters, and suppose the propagation speed along the link is s meters/sec. Host A is to send a packet of size L bits to host B. 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 of the packet? f. Suppose dprop is less than dtrans. At time t =dtrans, where is the first bit of the packet?g. Suppose s = 2.5 x 108 , L=100 bits, and R=28 Kbps. Find the distance m so that dprop = dtrans.
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 two hosts, A and B, connected by a single link of rate R bps. Suppose that the two hosts are separated by m meters, and suppose the propagation speed 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 L and R.c. Ignoring processing and queuing delays, obtain an expression for the end-to-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 of the packet?f. Suppose dprop is less than dtrans. At time t =dtrans, where is the first bit of the packet?g. Suppose s = 2.5 x 10^8 , L=100 bits, and R=28 Kbps. Find the distance m so that dprop = dtrans.
Consider two hosts, A and B, connected by a single link of rate R bps. Suppose that the two hosts are separated by m meters, and suppose the propagation speed 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 L and R.c. Ignoring processing and queuing delays, obtain an expression for the end-to-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 of the packet?f. Suppose dprop is less than dtrans. At time t =dtrans, where is the first bit of the packet?g. Suppose s = 2.5 x 108, L=100 bits, and R=28 Kbps. Find the distance m so that dprop = dtrans.
This elementary problem begins to explore propagation delay and transmission delay, two central concepts in datanetworking. Consider two hosts, A and B, connected by a single link of rate R bps. Suppose that the two hosts areseparated by m meters, and suppose the propagation speed along the link is s meters/sec. Host A is to send a packet ofsize 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 L and R.c. Ignoring processing and queuing delays, obtain an expression for the end-to-end delay.d. Suppose Host Abegins 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 of the packet?f. Suppose dprop is less than dtrans. At time t = dtrans, where is the first bit of the packet?g. g. Suppose s = 2.5 · 108, L = 120 bits, and R = 56 kbps. Find the distance m so that dprop…
This elementary problem begins to explore propagation delay andtransmission delay, two central concepts in data networking. Consider two hosts, Aand B, connected by a single link of rate R bps. Suppose that the two hosts areseparated by m meters, and suppose the propagation speed along the link is smeters/sec. Host A is to send a packet of size L bits to Host B. d. Suppose Host A begins to transmit the packet at time t=0 . At time t= ?????? ,where is the last bit of the packet? e. Suppose ????? is greater than ?????? . At time t= ??????, where is the first bit of the packet?f. Suppose ????? is less than ??????. At time t= ?????? , where is the first bit of thepacket?
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…
This elementary problem begins to explore propagation delay andtransmission delay, two central concepts in data networking. Consider two hosts, Aand B, connected by a single link of rate R bps. Suppose that the two hosts areseparated by m meters, and suppose the propagation speed along the link is smeters/sec. Host A is to send a packet of size L bits to Host B.a. Express the propagation delay, ????? , in terms of m and s.b. Determine the transmission time of the packet, ?????? , in terms of L and R.c. Ignoring processing and queuing delays, obtain an expression for the end to-enddelay
Consider a short, 10-meter link, over which a sender can transmit at a rate of 150 bits/sec in both directions. Suppose that packets containing data are 100,000 bits long, and packets containing only control (e.g., ACK or handshaking) are 200 bits long. Assume that N parallel connections each get 1/N of the link bandwidth. Now consider the HTTP protocol, and suppose that each downloaded object is 100 Kbits long, and that the initial downloaded object contains 10 referenced objects from the same sender. Would parallel downloads via parallel instances of non-persistent HTTP make sense in this case? Now consider persistent HTTP. Do you expect significant gains over the non-persistent case? Justify and explain your answer
2. Question; Consider two hosts, A and B, connected by a single link of rate R bps. Suppose that the two hosts are separated by m meters, and suppose the propagation speed along the link is s meters/sec. Host A is to send a packet of size L bits to Host B. Express the propagation delay, ????? , in terms of m and s. Determine the transmission time of the packet, ?????? , in terms of L and R. Ignoring processing and queuing delays, obtain an expression for the end-to-end delay. Suppose , ? = 2?10^8 ?/?, ? = 5 ????? and ? = 100???? Find the distance m so that ????? equals ??????.
Suppose that R = 1 Gbps and Rc is 300 Mbps and Rs is 200 Mbps. Assuming that the servers are sending at their maximum rate possible, enter the link utilization of the shared link, whose rate is R, below. Enter your answer as a decimal, of the form 1.00 (if the utilization is 1, or 0.xx if the utilization is less than 1, rounded to the closest xx).
This elementary problem begins to explore propagation delay andtransmission delay, two central concepts in data networking. Consider two hosts, Aand B, connected by a single link of rate R bps. Suppose that the two hosts areseparated by m meters, and suppose the propagation speed along the link is smeters/sec. Host A is to send a packet of size L bits to Host B. g. Suppose ? = 2.5?108, L=1500 bytes, and R=10 Mbps. Find the distance m sothat ????? equals ??????.