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

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 (K. Ragab and A. Yonezawa, 2006) 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

[1]  Kinji Mori,et al.  Autonomous decentralized community communication for information dissemination , 2004, IEEE Internet Computing.

[2]  Anthony H. Dekker,et al.  Network Robustness and Graph Topology , 2004, ACSC.

[3]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[4]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[5]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[6]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[7]  Akinori Yonezawa,et al.  Autonomic K-Interleaving Construction Scheme for P2P Overlay Networks , 2006, ATC.

[8]  N. Biggs.  Algebraic Graph Theory: COLOURING PROBLEMS , 1974 .

[9]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..

[10]  Akinori Yonezawa,et al.  K-Interleaving Rendezvous Overlay Network Construction Scheme , 2006, 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 (ICIS-COMSAR'06).