FKF-DTEWRP-06

Simon Fischer, Nils Kammenhuber, Anja Feldmann. ReplEx - Dynamic Traffic Engineering Based on Wardrop Routing Policies. In Proceedings of the 2nd Conference on Future Networking Technologies (CoNEXT), (Location: Lisboa, Spain), ACM Press, New York, NY, USA, 2007.

Download [help]

Download paper: Adobe portable document (pdf)

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

One major challenge in communication networks is the problem of dynamically distributing load in the presence of bursty and hard to predict changes in traffic demands. Current traffic engineering operates on time scales of several hours which is too slow to react to phenomena like flash crowds or BGP reroutes. One possible solution is to use load sensitive routing. Yet, interacting routing decisions at short time scales can lead to oscillations, which has prevented load sensitive routing from being deployed since the early experiences in Arpanet.

However, recent theoretical results have devised a game theoretical re-routing policy that provably avoids such oscillation and in addition can be shown to converge quickly. In this paper we present REPLEX, a distributed dynamic traffic engineering algorithm based on this policy. Exploiting the fact that most underlying routing protocols support multiple equal-cost routes to a destination, it dynamically changes the proportion of traffic that is routed along each path. These proportions are carefully adapted utilising information from periodic measurements and, optionally, information exchanged between the routers about the traffic condition along the path.

We evaluate the algorithm via simulations employing traffic loads that mimic actual Web traffic, i. e., bursty TCP traffic, and whose characteristics are consistent with self-similarity. The simulations quickly converge and do not exhibit significant oscillations on both artificial as well as real topologies, as can be expected from the theoretical results.

Keyword

[ Te ]

Contact

Nils Kammenhuber
Anja Feldmann

BibTex Reference

@InProceedings{FKF-DTEWRP-06,
   Author = {Fischer, Simon and Kammenhuber, Nils and Feldmann, Anja},
   Title = {ReplEx - Dynamic Traffic Engineering Based on Wardrop Routing Policies},
   BookTitle = {Proceedings of the 2nd Conference on Future Networking Technologies (CoNEXT)},
   Publisher = {ACM Press},
   Address = {New York, NY, USA},
   Location = {Lisboa, Spain},
   Year = {2007}
}

EndNote Reference [help]

Get EndNote Reference (.ref)

It has been automatically generated using the bib2html program.