Simulation and theoretical results on cluster management and directory management in dynamic hierarchical networks

Showi Min Shen, Hosame Abu-Amara, Wei K. Tsai, Wei Tek Tsai

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

A cluster management scheme for dynamic networks, the purpose of which is to maintain the cluster structure of the hierarchical network to be a balanced-tree topology, is presented. The theoretical time complexity bounds of the cluster management scheme for node birth and death are derived. The effects of the cluster management on gate-connected fixed-node networks under heavy intercluster traffic situations are discussed. In order to show that the scheme can handle realistic communication networks, routing tables and OD pair shortest path routing are used. The settle-down time, throughput, and end-to-end link delays of a network that uses cluster management and a network of the same topology that only uses flooding are compared.

Original languageEnglish (US)
Pages (from-to)312-324
Number of pages13
JournalIEEE Transactions on Communications
Volume40
Issue number2
DOIs
StatePublished - Feb 1992
Externally publishedYes

Fingerprint

Topology
Network routing
Telecommunication networks
Throughput

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Simulation and theoretical results on cluster management and directory management in dynamic hierarchical networks. / Shen, Showi Min; Abu-Amara, Hosame; Tsai, Wei K.; Tsai, Wei Tek.

In: IEEE Transactions on Communications, Vol. 40, No. 2, 02.1992, p. 312-324.

Research output: Contribution to journalArticle

Shen, Showi Min ; Abu-Amara, Hosame ; Tsai, Wei K. ; Tsai, Wei Tek. / Simulation and theoretical results on cluster management and directory management in dynamic hierarchical networks. In: IEEE Transactions on Communications. 1992 ; Vol. 40, No. 2. pp. 312-324.
@article{791e767a8b40444ea659499655523728,
title = "Simulation and theoretical results on cluster management and directory management in dynamic hierarchical networks",
abstract = "A cluster management scheme for dynamic networks, the purpose of which is to maintain the cluster structure of the hierarchical network to be a balanced-tree topology, is presented. The theoretical time complexity bounds of the cluster management scheme for node birth and death are derived. The effects of the cluster management on gate-connected fixed-node networks under heavy intercluster traffic situations are discussed. In order to show that the scheme can handle realistic communication networks, routing tables and OD pair shortest path routing are used. The settle-down time, throughput, and end-to-end link delays of a network that uses cluster management and a network of the same topology that only uses flooding are compared.",
author = "Shen, {Showi Min} and Hosame Abu-Amara and Tsai, {Wei K.} and Tsai, {Wei Tek}",
year = "1992",
month = "2",
doi = "10.1109/26.129193",
language = "English (US)",
volume = "40",
pages = "312--324",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Simulation and theoretical results on cluster management and directory management in dynamic hierarchical networks

AU - Shen, Showi Min

AU - Abu-Amara, Hosame

AU - Tsai, Wei K.

AU - Tsai, Wei Tek

PY - 1992/2

Y1 - 1992/2

N2 - A cluster management scheme for dynamic networks, the purpose of which is to maintain the cluster structure of the hierarchical network to be a balanced-tree topology, is presented. The theoretical time complexity bounds of the cluster management scheme for node birth and death are derived. The effects of the cluster management on gate-connected fixed-node networks under heavy intercluster traffic situations are discussed. In order to show that the scheme can handle realistic communication networks, routing tables and OD pair shortest path routing are used. The settle-down time, throughput, and end-to-end link delays of a network that uses cluster management and a network of the same topology that only uses flooding are compared.

AB - A cluster management scheme for dynamic networks, the purpose of which is to maintain the cluster structure of the hierarchical network to be a balanced-tree topology, is presented. The theoretical time complexity bounds of the cluster management scheme for node birth and death are derived. The effects of the cluster management on gate-connected fixed-node networks under heavy intercluster traffic situations are discussed. In order to show that the scheme can handle realistic communication networks, routing tables and OD pair shortest path routing are used. The settle-down time, throughput, and end-to-end link delays of a network that uses cluster management and a network of the same topology that only uses flooding are compared.

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

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

U2 - 10.1109/26.129193

DO - 10.1109/26.129193

M3 - Article

AN - SCOPUS:0026812180

VL - 40

SP - 312

EP - 324

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 2

ER -