DPoS: Decentralized, Privacy-Preserving, and Low-Complexity Online Slicing for Multi-Tenant Networks

by   Hailiang Zhao, et al.

Network slicing is the key to enable virtualized resource sharing among vertical industries in the era of 5G communication. Efficient resource allocation is of vital importance to realize network slicing in real-world business scenarios. To deal with the high algorithm complexity, privacy leakage, and unrealistic offline setting of current network slicing algorithms, in this paper we propose a fully decentralized and low-complexity online algorithm, DPoS, for multi-resource slicing. We first formulate the problem as a global social welfare maximization problem. Next, we design the online algorithm DPoS based on the primal-dual approach and posted price mechanism. In DPoS, each tenant is incentivized to make its own decision based on its true preferences without disclosing any private information to the mobile virtual network operator and other tenants. We provide a rigorous theoretical analysis to show that DPoS has the optimal competitive ratio when the cost function of each resource is linear. Extensive simulation experiments are conducted to evaluate the performance of DPoS. The results show that DPoS can not only achieve close-to-offline-optimal performance, but also have low algorithmic overheads.


page 9

page 10

page 13


Function Design for Improved Competitive Ratio in Online Resource Allocation with Procurement Costs

We study the problem of online resource allocation, where multiple custo...

Competitive Online Algorithms for Resource Allocation over the Positive Semidefinite Cone

We consider a new and general online resource allocation problem, where ...

Online Resource Allocation with Buyback: Optimal Algorithms via Primal-Dual

Motivated by applications in cloud computing spot markets and selling ba...

Fisher Market Model based Resource Allocation for 5G Network Slicing

Network slicing (NS) is a key technology in 5G networks that enables the...

Stochastic Averaging for Constrained Optimization with Application to Online Resource Allocation

Existing approaches to resource allocation for nowadays stochastic netwo...

Low-Complexity Distributed Radio Access Network Slicing: Algorithms and Experimental Results

Radio access network (RAN) slicing is an effective methodology to dynami...

A Privacy-preserving Method to Optimize Distributed Resource Allocation

We consider a resource allocation problem involving a large number of ag...

Please sign up or login with your details

Forgot password? Click here to reset