Please use this identifier to cite or link to this item: https://dspace.iiti.ac.in/handle/123456789/4681
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRane, Dheerajen_US
dc.contributor.authorShrivastava, Abhisheken_US
dc.date.accessioned2022-03-17T01:00:00Z-
dc.date.accessioned2022-03-17T15:35:09Z-
dc.date.available2022-03-17T01:00:00Z-
dc.date.available2022-03-17T15:35:09Z-
dc.date.issued2015-
dc.identifier.citationRane, D., & Srivastava, A. (2015). Cloud brokering architecture for dynamic placement of virtual machines. Paper presented at the Proceedings - 2015 IEEE 8th International Conference on Cloud Computing, CLOUD 2015, 661-668. doi:10.1109/CLOUD.2015.93en_US
dc.identifier.isbn9781467372879-
dc.identifier.otherEID(2-s2.0-84960153665)-
dc.identifier.urihttps://doi.org/10.1109/CLOUD.2015.93-
dc.identifier.urihttps://dspace.iiti.ac.in/handle/123456789/4681-
dc.description.abstractNumerous service providers in the cloud market provide diverse services, at distinct price and level of competence. However, the concept of cloud computing is yet to reach many organizations and to the end users as well. With perspective of these organizations and end users, it is very difficult to choose one among many service providers. Further, adhering to only one provider will deprive these users of benefits from market diversity and fluctuating rates. Instead, having a broker be aware of the provider's service offerings and consumer's requirements, and managing the assignment under economic and technical constraints will benefit both ends of the service viz consumers and providers. In this work, a cloud resource broker is proposed that will govern the assignment of providers' resources to consumer dynamically. The proposed broker uses various requirements and constraints specified by the consumer in the requirement description template as input, to calculate aggregated requirements, using an aggregation algorithm. Further, the service scheduling algorithm is defined to find an optimized match between the aggregated requirements with the providers offerings. Thereafter, this algorithm is executed frequently, based on a strategy for dynamic scheduling to benefit consumers on account of introduction of new provider or some good offerings. Results show that the solution provided by broker proves to be a win-win situation for the consumer with respect to cost as well as performance. © 2015 IEEE.en_US
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineers Inc.en_US
dc.sourceProceedings - 2015 IEEE 8th International Conference on Cloud Computing, CLOUD 2015en_US
dc.subjectAggregatesen_US
dc.subjectCloud computingen_US
dc.subjectCommerceen_US
dc.subjectSchedulingen_US
dc.subjectAggregation algorithmsen_US
dc.subjectBrokering architectureen_US
dc.subjectCloud brokersen_US
dc.subjectDynamic schedulingen_US
dc.subjectRequirement descriptionen_US
dc.subjectService Level Agreementsen_US
dc.subjectTechnical constraintsen_US
dc.subjectVirtual machinesen_US
dc.subjectScheduling algorithmsen_US
dc.titleCloud Brokering Architecture for Dynamic Placement of Virtual Machinesen_US
dc.typeConference Paperen_US
Appears in Collections:Department of Computer Science and Engineering

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetric Badge: