Change search
ReferencesLink to record
Permanent link

Direct link
Routing in Content Addressable Networks: Algorithms and Performance
Responsible organisation
2009 (English)Conference paper (Refereed) PublishedAlternative title
Routning i CAN : Algoritmer och Prestanda (Swedish)
Abstract [en]

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.

Abstract [sv]

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.

Place, publisher, year, edition, pages
Hoi An, Vietnam: IEEE , 2009.
Keyword [en]
CAN, P2P, Routing, Virtualization, Overlay
National Category
Telecommunications Computer Science
URN: urn:nbn:se:bth-8053Local ID: diva2:835740
20th ITC-Specialist Seminar
Available from: 2012-09-18 Created: 2009-06-11 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(203 kB)134 downloads
File information
File name FULLTEXT01.pdfFile size 203 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Fiedler, Markus
TelecommunicationsComputer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 134 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 23 hits
ReferencesLink to record
Permanent link

Direct link