Theory of linear and integer programming
Theory of linear and integer programming
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
A competitive analysis of the list update problem with lookahead
Theoretical Computer Science
SIAM Journal on Computing
Online bin packing with lookahead
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
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
Algorithms for provisioning virtual private networks in the hose model
IEEE/ACM Transactions on Networking (TON)
Resource management with hoses: point-to-cloud services for virtual private networks
IEEE/ACM Transactions on Networking (TON)
Improved Approximation Algorithms for Unsplittable Flow Problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A new polynomial-time algorithm for linear programming
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
A solver for the network testbed mapping problem
ACM SIGCOMM Computer Communication Review
Measurement based characterization and provisioning of IP VPNs
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
In VINI veritas: realistic and controlled network experimentation
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
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
Large-scale virtualization in the Emulab network testbed
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
A virtual network mapping algorithm based on subgraph isomorphism detection
Proceedings of the 1st ACM workshop on Virtualized infrastructure systems and architectures
A survey of network virtualization
Computer Networks: The International Journal of Computer and Telecommunications Networking
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Designing and embedding reliable virtual infrastructures
Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures
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
Topology-awareness and reoptimization mechanism for virtual network embedding
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Survivable virtual network embedding
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Surviving failures in bandwidth-constrained datacenters
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Surviving failures in bandwidth-constrained datacenters
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Simulated annealing based resource allocation for cloud data centers
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
NRS: a system for automated network virtualization in iaas cloud infrastructures
Proceedings of the 7th international workshop on Virtualization technologies in distributed computing
Greener networking in a network virtualization environment
Computer Networks: The International Journal of Computer and Telecommunications Networking
Topology-aware virtual network embedding based on closeness centrality
Frontiers of Computer Science: Selected Publications from Chinese Universities
Repeatable optimization algorithm based discrete PSO for virtual network embedding
ISNN'13 Proceedings of the 10th international conference on Advances in Neural Networks - Volume Part I
Virtual network embedding algorithm based connective degree and comprehensive capacity
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories
Fair virtual network embedding algorithm with repeatable pre-configuration mechanism
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories and Technology
Performance evaluation of artificial intelligence algorithms for virtual network embedding
Engineering Applications of Artificial Intelligence
A novel paths algebra-based strategy to flexibly solve the link mapping stage of VNE problems
Journal of Network and Computer Applications
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 |
Network virtualization allows multiple heterogeneous virtual networks (VNs) to coexist on a shared infrastructure. Efficient mapping of virtual nodes and virtual links of a VN request onto substrate network resources, also known as the VN embedding problem, is the first step toward enabling such multiplicity. Since this problem is known to be -hard, previous research focused on designing heuristic-based algorithms that had clear separation between the node mapping and the link mapping phases. In this paper, we present ViNEYard--a collection of VN embedding algorithms that leverage better coordination between the two phases. We formulate the VN embedding problem as a mixed integer program through substrate network augmentation.We then relax the integer constraints to obtain a linear program and devise two online VN embedding algorithms D-ViNE and R-ViNE using deterministic and randomized rounding techniques, respectively. We also present a generalized window-based VN embedding algorithm (WiNE) to evaluate the effect of lookahead on VN embedding. Our simulation experiments on a large mix of VN requests show that the proposed algorithms increase the acceptance ratio and the revenue while decreasing the cost incurred by the substrate network in the long run.