Analysis of Performance Improvement with Packet Dispersion

This paper analytically studies performance improvement with packet dispersion. Contrary to the previous work on packet dispersion, we consider the tail distribution of queue length and that of packet delay as performance measures, and we model a packet network as multiple parallel queues where the arrival processes from sources are not renewal but highly bursty. In the numerical results, we observe that packet dispersion can greatly improve the delay performance of packets. We also see that packet-level load balancing is superior to flow-level load balancing.