Browse

A marketplace and its market mechanism for trading commoditized computing resources

DC Field Value Language
dc.contributor.authorAltmann, Joern-
dc.contributor.authorCourcoubetis, Costas-
dc.contributor.authorRisch, Marcel-
dc.date.accessioned2011-12-02T06:03:09Z-
dc.date.available2011-12-02T06:03:09Z-
dc.identifier.citationANNALS OF TELECOMMUNICATIONS-ANNALES DES TELECOMMUNICATIONS; Vol.65 11-12; 653-667-
dc.identifier.issn0003-4347-
dc.identifier.urihttps://hdl.handle.net/10371/74988-
dc.description.abstractThis paper presents the design and implementation of the GridEcon Marketplace. In addition to supporting a market mechanism for trading computing resources on a pay-per-use basis, this marketplace also provides an environment for integrating value-added support services. These value-added services help consumers to use the utility computing market more efficiently. The GridEcon Market Mechanism for virtual machines specifies in detail the unit-of-trade, the bids and asks, as well as the matching algorithm. The marketplace and market mechanism are validated by using the GridEcon Platform, which is a service-oriented platform for composing market scenarios. Our validation results show that the GridEcon Marketplace fulfills all functional requirements and that the GridEcon Market Mechanism is computationally and economically efficient.-
dc.language.isoen-
dc.publisherSPRINGER FRANCE-
dc.subjectGrid economics-
dc.subjectMarket scenario emulation-
dc.subjectSimulation-
dc.subjectGrid computing-
dc.subjectUtility computing-
dc.subjectCloud computing-
dc.subjectMarket mechanism design-
dc.subjectComputing resource market-
dc.titleA marketplace and its market mechanism for trading commoditized computing resources-
dc.typeArticle-
dc.identifier.doi10.1007/s12243-010-0183-1-
dc.citation.journaltitleANNALS OF TELECOMMUNICATIONS-ANNALES DES TELECOMMUNICATIONS-
dc.description.citedreferenceMASON R, 2009, 6 INT WORKSH GRID EC-
dc.description.citedreferenceMEINL T, 2009, HICSS 09 42 HAW INT, P1-
dc.description.citedreferenceRISCH M, 2009, SPRINGER LNCS-
dc.description.citedreferenceALTMANN J, 2008, SPRINGER LNCS-
dc.description.citedreferenceMUSIL S, 2008, AMAZONS S3 EXPERIENC-
dc.description.citedreferenceRAHMAN M, 2008, CCGRID 2008 8 IEEE, P578-
dc.description.citedreferenceRISCH M, 2008, LECT NOTES COMPUT SC, P13-
dc.description.citedreferenceRISCH M, 2008, COLL KNOWL EC ISS, P1197-
dc.description.citedreferencePATTANAIK KK, 2007, IJCSNS INT J COMPUT, V7, P302-
dc.description.citedreferenceQUAN DM, 2007, GSEM 2007 4 INT C GR-
dc.description.citedreferenceVONNEUMANN J, 2007, THEORY GAMES EC BEHA-
dc.description.citedreferenceQUAN DM, 2006, P 2 INT C HIGH PERF-
dc.description.citedreferenceSANDHOLM T, 2006, P IEEE HPDC-
dc.description.citedreferenceKARASAVVAS K, 2005, LECT NOTES COMPUTER, V3458, P1-
dc.description.citedreferenceLAI K, 2005, MULTIAGENT GRID SYST, V1, P169-
dc.description.citedreferenceQuan DM, 2005, LECT NOTES COMPUT SC, V3470, P1107-
dc.description.citedreferenceWENG CL, 2005, CCGRID 2005 CARD WAL-
dc.description.citedreferenceELMROTH E, 2004, 2 INT C SERV OR COMP, P279-
dc.description.citedreferenceSANDHOLM T, 2004, P 2 INT C SERV OR CO-
dc.description.citedreferenceVENUGOPAL S, 2004, P 2 WORKSH MIDDL GRI, V76, P75-
dc.description.citedreferenceWOLSKI R, 2003, GRID COMPUTING MAKIN-
dc.description.citedreferenceBUYYA R, 2001, 10 IEEE INT HET COMP-
dc.description.citedreferenceBUYYA R, 2000, 4 INT C HIGH PERF CO-
dc.description.citedreferenceREGEV O, 1998, P 1 INT C INF COMP E-
dc.description.citedreferenceWALDSPURGER CA, 1992, IEEE T SOFTWARE ENG, V18, P103, DOI 10.1109/32.121753-
dc.description.citedreference*AM, EL COMP CLOUD AM EC2-
dc.description.citedreferenceSCHONFELD E, TECHCRUNCH-
dc.description.tc0-
dc.identifier.wosid000286493200002-
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Industrial Engineering (산업공학과)Journal Papers (저널논문_산업공학과)
Files in This Item:
There are no files associated with this item.
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse