In Traceroute why can the round-trip delay of packet be different than the round-trip delay of packet to the exact same router? this is not possible, the round-trip delay to the same router should be identical (similarism) because Traceroute increments a delay counter after each transmission (incremental) because the queuing delays within the network vary with time (dynamic)

In Traceroute why can the round-trip delay of packet be different than the round-trip delay of packet to the exact same router? this is not possible, the round-trip delay to the same router should be identical (similarism) because Traceroute increments a delay counter after each transmission (incremental) because the queuing delays within the network vary with time (dynamic)

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

Related questions

Q: 5)Consider a reliable data transfer protocol that uses only negative acknowledgments. Suppose the…

A: GIVEN:

Q: ssume that 2 packets arrive simultaneously to a switch at which one other packet is halfway done…

A: The value 0.027 seconds is correct but the method is unclear. The other comment provides the correct…

Concept explainers

Network transmission cabling

A network is a collection of devices connected by communication links. A device can be a computer or any instrument capable of sending and receiving data or information formed by other nodes toward the network. A channel that connects people or things is known as a network. It sends the data from one place to another. It is the basic concept of a computer, network, and data communications.

Question

In Traceroute why can the round-trip delay of packet <n> be different than the round-trip delay of packet <n+1> to the exact same router?

	this is not possible, the round-trip delay to the same router should be identical (similarism)
	because Traceroute increments a delay counter after each transmission (incremental)
	because the queuing delays within the network vary with time (dynamic)

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: Traceroute and round-trip delay

VIEW

Step 2: Round-trip delay of packet <n> be different than the round-trip delay of packet <n+1>

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

4. If delays are recorded as 8-bit numbers in a 50-router network, and delay vectors are exchanged twice a second, how much bandwidth per (full-duplex) line is chewed up by the distributed routing algorithm? Assume that each router has three lines to other routers.
In this example, assume that the fixed path is used to transport a packet from a source to an address at the other end of the network. List the many components of delay as well: Approximately how many delays are continuous for how long, and approximately how many are timedependent?
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 that KJ sends 3596 back-to-back packets, with each packet composed of 14,000 bits, to TA over 5 links (shown below). Suppose that the transmission rate of each link is 70,000 bits/sec (bps). Consider the routers to be store-and-forward routers. In such a scenario, find the endto- end delay of sending all the packets to TA (i.e., the time needed for the last bit of the last packet to arrive at TA since KJ starts transmitting the first bit of the first packet). Note, consider only the transmission delay that occurs in sending packets in your analysis. Show the steps used for derivation in detail. 70,000 bps 70,000 bps 70,000 bps 70,000 bps 70,000 bps KJ Router 1 Router 2 Router 3 Router 4 ТА
I need the answer as soon as possible
Consider a client and a server connected through one router. Assume the router can start transmitting an incoming packet after receiving its first 0.6 Mbits instead of the whole packet. Suppose that the transmission rate of each link is 6 Mb/s and that the client transmits one packet with a size of 2 Mbits to the server. Assume the propagation, processing, and queuing delays are negligible. Answer the following questions (use up to 4 significant digits if needed; e.g., yy.xxxx): What is the end-to-end delay?3D seconds What is the end-to-end delay if there are 2 routers between the client and the server?= seconds
Urgent
"An application message is segmented into 20 packets, each of which is 2500-byte in size. Calculate the end-to-end delay in milliseconds (ms) for the message when the bit rate for any node is 10 Mbps, the optical path total distance is 1200-km, and the queuing and processing delays are 1-ms and 3-ms, respectively. There are 2 intermediate routers in the path, each of which uses the store and-forward approach. Round your answer to the nearest integer. Question 16 of 37
Assume that 2 packets arrive simultaneously to a switch at which one other packet is halfway done being transmitted on the outbound link and two other packets are waiting to be transmitted. Each packets is of length N = 1600 bytes and the outbound link has transmission rate R = 1.28 Mbps. Assume that the queuing buffer is big enough to hold at least five packets. What is the average queuing delay for the arriving 2 packets?
A factor in the delay of a store-and-forward packet-switching system is how long it takes to store and forward a packet through a switch. If switching time is 10 usec, is this likely to be a major factor in the response of a client-server system where the client is in New York and the server is in California? Assume the propagation speed in copper and fiber to be 2/3 the speed of light in vacuum.
Let a denote the rate of packets arriving at a link in packets/sec, and let μ denote the link’s transmission rate in packets/sec. Based on the formula for the total delay (i.e., the queuing delay plus the transmission delay) derived in the previous problem, derive a formula for the total delay in terms of a and μ.
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?