2011 | OriginalPaper | Buchkapitel
Self-stabilizing Hierarchical Construction of Bounded Size Clusters
verfasst von : Alain Bui, Simon Clavière, Ajoy K. Datta, Lawrence L. Larmore, Devan Sohier
Erschienen in: Structural Information and Communication Complexity
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We present a self-stabilizing clustering algorithm for asynchronous networks. Our algorithms works under any scheduler and is silent. The sizes of the clusters are bounded by a parameter of the algorithm. Our solution also avoids constructing a large number of small clusters. Although the clusters are disjoint (no node belongs to more than one cluster), the clusters are connected to form a tree so that the resulting overlay graph is connected. The height of the tree of clusters is bounded by the diameter of the network.