Routing in Content Addressable Networks: Algorithms and Performance

Document type: Conference Papers
Peer reviewed: Yes
Full text:
Author(s): Alexandru Popescu, David Erman, Markus Fiedler, Demetres Kouvatsos
Title: Routing in Content Addressable Networks: Algorithms and Performance
Translated title: Routning i CAN: Algoritmer och Prestanda
Conference name: 20th ITC-Specialist Seminar
Year: 2009
Publisher: IEEE
City: Hoi An, Vietnam
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: app@bth.se, der@bth.se, mfi@bth.se
Language: English
Abstract: Over the last years, virtual networking has evolved towards becoming a dominant platform for the deployment of new services and applications such as large-scale data sharing, multimedia services, application-level multicast communication. A consequence of this evolution is that features like robust routing, efficient search, scalability, decentralization, fault tolerance, trust and authentication have become of paramount importance. Since network virtualization basically represents the process of combining resources of different types, two distinct aspects stand out. The first aspect is virtualization of hardware on network entities, while the second being in essence a virtualized network
such as an overlay network. In this context, overlay networks act as enablers by providing the addressing and routing substrates needed to implement a virtualized network structure. In this paper, we focus on the second aspect of network virtualization and consider the specific case of structured overlay networks with a particular focus on Content Addressable Networks (CAN). An investigation of the existing approaches for structured P2P overlay networks is provided, where we point out their advantages and drawbacks. The essentials of CAN
architecture are presented and based on that, we report on the implementation of a CAN simulator. Our initial goal is to use the simulator for investigating the performance of the CAN with focus on the routing algorithm. Preliminary results obtained in our experiments are reported as well. The results indicate
that greedy routing algorithms perform better than non-greedy algorithms.
Summary in Swedish: Eftersom virtualisering representerar processen att kombinera tillgångar, två distinkta aspekter står ut: Första är virtualisering av hårdvara på nätverks enheter medans den andra är att virtualisera ett nätverk såsom ett overlay nätverk. Vi fokuserar på den andra aspekten av virtualisering med specifikt fokus på Content Addressable Network. Vi undersöker olika strukturerade P2P nätverk och rapporterar av en egen implementerad CAN simulator. Vidare undersöker vi prestandan av CAN nätverket med specifikt focus på dess routnings algoritm. Vi jämför fyra olika implementerade CAN routnings algoritmer i våra experiment och rapporterar resultaten med hänsyn till prestanda.
Subject: Telecommunications\VP and VC Assignment and Routing
Computer Science\Distributed Computing
Telecommunications\General
Keywords: CAN, P2P, Routing, Virtualization, Overlay
Edit