Total latency is equal to a summation of network delay contributors such as frame transmission time, queuing time, and propagation time. Use the assumptions listed below to answer the questions below. Assumptions: • Host A and Host B are connected to a network. Packets sent from Host A to Host B transit through two Routers, R1 and R2 (Host A ? Router 1? Router 2 -? Host B) • The links that connect the hosts and routers are Ethernet 1000B and are short distance and can be ignored in any further delay calculations • The link between the two routers is 8km long and are connected by a T-1 WAN link (line rate = 1.544Mbps) • a single packet (size = 1500bytes) is routed from Host A to Host B through the network. The two routers, R1 and R2, introduce queuing delay of 3 msec and 5 msec, respectively. • Assume the signal propagation velocity in the T-1 channel = Vp = 2 x 108 m/sec a. Calculate the latency (in msec) required to send the 1500byte packet from Host A to Host B

Total latency is equal to a summation of network delay contributors such as frame transmission time, queuing time, and propagation time. Use the assumptions listed below to answer the questions below. Assumptions: • Host A and Host B are connected to a network. Packets sent from Host A to Host B transit through two Routers, R1 and R2 (Host A ? Router 1? Router 2 -? Host B) • The links that connect the hosts and routers are Ethernet 1000B and are short distance and can be ignored in any further delay calculations • The link between the two routers is 8km long and are connected by a T-1 WAN link (line rate = 1.544Mbps) • a single packet (size = 1500bytes) is routed from Host A to Host B through the network. The two routers, R1 and R2, introduce queuing delay of 3 msec and 5 msec, respectively. • Assume the signal propagation velocity in the T-1 channel = Vp = 2 x 108 m/sec a. Calculate the latency (in msec) required to send the 1500byte packet from Host A to Host B

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

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?
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.
Consider a router buffer preceding an outbound link. In this problem, you will use Little’s formula, a famous formula from queuing theory. Let N denote the average number of packets in the buffer plus the packet being transmitted. Let a denote the rate of packets arriving at the link. Let d denote the average total delay (i.e., the queuing delay plus the transmission delay) experienced by a packet. Little’s formula is N=a⋅d . Suppose that on average, the buffer contains 10 packets, and the average packet queuing delay is 10 msec. The link’s transmission rate is 100 packets/sec. Using Little’s formula, what is the average packet arrival rate, assuming there is no packet loss?
Consider a computer 1 that communicates with a computer 2 via LAN1, router R1, and LAN2. The sending computer1 is running two processes at this time with port addresses k and l. The receiving computer 2 is running three processes at this time with port addresses f, g and h. Process k in the sending computer 1 needs to communicate with process g in the receiving computer 2. Draw the network and show the contents of segments, packets and frames at the network, data link, and transport layer for each hop. Note: Computer 1 has: Physical address=15, Logical address=A Router R1 has: Physical address in the side of LAN 1=20, Logical address in the side of LAN1=B Physical address in the side of LAN 2=50, Logical address in the side of LAN2=D. Computer 2 has: Physical address=77, Logical address=E.
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?
It is theoretically feasible for two hosts to communicate with one another by sending packets back and forth over the same connection. Please enumerate all of the components that are responsible for the overall amount of time required to process a single packet, starting to end. Is it to be anticipated that one of the delays will continue for a certain amount of time, while the duration of the other delay will be more unpredictable?
1. Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. (a) i. Tabulate the executed iteration for the Dijkstra Algorithm using the table below. Iteration Nodes R1 R2 R3 R4 R5 R7 R8 R9 R10 0 [6] 1 [6,3] 2 [6,3,2] 3 [6,3,2,1] 4 [6,3,2,1,4] 5 [6,3,2,1,4,5] 6 [6,3,2,1,4,5,7]…
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
Under the assumption of no packets loss, how long will it take TCP to send an object that is 20KB over a link with a RTT of 400 milliseconds, a MSS of 2KB, and a rate of 10KB/second when: a. TCP is in slow start, CongWin = 1 and Threshold = 10: b. TCP is in congestion avoidance, CongWin = 5 and Threshold = 5
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,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?
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…
Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. Tabulate the executed iteration for the Dijkstra Algorithm using the table below. Iteration Nodes R1 R2 R3 R4 R5 R7 R8 R9 R10 0 [6] 1 [6,3] 2 [6,3,2] 3 [6,3,2,1] 4 [6,3,2,1,4] 5 [6,3,2,1,4,5] 6 [6,3,2,1,4,5,7]…