DISTRIBUTED CLUSTERING ALGORITHM FOR LARGE COMPUTER NETWORKS.

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

DISTRIBUTED CLUSTERING ALGORITHM FOR LARGE COMPUTER NETWORKS.

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

Computing and Augmented Intelligence, School of (IAFSE-SCAI)

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Proceedings - International Conference on Distributed Computing Systems
Publisher	IEEE
Pages	613-620
Number of pages	8
ISBN (Print)	0818606975
State	Published - Jan 1 1986

Publication series

Name	Proceedings - International Conference on Distributed Computing Systems

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Cite this

DISTRIBUTED CLUSTERING ALGORITHM FOR LARGE COMPUTER NETWORKS. / Ramamoorthy, C. V.; Srivastava, Jaideep; Tsai, Wei Tek.
Proceedings - International Conference on Distributed Computing Systems. IEEE, 1986. p. 613-620 (Proceedings - International Conference on Distributed Computing Systems).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

@inproceedings{2ae89299ce4c49a0b8009e871cff47ca,

title = "DISTRIBUTED CLUSTERING ALGORITHM FOR LARGE COMPUTER NETWORKS.",

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.",

author = "Ramamoorthy, {C. V.} and Jaideep Srivastava and Tsai, {Wei Tek}",

year = "1986",

month = jan,

day = "1",

language = "English (US)",

isbn = "0818606975",

series = "Proceedings - International Conference on Distributed Computing Systems",

publisher = "IEEE",

pages = "613--620",

booktitle = "Proceedings - International Conference on Distributed Computing Systems",

}

TY - GEN

T1 - DISTRIBUTED CLUSTERING ALGORITHM FOR LARGE COMPUTER NETWORKS.

AU - Ramamoorthy, C. V.

AU - Srivastava, Jaideep

AU - Tsai, Wei Tek

PY - 1986/1/1

Y1 - 1986/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0022583435&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022583435&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0022583435

SN - 0818606975

T3 - Proceedings - International Conference on Distributed Computing Systems

SP - 613

EP - 620

BT - Proceedings - International Conference on Distributed Computing Systems

PB - IEEE

ER -

DISTRIBUTED CLUSTERING ALGORITHM FOR LARGE COMPUTER NETWORKS.

Abstract

Publication series

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this