IEICE TRANSACTIONS on Information
Hybrid Hierarchical Overlay Routing (Hyho): Towards Minimal Overlay Dilation
Summary :
Many P2P lookup services based on distributed hash tables (DHT) have appeared recently. These schemes are built upon overlay networks and ignore distance to the target resources. As a result, P2P lookups often suffer from unnecessarily long routes in the underlay network, which we call overlay dilation. This paper proposes a new scheme for resource routing, called hybrid hierarchical overlay routing, dubbed Hyho. We introduce distance-weighted Bloom filters (dwBFs) as a concise representation of routing information for scattered resources in overlay networks. To further reduce the size of Bloom filters, so that they are linear in the number of distinct resources, Hyho splits overlay networks in accordance with DHT, where each subnetwork has a smaller set of resources and spans the entire network thinly. As a result, Hyho constructs a hierarchical overlay network and routes requests accordingly. Simulation results show that Hyho can reduce overlay dilation to one half that yielded by the Chord lookup service.
- Publication
- IEICE TRANSACTIONS on Information Vol.E87-D No.12 pp.2586-2593
- Publication Date
- 2004/12/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on New Technologies and their Applications of the Internet)
- Category
- Protocols, Applications and Services
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Noriyuki TAKAHASHI, Jonathan M. SMITH, "Hybrid Hierarchical Overlay Routing (Hyho): Towards Minimal Overlay Dilation" in IEICE TRANSACTIONS on Information,
vol. E87-D, no. 12, pp. 2586-2593, December 2004, doi: .
Abstract: Many P2P lookup services based on distributed hash tables (DHT) have appeared recently. These schemes are built upon overlay networks and ignore distance to the target resources. As a result, P2P lookups often suffer from unnecessarily long routes in the underlay network, which we call overlay dilation. This paper proposes a new scheme for resource routing, called hybrid hierarchical overlay routing, dubbed Hyho. We introduce distance-weighted Bloom filters (dwBFs) as a concise representation of routing information for scattered resources in overlay networks. To further reduce the size of Bloom filters, so that they are linear in the number of distinct resources, Hyho splits overlay networks in accordance with DHT, where each subnetwork has a smaller set of resources and spans the entire network thinly. As a result, Hyho constructs a hierarchical overlay network and routes requests accordingly. Simulation results show that Hyho can reduce overlay dilation to one half that yielded by the Chord lookup service.
URL: https://global.ieice.org/en_transactions/information/10.1587/e87-d_12_2586/_p
Copy
@ARTICLE{e87-d_12_2586,
author={Noriyuki TAKAHASHI, Jonathan M. SMITH, },
journal={IEICE TRANSACTIONS on Information},
title={Hybrid Hierarchical Overlay Routing (Hyho): Towards Minimal Overlay Dilation},
year={2004},
volume={E87-D},
number={12},
pages={2586-2593},
abstract={Many P2P lookup services based on distributed hash tables (DHT) have appeared recently. These schemes are built upon overlay networks and ignore distance to the target resources. As a result, P2P lookups often suffer from unnecessarily long routes in the underlay network, which we call overlay dilation. This paper proposes a new scheme for resource routing, called hybrid hierarchical overlay routing, dubbed Hyho. We introduce distance-weighted Bloom filters (dwBFs) as a concise representation of routing information for scattered resources in overlay networks. To further reduce the size of Bloom filters, so that they are linear in the number of distinct resources, Hyho splits overlay networks in accordance with DHT, where each subnetwork has a smaller set of resources and spans the entire network thinly. As a result, Hyho constructs a hierarchical overlay network and routes requests accordingly. Simulation results show that Hyho can reduce overlay dilation to one half that yielded by the Chord lookup service.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Hybrid Hierarchical Overlay Routing (Hyho): Towards Minimal Overlay Dilation
T2 - IEICE TRANSACTIONS on Information
SP - 2586
EP - 2593
AU - Noriyuki TAKAHASHI
AU - Jonathan M. SMITH
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E87-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2004
AB - Many P2P lookup services based on distributed hash tables (DHT) have appeared recently. These schemes are built upon overlay networks and ignore distance to the target resources. As a result, P2P lookups often suffer from unnecessarily long routes in the underlay network, which we call overlay dilation. This paper proposes a new scheme for resource routing, called hybrid hierarchical overlay routing, dubbed Hyho. We introduce distance-weighted Bloom filters (dwBFs) as a concise representation of routing information for scattered resources in overlay networks. To further reduce the size of Bloom filters, so that they are linear in the number of distinct resources, Hyho splits overlay networks in accordance with DHT, where each subnetwork has a smaller set of resources and spans the entire network thinly. As a result, Hyho constructs a hierarchical overlay network and routes requests accordingly. Simulation results show that Hyho can reduce overlay dilation to one half that yielded by the Chord lookup service.
ER -
English
