Suppose host A reaches host B via routers R1 and R2: A-R1-R2–B. Fast retransmit is not used, and A calculates TimeOut as 2 x Estimated RTT. Assume that the A-R1 and R2-B links have infinite bandwidth; the R1 →→R2 link, however, introduces a 1-second-per-packet bandwidth delay for data packets (though not ACKS). Describe a scenario in which the R1-R2 link is not 100% utilized, even though A always has data ready to send. (Hint: Suppose A's Congestion Window increases from N to N + 1, where N is R1's queue size)

Suppose host A reaches host B via routers R1 and R2: A-R1-R2–B. Fast retransmit is not used, and A calculates TimeOut as 2 x Estimated RTT. Assume that the A-R1 and R2-B links have infinite bandwidth; the R1 →→R2 link, however, introduces a 1-second-per-packet bandwidth delay for data packets (though not ACKS). Describe a scenario in which the R1-R2 link is not 100% utilized, even though A always has data ready to send. (Hint: Suppose A's Congestion Window increases from N to N + 1, where N is R1's queue size)

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

How is the cost/metric of a route determined in OSPF. Then, let's say that for a packet to get to a destination, it passes over the following 5 networks: Gigabit LAN, 100 Meg connection to ISP, 10 Gigabit ISP network, 10 Megabit ISP connection at remote end, and Gigabit LAN. Calculate the cost of this total route.
Consider the network shown below, and Dijkstra’s link-state algorithm. Suppose that Dijkstra's algorithm has been run to compute the least cost paths from node E to all other nodes. Now suppose that source node E has a packet to send to destination node A. What is the first router to which E will forward this packet on its path to A?
Consider a network with 4 links between two hosts where the maximum allowable packet size is 1000 bits; each link has a transmission rate of 2000 bits per second, except the second link has a transmission rate of 1000 bits per second. How long does it take to send 6000 bits from one host to the other? You may ignore propogation delay, assume there is no other traffic on the network, and assume that no routers drop packets due to queue length. Round your answer to two decimal places.
According to the given figure, assume that, PC0 wants to send a message to PC4. If the distance between the two points is 22,000 km, 3.2-kbyte message sends in 2.4 x 100000000 mls speed through cable and the transmission link has 1.5 Gbps Bandwidth. When the message arrives at Routers , Router0 already has 4 packets to process in the queue and each will need 2ms. Router1 has no packets in the queue, but if it had then would require 3ms to process. Router2 already has 5 packets to process in the queue and each will need 1ms. Calculate the total time to send the message from PC0 to PC4.
Consider the following configuration to connect host A to host B through the three middle nodes with using packet switching to forward packets. Assume the throughput rates for links are R1= 10Mbps, R2=15Mbps, R3=7Mbps, and R4= 10Mbps. How long takes to transfer a file with size of 500MB from host A to Host B? (No queuing, processing delay)?
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?
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 A and B nodes are on the same 10 Mbps broadcast and the propagation delay is 325 bit times between the two nodes. Suppose for this channel CSMA/CD and Ethernet packets are used. Suppose node A begins sends a frame and node B starts sending a frame until it is over. Can A finish transmitting B until it is detected? Why not? Why or why not? If so, then A incorrectly insists that his frame was transmitted safely without a crash. Hint: Suppose t = 0 bits at the moment, A begins sends the frame. In the worst case, a minimum frame of 512 + 64 bit times is transmitted. So A would end the frame at t = 512 + 64 bit times. The . response is no, if the signal B crosses t = 512 + 64 bits before bit time. In the worst scenario, when does B hit A?
Consider figure 2. Assume that we know the bottleneck link along the path from the server to the client is the first link with rate Rs bits/sec. Suppose we send a pair of packets back to back from the server to the client, and there is no other traffic on this path. Assume each packet of size L bits, and both links have the same propagation delay dprop. (a). What is the packet inter-arrival time at the destination? That is, how much time elapses from when the last bit of the first packet arrives until the last bit of the second packet arrives? (b). Now assume that the second link is the bottleneck link (i.e., Re < Rs). Is it possible that the second packet queues at the input queue of the second link? Explain. Now suppose that the server sends the second packet T seconds after sending the first packet. How large must T be to ensure no queuing before the second link? Explain.
Can someone help me with this question please? ASAP??!!! 6. Consider a packet of length L which begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let di, si, and Ri denote the length, propagation speed, and the transmission rate of link i, for i = 1, 2, 3. The packet switch delays each packet by dproc. a. Assuming no queuing delays, in terms of di, si, Ri, (i = 1,2,3), and L, what is the total end-to-end delay for the packet? (10 Points) b. Suppose now the packet is 1,500 bytes, the propagation speed on all three links is 2.5×108 m/s, the transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay? (15 Points)
Consider two hosts, A and B, connected by a single link of rate R bps. Suppose that the two hostsare 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 lastbit of the packet?e. Suppose dprop is greater than dtrans. At time t =dtrans, where is the first bit of the packet?
Consider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let di, si, and Ri denote the length, propagation speed, and the transmission rate of link i, for i=1,2,3. The packet switch delays each packet by dproc. Assuming no queuing delays, in terms of di, si, Ri, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,200 bytes, the propagation speed on all three links is 2.5x10^8 m/s, the transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 4,000 km, the length of the second link is 3,000 km, and the length of the last link is 1,500 km. For these values, what is the end-to-end delay? In the above problem, suppose R1=R2=R3=R and dproc=0. Further suppose the packet switch does not store-and-forward packets but instead immediately transmits each bit it receives…