Show simple item record

AuthorAbdelwahab, Sherif
AuthorHamdaoui, Bechir
AuthorGuizani, Mohsen
Available date2022-11-10T09:47:26Z
Publication Date2014
Publication Name2014 IEEE Global Communications Conference, GLOBECOM 2014
ResourceScopus
Resource2-s2.0-84988221760
URIhttp://dx.doi.org/10.1109/GLOCOM.2014.7037595
URIhttp://hdl.handle.net/10576/36176
AbstractThe virtual network embedding (VNE) problem is known to be NP-hard, and as a result, several heuristic approaches have been proposed to solve it. These heuristics find sub-optimal solutions in polynomial time, but have practical limitations, low acceptance rates, and high embedding costs. In this paper, we first propose two heuristics that exploit the constraint propagation properties of the VNE problem to ensure both topological and capacity disjoint consistencies, thereby avoiding backtracking while increasing acceptance rates. Then, combining these two heuristics, we design a polynomial-time VNE algorithm (we term it BIRD-VNE) that, in addition to avoiding backtracking and increasing acceptance rates, incurs a low embedding cost when compared to existing approaches. 2014 IEEE.
Languageen
PublisherInstitute of Electrical and Electronics Engineers Inc.
SubjectBirds
Heuristic methods
Polynomial approximation
Acceptance rate
Constraint propagation
Heuristic approach
NP-hard
Polynomial-time
Suboptimal solution
Virtual network embedding
Polynomials
TitleBIRD-VNE: Backtrack-avoidance virtual network embedding in polynomial time
TypeConference Paper
Pagination4983-4989
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record