IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Dynamic Overlay Networks for Robust and Scalable Routing

Dynamic Overlay Networks for Robust and Scalable Routing
View Sample PDF
Author(s): Bart De Vleeschauwer (Ghent University, Belgium), Filip De Turck (Ghent University, Belgium), Bart Dhoedt (Ghent University, Belgium)and Piet Demeester (Ghent University, Belgium)
Copyright: 2010
Pages: 23
Source title: Handbook of Research on P2P and Grid Systems for Service-Oriented Computing: Models, Methodologies and Applications
Source Author(s)/Editor(s): Nick Antonopoulos (University of Derby, UK), Georgios Exarchakos (University of Surrey, UK), Maozhen Li (Brunel University, UK)and Antonio Liotta (Technical University of Eindhoven, The Netherlands)
DOI: 10.4018/978-1-61520-686-5.ch023

Purchase

View Dynamic Overlay Networks for Robust and Scalable Routing on the publisher's website for pricing and purchasing information.

Abstract

This chapter discusses the use of peer-to-peer overlay networks to route around failures and congestion points in the Internet. The motivation for this type of overlay network is that often the network layer takes considerable time to react to link failure and is typically not capable of avoiding congestion. For instance, it has been reported that link failure may take the BGP system more than fifteen minutes to react. As a result, the services going over these links suffer from lost connectivity or severe quality degradation in the case of congestion. One technique to solve this problem is to use overlay routing techniques to detect these problems and to route around the problematic link(s). In this chapter we elaborate on the overall architecture of such a system. The concept is introduced and the architecture and implementation of prototype components implementing the behavior is discussed. Subsequently it is described how the overlay topology can be managed dynamically to achieve the same performance as a full mesh topology with a number of overlay edges that scales linearly with the number of nodes in the network.

Related Content

Radhika Kavuri, Satya kiranmai Tadepalli. © 2024. 19 pages.
Ramu Kuchipudi, Ramesh Babu Palamakula, T. Satyanarayana Murthy. © 2024. 10 pages.
Nidhi Niraj Worah, Megharani Patil. © 2024. 21 pages.
Vishal Goar, Nagendra Singh Yadav. © 2024. 23 pages.
S. Boopathi. © 2024. 24 pages.
Sai Samin Varma Pusapati. © 2024. 25 pages.
Swapna Mudrakola, Krishna Keerthi Chennam, Shitharth Selvarajan. © 2024. 11 pages.
Body Bottom