Suppose A is connected to B via an intermediate router R, as in the previous problem. The A-R link is instantaneous, but the R-B link transmits only one packet each second, one at a time (so two packets take 2 seconds). Assume A sends to B using the sliding window protocol with SWS = 4. For Time 0, 1, 2, 3, 4, state what packets arrive at and are sent from A and B. How large does the queue at R grow? -

Suppose A is connected to B via an intermediate router R, as in the previous problem. The A-R link is instantaneous, but the R-B link transmits only one packet each second, one at a time (so two packets take 2 seconds). Assume A sends to B using the sliding window protocol with SWS = 4. For Time 0, 1, 2, 3, 4, state what packets arrive at and are sent from A and B. How large does the queue at R grow? -

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 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 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…
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. 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,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 3,000 km. For these values, what is the end-to-end delay?
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.
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?
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 d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the propagation speed on all three links is 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? 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 before waiting…
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 d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, and the propagation speed on all three links are 3125km/sec, 10000 km/sec, and 3333km/sec respectively. 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? In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward packets but…
A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other packets are waiting to be transmitted. Packets are transmitted in order of arrival. Suppose all packets are 1,200 bytes and the link rate is 2 Mbps. What is the queuing delay for the packet? More generally, what is the queuing delay when all packets have length L, the transmission rate is R, x bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?
Suppose one packet is transmitted from a source to a destination via a path of N links each with a rate of R. Then, the end to end transmission delay is NL/R. What is the transmission delay time for P packets if the source and destination are connected via M routers?
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 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 d, s , and R denote the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, , and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the propagation speed on all three links is 2.5⋅108m/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?
Consider a scenario in which Host A wants to simultaneously send packets to Hosts B and C. A is connected to B and C via a broadcast channel—a packet sent by A is carried by the channel to both B and C. Suppose that the broadcast channel connecting A, B, and C can independently lose and corrupt packets (and so, for example, a packet sent from A might be correctly received by B, but not by C). Design a stop-and-wait-like error-control protocol for reliably transferring packets from A to B and C, such that A will not get new data from the upper layer until it knows that both B and C have correctly received the current packet. Give FSM descriptions of A and C.