Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/2461
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Addya, S K | - |
dc.contributor.author | Turuk, A K | - |
dc.contributor.author | Sahoo, Bibhudatta | - |
dc.contributor.author | Sarkar, M | - |
dc.date.accessioned | 2016-03-16T09:52:06Z | - |
dc.date.available | 2016-03-16T09:52:06Z | - |
dc.date.issued | 2015-12 | - |
dc.identifier.citation | IEEE International Conference on Advanced Networks and Telecommunications Systems, Bangalore, India, 6-9 Nov 2016 | en_US |
dc.identifier.uri | http://hdl.handle.net/2080/2461 | - |
dc.description | Copyright belongs to proceeding publisher | en_US |
dc.description.abstract | Virtual Machine (VM) placement is an important research area for power conservation in data centers. In this paper, we introduce a hybrid queuing model for VM placement for data centers to improve total placement time and earn more revenue. For the large data center management smaller placement times lead to greater quality of service (QoS) experienced by an user of the cloud infrastructure. Similarly, the larger the number of VMs that can be placed in a server racks, higher the justification of the placement cost. We thus propose a ILP, that provides maximum justification of the revenue earn along with minimizing placement time. In addition, we also study the rate of loss of VM placement requests and total utilization of the system as the arrival rate of VMs increase | en_US |
dc.publisher | IEEE | en_US |
dc.subject | Cloud computing | en_US |
dc.subject | Virtual machine | en_US |
dc.subject | Placement time | en_US |
dc.subject | Revenue | en_US |
dc.title | A Hybrid Queuing Model for Virtual Machine Placement in Cloud Data Cente | en_US |
dc.type | Article | en_US |
Appears in Collections: | Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2015_ANTS_Sahoo_Hybrid.pdf | 140.4 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.