\leK, D\ge-Interleaving Structuring Technique for Peer-Peer Overlay Network

Authors:
Khaled Ragab;Akinori Yonezawa
Affiliations:
Japan Science and Technology Agency/ The University of Tokyo, Japan;The University of Tokyo, Japan
Venue:
WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
Year:
2006

Citing 7
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Mapping the Gnutella Network

IEEE Internet Computing
Network robustness and graph topology

ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Autonomous Decentralized Community Communication for Information Dissemination

IEEE Internet Computing
K-Interleaving Rendezvous Overlay Network Construction Scheme

ICIS-COMSAR '06 Proceedings of the 5th IEEE/ACIS International Conference on Computer and Information Science and 1st IEEE/ACIS International Workshop on Component-Based Software Engineering,Software Architecture and Reuse
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Autonomic k-interleaving construction scheme for p2p overlay networks

ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rendezvous Overlay Network (RvON) enables the smaller/medium Service Providers (SP) to publish their services' advertisements. Moreover, it allows end-users to discover the services associated with these advertisements. An autonomic K-interleaving step-step construction scheme is proposed [2] that autonomously organizes RvON into RvON-Clusters, where (K+1) is the physical number of hops between any two rendezvous nodes stored the same advertisement in RvON. Thus, end-users accessing from different areas are able to discover services' advertisements within a constant K physical number of hops. However in dense networks, increasing the size of RvON-Clusters induces a long diameter that manifests high stress per physical links and high delay to discover service's advertisement. This paper limits the expansion of RvON-Cluster within a specific diameter D. Each RvON-Cluster is organized with at most D logical hops over K physical hops. Thus, doubtless end-users are able to efficiently discover services' advertisements within D logical hops over K physical hops with reasonable storage and bandwidth consumption.