Open Access. Powered by Scholars. Published by Universities.®
UNLV Theses, Dissertations, Professional Papers, and Capstones
Clustering; Computer networks; Distributed algorithms; Group membership; Network partitioning; Self-stabilizing algorithm
Articles 1 - 1 of 1
Full-Text Articles in Computer Engineering
Self-Stabilizing Group Membership Protocol, Mahesh Subedi
Self-Stabilizing Group Membership Protocol, Mahesh Subedi
UNLV Theses, Dissertations, Professional Papers, and Capstones
In this thesis, we consider the problem of partitioning a network into groups of bounded diameter.
Given a network of processes X and a constant D, the group partition problem is the problem of finding a D-partition of X, that is, a partition of X into disjoint connected subgraphs, which we call groups, each of diameter no greater than D. The minimal group partition problem is to find a D-partition {G1, ... Gm} of X such that no two groups can be combined; that is, for any Gi and Gj, where i ≠ j, either Gi U Gj is disconnected …