Dynamic Programming for Minimal Cost Topology with Reliability Constraint

Dynamic Programming for Minimal Cost Topology with Reliability Constraint

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...

Full description

Bibliographic Details
Main Authors: Elshqeirat, B., Soh, Sieteng, Rai, S., Lazarescu, Mihai
Format: Journal Article
Published: IACSIT Press 2013
Subjects:
network reliability
network optimization
Dynamic programing
network topology design
Online Access:http://hdl.handle.net/20.500.11937/10250

Internet

http://hdl.handle.net/20.500.11937/10250

Similar Items