A Virtual Network Allocation Algorithm For Reliability Negotiation

The Internet has become a primary means of communication, even though it currently does not guarantee Quality of Service (QoS). In order to tackle with this problem, companies establish Service Level Agreements (SLA) with their providers, including the reliability of services. This paper shows an algorithm for virtual network allocation in a reliability context, where some techniques of disjoint path and reliability calculation are used to deploy the virtual network according to the client's specification. Simulations using real network topologies show the capacity of the algorithm to deploy the virtual network according to the client requirements. © 2013 IEEE. IEEE Communications Society,U.S. National Science Foundation (NSF)Urra, A., Calle, E., Marzo, J., Enhanced multi-layer protection in multi-service gmpls networks (2005) Global Telecommunications Conference, IEEE GLOBECOM '05, 1Lee, H.-W., Modiano, E., Lee, K., Diverse routing in networks with probabilistic failures (2010) IEEE/ACM Transactions on Networking, 18 (6), pp. 1895-1907Femminella, M., Francescangeli, R., Reali, G., Lee, J.W., Schulzrinne, H., An enabling platform for autonomic management of the future internet (2011) IEEE Network, 25 (6), pp. 24-32Gomes, R.L., Bittencourt, L.F., Madeira, E.R.M., A generic sla negotiation protocol for virtualized environments Proceedings of 18th IEEE International Conference on Networks (ICON 2012), 2012Pouyllau, H., Douville, R., End-to-end qos negotiation in network federations 3rd IEEE/IFIP International Workshop on Bandwidth on Demand and Federation Economics, 2010Zaheer, F., Xiao, J., Boutaba, R., Multi-provider service negotiation and contracting in network virtualization 12th IEEE/IFIP Network Operations and Management Symposium, 2010Li, V., Silvester, J., Performance analysis of networks with unreliable components (1984) IEEE Transactions on Communications, 32 (10), pp. 1105-1110. , octSuurballe, J.W., Tarjan, R.E., A quick method for finding shortest pairs of disjoint paths (1984) Networks, 14 (2), pp. 325-336Gomes, T., Craveirinha, J., Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks (2007) European Journal of Operational Research, 181 (3)Pu, J., Manning, E., Shoja, G., Routing reliability analysis of partially disjoint paths (2001) IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, 1Rahman, M., Aib, I., Boutaba, R., Survivable virtual network embedding (2010) NETWORKING, 6091, pp. 40-52Sun, G., Di, H., Yu, H., Li, L., Anand, V., The framework and algorithms for the survivable mapping of virtual network onto a substrate network (2011) IETE Technical Review, 28 (5