The random walk construction of uniform spanning trees and uniform labelled trees
SIAM Journal on Discrete Mathematics
Location Management Handoff Overhead in Hierarchically Organized Mobile Ad hoc Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Theoretical Computer Science
Robust self-stabilizing weight-based clustering algorithm
Theoretical Computer Science
Design Issues and Performance Analysis of Location-Aided Hierarchical Cluster Routing on the MANET
CMC '09 Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02
A Fully Distributed Clustering Algorithm Based on Random Walks
ISPDC '09 Proceedings of the 2009 Eighth International Symposium on Parallel and Distributed Computing
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
The Computer Journal
The Journal of Supercomputing
Best-effort group service in dynamic networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Robust self-stabilizing construction of bounded size weight-based clusters
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Self-stabilizing hierarchical construction of bounded size clusters
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Distributed Construction of Nested Clusters with Inter-cluster Routing
IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
A distributed clustering algorithm for large-scale dynamic networks
Cluster Computing
| Hi-index | 0.00 |
Very large scale networks have become common in distributed systems. To efficiently manage these networks, various techniques are being developed in the distributed and networking research community. In this paper, we focus on one of those techniques, network clustering, i.e., the partitioning of a system into connected subsystems. The clustering we compute is size-oriented: given a parameter K of the algorithm, we compute, as far as possible, clusters of size K.We present an algorithm to compute a binary hierarchy of nested disjoint clusters. A token browses the network and recruits nodes to its cluster. When a cluster reaches a maximal size defined by a parameter 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. The token browsing scheme chosen is a random walk, in order to ensure local load balancing.To allow the division of clusters, a spanning tree is built for each cluster. At each division, information on how to route messages between the clusters is stored. The naming process used for the clusters, along with the information stored during each division, allows routing between any two clusters.