Techniques for efficient routing and load balancing in content-addressable networks

Ozgur D. Sahin, Divyakant Agrawal, Amr El Abbadi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

As a Distributed Hash Table (DHT), a Content Addressable Network (CAN) provides efficient routing and object location in a decentralized manner while offering fault tolerance and dynamic peer operations. However, as opposed to other DHTs that use a flat ID space, CAN uses a multi-dimensional logical space. DHTs usually require O(logN) routing information per peer and provide routing in O(logN) hops, where N is the number of peers in the system. In CAN, on the other hand, each peer keeps only constant amount of routing information and the routing takes O(dN 1/d) hops, where d is the dimensionality of the logical space. Hence the routing performance of CAN is worse than other DHTs especially when d is small. In this paper, we describe and evaluate several schemes for efficient routing in CAN by keeping additional routing information at the peers. Furthermore, due to the underlying multi-dimensional ID space, CAN is used by applications that require content-based mapping of data objects onto the ID space. Since uniform hashing is not used, such mappings introduce skewed object distributions among the peers. Thus we also describe load balancing schemes for CAN and investigate their efficiency.

Original languageEnglish
Title of host publicationProceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005
Pages67-74
Number of pages8
Volume2005
DOIs
Publication statusPublished - 1 Dec 2005
Externally publishedYes
Event5th IEEE International Conference on Peer-to-Peer Computing, P2P 2005 - onstanz, Germany
Duration: 31 Aug 20052 Sep 2005

Other

Other5th IEEE International Conference on Peer-to-Peer Computing, P2P 2005
CountryGermany
Cityonstanz
Period31/8/052/9/05

Fingerprint

Resource allocation
Fault tolerance

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Sahin, O. D., Agrawal, D., & El Abbadi, A. (2005). Techniques for efficient routing and load balancing in content-addressable networks. In Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005 (Vol. 2005, pp. 67-74). [1551022] https://doi.org/10.1109/P2P.2005.37

Techniques for efficient routing and load balancing in content-addressable networks. / Sahin, Ozgur D.; Agrawal, Divyakant; El Abbadi, Amr.

Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005. Vol. 2005 2005. p. 67-74 1551022.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sahin, OD, Agrawal, D & El Abbadi, A 2005, Techniques for efficient routing and load balancing in content-addressable networks. in Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005. vol. 2005, 1551022, pp. 67-74, 5th IEEE International Conference on Peer-to-Peer Computing, P2P 2005, onstanz, Germany, 31/8/05. https://doi.org/10.1109/P2P.2005.37
Sahin OD, Agrawal D, El Abbadi A. Techniques for efficient routing and load balancing in content-addressable networks. In Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005. Vol. 2005. 2005. p. 67-74. 1551022 https://doi.org/10.1109/P2P.2005.37
Sahin, Ozgur D. ; Agrawal, Divyakant ; El Abbadi, Amr. / Techniques for efficient routing and load balancing in content-addressable networks. Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005. Vol. 2005 2005. pp. 67-74
@inproceedings{d50957d79090427da296f0011950d79d,
title = "Techniques for efficient routing and load balancing in content-addressable networks",
abstract = "As a Distributed Hash Table (DHT), a Content Addressable Network (CAN) provides efficient routing and object location in a decentralized manner while offering fault tolerance and dynamic peer operations. However, as opposed to other DHTs that use a flat ID space, CAN uses a multi-dimensional logical space. DHTs usually require O(logN) routing information per peer and provide routing in O(logN) hops, where N is the number of peers in the system. In CAN, on the other hand, each peer keeps only constant amount of routing information and the routing takes O(dN 1/d) hops, where d is the dimensionality of the logical space. Hence the routing performance of CAN is worse than other DHTs especially when d is small. In this paper, we describe and evaluate several schemes for efficient routing in CAN by keeping additional routing information at the peers. Furthermore, due to the underlying multi-dimensional ID space, CAN is used by applications that require content-based mapping of data objects onto the ID space. Since uniform hashing is not used, such mappings introduce skewed object distributions among the peers. Thus we also describe load balancing schemes for CAN and investigate their efficiency.",
author = "Sahin, {Ozgur D.} and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/P2P.2005.37",
language = "English",
isbn = "0769523765",
volume = "2005",
pages = "67--74",
booktitle = "Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005",

}

TY - GEN

T1 - Techniques for efficient routing and load balancing in content-addressable networks

AU - Sahin, Ozgur D.

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2005/12/1

Y1 - 2005/12/1

N2 - As a Distributed Hash Table (DHT), a Content Addressable Network (CAN) provides efficient routing and object location in a decentralized manner while offering fault tolerance and dynamic peer operations. However, as opposed to other DHTs that use a flat ID space, CAN uses a multi-dimensional logical space. DHTs usually require O(logN) routing information per peer and provide routing in O(logN) hops, where N is the number of peers in the system. In CAN, on the other hand, each peer keeps only constant amount of routing information and the routing takes O(dN 1/d) hops, where d is the dimensionality of the logical space. Hence the routing performance of CAN is worse than other DHTs especially when d is small. In this paper, we describe and evaluate several schemes for efficient routing in CAN by keeping additional routing information at the peers. Furthermore, due to the underlying multi-dimensional ID space, CAN is used by applications that require content-based mapping of data objects onto the ID space. Since uniform hashing is not used, such mappings introduce skewed object distributions among the peers. Thus we also describe load balancing schemes for CAN and investigate their efficiency.

AB - As a Distributed Hash Table (DHT), a Content Addressable Network (CAN) provides efficient routing and object location in a decentralized manner while offering fault tolerance and dynamic peer operations. However, as opposed to other DHTs that use a flat ID space, CAN uses a multi-dimensional logical space. DHTs usually require O(logN) routing information per peer and provide routing in O(logN) hops, where N is the number of peers in the system. In CAN, on the other hand, each peer keeps only constant amount of routing information and the routing takes O(dN 1/d) hops, where d is the dimensionality of the logical space. Hence the routing performance of CAN is worse than other DHTs especially when d is small. In this paper, we describe and evaluate several schemes for efficient routing in CAN by keeping additional routing information at the peers. Furthermore, due to the underlying multi-dimensional ID space, CAN is used by applications that require content-based mapping of data objects onto the ID space. Since uniform hashing is not used, such mappings introduce skewed object distributions among the peers. Thus we also describe load balancing schemes for CAN and investigate their efficiency.

UR - http://www.scopus.com/inward/record.url?scp=33744824692&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33744824692&partnerID=8YFLogxK

U2 - 10.1109/P2P.2005.37

DO - 10.1109/P2P.2005.37

M3 - Conference contribution

SN - 0769523765

SN - 9780769523767

VL - 2005

SP - 67

EP - 74

BT - Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005

ER -