leK, Dge-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