Stable internet routing without global coordination
IEEE/ACM Transactions on Networking (TON)
MATE: multipath adaptive traffic engineering
Computer Networks: The International Journal of Computer and Telecommunications Networking
Guidelines for interdomain traffic engineering
ACM SIGCOMM Computer Communication Review
Stability of end-to-end algorithms for joint routing and rate control
ACM SIGCOMM Computer Communication Review
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Policing congestion response in an internetwork using re-feedback
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Designing DCCP: congestion control without reliability
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
The resource pooling principle
ACM SIGCOMM Computer Communication Review
A mutualistic resource pooling architecture
Proceedings of the Re-Architecting the Internet Workshop
An overview of routing optimization for internet traffic engineering
IEEE Communications Surveys & Tutorials
Interdomain traffic engineering with BGP
IEEE Communications Magazine
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
There has long been a need for a robust and reliable system which distributes traffic across multiple paths. In particular such a system must rarely reorder packets, must not require per-flow state, must cope with different paths having different bandwidths and must be self-tuning in a variety of network contexts. PREFLEX, proposed herein, uses estimates of loss rate to balance congestion. This paper describes a method of automatically adjusting how PREFLEX will split traffic in order to balance loss across multiple paths in a variety of network conditions. Equations are derived for the automatic tuning of the time scale and traffic split at a decision point. The algorithms described allow the load balancer to self-tune to network conditions. The calculations are simple and do not place a large burden on a router which would implement the algorithm. The algorithm is evaluated by simulation using ns-3 and is shown to perform well under a variety of circumstances. The resulting adaptive, end-to-end traffic balancing architecture provides the necessary framework to meet the increasing demands of users while simultaneously offering edge networks more fine-grained control at far shorter timescales.