Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/12532
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAgarwal, Ankit-
dc.date.accessioned2014-12-01T08:18:01Z-
dc.date.available2014-12-01T08:18:01Z-
dc.date.issued2012-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/12532-
dc.guideMisra, Manoj-
dc.description.abstractCloud computing is an emerging model of business computing. Cloud computing is the long dreamed vision of computing as a utility, where data owners can remotely store their data in the cloud to enjoy on-demand high-quality applications and services from a shared pool of configurable computing resources. As the cost of energy is increasing day by day, there is a need to shift to energy saving mechanism. In Cloud computing there are large number of host and different virtual machines running on them. In this dissertation, the concept of migration of virtual machines is studied. The different migration policies of the virtual machines and factors on which they depend are studied. The migration policy depends on two threshold values. The dynamic evaluation of these thresholds is suggested and a different migration policy is suggested. The performance evaluation is done on the basis of migration count of the virtual machines. Finally the thesis is concluded by pointing out future perspective of the migration policies and how can they be used in the real time environmenten_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectVIRTUAL MACHINEen_US
dc.subjectTHRESHOLD FOR CLOUDSen_US
dc.subjectMIGRATIONen_US
dc.titleA NEW VIRTUAL MACHINE MIGRATION POLICY USING DYNAMIC THRESHOLD FOR CLOUDSen_US
dc.typeM.Tech Dessertationen_US
dc.accession.numberG21467en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECDG21467.pdf2.3 MBAdobe PDFView/Open


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