Abstract
This paper presents an algorithm to compute a binary hierarchy of nested clusters. A token browses the network and recruits nodes to its cluster. When the cluster reaches a maximal size defined by a parameter $K$ of the algorithm, it is divided (when possible) and tokens are created in both of the new clusters. The new clusters are then built and divided in the same fashion. To allow the division of clusters, a spanning tree is built for each cluster. At each division, routing information is stored. The browsing scheme chosen is a random walk, in order to ensure (local) load balancing. The naming process used for the clusters, along with the information stored during each division, allows routing to any cluster. This routing scheme is based on the spanning trees of the clusters.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
