Skip to main content
Log in

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

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

The availability is an important QoS metric of network connections. We can estimate the availability of a connection based on the availability parameters of the network components. There are several resilience schemes that can be applied to enhance the availability of the connections. However, an accurate approximation can be achieved with simple and fast calculation only for the most basic protection schemes. The more complex the applied protection scheme is the more complex calculation is required to get the exact results. Fortunately, heuristic algorithms have been developed which can give a fast approximation on the price of approximation error, and this error is negligible in the most cases of practical usage.

In this paper we examine and compare two methods that can be used to evaluate or to estimate the availability of connections protected by p-cycle protection scheme. The first method, that we propose, focuses on the accuracy, and by exploiting the special properties of p-cycles provides accurate results without enumerating all the possible network or protection configuration states. The second method is the well-known Serial-Parallel availability modeling and calculation method, which is known to be fast (O(n) steps in case of n components), however, its results can have approximation error since the model does not take into account the overlapping of connection components, i.e., when a component is member of more different series.

Setting the advantages and disadvantages of these methods against each other, first, we show, that even though, theoretically, the complexity of the proposed algorithm is still exponential (O(2l)), the index (l) does not get high, moreover, it can be kept moderate low if the size and extent of the cycles is constrained. Next, we analyze the approximation error of the Serial-Parallel method. We prove that the estimated availability is always less than the exact one, define an upper bound onto the approximation error of the estimated unavailability and show where does this inaccuracy converge by increasing the availability of the network components.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Willems, G., Arijs, P., Van Parys, W., & Demeester, P. (2001). Capacity vs. availability trade-offs in mesh-restorable WDM networks. In Proc. of third international workshop on the design of reliable communication networks (DRCN) (pp. 107–112), Budapest, Hungary.

    Google Scholar 

  2. Schupke, D. A., & Prinz, R. G. (2004). Capacity efficiency and restorability of path protection and rerouting in WDM networks subject to dual failures. Photonic Network Communications, 8(2), 191–207.

    Article  Google Scholar 

  3. Jereb, L., Bajor, P., & Kiss, A. J. (1999). Network reliability analysis based on multilayer models. In Proceedings of the 7th international conference on telecommunication system/modeling and analysis (pp. 490–500), Nashville, TN.

    Google Scholar 

  4. Pandi, Z., Tacca, M., & Fumagalli, A. (2005). A threshold based on-line RWA algorithm with end-to-end reliability guarantees. In Conference on optical design and modelling (pp. 447–453). Milan, Italy, Feb. 2005

    Google Scholar 

  5. Mello, D., Schupke, D., Scheffel, M., & Waldman, H. (2005). Availability maps for connections in WDM optical networks. In Proceedings of the international workshop on design of reliable communication networks (DRCN), Island of Ischia (Naples), Italy, Oct. 2005

    Google Scholar 

  6. Pándi, Zs., & Gricser, A. Improving connection availability by means of backup sharing restrictions. OSA Journal of Optical Networking, 5(5), 383–397.

  7. Grover, W. D., & Stamatelakis, D. (1998). Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration. In ICC 1998 (pp. 537–543), Atlanta, GA, June 1998.

    Google Scholar 

  8. Stamatelakis, D., & Grover, W. D. (2000). Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles (p-cycles). IEEE Transactions on Communications, 48(8), 1262–1265.

    Article  Google Scholar 

  9. Clouqueur, M., & Grover, W. D. (2005). Availability analysis and enhanced availability design in p-cycle-based networks. Photonic Network Communications, 10(1), 55–71.

    Article  Google Scholar 

  10. Szigeti, J., & Cinkler, T. (2007). Incremental availability evaluation model for p-cycle protected connections. In DRCN2007, La Rochelle, France, Oct. 2007.

    Google Scholar 

  11. Dhillon, B. S. (1987). Reliability in computer system design. Norwood: Ablex Publishing Corporation.

    Google Scholar 

  12. Shen, G., & Grover, W. D. (2003). Extending the p-cycle concept to path segment protection for span and node failure recovery. IEEE Journal on Selected Areas in Communications, 21(8), 1306–1319.

    Article  Google Scholar 

  13. Schupke, D. A., Grover, W. D., & Clouqueur, M. (2004). Strategies for enhanced dual failure restorability with static or reconfigurable p-cycle networks. In IEEE ICC2004 (Vol. 3, pp. 1628–1633). Paris, France, June 2004.

    Google Scholar 

  14. Grosh, D. L. (1989). A primer of reliability theory. New York: Wiley.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to János Szigeti.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Szigeti, J., Cinkler, T. Evaluation and estimation of the availability of p-cycle protected connections. Telecommun Syst 52, 767–782 (2013). https://doi.org/10.1007/s11235-011-9576-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-011-9576-3

Keywords

Navigation