Author
Listed:
- Ramon de Oliveira
- Guilherme Piegas Koslovski
Abstract
Cloud providers have introduced the on‐demand provisioning of virtual infrastructures (VIs) to deliver virtual networks of computing resources as a service. By combining network and computing virtualization, providers allow traffic isolation between hosted VIs. Taking advantage of this opportunity, tenants have deployed private VIs with application‐optimized network topologies to increase quality of experience of final users. One of the main open challenges in this scenario is the allocation of physical resources to host VIs in accordance with quality of service computing (eg, virtual CPUs and memory) and network requirements (guaranteed bandwidth and specific network topology). Moreover, a VI can be allocated anywhere atop a network datacenter, and because of its NP‐hard complexity, the search for optimal solutions has a limited applicability in cloud providers as requesting users seek an immediate response. The present work proposes an algorithm to accomplish the VI allocation by applying tree‐based heuristics to reduce the search space, performing a joint allocation of computing and network resources. So as to accomplish this goal, the mechanism includes a strategy to convert physical and virtual graphs to trees, which later are pruned by a grouped accounting algorithm. These innovations reduce the number of comparisons required to allocate a VI. Experimental results indicate that the proposed algorithm finds an allocation on feasible time for different cloud scenarios and VI topologies, while maintaining a high acceptance rate and a moderate physical infrastructure fragmentation.
Suggested Citation
Ramon de Oliveira & Guilherme Piegas Koslovski, 2017.
"A tree‐based algorithm for virtual infrastructure allocation with joint virtual machine and network requirements,"
International Journal of Network Management, John Wiley & Sons, vol. 27(1), January.
Handle:
RePEc:wly:intnem:v:27:y:2017:i:1:n:e1958
DOI: 10.1002/nem.1958
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:intnem:v:27:y:2017:i:1:n:e1958. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.