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 Scopus citations

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 (US)
Title of host publicationProceedings - International Conference on Distributed Computing Systems
PublisherIEEE
Pages613-620
Number of pages8
ISBN (Print)0818606975
StatePublished - Jan 1 1986

Publication series

NameProceedings - International Conference on Distributed Computing Systems

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'DISTRIBUTED CLUSTERING ALGORITHM FOR LARGE COMPUTER NETWORKS.'. Together they form a unique fingerprint.

  • 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). (Proceedings - International Conference on Distributed Computing Systems). IEEE.