Abstract
With the existence of the network virtualization, the mapping issue of it has received a tremendous attention in recent research. However, the progress of virtual network (VN) mapping is quite complicate due to different constraints and the large variety of the topologies of VN. VN mapping method also varies under different conditions. In this paper, we investigate survivable mapping for VN request with the geographic location constraint of each VN node. Since the VN mapping problem is NP-hard, we propose two heuristic algorithms called Geographic based Survivable VN Mapping (G-SVNM) and Geographic-Guided Survivable VN Mapping (GG-SVNM) to solve this problem. Considering the effect that virtual nodes' geographic locations while VN mapping, these two algorithms make VN mapping more practical. Furthermore, we compare the performances and costs of these two algorithms through simulation experiments.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
