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

Kenji ISHIDA; Jun'ichi MIYAO; Tohru KIKUNO; Noriyoshi YOSHIDA

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

Kenji ISHIDA, Jun'ichi MIYAO, Tohru KIKUNO, Noriyoshi YOSHIDA

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on transactions Vol.E72-E No.7 pp.843-851

Publication Date: 1989/07/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Computer Networks

Authors

Kenji ISHIDA
Jun'ichi MIYAO
Tohru KIKUNO
Noriyoshi YOSHIDA

Keyword

Cite this

Copy

Kenji ISHIDA, Jun'ichi MIYAO, Tohru KIKUNO, Noriyoshi YOSHIDA, "On Analytical Evaluation of Cluster-Based Routing for Real-Time Computer Networks" in IEICE TRANSACTIONS on transactions, vol. E72-E, no. 7, pp. 843-851, July 1989, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e72-e_7_843/_p

Copy

@ARTICLE{e72-e_7_843,
author={Kenji ISHIDA, Jun'ichi MIYAO, Tohru KIKUNO, Noriyoshi YOSHIDA, },
journal={IEICE TRANSACTIONS on transactions},
title={On Analytical Evaluation of Cluster-Based Routing for Real-Time Computer Networks},
year={1989},
volume={E72-E},
number={7},
pages={843-851},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - On Analytical Evaluation of Cluster-Based Routing for Real-Time Computer Networks
T2 - IEICE TRANSACTIONS on transactions
SP - 843
EP - 851
AU - Kenji ISHIDA
AU - Jun'ichi MIYAO
AU - Tohru KIKUNO
AU - Noriyoshi YOSHIDA
PY - 1989
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E72-E
IS - 7
JA - IEICE TRANSACTIONS on transactions
Y1 - July 1989
AB - 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.
ER -