Advanced Search
DSpace@MIT

Designing Hierarchical Survivable Networks

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author Balakrishnan, Anantaram en_US
dc.contributor.author Magnanti, Thomas L. en_US
dc.contributor.author Mirchandani, Prakash en_US
dc.date.accessioned 2004-05-28T19:23:49Z
dc.date.available 2004-05-28T19:23:49Z
dc.date.issued 1994-01 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/5115
dc.description.abstract As the computer, communication, and entertainment industries begin to integrate phone, cable, and video services and to invest in new technologies such as fiber optic cables, interruptions in service can cause considerable customer dissatisfaction and even be catastrophic. In this environment, network providers want to offer high levels of servicein both serviceability (e.g., high bandwidth) and survivability (failure protection)-and to segment their markets, providing better technology and more robust configurations to certain key customers. We study core models with three types of customers (critical, primary, and secondary) and two types of services/technologies (primary and secondary). The network must connect primary customers using primary (high bandwidth) services and, additionally, contain a back-up path connecting certain critical primary customers. Secondary customers require only single connectivity to other customers and can use either primary or secondary facilities. We propose a general multi-tier survivable network design model to configure cost effective networks for this type of market segmentation. When costs are triangular, we show how to optimally solve single-tier subproblems with two critical customers as a matroid intersection problem. We also propose and analyze the worst-case performance of tailored heuristics for several special cases of the two-tier model. Depending upon the particular problem setting, the heuristics have worst-case performance ratios ranging between 1.25 and 2.6. We also provide examples to show that the performance ratios for these heuristics are the best possible. en_US
dc.format.extent 3675196 bytes
dc.format.mimetype application/pdf
dc.language.iso en_US en_US
dc.publisher Massachusetts Institute of Technology, Operations Research Center en_US
dc.relation.ispartofseries Operations Research Center Working Paper;OR 291-94 en_US
dc.title Designing Hierarchical Survivable Networks en_US
dc.type Working Paper en_US


Files in this item

Name Size Format Description
OR-291-94.pdf 3.504Mb PDF

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage