Please use this identifier to cite or link to this item:
http://13.232.72.61:8080/jspui/handle/123456789/1001
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sadashiv, Naidila | - |
dc.contributor.author | Dilip Kumar, S. M. | - |
dc.contributor.author | Goudar, R. S. | - |
dc.date.accessioned | 2019-02-25T09:20:18Z | - |
dc.date.available | 2019-02-25T09:20:18Z | - |
dc.date.issued | 2014-09 | - |
dc.identifier.citation | Sadashiv, Naidila., Dilip Kumar, S. M., & Goudar, R. S. (2014, September). Priority based resource allocation and demand based pricing model in peer-to-peer clouds. In 2014 International Conference on Advances in Computing, Communications and Informatics (ICACCI) (pp. 1210-1216). New Delhi, India: IEEE. | en_US |
dc.identifier.isbn | e- 9781479930807 | - |
dc.identifier.issn | p-9781479930784 | - |
dc.identifier.other | DOI: 10.1109/ICACCI.2014.6968277 | - |
dc.identifier.uri | http://13.232.72.61:8080/jspui/handle/123456789/1001 | - |
dc.description.abstract | Management of resources in large scale distributed cloud environment is a major challenge due to the nature of cloud. On-demand resource provisioning allows the requests to be made on the fly. In order to provide QoS in accordance with the SLA in such a distributed environment, an effective resource handling scheme and pricing models that will benefit both the provider and cloud users is required. This paper aims to provide priority based resource allocation to the tasks by giving higher preference to the tasks that requests large amount of CPU. The tasks are classified into high, medium and low priority sets using the k-means algorithm. We also propose a dynamic pricing model where in the price is calculated based on the current demand for a resource and its availability. During high resource contention across the network, the resources are priced more than when there are surplus amount of resources. In such scenarios, the resources are discovered from the peer clouds through content addressable network for prioritized tasks. Simulation under different contention periods is carried out based on our priority based allocation. The results show that our algorithm provides better resource utilization ratio and throughput ratio when compared with non-prioritized tasks. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.subject | Computer science | en_US |
dc.subject | Cloud computing | en_US |
dc.subject | Resource management | en_US |
dc.subject | Peer-to-peer cloud | en_US |
dc.title | Priority Based Resource Allocation and Demand Based Pricing Model in Peer-to-Peer Clouds | en_US |
dc.type | Other | en_US |
Appears in Collections: | Conference Proceedings |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Priority Based Resource Allocation and Demand Based Pricing Model in Peer.pdf | 428.97 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.