Effects of Bandwidth Sharing on Optimal Complete Partitioning Policy

摘要

A capacitated loss network sometimes deals with contiguous traffic with different bandwidth demands and reward rates. Given the limited overall bandwidth capacity, under the constraint that each traffic demand must be assigned in a contiguous position, it is essential that a good admission control and packing scheduler seeks to maximize the long-term average revenue. Previously, Optimal-Complete-Partitioning (OCP) policy has been shown to have a performance very close to the optimal under several traffic patterns [1]. However, it is not clear whether certain level of sharing introduced to the generic strict-partitioning OCP could further improve the performance. In this paper, we investigate this issue by introducing a conservative level of sharing into OCP, such that those sharing would have least adverse impact on the overall partitioning policy; therefore, we are able to examine whether the introduction of certain level of sharing could possibly further improve the performance of OCP. The results show that OCP performs well (especially considering its simplicity in implementation), however, additional level of sharing could potentially improve network performance significantly if the prediction of the traffic parameters is not correct.