Sharing within limits: Partial resource pooling in loss systems

by   Anvitha Nandigam, et al.

Fragmentation of expensive resources, e.g., spectrum for wireless services, between providers can introduce inefficiencies in resource utilisation and worsen overall system performance. In such cases, resource pooling between independent service providers can be used to improve performance. However, for providers to agree to pool their resources, the arrangement has to be mutually beneficial. The traditional notion of resource pooling, which implies complete sharing, need not have this property. For example, under full pooling, one of the providers may be worse off and hence have no incentive to participate. In this paper, we propose partial resource sharing models as a generalization of full pooling, which can be configured to be beneficial to all participants. We formally define and analyze two partial sharing models between two service providers, each of which is an Erlang-B loss system with the blocking probabilities as the performance measure. We show that there always exist partial sharing configurations that are beneficial to both providers, irrespective of the load and the number of circuits of each of the providers. A key result is that the Pareto frontier has at least one of the providers sharing all its resources with the other. Furthermore, full pooling may not lie inside this Pareto set. The choice of the sharing configurations within the Pareto set is formalized based on bargaining theory. Finally, large system approximations of the blocking probabilities in the quality-efficiency-driven regime are presented.


page 1

page 2

page 3

page 4


Partial Server Pooling in Redundancy Systems

Partial sharing allows providers to possibly pool a fraction of their re...

Let's Share: A Game-Theoretic Framework for Resource Sharing in Mobile Edge Clouds

Mobile edge computing seeks to provide resources to different delay-sens...

On the ubiquity of duopolies in constant sum congestion games

We analyse a coalition formation game between strategic service provider...

Coalition Formation in Constant Sum Queueing Games

We analyse a coalition formation game between strategic service provider...

Resource Sharing in the Edge: A Distributed Bargaining-Theoretic Approach

The growing demand for edge computing resources, particularly due to inc...

SQLR: Short Term Memory Q-Learning for Elastic Provisioning

As more and more application providers transition to the cloud and deliv...

Poly-Symmetry in Processor-Sharing Systems

We consider a system of processor-sharing queues with state-dependent se...

Please sign up or login with your details

Forgot password? Click here to reset