Abstract
This chapter is an introduction to the area of performability evaluation of networks. The term performability, which stands for performance plus reliability, was introduced in the 1980s in connection with the performance evaluation of fault-tolerant, degradable computer systems [23]. In network performability evaluation, we are interested in investigating a network’s performance not only in the “perfect” state, where all network elements are operating properly, but also in states where some elements have failed or are operating in a degraded mode (see, e.g., [8]). The following example will introduce the main ideas.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Unfortunately, the terminology is not completely standard and some authors still use the term “reliability” for what we call performability; see, e.g., [1]. One may also encounter other terms such as “availability” or “dependability”.
- 2.
When a node fails, we consider that all edges incident to it also fail.
- 3.
We say “real” because any description is itself at some level of abstraction and omits aspects which may be important if one adopts a different viewpoint.
- 4.
There are more complex DWDM systems with various optically-transparent “add/drop” capabilities, which, for simplicity, we do not discuss here.
- 5.
This definition is by no means unique, we claim only that it is useful in a wide variety of contexts.
- 6.
Specifically by Protocol Independent Multicast (PIM).
- 7.
By “link” here we mean an edge at the graph level of the model of Fig. 4.2.
- 8.
For example, a traffic loss of 0.01% of the total translates to 1 ∕ 10, 000 of a year, i.e., about 52 min/year.
References
Aven, T., & Jensen, U. (1999). Stochastic models in reliability. New York: Springer.
Ahuja, R., Magnanti, T., & Orlin, J. (1998). Network flows. Englewood Cliffs, NJ: Prentice-Hall.
Agrawal, G. Oikonomou, K. N., & Sinha, R. K. (2007). Network performability evaluation for different routing schemes. Proceedings of the OFC. Anaheim, CA.
Alvarez, G., Uysal, M., & Merchant, A. (2001). Efficient verification of performability guarantees. In PMCCS-5: The fifth international workshop on performability modelling of computer and communication systems. Erlangen, Germany.
Bolch, G., Greiner, S., de Meer, H., & Trivedi, K. S.(2006). Queueing networks and Markov chains. Wiley, New Jersey.
Bremaud, P. (2008). Markov chains, Gibbs fields, Monte Carlo simulation, and queues. New York: Springer.
Carlier, J., Li, Y., & Lutton, J. (1997). Reliability evaluation of large telecommunication networks. Discrete Applied Mathematics, 76(1–3), 61–80.
Colbourn, C. J. (1999). Reliability issues in telecommunications network planning. In B. Sansó (Ed.), Telecommunications network planning. Boston: Kluwer.
Doverspike, R. D., Li, G., Oikonomou, K. N., Ramakrishnan, K. K., & Wang, D. (2007). IP backbone design for multimedia distribution: architecture and performance. In Proceedings of the IEEE INFOCOM, Alaska.
Doverspike, R. D., Li, G., Oikonomou, K. N., Ramakrishnan, K. K., Sinha, R. K., Wang, D., & Chase, C. (2009). Designing a reliable IPTV network. IEEE internet computing, 13(3), 15–22.
de Souza e Silva, E., & Gail, R. (2000). Transient solutions for Markov chains. In W. K. Grassmann (Ed.), Computational probability. Kluwer, Boston.
Gomes, T. M. S., & Craveirinha, J. M. F. (1997). A case ctudy of reliability analysis of a multiexchange telecommunication network. In C. G. Soares (Ed.), Advances in safety and reliability. Elsevier Science.
Gomes, T. M. S., & Craveirinha J. M. F. (April 1998). Algorithm for sequential generation of states in failure-prone communication network. IEE proceedings-communications, 145(2).
Gomes, T., Craveirinha, J., & Martins, L. (2002). An efficient algorithm for sequential generation of failures in a network with multi-mode components. Reliability Engineering & System Safety, 77, 111–119.
Garey, M., & Johnson, D. (1978). Computers and intractability: a guide to the theory of NP-completeness. San Francisco, CA: Freeman.
Harms, D. D., Kraetzl, M., Colbourn, C. C., & Devitt, J. S. (1995). Network reliability: experiments with a symbolic algebra environment. Boca Raton, FL: CRC Press.
Jarvis, J. P., & Shier, D. R. (1996). An improved algorithm for approximating the performance of stochastic flow networks. INFORMS Journal on Computing, 8(4).
Karger, D. (1995). A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem. In Proceedings of the 27th ACM STOC.
Levendovszky, J., Jereb, L., Elek, Zs., & Vesztergombi, Gy. (2002). Adaptive statistical algorithms in network reliability analysis. Performance Evaluation, 48(1–4), 225–236.
Li, V. K., & Silvester, J. A. (1984). Performance analysis of networks with unreliable components. IEEE Transactions on Communications, 32, 1105–1110.
Levy, Y. & Wirth, P. E. (1989). A unifying approach to performance and reliability objectives. In Teletraffic science for new cost-effective systems, networks and services, ITC-12. Elsevier Science.
Mendiratta, V. B. (2001). A hierarchical modelling approach for analyzing the performability of a telecommunications system. In PMCCS-5: the fifth international workshop on performability modelling of computer and communication systems.
Meyer, J. F. (1995). Performability evaluation: where it is and what lies ahead. In First IEEE computer performance and dependability symposium (IPDS), pp 334–343. Erlangen, Germany.
Moy, J. T. (1998). OSPF: anatomy of an internet routing protocol. Reading, MA: Addison Wesley.
Oikonomou, K. N. Ramakrishnan, K. K., Doverspike, R. D., Chiu, A., Martinez Heath, M., & Sinha, R. K. (2007). Performability analysis of multi-layer restoration in a satellite network. Managing traffic performance in converged networks, ITC 20 (LNCS 4516). Springer.
Oikonomou, K. N., & Sinha, R. K. (2008). Techniques for probabilistic multi-layer network analysis. In Proceedings of the IEEE Globecomm, New Orleans.
Oikonomou, K. N., & Sinha, R. K. (February 2009). Improved bounds for performability evaluation algorithms using state generation. Performance Evaluation, 66(2).
Oikonomou, K. N., Sinha, R. K., & Doverspike, R. D. (2009). Multi-layer network performance and reliability analysis. The International Journal of Interdisciplinary Telecommunications & Networking (IJITN), 1(3).
Pióro, M., & Medhi, D. (2004). Routing, flow, and capacity design in communication and computer networks. Morgan-Kaufmann.
Rauzy, A. (2005). An mlogmalgorithm to compute the most probable configurations of a system with multi-mode independent components. IEEE Transactions on Reliability, 54(1), 156–158.
Shier, D. R., Bibelnieks, E., Jarvis, J. P., & Lakin, R. J. (1990). Algorithms for approximating the performance of multimode systems. In Proceedings of IEEE Infocom.
Shier, D. R. (1991). Network reliability and algebraic structures. Oxford: Clarendon.
Yang, C. L., & Kubat, P. (1990). An algorithm for network reliability bounds. ORSA Journal on Computing, 2(4), 336–345.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag London
About this chapter
Cite this chapter
Oikonomou, K.N. (2010). Network Performability Evaluation. In: Kalmanek, C., Misra, S., Yang, Y. (eds) Guide to Reliable Internet Services and Applications. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84882-828-5_4
Download citation
DOI: https://doi.org/10.1007/978-1-84882-828-5_4
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-84882-827-8
Online ISBN: 978-1-84882-828-5
eBook Packages: Computer ScienceComputer Science (R0)