Dynamic recovery for survivable virtual network embedding

doi:10.1016/S1005-8885(14)60304-6

Acta Metallurgica Sinica(English letters) ›› 2014, Vol. 21 ›› Issue (3): 77-84.doi: 10.1016/S1005-8885(14)60304-6

• Networks • Previous Articles Next Articles

Dynamic recovery for survivable virtual network embedding

卢波, HUANG Tao, SUN Xiao-chuan, CHEN Jian-ya, LIU Yun-jie

1. Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, Beijing 100876, China 2. School of Information Engineering, Hebei United University, Tangshan 063009, China

Received:2013-11-29 Revised:2014-04-02 Online:2014-06-30 Published:2014-06-30
Contact: Bo Lu E-mail:billylu@bupt.edu.cn
Supported by:
This work was supported by the National Basic Research Programs of China (2012CB315801).

Abstract

Abstract:

Network virtualization is a promising way to overcome the current ossification of the Internet. It is essential challenge to find effective, efficient and robust embedding algorithms for recovering virtual network. The virtual network mapping algorithm based on integer programming which was proposed months ago. But it did consider the faults of physical network resources, which is so called survivable virtual network embedding (VNE) problem. Previous strategies for enabling survivability in network virtualization focused on providing protection for the physical network or enhancing the virtual networks by providing backup physical resources in advance, and treated all the physical failures as link failures. In the article, a dynamic recovery method is proposed to solve the survivable virtual network embedding problem based on the integer programming VNE algorithm. The dynamic recovery method doesn’t need to backup physical resources and it makes more substrate resources which can be used in the embedding. The dynamic recovery process will be activated only when physical failures occur. Different algorithms are used to recovery node and link failures. Simulations show that the method helps to recover almost all of physical failures by finding the substitute nodes and paths, and its performance is very close to that of pure VNE method without considering physical failures.

Key words:

network virtualization, integer programming, survivable virtual network embedding, dynamic recovery

LU Bo, HUANG Tao, SUN Xiao-chuan, CHEN Jian-ya, LIU Yun-jie. Dynamic recovery for survivable virtual network embedding[J]. Acta Metallurgica Sinica(English letters), 2014, 21(3): 77-84.

References

1. Anderson T, Peterson L, Shenker S, et al. Overcoming the Internet impasse through virtualization. Computer, 2005, 38(4): 34-41

2. Chowdhury N M M K, Boutaba R. A survey of network virtualization. Computer Networks, 2010, 54(4): 862-867

3. Fischer A, Botero J F, Duelli M, et al. ALEVIN--A framework to develop, compare, and analyze virtual network embedding algorithms. Proceedings of the Workshops der Wissenschaftlichen Konferenz Kommunikation in Verteilten Systemen (WowKiVS’11), Mar 10-11, 2011, Kiel, Germany (Electronic Communications of the EASST, 2011, Vol 10). 2011: 12p

4. Wang A J, Iyer M, Dutta R, et al. Network virtualization: Technologies, perspectives, and frontiers. Journal of Lightwave Technology, 2013, 31(4): 523-537

5. Yu M, Yi Y, Rexford J, et al. Rethinking virtual network embedding: Substrate support for path splitting and migration. Computer Communication Review (ACM SIGCOMM), 2008, 38(2): 17-29

6. Chowdhury N M M K, Rahman M R, Boutaba R. Virtual network embedding with coordinated node and link mapping. Proceedings of the 28th Annual Joint Conference of the IEEE Computer and Communications (INFOCOM’09), Apr 19-25, 2009, Rio de Janeiro, Brazil. Piscataway, NJ, USA: IEEE, 2009: 783-791

7. Lu B, Chen J Y, Cui H Y, et al. A virtual network mapping algorithm based on integer programming. Journal of Zhejiang University: Science C, 2013, 14(12): 899-908

8. Yu H F, Anand V, Qiao C M, et al. Cost efficient design of survivable virtual infrastructure to recover from facility node failures. Proceedings of the IEEE International Conference on Communications (ICC’11), Jun 5-9, 2011, Kyoto, Japan. Piscataway, NJ, USA: IEEE, 2011: 6p

9. Qiao C M, Guo B L, Huang S G, et al. A novel two-step approach to surviving facility failures. Proceedings of the Optical Fiber Communication/National Fiber Optic Engineers Conference (OFC/NFOEC’11), Mar 6-11, 2011, Los Angeles, CA, USA. Piscataway, NJ, USA: IEEE, 2011: 3p

10. Rahman M R, Aib I, Boutaba R. Survivable virtual network embedding. Proceedings of the 9th International IFIP-TC6 Networking Conference (NETWORKING’10), May 11-15, 2010, Chennai, India. LNCS 6091. Berlin, Germany: Springer-Verlag, 2010: 40-52

11. Hu Q, Wang Y, Cao X J. Location-constrained survivable network virtualization. Proceedings of the 35th IEEE Sarnoff Symposium (SARNOFF’12), May 21-22, 2012, Newark, NJ, USA. Piscataway, NJ, USA: IEEE, 2012: 5p

12. Schrijver A. Theory of linear and integer programming. New York, NY, USA: John Wiley & Sons, 1986

13. Zegura E W, Calvert K L, Bhattacharjee S. How to model an Internetwork. Networking the Next Generation: Proceedings of the 15th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM’96): Vol 2, Mar 24-28, 1996, San Francisco, CA, USA. Piscataway, NJ, USA: IEEE, 1996: 594-602

Metrics

Comments

Copyright © 2020 The Journal of China Universities of Posts and Telecommunications
　 Adress: P.O. Box 231,Beijing University of Posts and Telecommunications,10 Xi Tucheng Road,Beijing 100876,P.R.China　Post Code: 100081
Tel：86-010-62282493　Fax： 86-010-62283461　E-mail: jchupt@bupt.edu.cn
Support by: Beijing Magtech Co.Ltd

Dynamic recovery for survivable virtual network embedding

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 0

Recommended Articles

Metrics

Comments