The problem of clustering in large dynamic distributed networks is considered. A weighted, dynamic graph is used to model the problem environment, and various ways of formulating the clustering problem to achieve different objectives are examined. A distributed algorithm is presented along with an analysis of its communication cost, and possible application area are identified.
|Original language||English (US)|
|Title of host publication||Proceedings - International Conference on Distributed Computing Systems|
|Number of pages||8|
|State||Published - Jan 1 1986|
|Name||Proceedings - International Conference on Distributed Computing Systems|