Fault Tolerant Packet-Switched Network Design and Its Sensitivity

Tokumi Yokohira, Masashi Okayama

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

Reliability and performance for telecommunication networks have been traditionally investigated separately in spite of their close relation. A design method integrating them for a reliable packet switched network, called a proofing method, was discussed in previous papers. This paper first presents the proofing method in detail. Then two heuristic design approaches (max-average, max-delay-link) for optimizing network cost in the proofing method are described. In order to verify their effectiveness and applicability, they are compared numerically for three example network topologies. Finally, the sensitivity of these two methods is examined with respect to changes in traffic demand and in link reliability. Numerical results show that the max-delay-link method provides a lower minimum network-cost than does the max-average method, for both a small and a large example network. The answers obtained by these two methods are not highly sensitive to changes either in traffic demand or in link reliability. Thus a network designed by these two methods is robust to a system change which is not considered at a design stage. The max-average method is superior to the max-delay-link method in terms of the sensitivity. Many other sources of failures must be considered in our failure model, eg, node and software faults. Only statistically independent failures are considered. Statistical dependence effects must be included to make the model more realistic. The max-average and max-delay-link methods cannot prevent a state where there are no routes between a particular source and destination node pair. To cope with this, a topological design method must be added to these methods. The computational complexity of these methods needs to be clarified to identify how large a practical problem can be solved using them.

Original languageEnglish
Pages (from-to)452-460
Number of pages9
JournalIEEE Transactions on Reliability
Volume40
Issue number4
DOIs
Publication statusPublished - 1991

Fingerprint

Packet networks
Telecommunication networks
Costs
Computational complexity
Topology

Keywords

  • Capacity assignment algorithm
  • Packet-switched network
  • Performance
  • Sensitivity

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Safety, Risk, Reliability and Quality
  • Computer Graphics and Computer-Aided Design
  • Hardware and Architecture
  • Software

Cite this

Fault Tolerant Packet-Switched Network Design and Its Sensitivity. / Yokohira, Tokumi; Okayama, Masashi.

In: IEEE Transactions on Reliability, Vol. 40, No. 4, 1991, p. 452-460.

Research output: Contribution to journalArticle

@article{5ed924c619e54d18b9d1d8ce7e06a684,
title = "Fault Tolerant Packet-Switched Network Design and Its Sensitivity",
abstract = "Reliability and performance for telecommunication networks have been traditionally investigated separately in spite of their close relation. A design method integrating them for a reliable packet switched network, called a proofing method, was discussed in previous papers. This paper first presents the proofing method in detail. Then two heuristic design approaches (max-average, max-delay-link) for optimizing network cost in the proofing method are described. In order to verify their effectiveness and applicability, they are compared numerically for three example network topologies. Finally, the sensitivity of these two methods is examined with respect to changes in traffic demand and in link reliability. Numerical results show that the max-delay-link method provides a lower minimum network-cost than does the max-average method, for both a small and a large example network. The answers obtained by these two methods are not highly sensitive to changes either in traffic demand or in link reliability. Thus a network designed by these two methods is robust to a system change which is not considered at a design stage. The max-average method is superior to the max-delay-link method in terms of the sensitivity. Many other sources of failures must be considered in our failure model, eg, node and software faults. Only statistically independent failures are considered. Statistical dependence effects must be included to make the model more realistic. The max-average and max-delay-link methods cannot prevent a state where there are no routes between a particular source and destination node pair. To cope with this, a topological design method must be added to these methods. The computational complexity of these methods needs to be clarified to identify how large a practical problem can be solved using them.",
keywords = "Capacity assignment algorithm, Packet-switched network, Performance, Sensitivity",
author = "Tokumi Yokohira and Masashi Okayama",
year = "1991",
doi = "10.1109/24.93767",
language = "English",
volume = "40",
pages = "452--460",
journal = "IEEE Transactions on Reliability",
issn = "0018-9529",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Fault Tolerant Packet-Switched Network Design and Its Sensitivity

AU - Yokohira, Tokumi

AU - Okayama, Masashi

PY - 1991

Y1 - 1991

N2 - Reliability and performance for telecommunication networks have been traditionally investigated separately in spite of their close relation. A design method integrating them for a reliable packet switched network, called a proofing method, was discussed in previous papers. This paper first presents the proofing method in detail. Then two heuristic design approaches (max-average, max-delay-link) for optimizing network cost in the proofing method are described. In order to verify their effectiveness and applicability, they are compared numerically for three example network topologies. Finally, the sensitivity of these two methods is examined with respect to changes in traffic demand and in link reliability. Numerical results show that the max-delay-link method provides a lower minimum network-cost than does the max-average method, for both a small and a large example network. The answers obtained by these two methods are not highly sensitive to changes either in traffic demand or in link reliability. Thus a network designed by these two methods is robust to a system change which is not considered at a design stage. The max-average method is superior to the max-delay-link method in terms of the sensitivity. Many other sources of failures must be considered in our failure model, eg, node and software faults. Only statistically independent failures are considered. Statistical dependence effects must be included to make the model more realistic. The max-average and max-delay-link methods cannot prevent a state where there are no routes between a particular source and destination node pair. To cope with this, a topological design method must be added to these methods. The computational complexity of these methods needs to be clarified to identify how large a practical problem can be solved using them.

AB - Reliability and performance for telecommunication networks have been traditionally investigated separately in spite of their close relation. A design method integrating them for a reliable packet switched network, called a proofing method, was discussed in previous papers. This paper first presents the proofing method in detail. Then two heuristic design approaches (max-average, max-delay-link) for optimizing network cost in the proofing method are described. In order to verify their effectiveness and applicability, they are compared numerically for three example network topologies. Finally, the sensitivity of these two methods is examined with respect to changes in traffic demand and in link reliability. Numerical results show that the max-delay-link method provides a lower minimum network-cost than does the max-average method, for both a small and a large example network. The answers obtained by these two methods are not highly sensitive to changes either in traffic demand or in link reliability. Thus a network designed by these two methods is robust to a system change which is not considered at a design stage. The max-average method is superior to the max-delay-link method in terms of the sensitivity. Many other sources of failures must be considered in our failure model, eg, node and software faults. Only statistically independent failures are considered. Statistical dependence effects must be included to make the model more realistic. The max-average and max-delay-link methods cannot prevent a state where there are no routes between a particular source and destination node pair. To cope with this, a topological design method must be added to these methods. The computational complexity of these methods needs to be clarified to identify how large a practical problem can be solved using them.

KW - Capacity assignment algorithm

KW - Packet-switched network

KW - Performance

KW - Sensitivity

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

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

U2 - 10.1109/24.93767

DO - 10.1109/24.93767

M3 - Article

VL - 40

SP - 452

EP - 460

JO - IEEE Transactions on Reliability

JF - IEEE Transactions on Reliability

SN - 0018-9529

IS - 4

ER -