Routing on Overlay Networks: Developments and Challenges

Document type: Journal Articles
Article type: Original article
Peer reviewed: Yes
Full text:
Author(s): Adrian Popescu
Title: Routing on Overlay Networks: Developments and Challenges
Journal: IEEE Communications Magazine
Year: 2005
Volume: 43
Issue: 8
ISSN: 0163-6804
Publisher: IEEE
Organization: Blekinge Institute of Technology
Department: School of Engineering - Dept. of Telecommunication Systems (Sektionen för teknik – avd. för telekommunikationssystem)
School of Engineering S- 372 25 Ronneby
+46 455 38 50 00
http://www.tek.bth.se/
Authors e-mail: adrian.popescu@bth.se
Language: English
Abstract: Overlay networks are networks operating on the inter-domain level, where the edge hosts learn of each other and, based on knowledge of underlying network performance, they form loosely coupled neighboring relationships. These
relationships can be used to induce a specific graph, where nodes are representing hosts and edges are representing neighboring relationships. Graph abstraction and the associated graph theory can be further used to formulate routing algorithms on overlay networks. The main advantage of overlay networks is that they offer the possibility to augment the IP routing as well as the QoS functionality offered by the Internet.
Subject: Computer Science\Networks and Communications
Telecommunications\VP and VC Assignment and Routing
Keywords: overlay networks, routing, QoS, multipath, security
Edit