On Analytical Evaluation of Cluster-Based Routing for Real-Time Computer Networks

Kenji ISHIDA  Jun'ichi MIYAO  Tohru KIKUNO  Noriyoshi YOSHIDA  

IEICE TRANSACTIONS (1976-1990)   Vol.E72   No.7   pp.843-851
Publication Date: 1989/07/25
Online ISSN: 
Print ISSN: 0000-0000
Type of Manuscript: PAPER
Category: Computer Networks

Full Text: PDF(723.7KB)>>
Buy this Article

Recently, a real-time communication such as digitizing and packetizing voice, video, and fax has become one of the most important services in large computer networks. However, it is hard to support the real-time communication when a failure occurs in large networks. In this paper, management of a real-time large computer network is discussed concerning the link failure. A reliable cluster-based routing algorithm is proposed. The algorithm, which is an application of a cluster based network management, can keep the real-time communication in case of a link failure. By incorporating both the clusters and the multiple routing modes, the algorithm provides not only a short disconnecting time but also small communication overhead of recovery processing. These advantages of the algorithm are shown by the analysis of average message delay based on Kleinrock's model.