K-Interleaving Rendezvous Overlay Network Construction Scheme

Authors:
Khaled Ragab;Yoshihiro Oyama;Akinori Yonezawa
Affiliations:
Japan Science and Technology Agency, University of Tokyo;Japan Science and Technology Agency, University of Tokyo;Japan Science and Technology Agency, University of Tokyo
Venue:
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
Year:
2006

Citing 0
Cited 2

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

WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
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

An Autonomic Community Computing Infrastructure is proposed as an agile platform for simultaneously hosting multiple autonomic cooperative services. It formulates, composes, monitors and manages the components of the services in an autonomic and dynamic fashion. Therefore, a Rendezvous Overlay Network (RVON) is constructed to publish the advertisements and discover the services associated with these advertisements. The main goal of this paper is to publish the advertisements by efficiently replicating them into RVON. This paper proposes an autonomic K-interleaving scheme that divides RVON into RVON-Clusters, where (K+1) is the distance between any two rendezvous nodes stored the same advertisement in RVON. Thus, users accessing from different areas are able to efficiently discover service's advertisement within a constant K number of units (e.g. hops, latency, etc).