• DocumentCode
    1255027
  • Title

    Reliability optimization of computer-communication networks

  • Author

    Kiu, Sun-wah ; McAllister, D.F.

  • Author_Institution
    Hong Kong Polytech., Hong Kong
  • Volume
    37
  • Issue
    5
  • fYear
    1988
  • fDate
    12/1/1988 12:00:00 AM
  • Firstpage
    475
  • Lastpage
    483
  • Abstract
    The evaluation of the reliability of a given computer communication network is a NP-hard problem. Hence, the problem of assigning reliabilities to links of a fixed computer communication network topology to optimize the system reliability is also NP-hard. A heuristic method is developed to assign links to a given topology so that the system reliability of the network is near optimal. The method provides a way to assign reliability measures to the links of a network to increase overall reliability. It is based on the principle that the most reliable link should be assigned to the most vulnerable edge. The method computes an importance order for the edges of the network and uses the order to assign link reliabilities. If there are fewer than six links in a network, it can be shown that the method gives optimal assignment
  • Keywords
    computer networks; graph theory; optimisation; reliability theory; NP-hard problem; computer communication network; edges; graph theory; heuristic method; link reliability; optimization; system reliability; Communication networks; Computer network reliability; Computer networks; Graph theory; Joining IEEE; Joining processes; NP-hard problem; Network topology; Reliability theory; Telecommunication network reliability;
  • fLanguage
    English
  • Journal_Title
    Reliability, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9529
  • Type

    jour

  • DOI
    10.1109/24.9866
  • Filename
    9866