DISTRIBUTED CLUSTERING ALGORITHM FOR LARGE COMPUTER NETWORKS.

C. V. Ramamoorthy, Jaideep Srivastava, Wei Tek Tsai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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 languageEnglish
Title of host publicationProceedings - International Conference on Distributed Computing Systems
Place of PublicationNew York, NY, USA
PublisherIEEE
Pages613-620
Number of pages8
ISBN (Print)0818606975
Publication statusPublished - 1986
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Ramamoorthy, C. V., Srivastava, J., & Tsai, W. T. (1986). DISTRIBUTED CLUSTERING ALGORITHM FOR LARGE COMPUTER NETWORKS. In Proceedings - International Conference on Distributed Computing Systems (pp. 613-620). IEEE.