REPLEX: dynamic traffic engineering based on wardrop routing policies
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
| Hi-index | 0.00 |
Traditionally, traffic in wireless networks is routed along minimum hop paths from sources to destinations. It can be theoreticallyshown that flow avoiding routing provides throughput gains overshortest path routing in random wireless networks by a factor offour when the sources are few enough. Motivated by this, analternative approach to wireless routing using delay measurementsto adaptively route packets in order to achieve a Wardrop equilibriumis presented. The proposed protocol is completely distributed and balances load along loop-free paths. An ns-2 simulation study indicates that the protocol is able toautomatically route flows to "avoid" each other, improving over the performance of shortest-path protocols in a variety ofscenarios. The architectural challenges in implementing such amulti-path, delay based, probabilistic algorithm are discussed.A user-space implementation of the protocol has been built ona modified Linux 2.4.20 kernel. Finally, a measurement study ofthe implementation on a six node testbed is discussed.