Home > Research > Publications & Outputs > Routing performance in a hierarchical DHT-based...

Research

Associated organisational units

Links

Text available via DOI:

View graph of relations

Routing performance in a hierarchical DHT-based overlay network

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

Routing performance in a hierarchical DHT-based overlay network. / Martinez-Yelmo, Isaias; Cuevas, Ruben; Guerrero, Carmen et al.
PDP '08: Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008). Washington, DC, USA: IEEE Computer Society, 2008. p. 508-515.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Martinez-Yelmo, I, Cuevas, R, Guerrero, C & Mauthe, A 2008, Routing performance in a hierarchical DHT-based overlay network. in PDP '08: Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008). IEEE Computer Society, Washington, DC, USA, pp. 508-515. https://doi.org/10.1109/PDP.2008.79

APA

Martinez-Yelmo, I., Cuevas, R., Guerrero, C., & Mauthe, A. (2008). Routing performance in a hierarchical DHT-based overlay network. In PDP '08: Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008) (pp. 508-515). IEEE Computer Society. https://doi.org/10.1109/PDP.2008.79

Vancouver

Martinez-Yelmo I, Cuevas R, Guerrero C, Mauthe A. Routing performance in a hierarchical DHT-based overlay network. In PDP '08: Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008). Washington, DC, USA: IEEE Computer Society. 2008. p. 508-515 doi: 10.1109/PDP.2008.79

Author

Martinez-Yelmo, Isaias ; Cuevas, Ruben ; Guerrero, Carmen et al. / Routing performance in a hierarchical DHT-based overlay network. PDP '08: Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008). Washington, DC, USA : IEEE Computer Society, 2008. pp. 508-515

Bibtex

@inproceedings{8c80b5ae05c4456fbf5e73fa47281dc4,
title = "Routing performance in a hierarchical DHT-based overlay network",
abstract = "The scalability properties of DHT based overlay networks is considered satisfactory. However, in large scale systems this might still cause a problem since they have a logarithmic complexity depending. Further, they only provide a one dimensional structure and do not make use on inherent clustering properties of some applications (e.g. P2PVoIP or locality aware overlays). Thus, structures based on a hierarchical approach can have performance as well as structural advantages. In this paper, a generic hierarchical architecture based on super-peers is presented where a peer ID is composed by a prefix ID and a suffix ID. Prefix ID is only routed at the super-peer level and the Suffix ID at the peer level. We specifically analyse the Routing Performance of this approach within the context of two specific overlays, viz. CAN and Kademlia.",
author = "Isaias Martinez-Yelmo and Ruben Cuevas and Carmen Guerrero and Andreas Mauthe",
year = "2008",
doi = "10.1109/PDP.2008.79",
language = "English",
isbn = "9780769530895",
pages = "508--515",
booktitle = "PDP '08: Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)",
publisher = "IEEE Computer Society",

}

RIS

TY - GEN

T1 - Routing performance in a hierarchical DHT-based overlay network

AU - Martinez-Yelmo, Isaias

AU - Cuevas, Ruben

AU - Guerrero, Carmen

AU - Mauthe, Andreas

PY - 2008

Y1 - 2008

N2 - The scalability properties of DHT based overlay networks is considered satisfactory. However, in large scale systems this might still cause a problem since they have a logarithmic complexity depending. Further, they only provide a one dimensional structure and do not make use on inherent clustering properties of some applications (e.g. P2PVoIP or locality aware overlays). Thus, structures based on a hierarchical approach can have performance as well as structural advantages. In this paper, a generic hierarchical architecture based on super-peers is presented where a peer ID is composed by a prefix ID and a suffix ID. Prefix ID is only routed at the super-peer level and the Suffix ID at the peer level. We specifically analyse the Routing Performance of this approach within the context of two specific overlays, viz. CAN and Kademlia.

AB - The scalability properties of DHT based overlay networks is considered satisfactory. However, in large scale systems this might still cause a problem since they have a logarithmic complexity depending. Further, they only provide a one dimensional structure and do not make use on inherent clustering properties of some applications (e.g. P2PVoIP or locality aware overlays). Thus, structures based on a hierarchical approach can have performance as well as structural advantages. In this paper, a generic hierarchical architecture based on super-peers is presented where a peer ID is composed by a prefix ID and a suffix ID. Prefix ID is only routed at the super-peer level and the Suffix ID at the peer level. We specifically analyse the Routing Performance of this approach within the context of two specific overlays, viz. CAN and Kademlia.

U2 - 10.1109/PDP.2008.79

DO - 10.1109/PDP.2008.79

M3 - Conference contribution/Paper

SN - 9780769530895

SP - 508

EP - 515

BT - PDP '08: Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)

PB - IEEE Computer Society

CY - Washington, DC, USA

ER -