Adaptive hierarchical routing protocol

W. T. Tsai, C. V. Ramamoorthy, Wei K. Tsai, Osamu Nishiguchi

Research output: Contribution to journalArticle

44 Citations (Scopus)

Abstract

An adaptive hierarchical routing protocol based on the extension of the new Arpanet scheme is proposed and its simulated performance is presented. The protocol can adapt to rapidly changing environments and works for arbitrarily large networks. A number of existing schemes as well as the proposed scheme are simulated under many different environments and clustering structures. The proposed protocol is found to be superior to the other protocols tested in many different types of network traffic and topological configurations. The results indicate that intercluster links must be reliable, because (1) the failure of these links can significantly degrade the routing performance, even though the protocol does not degrade as badly as the existing scheme and (2) hierarchical routing protocols usually prefer small clusters, which means that there will be many intercluster links. The tradeoff between two response speed and communication overhead is shown.

Original languageEnglish (US)
Pages (from-to)1059-1075
Number of pages17
JournalIEEE Transactions on Computers
Volume38
Issue number8
DOIs
StatePublished - Aug 1989
Externally publishedYes

Fingerprint

Routing Protocol
Routing protocols
Network protocols
Network Traffic
Routing
Trade-offs
Clustering
Configuration
Communication

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Tsai, W. T., Ramamoorthy, C. V., Tsai, W. K., & Nishiguchi, O. (1989). Adaptive hierarchical routing protocol. IEEE Transactions on Computers, 38(8), 1059-1075. https://doi.org/10.1109/12.30862

Adaptive hierarchical routing protocol. / Tsai, W. T.; Ramamoorthy, C. V.; Tsai, Wei K.; Nishiguchi, Osamu.

In: IEEE Transactions on Computers, Vol. 38, No. 8, 08.1989, p. 1059-1075.

Research output: Contribution to journalArticle

Tsai, WT, Ramamoorthy, CV, Tsai, WK & Nishiguchi, O 1989, 'Adaptive hierarchical routing protocol', IEEE Transactions on Computers, vol. 38, no. 8, pp. 1059-1075. https://doi.org/10.1109/12.30862
Tsai WT, Ramamoorthy CV, Tsai WK, Nishiguchi O. Adaptive hierarchical routing protocol. IEEE Transactions on Computers. 1989 Aug;38(8):1059-1075. https://doi.org/10.1109/12.30862
Tsai, W. T. ; Ramamoorthy, C. V. ; Tsai, Wei K. ; Nishiguchi, Osamu. / Adaptive hierarchical routing protocol. In: IEEE Transactions on Computers. 1989 ; Vol. 38, No. 8. pp. 1059-1075.
@article{727b68cd55b946d48618f38aed1d5e66,
title = "Adaptive hierarchical routing protocol",
abstract = "An adaptive hierarchical routing protocol based on the extension of the new Arpanet scheme is proposed and its simulated performance is presented. The protocol can adapt to rapidly changing environments and works for arbitrarily large networks. A number of existing schemes as well as the proposed scheme are simulated under many different environments and clustering structures. The proposed protocol is found to be superior to the other protocols tested in many different types of network traffic and topological configurations. The results indicate that intercluster links must be reliable, because (1) the failure of these links can significantly degrade the routing performance, even though the protocol does not degrade as badly as the existing scheme and (2) hierarchical routing protocols usually prefer small clusters, which means that there will be many intercluster links. The tradeoff between two response speed and communication overhead is shown.",
author = "Tsai, {W. T.} and Ramamoorthy, {C. V.} and Tsai, {Wei K.} and Osamu Nishiguchi",
year = "1989",
month = "8",
doi = "10.1109/12.30862",
language = "English (US)",
volume = "38",
pages = "1059--1075",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "8",

}

TY - JOUR

T1 - Adaptive hierarchical routing protocol

AU - Tsai, W. T.

AU - Ramamoorthy, C. V.

AU - Tsai, Wei K.

AU - Nishiguchi, Osamu

PY - 1989/8

Y1 - 1989/8

N2 - An adaptive hierarchical routing protocol based on the extension of the new Arpanet scheme is proposed and its simulated performance is presented. The protocol can adapt to rapidly changing environments and works for arbitrarily large networks. A number of existing schemes as well as the proposed scheme are simulated under many different environments and clustering structures. The proposed protocol is found to be superior to the other protocols tested in many different types of network traffic and topological configurations. The results indicate that intercluster links must be reliable, because (1) the failure of these links can significantly degrade the routing performance, even though the protocol does not degrade as badly as the existing scheme and (2) hierarchical routing protocols usually prefer small clusters, which means that there will be many intercluster links. The tradeoff between two response speed and communication overhead is shown.

AB - An adaptive hierarchical routing protocol based on the extension of the new Arpanet scheme is proposed and its simulated performance is presented. The protocol can adapt to rapidly changing environments and works for arbitrarily large networks. A number of existing schemes as well as the proposed scheme are simulated under many different environments and clustering structures. The proposed protocol is found to be superior to the other protocols tested in many different types of network traffic and topological configurations. The results indicate that intercluster links must be reliable, because (1) the failure of these links can significantly degrade the routing performance, even though the protocol does not degrade as badly as the existing scheme and (2) hierarchical routing protocols usually prefer small clusters, which means that there will be many intercluster links. The tradeoff between two response speed and communication overhead is shown.

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

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

U2 - 10.1109/12.30862

DO - 10.1109/12.30862

M3 - Article

VL - 38

SP - 1059

EP - 1075

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 8

ER -