Distributed Construction of Nested Clusters with Inter-cluster Routing

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.