DocumentCode
3719903
Title
SiMPLE: Survivability in multi-path link embedding
Author
Md Mashrur Alam Khan;Nashid Shahriar;Reaz Ahmed;Raouf Boutaba
Author_Institution
David R Cheriton School of Computer Science, University of Waterloo, ON, Canada
fYear
2015
Firstpage
210
Lastpage
218
Abstract
Internet applications are deployed on the same network infrastructure, yet they have diverse performance and functional requirements. The Internet was not originally designed to support the diversity of current applications. Network Virtualization can enable heterogeneous applications and network architectures to coexist without interference on the same infrastructure. Embedding a Virtual Network (VN) into a physical network is a fundamental problem in Network Virtualization. A VN Embedding that aims to survive physical (e.g., link) failures is known as the Survivable Virtual Network Embedding (SVNE). A key challenge in the SVNE problem is to ensure VN survivability with minimal resource redundancy. To address this challenge, we propose SiMPLE. By exploiting path diversity in the physical network, SiMPLE provides guaranteed VN survivability against single link failure. In addition, SiMPLE produces highly surviv-able VN embeddings in presence of multiple link failures while incurring very low resource redundancy. We provide an ILP formulation for this problem and implement it using GLPK. We also propose a greedy algorithm to solve larger instances of the problem. Simulation results show that our solution outperforms full backup and shared backup schemes for SVNE, and produces near-optimal results.
Keywords
"Substrates","Bandwidth","Redundancy","Indium phosphide","III-V semiconductor materials","Internet","Greedy algorithms"
Publisher
ieee
Conference_Titel
Network and Service Management (CNSM), 2015 11th International Conference on
Type
conf
DOI
10.1109/CNSM.2015.7367361
Filename
7367361
Link To Document