Network protection with multiple availability guarantees
We develop a novel network protection scheme that provides guarantees on both the fraction of time a flow has full connectivity, as well as a quantifiable minimum grade of service during downtimes. In particular, a flow can be below the full demand for at most a maximum fraction of time; then, it mu...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://hdl.handle.net/1721.1/81411 https://orcid.org/0000-0001-8238-8130 |
| _version_ | 1811095996244951040 |
|---|---|
| author | Narula-Tam, Aradhana Kuperman, Gregory Modiano, Eytan H. |
| author2 | Lincoln Laboratory |
| author_facet | Lincoln Laboratory Narula-Tam, Aradhana Kuperman, Gregory Modiano, Eytan H. |
| author_sort | Narula-Tam, Aradhana |
| collection | MIT |
| description | We develop a novel network protection scheme that provides guarantees on both the fraction of time a flow has full connectivity, as well as a quantifiable minimum grade of service during downtimes. In particular, a flow can be below the full demand for at most a maximum fraction of time; then, it must still support at least a fraction q of the full demand. This is in contrast to current protection schemes that offer either availability-guarantees with no bandwidth guarantees during the downtime, or full protection schemes that offer 100% availability after a single link failure. We develop algorithms that provide multiple availability guarantees and show that significant capacity savings can be achieved as compared to full protection. If a connection is allowed to drop to 50% of its bandwidth for 1 out of every 20 failures, then a 24% reduction in spare capacity can be achieved over traditional full protection schemes. In addition, for the case of q = 0, corresponding to the standard availability constraint, an optimal pseudo-polynomial time algorithm is presented. |
| first_indexed | 2024-09-23T16:36:40Z |
| format | Article |
| id | mit-1721.1/81411 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T16:36:40Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | mit-1721.1/814112022-10-02T08:26:10Z Network protection with multiple availability guarantees Narula-Tam, Aradhana Kuperman, Gregory Modiano, Eytan H. Lincoln Laboratory Massachusetts Institute of Technology. Department of Aeronautics and Astronautics Massachusetts Institute of Technology. Laboratory for Information and Decision Systems Kuperman, Gregory Modiano, Eytan H. Narula-Tam, Aradhana We develop a novel network protection scheme that provides guarantees on both the fraction of time a flow has full connectivity, as well as a quantifiable minimum grade of service during downtimes. In particular, a flow can be below the full demand for at most a maximum fraction of time; then, it must still support at least a fraction q of the full demand. This is in contrast to current protection schemes that offer either availability-guarantees with no bandwidth guarantees during the downtime, or full protection schemes that offer 100% availability after a single link failure. We develop algorithms that provide multiple availability guarantees and show that significant capacity savings can be achieved as compared to full protection. If a connection is allowed to drop to 50% of its bandwidth for 1 out of every 20 failures, then a 24% reduction in spare capacity can be achieved over traditional full protection schemes. In addition, for the case of q = 0, corresponding to the standard availability constraint, an optimal pseudo-polynomial time algorithm is presented. National Science Foundation (U.S.) (NSF grants CNS-1116209) National Science Foundation (U.S.) (NSF grants CNS-0830961) United States. Defense Threat Reduction Agency (grant HDTRA-09-1-005) United States. Defense Threat Reduction Agency (grant HDTRA1-07-1-0004) United States. Air Force (Air Force contract # FA8721-05-C-0002) 2013-10-16T20:25:31Z 2013-10-16T20:25:31Z 2012-06 Article http://purl.org/eprint/type/ConferencePaper 978-1-4577-2053-6 978-1-4577-2052-9 978-1-4577-2051-2 1550-3607 INSPEC Accession Number: 13154356 http://hdl.handle.net/1721.1/81411 Kuperman, Greg, Eytan Modiano, and Aradhana Narula-Tam. “Network protection with multiple availability guarantees.” In 2012 IEEE International Conference on Communications (ICC), 6241-6246. Institute of Electrical and Electronics Engineers, 2012. https://orcid.org/0000-0001-8238-8130 en_US http://dx.doi.org/10.1109/ICC.2012.6364715 2012 IEEE International Conference on Communications (ICC) Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf MIT web domain |
| spellingShingle | Narula-Tam, Aradhana Kuperman, Gregory Modiano, Eytan H. Network protection with multiple availability guarantees |
| title | Network protection with multiple availability guarantees |
| title_full | Network protection with multiple availability guarantees |
| title_fullStr | Network protection with multiple availability guarantees |
| title_full_unstemmed | Network protection with multiple availability guarantees |
| title_short | Network protection with multiple availability guarantees |
| title_sort | network protection with multiple availability guarantees |
| url | http://hdl.handle.net/1721.1/81411 https://orcid.org/0000-0001-8238-8130 |
| work_keys_str_mv | AT narulatamaradhana networkprotectionwithmultipleavailabilityguarantees AT kupermangregory networkprotectionwithmultipleavailabilityguarantees AT modianoeytanh networkprotectionwithmultipleavailabilityguarantees |