عرض بسيط للتسجيلة

المؤلفAbdelwahab, Sherif
المؤلفHamdaoui, Bechir
المؤلفGuizani, Mohsen
تاريخ الإتاحة2022-11-10T09:47:26Z
تاريخ النشر2014
اسم المنشور2014 IEEE Global Communications Conference, GLOBECOM 2014
المصدرScopus
المصدر2-s2.0-84988221760
معرّف المصادر الموحدhttp://dx.doi.org/10.1109/GLOCOM.2014.7037595
معرّف المصادر الموحدhttp://hdl.handle.net/10576/36176
الملخصThe 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.
اللغةen
الناشرInstitute of Electrical and Electronics Engineers Inc.
الموضوعBirds
Heuristic methods
Polynomial approximation
Acceptance rate
Constraint propagation
Heuristic approach
NP-hard
Polynomial-time
Suboptimal solution
Virtual network embedding
Polynomials
العنوانBIRD-VNE: Backtrack-avoidance virtual network embedding in polynomial time
النوعConference Paper
الصفحات4983-4989
dc.accessType Abstract Only


الملفات في هذه التسجيلة

الملفاتالحجمالصيغةالعرض

لا توجد ملفات لها صلة بهذه التسجيلة.

هذه التسجيلة تظهر في المجموعات التالية

عرض بسيط للتسجيلة