.png){kind=icon}
Return
Efficient Virtual Network Embedding With Backtrack Avoidance for Dynamic Wireless Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2015.2507134.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We develop an efficient virtual network embedding (VNE) algorithm, termed BIRD-VNE, for mobile wireless networks. BIRD-VNE is an approximation algorithm that ensures a close to optimal virtual embedding profit and acceptance rate while minimizing the number of virtual networkmigrations resulting from the mobility of wireless nodes. BIRD-VNE employs a constraint satisfaction framework by which we analyze the constraint propagation properties of the VNE problem and design constraint processing algorithms that efficiently narrow the solution space and avoid backtracking as much as possible without compromising the solution quality. Our evaluation results show that the likelihood that BIRD-VNE results in backtracking is small, thus demonstrating its effectiveness in reducing the search space. We 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.
Keywords:
Mobile wireless networks
virtual network embedding
remote sensor networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave View more