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

Author

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

Author_Institution

Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA

Volume

40

Issue

2

fYear

1992

fDate

2/1/1992 12:00:00 AM

Firstpage

312

Lastpage

324

Abstract

A cluster management scheme for dynamic networks, the purpose of which is to maintain the cluster structure of the hierarchical network as 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

Keywords

network topology; telecommunication network management; OD pair shortest path routing; balanced-tree topology; cluster management; directory management; dynamic hierarchical networks; end-to-end link delays; gate-connected fixed-node networks; heavy intercluster traffic situations; node birth; node death; realistic communication networks; routing tables; time complexity bounds; Communication networks; Communication switching; Delay effects; Environmental management; Intelligent networks; Network topology; Routing; Telecommunication traffic; Throughput; Traffic control;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.129193

Filename

129193