<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2d1 20170631//EN" "JATS-journalpublishing1.dtd">
<article xlink="http://www.w3.org/1999/xlink" dtd-version="1.0" article-type="technology" lang="en"><front><journal-meta><journal-id journal-id-type="publisher">IJCRR</journal-id><journal-id journal-id-type="nlm-ta">I Journ Cur Res Re</journal-id><journal-title-group><journal-title>International Journal of Current Research and Review</journal-title><abbrev-journal-title abbrev-type="pubmed">I Journ Cur Res Re</abbrev-journal-title></journal-title-group><issn pub-type="ppub">2231-2196</issn><issn pub-type="opub">0975-5241</issn><publisher><publisher-name>Radiance Research Academy</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">1147</article-id><article-id pub-id-type="doi"/><article-id pub-id-type="doi-url"/><article-categories><subj-group subj-group-type="heading"><subject>Technology</subject></subj-group></article-categories><title-group><article-title>VM Source Assigned Procedure in Numerous Multiple Supply Using Clouds Computing&#13;
</article-title></title-group><contrib-group><contrib contrib-type="author"><name><surname>Iswarya</surname><given-names>R. M.</given-names></name></contrib><contrib contrib-type="author"><name><surname>Raj</surname><given-names>T. Nirmal</given-names></name></contrib></contrib-group><pub-date pub-type="ppub"><day>6</day><month>06</month><year>2017</year></pub-date><volume>) </volume><issue> I</issue><fpage>84</fpage><lpage>88</lpage><permissions><copyright-statement>This article is copyright of Popeye Publishing, 2009</copyright-statement><copyright-year>2009</copyright-year><license license-type="open-access" href="http://creativecommons.org/licenses/by/4.0/"><license-p>This is an open-access article distributed under the terms of the Creative Commons Attribution (CC BY 4.0) Licence. You may share and adapt the material, but must give appropriate credit to the source, provide a link to the licence, and indicate if changes were made.</license-p></license></permissions><abstract><p>Cloud providers stipulate a variety of resources such as CPUs, memory, and storage in the form of Virtual Machine (VM) occurrence which is then allocated to the users. The users are charged based on an on-demand model, and their payments should be strong-minded by taking into account both their incentives and the incentives of the cloud providers. These provisions of cloud services make a service market, where users can dynamically pick services based on such attractive norm as price and class. A perceptive model of a service market is a reverse auction. In the first price auction, however, a service that is cheaper and provides better quality is not necessarily selected. Auction markets can incarcerate such incentives, where users name their own prices for their requested VMs. This causes unwanted outcomes both for users and cloud providers. We intend an auction-based online mechanism for VM provisioning, share, and pricing in clouds that deem several types of resources. Our proposed online mechanism makes no theory about future demand of VMs, which is the case in real cloud settings. The proposed online mechanism is summoned as soon as a user places a request or some of the allocated resources are released and become available. The mechanism assigns VM instances to selected users for the period they are requested for, and ensures that the users will continue using their VM instances for the entire requested period. In addition, the mechanism determines the payment the users have to pay for using the assigned resources. We prove that the mechanism is incentive-compatible, that is, it gives incentives to the users to reveal their actual requests. We investigate the performance of our proposed mechanism through extensive experiments.&#13;
</p></abstract><kwd-group><kwd>Cloud computing</kwd><kwd> Online truthful mechanism</kwd><kwd> Dynamic pricing</kwd><kwd> Resource allocation</kwd></kwd-group></article-meta></front></article>
