• DocumentCode
    1345100
  • Title

    Reliability Evaluation of a Network with Delay

  • Author

    Park, Yong Jin ; Tanaka, Sueo

  • Author_Institution
    Department of Electronic Engineering; College of Engineering; Hanyang University; 17 Haengdang-dong, Seongdong-ku; Seoul 133 KOREA
  • Issue
    4
  • fYear
    1979
  • Firstpage
    320
  • Lastpage
    324
  • 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.
  • Keywords
    Communication networks; Computer network reliability; Computer networks; Delay; Graph theory; Partitioning algorithms; Performance analysis; Reliability theory; Telecommunication network reliability; Tree graphs; Algorithm; Delay; Network reliability; Shortest path; Tree;
  • fLanguage
    English
  • Journal_Title
    Reliability, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9529
  • Type

    jour

  • DOI
    10.1109/TR.1979.5220618
  • Filename
    5220618