1,137 research outputs found
A Game-theoretic Framework for Revenue Sharing in Edge-Cloud Computing System
We introduce a game-theoretic framework to ex- plore revenue sharing in an
Edge-Cloud computing system, in which computing service providers at the edge
of the Internet (edge providers) and computing service providers at the cloud
(cloud providers) co-exist and collectively provide computing resources to
clients (e.g., end users or applications) at the edge. Different from
traditional cloud computing, the providers in an Edge-Cloud system are
independent and self-interested. To achieve high system-level efficiency, the
manager of the system adopts a task distribution mechanism to maximize the
total revenue received from clients and also adopts a revenue sharing mechanism
to split the received revenue among computing servers (and hence service
providers). Under those system-level mechanisms, service providers attempt to
game with the system in order to maximize their own utilities, by strategically
allocating their resources (e.g., computing servers).
Our framework models the competition among the providers in an Edge-Cloud
system as a non-cooperative game. Our simulations and experiments on an
emulation system have shown the existence of Nash equilibrium in such a game.
We find that revenue sharing mechanisms have a significant impact on the
system-level efficiency at Nash equilibria, and surprisingly the revenue
sharing mechanism based directly on actual contributions can result in
significantly worse system efficiency than Shapley value sharing mechanism and
Ortmann proportional sharing mechanism. Our framework provides an effective
economics approach to understanding and designing efficient Edge-Cloud
computing systems
Collaborative Uploading in Heterogeneous Networks: Optimal and Adaptive Strategies
Collaborative uploading describes a type of crowdsourcing scenario in
networked environments where a device utilizes multiple paths over neighboring
devices to upload content to a centralized processing entity such as a cloud
service. Intermediate devices may aggregate and preprocess this data stream.
Such scenarios arise in the composition and aggregation of information, e.g.,
from smartphones or sensors. We use a queuing theoretic description of the
collaborative uploading scenario, capturing the ability to split data into
chunks that are then transmitted over multiple paths, and finally merged at the
destination. We analyze replication and allocation strategies that control the
mapping of data to paths and provide closed-form expressions that pinpoint the
optimal strategy given a description of the paths' service distributions.
Finally, we provide an online path-aware adaptation of the allocation strategy
that uses statistical inference to sequentially minimize the expected waiting
time for the uploaded data. Numerical results show the effectiveness of the
adaptive approach compared to the proportional allocation and a variant of the
join-the-shortest-queue allocation, especially for bursty path conditions.Comment: 15 pages, 11 figures, extended version of a conference paper accepted
for publication in the Proceedings of the IEEE International Conference on
Computer Communications (INFOCOM), 201
- …