Abstract
Network virtualization can offer more flexibility and better manageability for the future Internet by allowing multiple heterogeneous virtual networks (VN) to coexist on a shared infrastructure provider (InP) network. A major challenge in this respect is the VN embedding problem that deals with the efficient mapping of virtual resources on InP network resources. Previous research focused on heuristic algorithms for the VN embedding problem assuming that the InP network remains operational at all times. In this paper, we remove that assumption by formulating the survivable virtual network embedding (SVNE) problem and developing a hybrid policy heuristic to solve it. The policy is based on a fast re-routing strategy and utilizes a pre-reserved quota for backup on each physical link. Evaluation results show that our proposed heuristic for SVNE outperforms baseline heuristics in terms of long term business profit for the InP, acceptance ratio, bandwidth efficiency, and response time.
Chapter PDF
Similar content being viewed by others
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
Aib, I., Boutaba, R.: On leveraging policy-based management for maximizing business profit. IEEE Transactions on Network and Service Management (TNSM) 4(2), 14 (2007)
Andersen, D.: Theoretical approaches to node assignment. Unpublished Manuscript (2002), http://www.cs.cmu.edu/~dga/papers/andersen-assign.ps
Anderson, T., Peterson, L., Shenker, S., Turner, J.: Overcoming the internet impasse through virtualization. Computer 38(4), 34–41 (2005)
Chowdhury, N., Boutaba, R.: Network virtualization: state of the art and research challenges (topics in network and service management). IEEE Communications Magazine 47(7), 20–26 (2009)
Chowdhury, N., Rahman, M., Boutaba, R.: Virtual network embedding with coordinated node and link mapping, April 2009, pp. 783–791. IEEE INFOCOM (2009)
Fan, J., Ammar, M.: Dynamic topology configuration in service overlay networks - a study of reconfiguration policies. In: IEEE INFOCOM (2006)
Feamster, N., Gao, L., Rexford, J.: How to lease the internet in your spare time. SIGCOMM Comput. Commun. Rev. 37(1), 61–64 (2007)
Houidi, I., Louati, W., Zeghlache, D.: A distributed virtual network mapping algorithm. In: Proceedings of IEEE ICC, pp. 5634–5640 (2008)
Kurant, M., Thiran, P.: Survivable Routing of Mesh Topologies in IP-over-WDM Networks by Recursive Graph Contraction. IEEE Journal on Selected Areas in Communications 25(5), 922–933 (2007)
Lee, K., Modiano, E.: Cross-layer survivability in wdm-based networks. In: INFOCOM 2009, April 2009, pp. 1017–1025. IEEE, Los Alamitos (2009)
Lischka, J., Karl, H.: A virtual network mapping algorithm based on subgraph isomorphism detection. In: Proceedings of ACM SIGCOMM VISA (2009)
Lu, J., Turner, J.: Efficient mapping of virtual networks onto a shared substrate. Washington University, Tech. Rep. WUCSE-2006-35 (2006)
Makhorin, A.: GNU Linear Programming Kit, Moscow Aviation Institute, Russia (2008), http://www.gnu.org/software/glpk/
Markopoulou, A., Iannaccone, G., Bhattacharyya, S., Chuah, C.-N., Ganjali, Y., Diot, C.: Characterization of failures in an operational ip backbone network. IEEE/ACM Trans. Netw. 16(4), 749–762 (2008)
Stern, T.E., Bala, K.: Multiwavelength Optical Networks: A Layered Approach. Addison-Wesley Longman Publishing Co., Inc., Boston (1999)
Thulasiraman, K., Javed, M.S., Xue, G.L.: Circuits/cutsets duality and a unified algorithmic framework for survivable logical topology design in ip-over-wdm optical networks. In: IEEE INFOCOM (2009)
Topkis, D.M.: A k shortest path algorithm for adaptive routing in communications networks. IEEE Transactions on Communications 36(7) (July 1988)
Wang, Y., Keller, E., Biskeborn, B., van der Merwe, J., Rexford, J.: Virtual routers on the move: live router migration as a network-management primitive. In: SIGCOMM, pp. 231–242. ACM, New York (2008)
Yu, M., Yi, Y., Rexford, J., Chiang, M.: Rethinking virtual network embedding: Substrate support for path splitting and migration. ACM SIGCOMM CCR 38(2), 17–29 (2008)
Zheng, Q., Shin, K.G.: Fault-tolerant real-time communication in distributed computing systems. IEEE Trans. Parallel Distrib. Syst. 9(5), 470–480 (1998)
Zhu, Y., Ammar, M.: Algorithms for assigning substrate network resources to virtual network components. In: Proceedings of IEEE INFOCOM (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rahman, M.R., Aib, I., Boutaba, R. (2010). Survivable Virtual Network Embedding. In: Crovella, M., Feeney, L.M., Rubenstein, D., Raghavan, S.V. (eds) NETWORKING 2010. NETWORKING 2010. Lecture Notes in Computer Science, vol 6091. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12963-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-12963-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12962-9
Online ISBN: 978-3-642-12963-6
eBook Packages: Computer ScienceComputer Science (R0)