遲廷을 수반하는 Network의 信賴度計算에 관한 硏究
박용진 · 1980
In a computer communication network. the reliability and transfer-delay of communication are important measures of performance. This paper describes a method of computing 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 key 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.
Cited by 1 works.