Abstract
In a computer or communication network, the reliability and transfer-delay of communication are important measures of performance. This paper describes a method of evaluating the reliability of a network with delay. When network elements fail, delay is defined as the length of the shortest remaining path between two specified nodes. We find the occurrence probability of events that a central node can communicate with a group of terminal nodes so that a specified delay is not exceeded. The desired events are mutually exclusive and contain a tree. Our algorithm efficiently generates all the events by noting network topology. The paper includes the case of several central nodes.
| Original language | English |
|---|---|
| Pages (from-to) | 320-324 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Reliability |
| Volume | R-28 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1979 |
Fingerprint
Keywords
- Algorithm
- Delay
- Network reliability
- Shortest path
- Tree
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
Reliability evaluation of a network with delay. / Park, Yong Jin.
In: IEEE Transactions on Reliability, Vol. R-28, No. 4, 1979, p. 320-324.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Reliability evaluation of a network with delay
AU - Park, Yong Jin
PY - 1979
Y1 - 1979
N2 - In a computer or communication network, the reliability and transfer-delay of communication are important measures of performance. This paper describes a method of evaluating the reliability of a network with delay. When network elements fail, delay is defined as the length of the shortest remaining path between two specified nodes. We find the occurrence probability of events that a central node can communicate with a group of terminal nodes so that a specified delay is not exceeded. The desired events are mutually exclusive and contain a tree. Our algorithm efficiently generates all the events by noting network topology. The paper includes the case of several central nodes.
AB - In a computer or communication network, the reliability and transfer-delay of communication are important measures of performance. This paper describes a method of evaluating the reliability of a network with delay. When network elements fail, delay is defined as the length of the shortest remaining path between two specified nodes. We find the occurrence probability of events that a central node can communicate with a group of terminal nodes so that a specified delay is not exceeded. The desired events are mutually exclusive and contain a tree. Our algorithm efficiently generates all the events by noting network topology. The paper includes the case of several central nodes.
KW - Algorithm
KW - Delay
KW - Network reliability
KW - Shortest path
KW - Tree
UR - http://www.scopus.com/inward/record.url?scp=0018529509&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0018529509&partnerID=8YFLogxK
U2 - 10.1109/TR.1979.5220618
DO - 10.1109/TR.1979.5220618
M3 - Article
AN - SCOPUS:0018529509
VL - R-28
SP - 320
EP - 324
JO - IEEE Transactions on Reliability
JF - IEEE Transactions on Reliability
SN - 0018-9529
IS - 4
ER -