Theory of linear and integer programming
Theory of linear and integer programming
Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A Unified Probabilistic Framework for Web Page Scoring Systems
IEEE Transactions on Knowledge and Data Engineering
A solver for the network testbed mapping problem
ACM SIGCOMM Computer Communication Review
ACM Transactions on Internet Technology (TOIT)
Exact and Approximate Graph Matching Using Random Walks
IEEE Transactions on Pattern Analysis and Machine Intelligence
How to lease the internet in your spare time
ACM SIGCOMM Computer Communication Review
Rethinking virtual network embedding: substrate support for path splitting and migration
ACM SIGCOMM Computer Communication Review
Accountable internet protocol (aip)
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
DaVinci: dynamically adaptive virtual networks for a customized internet
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
A virtual network mapping algorithm based on subgraph isomorphism detection
Proceedings of the 1st ACM workshop on Virtualized infrastructure systems and architectures
Network virtualization: state of the art and research challenges
IEEE Communications Magazine
A survey of network virtualization
Computer Networks: The International Journal of Computer and Telecommunications Networking
PolyViNE: policy-based virtual network embedding across multiple domains
Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Virtual network provisioning across multiple substrate networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Virtual network embedding through topology-aware node ranking
ACM SIGCOMM Computer Communication Review
Topology-awareness and reoptimization mechanism for virtual network embedding
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Evolutionary programming techniques for constrained optimizationproblems
IEEE Transactions on Evolutionary Computation
Simulated annealing based resource allocation for cloud data centers
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
DoS-resilient virtual networks through multipath embedding and opportunistic recovery
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Green cloud virtual network provisioning based ant colony optimization
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Performance evaluation of artificial intelligence algorithms for virtual network embedding
Engineering Applications of Artificial Intelligence
A new virtual network static embedding strategy within the Cloud's private backbone network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Embedding a sequence of virtual networks (VNs) into a given physical network substrate to accommodate as many VN requests as possible is known to be NP-hard. This paper presents a new approach to studying this problem. In particular, we devise a topology-aware measure on node resources based on random walks and use it to rank a node's resources and topological attributes. We then devise a greedy algorithm that matches nodes in the VN to nodes in the substrate network according to node ranks. In most situations there exist multiple embedding solutions, and so we want to find the best embedding that increases the possibility of accepting future VN requests and optimizes the revenue for the provider of the substrate network. We present an integer linear programming formulation for this optimization problem when path splitting is not allowed. We then devise a fast-convergent discrete Particle Swarm Optimization algorithm to approximate this problem. Extensive simulation results show that our algorithms produce near optimal solutions and significantly outperform existing algorithms in terms of the ratio of the long-term average revenue over the VN request acceptance.