Distributed Workload Dispatching Algorithms for Mobile Cloud Computing
Date Issued
2016
Date
2016
Author(s)
Chao, Shou-Hao
Abstract
With the improvement of mobile computing devices and cloud computing technologies, a variety of mobile computing applications enrich our lives. In the meanwhile, we found the computation requirement of the mobile application become more and more complex. However, based on physical limitations, a mobile device can not consummatly process some resource-intensive and time-intensive mobile applications. A concept has been applied to improve the computation capbilities by moving the resource-intensive task to a more powerful remote computation devices. In this thesis, we adopt a framework which can federate our mobile devices and the computation resource of the idle device which around us. Moreover, the framework can decreace the network latency in chorus. We can still complete a complicated task even if we lose the connection with the cloud. In addition, we propose the dispatching game problem in this thesis. We combine the game theory model and user mobility. We can achive the maximum utilization of the whole system and respose time promising. We also show how a Nash equilibrum always exsit with the condition which the system has the utilization bound.
Subjects
Mobile Computing
Decentralized Dispatching
Game theory
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-105-R03922076-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):ff507136a23f0374126888b4644dcc9b