Dispersity routing in high-speed networks
Computer Networks and ISDN Systems - Special issue on high speed networks
Parallel queues with resequencing
Journal of the ACM (JACM)
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
A simple approximation to minimum-delay routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Packet reordering is not pathological network behavior
IEEE/ACM Transactions on Networking (TON)
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Analysis on packet resequencing for reliable network protocols
Performance Evaluation
Asymptotic optimality of the Round---Robin policy in multipath routing with resequencing
Queueing Systems: Theory and Applications
Generalized Load Sharing for Packet-Switching Networks I: Theory and Packet-Based Algorithm
IEEE Transactions on Parallel and Distributed Systems
On the Large Deviations of Resequencing Queue Size: 2-M/M/1 Case
IEEE Transactions on Information Theory
A literature survey on traffic dispersion
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.24 |
In this paper, we propose a framework to study the resequencing mechanism in high-speed networks. This framework allows us to estimate the packet resequencing delay and the resequencing buffer occupancy distributions when data traffic is dispersed on multiple disjoint paths. In contrast to most existing work, the end-to-end path delay distribution is decoupled from the resequencing model. Thus, once the end-to-end path delay distribution is obtained, such as from historical data, our model may be used. In this paper, we illustrate our proposed model with Gaussian distributed path delays. Our results show that the packet resequencing delay and the resequencing buffer occupancy drop when the traffic is spread over a larger number of homogeneous paths, although the network performance improvement quickly saturates when the number of paths increases. We find that the number of paths used in multipath routing should be small, say, up to three.