Rethinking virtual network embedding: substrate support for path splitting and migration
ACM SIGCOMM Computer Communication Review
A virtual network mapping algorithm based on subgraph isomorphism detection
Proceedings of the 1st ACM workshop on Virtualized infrastructure systems and architectures
A Cost Efficient Design of Virtual Infrastructures with Joint Node and Link Mapping
Journal of Network and Systems Management
Survivable virtual network embedding
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
ViNEYard: virtual network embedding algorithms with coordinated node and link mapping
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Network virtualization allows multiple virtual networks to coexist on a shared physical substrate infrastructure. As far as possible to support more virtual networks on a shared substrate network, efficient physical resource utilization is crucial. This paper presents a novel approach to increase utility of the substrate network. As an optimization problem, such virtual network embedding problem is formulated as an integer linear programming model. By introducing a sliding window with priority for VN requests, the algorithm embeds virtual nodes based on both connective degree and comprehensive capacity. Experimental results show that comparing with the existing VNE algorithm the proposed algorithm achieve higher VNs accept ratio and gain higher revenue-cost ratio for substrate network.