Hierarchical Virtual Partitioning - Algorithms For Virtual Private Networking
Published 1997 · Engineering, Computer Science
This paper discusses the hierarchical virtual partitioning (HVP) concept, which facilitates the sharing of a resource, such as a link, by multiple customers, each having various service classes. Calls of each service class have distinctive bandwidth requirements, arrival rates, and mean holding times, and quality of service (QoS) is in terms of call blocking probabilities. The algorithms devised provide for the desired mix of fairness, robustness, and multiplexing efficiency at each of two levels — namely, at the customer level and at the level of the various services of each customer. The HVP scheme relies on nominal allocations of capacities to each customer and service, as well as priorities in the call admission process implemented by dynamic trunk reservations. The paper gives an approximate method of analysis based on fixed-point equations. In addition, a reward/penalty paradigm is devised to reflect the issues in virtual private networking, and the performance of our algorithms is compared to the optimal solution. The results show that the HVP scheme is fair, efficient, and robust.