Dynamics of IP traffic: a study of the role of variability and the impact of control
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
Delayed Internet routing convergence
IEEE/ACM Transactions on Networking (TON)
Cisco ISP Essentials
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Guidelines for interdomain traffic engineering
ACM SIGCOMM Computer Communication Review
Locating internet bottlenecks: algorithms, measurements, and implications
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Designing BGP-based outbound traffic engineering techniques for stub ASes
ACM SIGCOMM Computer Communication Review
A first look at modern enterprise traffic
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Achieving sub-50 milliseconds recovery upon BGP peering link failures
IEEE/ACM Transactions on Networking (TON)
On the performance benefits of multihoming route control
IEEE/ACM Transactions on Networking (TON)
Understanding Internet traffic streams: dragonflies and tortoises
IEEE Communications Magazine
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
BGP routing policies in ISP networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
In the Internet, with many competing networks each trying to optimise its own bandwidth, a stub network has limited knowledge about user demands, available network resources and routing policies of other networks. This uncertainty makes the task of interdomain traffic engineering for a stub network very challenging. The basic aim of a stub network connected to multiple ISPs (multihomed) is to load balance its traffic among its various edge links. Our goal in this work is to distribute the incoming traffic of a multihomed stub network among its various edge links. The focus is on networks that primarily download traffic from the Internet. Regulating the incoming traffic is difficult since it will require to influence the behaviour of the remote destinations. We performed a systematic analysis of our problem and showed that even a restricted instance of the problem is NP-complete. We proposed simple, low-cost route control techniques to load balance traffic by reallocating the routes of outgoing traffic. The techniques were validated using synthetic as well as actual data collected under numerous traffic load conditions. Results show that we can achieve significant improvement in load balancing with minimum traffic re-assignments. Moreover, the proposed techniques neither require any third party assistance nor changes to existing protocols and network setup. This makes our schemes easily deployable in real networks.