Dynamic algorithms to provide a robust and scalable overlay routing service

Authors:
Bart De Vleeschauwer;Filip De Turck;Bart Dhoedt;Piet Demeester
Affiliations:
Department of Information Technology, Ghent University – IBBT – IMEC, Gent, Belgium;Department of Information Technology, Ghent University – IBBT – IMEC, Gent, Belgium;Department of Information Technology, Ghent University – IBBT – IMEC, Gent, Belgium;Department of Information Technology, Ghent University – IBBT – IMEC, Gent, Belgium
Venue:
ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks
Year:
2006

Citing 2
Cited 2

Resilient overlay networks

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Measuring the effects of internet path faults on reactive routing

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Towards automating overlay network management

Journal of Network and Computer Applications
Optimizing User Quality of Experience through Overlay Routing, Bandwidth Management and Dynamic Trans-Coding

International Journal of Adaptive, Resilient and Autonomic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Service providers and companies wishing to connect a number of distributed sites need a QoS enabled and resilient network to provide their services As network providers can not yet offer multidomain end-to-end QoS and Internet path outages can last several minutes, using Overlay Service Networks to route around congested or failing parts of the network is a hot topic in the research community Typically a full mesh topology is used to connect the servers of the Overlay Service Network Because this approach is not scalable, we propose to use a dynamic topology that is only a fraction of the full mesh A novel algorithm that automatically reconfigures the topology when link outages or congestion occur is introduced We have also developed an on-demand overlay routing algorithm that decreases the overlay network load Through simulation it is shown that our algorithms allow to offer a robust routing service in a scalable way.