Improving connection availability by means of backup sharing restrictions

Pandi, Z.; Gricser, Adam

doi:10.1364/jon.5.000383

Cited by 4 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Huang et al [11] traces back connection availability on link availabilities in networks without resource sharing, Mello et al [12] suggests a method for estimating Shared Backup Path Protection (SBPP) availability, Pándi and Gricser [13] estimates connection availability by evaluating N failures in the network and giving an upperbound for the estimation deviation, Clouqueur and Grover [14] investigates dual failures and Schupke [15] analyses multiple failures in p-cycles. Another possibility is using heuristics like Monte-Carlo simulation or Tabu-Search for estimating connection availability.…”

Section: Availability Of P-cyclesmentioning

confidence: 99%

P-cycle Protection in multi-domain optical networks

et al. 2008

View full text Add to dashboard Cite

Providing resilient inter-domain connections in multi-domain optical GMPLS networks is a challenge. On the one hand, the integration of different GMPLS domains to run traffic engineering operations requires the development of a framework for inter-domain routing and control of connections, while keeping the internal structure and available resources of the domains undisclosed to the other operators. On the other hand, the definition of mechanisms to take advantage of such automatically switched inter-domain connectivity is still an open issue. This article focuses on the analysis of applicability of one of these mechanisms: p-cycle-based protection. The proposed solution is based on the decomposition of the multi-domain resilience problem into two sub-problems, namely, the higher level interdomain protection and the lower level intra-domain protection. Building a p-cycle at the higher level is accomplished by certain tasks at the lower level, including straddling link connection, capacity allocation and path selection. In this article, we present several methods to realize inter-domain p-cycle protection at both levels and we evaluate their performance in terms of availability and spent resources. A discussion on a proposal of implementation of signalling based on extensions of existing protocols such as RSVP-TE and the PCE architecture illustrates the practical viability of the approach.

show abstract

Section: Availability Of P-cyclesmentioning

confidence: 99%

P-cycle Protection in multi-domain optical networks

et al. 2008

View full text Add to dashboard Cite

show abstract

Evaluation and estimation of the availability of p-cycle protected connections

Szigeti

Cinkler

2011

Telecommun Syst

View full text Add to dashboard Cite

Incremental availability evaluation model for p-cycle protected connections

Szigeti

Cinkler

2007

2007 6th International Workshop on Design and Reliable Communication Networks

View full text Add to dashboard Cite

QoS routes need availability assurance. Regardless of the applied protection scheme, there are several heuristic algorithms that can approximate the availability of connections based on the availability parameters of network components along the connection path.Accurate approximation can be achieved with simple and fast calculation only for the most basic protection schemes, the more complex the protection scheme is the more complex and long running calculation is required to get the result. Though, the inaccuracy of the heuristic algorithms is negligible in the most cases of practical usage.In this paper we present an availability calculation method for p-cycles that exploits the special properties of the p-cycle protection scheme and provides accurate results without enumerating all the possible network or protection configuration states.The method evaluates the availability of the connection along the working path link-by-link incrementally, pre-calculating also those conditional availabilities of the connection-part that may be used in latter calculations.Theoretically, the complexity of the algorithm is still O(2 n ), however, in fact n does not get high, moreover, it can be kept moderate low if the size of the cycles is constrained.

show abstract

Improving connection availability by means of backup sharing restrictions

Cited by 4 publications

References 0 publications

P-cycle Protection in multi-domain optical networks

P-cycle Protection in multi-domain optical networks

Evaluation and estimation of the availability of p-cycle protected connections

Incremental availability evaluation model for p-cycle protected connections

Contact Info

Product

Resources

About