Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Operations Research Center
  3. Operations Research Center Working Papers
  4. Designing Hierarchical Survivable Networks

Designing Hierarchical Survivable Networks

Thumbnail Image
Download
Name

OR-291-94.pdf

Size

3.5 MB

Format

Adobe PDF

Checksum (MD5)

1f21f78fc96e15acd11bab9e28ae14ad

Author(s)
Balakrishnan, Anantaram
•
Magnanti, Thomas L.
•
Mirchandani, Prakash
Date Issued
January 1994
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 291-94
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.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
http://hdl.handle.net/1721.1/5115
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.