.png){kind=icon}
.png){kind=icon}
Return
Dependable virtual network mapping
.png){kind=icon}
PRE
AI
DOI：10.1007/s00607-014-0431-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Virtualized networks are a promising approach to deal with the current ossification problem of Internet. A major challenge is related to virtual network (VN) mapping, as it is a NP-hard problem. Thus, several heuristics have been proposed aiming to achieve efficient allocation, but they do not consider dependability issues, which directly impact quality of service. This paper proposes a Greedy Randomized Adaptive Search Procedure (GRASP) based algorithm for dependable virtual network mapping, considering availability as the adopted metric. Redundancy policies are also adopted in order to meet VN requests with high availability constraints. Experiments demonstrate the impacts whenever dependability is taken into accountsss in the allocation as well as the trade-off between VN's availability and cost.
Keywords:
Network virtualization
GRASP
Dependability
Stochastic Petri nets
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.