完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLin, Ming-Yien_US
dc.contributor.authorYen, Li-Hsingen_US
dc.contributor.authorBaghban, Hojjaten_US
dc.date.accessioned2020-05-05T00:01:55Z-
dc.date.available2020-05-05T00:01:55Z-
dc.date.issued2019-01-01en_US
dc.identifier.isbn978-1-5386-7646-2en_US
dc.identifier.issn1525-3511en_US
dc.identifier.urihttp://hdl.handle.net/11536/153987-
dc.description.abstractMulti-access edge computing (MEC) system consisting of geographically-distributed heterogeneous servers can provide low-latency virtualized resource to support computation offloading of smart devices. When bulk offloading requests comes to an MEC system, how to dispatch requests to servers so as to maximize divergent objectives of MEC service providers and users is challenging. The problem further involves money transfer when different MEC service providers can share resource to each other. In this paper, we address request dispatch issues in a standalone MEC and among federated MEC systems using matching game theory. We have adapted several classical matching algorithms to our problem. Simulation results show that we can serve more requests while still meeting latency constraints. For federated MEC systems, we can also have high revenue.en_US
dc.language.isoen_USen_US
dc.subjectResource Allocationen_US
dc.subjectEdge Computingen_US
dc.subjectMatching Theoryen_US
dc.titleResource Request Dispatch in Standalone and Federated MEC Systems: A Matching Game Approachen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2019 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC)en_US
dc.citation.spage0en_US
dc.citation.epage0en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000519086302142en_US
dc.citation.woscount0en_US
顯示於類別:會議論文