A Multi-Commodity Flow Based Approach to Virtual Network Resource Allocation
Oh la la
Your session has expired but don’t worry, your message
has been saved.Please log in and we’ll bring you back
to this page. You’ll just need to click “Send”.
Your evaluation is of great value to our authors and readers. Many thanks for your time.
When you're done, click "publish"
Only blue fields are mandatory.
Your mailing list is currently empty.
It will build up as you send messages
and links to your peers.
besides you has access to this list.
Enter the e-mail addresses of your recipients in the box below. Note: Peer Evaluation will NOT store these email addresses log in
Your message has been sent.
Full text for this article was not available? Send a request to the author(s)
: A Multi-Commodity Flow Based Approach to Virtual Network Resource Allocation
Abstract : The Virtual Network (VN) concept has been studied as a useful mean in supporting rapid service creation and deployment. In this research paper, we propose a scheme for allocating resource to VNs with the objective of maximizing the number of VNs that can be accommodated into the network. In our scheme, a set of resource is pre-allocated for each pair of edge nodes, according to the solution of the multi-commodity flow problem. A VN creation request consists of a set of edge nodes and the bandwidth requirement between each edge node pair. A VN creation request is satisfied by exercising the associated pre-allocated resource and the residual network resource. Simulation results show that our scheme offers better performance over traditional methods, in terms of request blocking ratio and network resource utilization.
: Computer Science
Leave a comment
This contribution has not been reviewed yet. review?