Abstract
The virtual network embedding (VNE) problem deals with the embedding of virtual network (VN) requests in an underlying physical (substrate network) infrastructure. When both the node and link constraints are considered, the VN embedding problem is NP-hard, even in the offline case. The genetic algorithm (GA) is an excellent approach to solving complex problems in optimization with difficult constraints. This paper explores applying GA to handle the VNE problem. We propose two GA-based VNE algorithms and evaluate them by comparing with the existing state-of-the-art VNE algorithms, including PSO-based VNE approaches. Extensive simulation results validate the capability of the proposed GA-based VNE algorithms in terms of the InP long-term revenue and the VN embedding cost.
Sign-in/Register to access full text options 
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.
