K-Interleaving Rendezvous Overlay Network Construction Scheme

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)