Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5115
Full metadata record
DC FieldValueLanguage
dc.creatorBalakrishnan, Anantaram-
dc.creatorMagnanti, Thomas L.-
dc.creatorMirchandani, Prakash-
dc.date2004-05-28T19:23:49Z-
dc.date2004-05-28T19:23:49Z-
dc.date1994-01-
dc.date.accessioned2013-10-09T02:37:49Z-
dc.date.available2013-10-09T02:37:49Z-
dc.date.issued2013-10-09-
dc.identifierhttp://hdl.handle.net/1721.1/5115-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionAs 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.-
dc.format3675196 bytes-
dc.formatapplication/pdf-
dc.languageen_US-
dc.publisherMassachusetts Institute of Technology, Operations Research Center-
dc.relationOperations Research Center Working Paper;OR 291-94-
dc.titleDesigning Hierarchical Survivable Networks-
dc.typeWorking Paper-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.