Interaction of overlay networks: properties and implications
ACM SIGMETRICS Performance Evaluation Review - Special issue on the workshop on MAthematical performance Modeling And Analysis (MAMA 2005)
Biologically inspired self-adaptive multi-path routing in overlay networks
Communications of the ACM - Self managed systems
On the interaction of multiple overlay routing
Performance Evaluation - Performance 2005
Dynamic overlay routing based on available bandwidth estimation: a simulation study
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Dynamic overlay routing based on available bandwidth estimation: A simulation study
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Resilient multi-path routing based on a biological attractor selection scheme
BioADIT'06 Proceedings of the Second international conference on Biologically Inspired Approaches to Advanced Information Technology
Binder: a system to aggregate multiple internet gateways in community networks
Proceedings of the 2013 ACM MobiCom workshop on Lowest cost denominator networking for universal access
| Hi-index | 0.01 |
Recently we have seen an emergent trend of self adaptive routing in both Internet and wireless ad hoc networks. Although there are previous methods for computing the traffic equilibria of self adaptive routing (e.g., selfish routing), these methods use computationally demanding algorithms and require that a precise analytical model of the network be given. Also, it remains an open question how to design an adaptive routing scheme which ensures convergence to traffic equilibria in practice. In this paper we propose a simple, efficient, distributed probabilistic routing scheme for self adaptive routing in dynamic, realistic environments. Using both analysis and extensive simulations, we show that our scheme can converge to the desired traffic equilibrium (either user-optimal or network-optimal) very quickly. We find that user-optimal routing can achieve very close to optimal average latency indynamic environments, but such performance often comes at the cost of seriously overloading certain links. To avoid link overloads, we improve adaptive routing by optimizing average user latency and link utilization simultaneously. Our evaluation shows that there is a trade-off between optimizing dual objectives, but the degradation in average latency is only marginal for typical link utilization requirements.