Options
Prasad, Abhinandan S.
Loading...
Preferred name
Prasad, Abhinandan S.
Official Name
Prasad, Abhinandan S.
Alternative Name
Prasad, A. S.
Main Affiliation
Now showing 1 - 2 of 2
2014Journal Article [["dc.bibliographiccitation.firstpage","17"],["dc.bibliographiccitation.issue","1"],["dc.bibliographiccitation.journal","IEEE Transactions on Computers"],["dc.bibliographiccitation.lastpage","30"],["dc.bibliographiccitation.volume","63"],["dc.contributor.author","Prasad, Abhinandan S."],["dc.contributor.author","Rao, Shrisha"],["dc.date.accessioned","2019-07-30T12:50:45Z"],["dc.date.available","2019-07-30T12:50:45Z"],["dc.date.issued","2014"],["dc.description.abstract","We present a cloud resource procurement approach which not only automates the selection of an appropriate cloud vendor but also implements dynamic pricing. Three possible mechanisms are suggested for cloud resource procurement: C-DSIC, C-BIC and C-OPT. C-DSIC is dominant strategy incentive compatible, based on the VCG mechanism, and is a low-bid Vickrey auction. C-BIC is Bayesian incentive compatible, which achieves budget balance. C-BIC does not satisfy individual rationality. In C-DSIC and C-BIC, the cloud vendor who charges the lowest cost per unit QoS is declared the winner. In C-OPT, the cloud vendor with the least virtual cost is declared the winner. C-OPT overcomes the limitations of both C-DSIC and C-BIC. C-OPT is not only Bayesian incentive compatible, but also individually rational. Our experiments indicate that the resource procurement cost decreases with increase in number of cloud vendors irrespective of the mechanisms. We also propose a procurement module for a cloud broker which can implement C-DSIC, C-BIC or C-OPT to perform resource procurement in a cloud computing context. A cloud broker with such a procurement module enables users to automate the choice of a cloud vendor among many with diverse offerings, and is also an essential first step towards implementing dynamic pricing in the cloud."],["dc.identifier.doi","10.1109/TC.2013.106"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/62201"],["dc.language.iso","en"],["dc.relation.issn","0018-9340"],["dc.title","A Mechanism Design Approach to Resource Procurement in Cloud Computing"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]Details DOI2018Journal Article [["dc.bibliographiccitation.firstpage","904"],["dc.bibliographiccitation.issue","4"],["dc.bibliographiccitation.journal","IEEE Transactions on Cloud Computing"],["dc.bibliographiccitation.lastpage","914"],["dc.bibliographiccitation.volume","6"],["dc.contributor.author","Prasad, G. Vinu"],["dc.contributor.author","Prasad, Abhinandan S."],["dc.contributor.author","Rao, Shrisha"],["dc.date.accessioned","2020-12-10T18:26:16Z"],["dc.date.available","2020-12-10T18:26:16Z"],["dc.date.issued","2018"],["dc.description.abstract","In hybrid cloud computing, cloud users have the ability to procure resources from multiple cloud vendors, and furthermore also the option of selecting different combinations of resources. The problem of procuring a single resource from one of many cloud vendors can be modeled as a standard winner determination problem, and there are mechanisms for single item resource procurement given different QoS and pricing parameters. There however is no compatible approach that would allow cloud users to procure arbitrary bundles of resources from cloud vendors. We design the CLOUD-CABOB algorithm to solve the multiple resource procurement problem in hybrid clouds. Cloud users submit their requirements, and in turn vendors submit bids containing price, QoS and their offered sets of resources. The approach is scalable, which is necessary given that there are a large number of cloud vendors, with more continually appearing. We perform experiments for procurement cost and scalability efficacy on the CLOUD-CABOB algorithm using various standard distribution benchmarks like random, uniform, decay and CATS. Simulations using our approach with prices procured from several cloud vendors' datasets show its effectiveness at multiple resource procurement."],["dc.identifier.doi","10.1109/TCC.2016.2541150"],["dc.identifier.eissn","2168-7161"],["dc.identifier.eissn","2372-0018"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/76021"],["dc.language.iso","en"],["dc.notes.intern","DOI Import GROB-354"],["dc.relation.issn","2168-7161"],["dc.relation.issn","2372-0018"],["dc.title","A Combinatorial Auction Mechanism for Multiple Resource Procurement in Cloud Computing"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]Details DOI
2 results