37,589 research outputs found
Improving distributed virtual network embedding with offline optimization
To cope with the complexity of the ever changing internet architecture, network virtualization services are vowed to play an important role in the future. To provide such solutions effectively, internet providers face the problem of optimizing the allocation of virtual networks on their physical resources. Since this problem is known to be NP-hard, heuristic based online solutions tend to provide better response time, however they lead to non-optimal solutions. This paper shows how a periodic live migration of virtual networks, using a state provided by offline optimization, can help an internet provider increase its virtual network load by up to 20%. Due to better packing of virtual load, some physical resources can also be shut down to save energy
On distributed virtual network embedding with guarantees
To provide wide-area network services, resources from different infrastructure providers are needed. Leveraging the consensus-based resource allocation literature, we propose a general distributed auction mechanism for the (NP-hard) virtual network (VNET) embedding problem. Under reasonable assumptions on the bidding scheme, the proposed mechanism is proven to converge, and it is shown that the solutions guarantee a worst-case efficiency of (1-(1/e)) relative to the optimal node embedding, or VNET embedding if virtual links are mapped to exactly one physical link. This bound is optimal, that is, no better polynomial-time approximation algorithm exists, unless P=NP. Using extensive simulations, we confirm superior convergence properties and resource utilization when compared to existing distributed VNET embedding solutions, and we show how by appropriate policy design, our mechanism can be instantiated to accommodate the embedding goals of different service and infrastructure providers, resulting in an attractive and flexible resource allocation solution.CNS-0963974 - National Science Foundationhttp://www.cs.bu.edu/fac/matta/Papers/ToN-CAD.pdfAccepted manuscrip
On distributed virtual network embedding with guarantees
To provide wide-area network services, resources from different infrastructure providers are needed. Leveraging the consensus-based resource allocation literature, we propose a general distributed auction mechanism for the (NP-hard) virtual network (VNET) embedding problem. Under reasonable assumptions on the bidding scheme, the proposed mechanism is proven to converge, and it is shown that the solutions guarantee a worst case efficiency of (?????) relative to the optimal solution, and that this bound is optimal, that is, no better approximation exists. Using extensive simulations, we confirm superior convergence properties and resource utilization when compared with existing distributed VNET embedding solutions, and we show how byappropriate policy design, our mechanism can be instantiated to accommodate the embedding goals of different service and infrastructure providers, resulting in an attractive and flexible resource allocation solution.This work is supported in part by the National Science Foundation under grant CNS-0963974
On distributed virtual network embedding with guarantees
To provide wide-area network services, resources from different infrastructure providers are needed. Leveraging the consensus-based resource allocation literature, we propose a general distributed auction mechanism for the (NP-hard) virtual network (VNET) embedding problem. Under reasonable assumptions on the bidding scheme, the proposed mechanism is proven to converge, and it is shown that the solutions guarantee a worst case efficiency of (?????) relative to the optimal solution, and that this bound is optimal, that is, no better approximation exists. Using extensive simulations, we confirm superior convergence properties and resource utilization when compared with existing distributed VNET embedding solutions, and we show how byappropriate policy design, our mechanism can be instantiated to accommodate the embedding goals of different service and infrastructure providers, resulting in an attractive and flexible resource allocation solution.This work is supported in part by the National Science Foundation under grant CNS-0963974
Embedding of Virtual Network Requests over Static Wireless Multihop Networks
Network virtualization is a technology of running multiple heterogeneous
network architecture on a shared substrate network. One of the crucial
components in network virtualization is virtual network embedding, which
provides a way to allocate physical network resources (CPU and link bandwidth)
to virtual network requests. Despite significant research efforts on virtual
network embedding in wired and cellular networks, little attention has been
paid to that in wireless multi-hop networks, which is becoming more important
due to its rapid growth and the need to share these networks among different
business sectors and users. In this paper, we first study the root causes of
new challenges of virtual network embedding in wireless multi-hop networks, and
propose a new embedding algorithm that efficiently uses the resources of the
physical substrate network. We examine our algorithm's performance through
extensive simulations under various scenarios. Due to lack of competitive
algorithms, we compare the proposed algorithm to five other algorithms, mainly
borrowed from wired embedding or artificially made by us, partially with or
without the key algorithmic ideas to assess their impacts.Comment: 22 page
- …