Flexible VNE algorithms analysis using ALEVIN

View/Open
Document typeConference report
Defense date2011
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
Network virtualization is recognized as an enabling technology for the Future Internet that overcomes network ossification. However, it introduces a set of challenges. In any network virtualization environment, the problem of optimally mapping virtual demands to physical resources, known as virtual network embedding (VNE), is a crucial challenge. This paper analyses the behaviour of the main algorithms proposed to solve VNE by means of the ALEVIN framework. The VNE algorithms are evaluated with regard to appropriate metrics such as: cost, revenue, and virtual network acceptance ratio. We also analyse the impact of the recently introduced hidden hop demand concept
in the performance of the VNE algorithms.
CitationBotero, J. [et al.]. Flexible VNE algorithms analysis using ALEVIN. A: Euroview. "Proceedings". Wuerzburg: 2011, p. 47-48.
Files | Description | Size | Format | View |
---|---|---|---|---|
Euroview 2011 - paper.pdf | 115,3Kb | View/Open |