Restorability versus Efficiency in (1:1)n protection schemes for optical networks

David Griffith, Kotikalapudi Sriram, Su Kyoung Lee, Stephan Klink, Nada Golmie

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

As network utilization continues to grow in the coming years, there will be increased pressure on network operators to use traffic engineering to provision resources more efficiently. One way to do this is to allow backup paths associated with disjoint working paths to share bandwidth. Increasing the amount of sharing will naturally increase the risk that a failed working path will either be unrecovered or forced to use dynamic recovery mechanisms. To examine the trade-offs between robustness and efficiency and to develop useful performance bounds, we develop theoretical models for (1:1)n recovery schemes that are independent of the network's topology and management plane. We confirm our results using simulations of uncorrelated failures in a wide-area optical network with various degrees of resource sharing.

Original languageEnglish
Pages (from-to)1634-1638
Number of pages5
JournalIEEE International Conference on Communications
Volume3
Publication statusPublished - 2004 Aug 30
Event2004 IEEE International Conference on Communications - Paris, France
Duration: 2004 Jun 202004 Jun 24

Fingerprint

Fiber optic networks
Recovery
Topology
Bandwidth

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Griffith, David ; Sriram, Kotikalapudi ; Lee, Su Kyoung ; Klink, Stephan ; Golmie, Nada. / Restorability versus Efficiency in (1:1)n protection schemes for optical networks. In: IEEE International Conference on Communications. 2004 ; Vol. 3. pp. 1634-1638.
@article{9bf4d6084a024be3a3e86ce15381eccc,
title = "Restorability versus Efficiency in (1:1)n protection schemes for optical networks",
abstract = "As network utilization continues to grow in the coming years, there will be increased pressure on network operators to use traffic engineering to provision resources more efficiently. One way to do this is to allow backup paths associated with disjoint working paths to share bandwidth. Increasing the amount of sharing will naturally increase the risk that a failed working path will either be unrecovered or forced to use dynamic recovery mechanisms. To examine the trade-offs between robustness and efficiency and to develop useful performance bounds, we develop theoretical models for (1:1)n recovery schemes that are independent of the network's topology and management plane. We confirm our results using simulations of uncorrelated failures in a wide-area optical network with various degrees of resource sharing.",
author = "David Griffith and Kotikalapudi Sriram and Lee, {Su Kyoung} and Stephan Klink and Nada Golmie",
year = "2004",
month = "8",
day = "30",
language = "English",
volume = "3",
pages = "1634--1638",
journal = "Conference Record - International Conference on Communications",
issn = "0536-1486",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Restorability versus Efficiency in (1:1)n protection schemes for optical networks. / Griffith, David; Sriram, Kotikalapudi; Lee, Su Kyoung; Klink, Stephan; Golmie, Nada.

In: IEEE International Conference on Communications, Vol. 3, 30.08.2004, p. 1634-1638.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Restorability versus Efficiency in (1:1)n protection schemes for optical networks

AU - Griffith, David

AU - Sriram, Kotikalapudi

AU - Lee, Su Kyoung

AU - Klink, Stephan

AU - Golmie, Nada

PY - 2004/8/30

Y1 - 2004/8/30

N2 - As network utilization continues to grow in the coming years, there will be increased pressure on network operators to use traffic engineering to provision resources more efficiently. One way to do this is to allow backup paths associated with disjoint working paths to share bandwidth. Increasing the amount of sharing will naturally increase the risk that a failed working path will either be unrecovered or forced to use dynamic recovery mechanisms. To examine the trade-offs between robustness and efficiency and to develop useful performance bounds, we develop theoretical models for (1:1)n recovery schemes that are independent of the network's topology and management plane. We confirm our results using simulations of uncorrelated failures in a wide-area optical network with various degrees of resource sharing.

AB - As network utilization continues to grow in the coming years, there will be increased pressure on network operators to use traffic engineering to provision resources more efficiently. One way to do this is to allow backup paths associated with disjoint working paths to share bandwidth. Increasing the amount of sharing will naturally increase the risk that a failed working path will either be unrecovered or forced to use dynamic recovery mechanisms. To examine the trade-offs between robustness and efficiency and to develop useful performance bounds, we develop theoretical models for (1:1)n recovery schemes that are independent of the network's topology and management plane. We confirm our results using simulations of uncorrelated failures in a wide-area optical network with various degrees of resource sharing.

UR - http://www.scopus.com/inward/record.url?scp=4143151970&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4143151970&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:4143151970

VL - 3

SP - 1634

EP - 1638

JO - Conference Record - International Conference on Communications

JF - Conference Record - International Conference on Communications

SN - 0536-1486

ER -