  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.
