In practical large networks, node birth and death, and link failure and recovery happen frequently. Thus, the topologies of networks are changeable and unpredictable. In such dynamic networks, cluster management and directory management are indispensable. Directory managers are nodes that are responsible for tracking and binding the names and addresses of nodes, and storing topology information in the directory tables. The major function of directory management is to maintain the most up-to-date mapping of each node name to its address. The purpose of cluster management is to maintain the cluster structure of the hierarchical network to be a balanced-tree topology. First, we present a cluster management scheme for dynamic networks. Next, we derive the theoretical time complexity bounds of our cluster management scheme for node birth and death. Then, we investigate the effects of our cluster management on gate-connected fixed-node networks under heavy intercluster traffic situations. In order to show that our scheme can handle realistic communication networks, we use routing tables and OD pair shortest path routing. We will use simulation to compare the settle-down time, throughput, and end-to-end link delays of a network that uses cluster management with a network of the same topology that only uses flooding. We will show that the more the congestion of network traffic, and the larger the network diameter, the more difficult it is to flood messages through the whole network, and the more important it is to use our cluster management scheme combined with suitable directory management.
ASJC Scopus subject areas
- Electrical and Electronic Engineering