# Unnecessary mathematics: queuing delay for two types of network traffic

This morning I asked myself what I thought was an interesting question:

• If there are two types of traffic in a network, where one is much less common than the other, will the two types experience different queuing delays?

If you have more common sense than me, you’ve already figured out that the answer is “No.” But it took me about an hour to figure this one out.

I designed a simple model of the scenario: there is a queue of packets, and one of them is of a different type than the rest. Let’s call the two types and .

We can assume that the position in the queue reflects the queuing delay of the packet, so then we only need to be interested in the average position in the queue for each type of traffic: , and .

We assume that there are packets of type , and one packet of type . We can place the type- packet at any of the positions in the queue with equal probabilities:

• • The term summed in the formula for represents the average position of all type- packets. In , there is only one packet so the term doesn’t need another sum inside of it.

Well, it turns out that and both simplify to .

This should be immediately obvious in the formula for , and it takes just a little more work to derive for . Yep, it couldn’t have been simpler.

If you think about it, this result makes a lot of sense and I shouldn’t have needed to compute it — if I’m at a random position in line, then so is everyone else. So it doesn’t matter whether I’m averaging over a group of people, or only worrying about myself. We’ll all wait the same amount of time (on average, of course). 