Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    Dynamic Programming for Minimal Cost Topology with Reliability Constraint

    195169_195169.pdf (1.457Mb)
    Access Status
    Open access
    Authors
    Elshqeirat, B.
    Soh, Sieteng
    Rai, S.
    Lazarescu, Mihai
    Date
    2013
    Type
    Journal Article
    
    Metadata
    Show full item record
    Citation
    Elshqeirat, Basima and Soh, Sieteng and Rai, Suresh and Lazarescu, Mihai. 2013. Dynamic Programming for Minimal Cost Topology with Reliability Constraint. Journal of Advances in Communication Networks. 1 (4): pp. 286-290.
    Source Title
    Journal of Advances in Communication Networks
    DOI
    10.7763/JACN.2013.V1.57
    ISSN
    1793-8244
    Remarks

    Copyright © 2013 International Association of Computer Science and Information Technology Press

    URI
    http://hdl.handle.net/20.500.11937/10250
    Collection
    • Curtin Research Publications
    Abstract

    This paper addresses an NP-hard problem, called NTD-CR, to design a minimal-cost communication network topology that satisfies a pre-defined reliability constraint. Since reliability is always a major issue in the network design, the problem is practical for critical applications requiring minimized cost. The paper formulates a dynamic programming (DP) scheme to solve NTD-CR problem. DP approach, called DPCR-ST, generates the topology using a selected set of spanning trees of the network, STXmin. We propose three greedy heuristics to generate and order only k spanning trees of the network. Each heuristic allows DPCR-ST to enumerate STXmin using only k spanning trees, which improves the time complexity while producing near optimal topology. Simulations based on fully connected networks that contain up to 2.3×109 spanning trees show the merits of ordering methods and the effectiveness of our algorithm vis-à-vis four existing state-of-the-art techniques; DPCR-ST produces 81.5% optimal results, while using only 0.77% of the spanning trees contained in network.

    Related items

    Showing items related by title, author, creator and subject.

    • Topology Design with Minimal Cost Subject to Network Reliability Constraint
      Elshqeirat, Basima; Soh, Sieteng; Rai, S.; Lazarescu, M. (2015)
      This paper addresses an NP-hard problem, referred to as Network Topology Design with minimum Cost subject to a Reliability constraint (NTD-CR), to design a minimal-cost communication network topology that satisfies a ...
    • Dynamic Programming for Minimal Cost Topology with Two Terminal Reliability Constraint
      Elshqeirat, B.; Soh, Sieteng; Rai, S.; Lazarescu, Mihai (2013)
      This paper addresses an NP-hard problem, called NTD-CR, to design a minimal-cost communication network topology that satisfies a pre-defined reliability constraint. Since reliability is always a major issue in the network ...
    • A Dynamic Programming Algorithm for Reliable Network Design
      Elshqeirat, Basima; Soh, Sieteng; Rai, S.; Lazarescu, Mihai (2014)
      This paper addresses an NP-hard problem to design a network topology with maximum all-terminal reliability subject to a cost constraint, given the locations of the various computer centers (nodes), their connecting links, ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.