Differentiated reliability in optical networks: Theoretical and practical results

Tacca, Marco; Fumagalli, Andrea; Paradisi, A.; Unghváry, Ferenc; Gadhiraju, K.; Lakshmanan, Sriram; Rossi, Sandro; Sachs, Antonio de Campos; Shah, D.S.

doi:10.1109/jlt.2003.819554

Cited by 62 publications

(23 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The most common scheme in backbone networks today is 1 + 1 guaranteed path protection [7], which provides an edgedisjoint backup path for each working path, and guarantees the full demand to be available at all times after any single link failure. There has also been a growing body of literature for backup provisioning to meet availability guarantees [8][9][10][11][12][13][14]. In all of these, primary and backup flows are allocated such that the connection is disrupted for at most a specified fraction of time or probability.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Network protection with multiple availability guarantees

Kuperman

Modiano

Narula-Tam

2012

2012 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Abstract-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 availabilityguarantees 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.

show abstract

Section: Introductionmentioning

confidence: 99%

“…In our work, flows can drop below the full demand for at most a specified fraction of time, and maintain at least q of that demand at all times. Similar to [10][11][12][13][14], the probability of simultaneous failures is assumed to be negligible and we only consider single-link failures.…”

Section: Introductionmentioning

confidence: 99%

Network protection with multiple availability guarantees

Kuperman

Modiano

Narula-Tam

2012

2012 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

show abstract

“…These resources are usually shared among several primary connections to improve the network utilization. Generally, the primary connections are considered as equally important when contending for the use of the backup resources [1], [2], [3]. However, this solution is unsuitable from the service perspective.…”

Section: Introductionmentioning

confidence: 99%

Introducing a Relative Priority for the Shared-Protection Schemes

Bouabdallah¹,

Séricola²

2007

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

Abstract-One of the major challenges of optical network operators is ensuring the stringent levels of availability required by their highest class clients. To achieve this, we introduce relative priorities among the different primary connections contending for access to the shared-protection paths. In this paper, we provide an analytical model for the proposed priority-enabled scheme. As a key distinguishing feature from existing literature, we derive explicit analytic expressions for the average availability and service disruption rate for the different priority classes.

show abstract

“…3 In Ref. 4, the authors present a shared protection scheme with DiR. It shows better performance than the dedicated path protection scheme.…”

Section: Introductionmentioning

confidence: 99%

Availability analysis considering primary and backup sharing in wavelength-division multiplexed networks

Jin

2006

Opt. Eng

View full text Add to dashboard Cite

Abstract. In survivable wavelength-division multiplexed networks, the backup resource can be shared by the primary light paths, which is called primary-backup sharing. We find that primary-backup sharing can have an effect on the link availability. We focus on routing under dynamic availability of the wavelength resource while the requested reliability of traffic has to be met, using the modified shortest path algorithm. We propose a new algorithm called the dynamic link availability algorithm and evaluate the performance of the proposed algorithm on the NSFNET.

show abstract

Differentiated reliability in optical networks: Theoretical and practical results

Cited by 62 publications

References 14 publications

Network protection with multiple availability guarantees

Network protection with multiple availability guarantees

Introducing a Relative Priority for the Shared-Protection Schemes

Availability analysis considering primary and backup sharing in wavelength-division multiplexed networks

Contact Info

Product

Resources

About