Analysis and algorithms for partial protection in mesh networks
Name
Modiano_Analysis and Algorithms.pdf
Size
223.43 KB
Format
Adobe PDF
Checksum (MD5)
79f636baa08a2d0b1679b9fda4c3bfe7
Author(s)
Kuperman, Gregory
Modiano, Eytan H.
Narula-Tam, Aradhana
Date Issued
June 2011
Journal
Proceedings of the 30th IEEE International Conference on Computer Communications (IEEE INFOCOM 2011)
Publisher
Institute of Electrical and Electronics Engineers
Citation
Kuperman, G., E. Modiano, and A. Narula-Tam. “Analysis and algorithms for partial protection in mesh networks.” INFOCOM, 2011 Proceedings IEEE. 2011. 516-520.
Version
Author's final manuscript
Abstract
This paper develops a mesh network protection scheme that guarantees a quantifiable minimum grade of service upon a failure within a network. The scheme guarantees that a fraction q of each demand remains after any single link failure. A linear program is developed to find the minimum-cost capacity allocation to meet both demand and protection requirements. For q ≤ 1/2, an exact algorithmic solution for the optimal routing and allocation is developed using multiple shortest paths. For q >; 1/2, a heuristic algorithm based on disjoint path routing is developed that performs, on average, within 1.4% of optimal, and runs four orders of magnitude faster than the minimum-cost solution achieved via the linear program. Moreover, the partial protection strategies developed achieve reductions of up to 82% over traditional full protection schemes.
MIT Department
Lincoln Laboratory
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFCOM.2011.5935216
