Proceedings ArticleDOI
BIRD-VNE: Backtrack-avoidance virtual network embedding in polynomial time
Sherif Abdelwahab,Bechir Hamdaoui,Mohsen Guizani +2 more
- pp 4983-4989
Reads0
Chats0
TLDR
A polynomial-time VNE algorithm is designed that, in addition to avoiding backtracking and increasing acceptance rates, incurs a low embedding cost when compared to existing approaches.Abstract:
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 approachesread more
Citations
More filters
Journal ArticleDOI
Cloud of Things for Sensing-as-a-Service: Architecture, Algorithms, and Use Case
TL;DR: A distributed sensing resource discovery and virtualization algorithms that efficiently deploy virtual sensor networks on top of a subset of the selected IoT devices and an uncoordinated, distributed algorithm that relies on the selected sensors to estimate a set of parameters without requiring synchronization among the sensors are designed.
Journal ArticleDOI
A survey of embedding algorithm for virtual network embedding
TL;DR: A survey of embedding algorithms for VNE problem is conducted, according to the novel proposed category approach, which aims at overcoming the gradual ossification of current networks, particularly to the worldwide Internet.
Journal ArticleDOI
Efficient Virtual Network Embedding With Backtrack Avoidance for Dynamic Wireless Networks
TL;DR: This work analytically and empirically verify that Bird-VNE outperforms existing VNE algorithms with respect to computational efficiency, closeness to optimality, and its ability to avoid potential migrations in mobile wireless networks.
Journal ArticleDOI
Secure virtual network embedding with flexible bandwidth-based revenue maximization
TL;DR: This paper proposes a virtual network embedding problem that ensures that the virtual networks of conflicting operators are mapped to different physical equipments and enables the virtual links to select among a range of discrete bandwidth values, each with a corresponding price and thereby realizing any possible revenue function.
Posted Content
Flocking Virtual Machines in Quest for Responsive IoT Cloud Services
TL;DR: In this paper, a simple and scalable protocol that enables live migration of Virtual Machines (VMs) across heterogeneous edge and conventional cloud platforms to improve the responsiveness of cloud services is proposed.
References
More filters
Journal ArticleDOI
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
John E. Hopcroft,Richard M. Karp +1 more
TL;DR: This paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to $(m + n)\sqrt n $.
Book
Constraint Processing
TL;DR: Rina Dechter synthesizes three decades of researchers work on constraint processing in AI, databases and programming languages, operations research, management science, and applied mathematics to provide the first comprehensive examination of the theory that underlies constraint processing algorithms.
Proceedings ArticleDOI
A n5/2 algorithm for maximum matchings in bipartite
John E. Hopcroft,Richard M. Karp +1 more
TL;DR: In this paper, a bipartite graph with n vertices and m edges was constructed in a number of computation steps proportional to (m+n) n, where n is the number of edges in the graph.
Journal ArticleDOI
Virtual Network Embedding: A Survey
TL;DR: A survey of current research in the Virtual Network Embedding (VNE) area is presented and a taxonomy of current approaches to the VNE problem is provided and opportunities for further research are discussed.
Proceedings Article
A filtering algorithm for constraints of difference in CSPs
TL;DR: A new filtering algorithm is presented that achieves the generalized arc-consistency condition for these non-binary constraints and has been successfully used in the system RESYN, to solve the subgraph isomorphism problem.
Related Papers (5)
Resolve the virtual network embedding problem: A column generation approach
Qian Hu,Yang Wang,Xiaojun Cao +2 more