Please use this identifier to cite or link to this item:
https://idr.l1.nitk.ac.in/jspui/handle/123456789/14929
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chakma A. | |
dc.contributor.author | Kumar S. | |
dc.contributor.author | Mahato P.K. | |
dc.contributor.author | Satpathy A. | |
dc.contributor.author | Addya S.K. | |
dc.date.accessioned | 2021-05-05T10:16:01Z | - |
dc.date.available | 2021-05-05T10:16:01Z | - |
dc.date.issued | 2021 | |
dc.identifier.citation | 2021 International Conference on COMmunication Systems and NETworkS, COMSNETS 2021 , Vol. , , p. 127 - 130 | en_US |
dc.identifier.uri | https://doi.org/10.1109/COMSNETS51098.2021.9352821 | |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/14929 | - |
dc.description.abstract | The modern applications execute in the cloud via independent executable entities called virtual machines (VMs). In a typical multi-SP market with variable pricing and heterogeneous resource demands of VMs, resource allocation/placement is particularly challenging. To maximize the social welfare of the multi-SP markets, in this paper, we propose a resource allocation technique called MatchCloud formulated as a one-to-many matching game. Owing to the in-applicability of the classical deferred acceptance algorithm (DAA) due to size heterogeneity, we adopt a modified version of the algorithm. Moreover, preference generation is crucial for matching markets. Hence, we also present a simple yet efficient technique to assign preferences to two different stakeholders, i.e., VMs and SPs. Simulation results show that VM proposing RDA performs better compared to when SPs propose. © 2021 IEEE. | en_US |
dc.title | MatchCloud: Service Matching for Multi Cloud Marketplace | en_US |
dc.type | Conference Paper | en_US |
Appears in Collections: | 2. Conference Papers |
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.