An Adaptive Virtual Path Allocation Policy for Broadband Networks

We propose a new policy for virtual path bandwidth allocation in
broadband networks. Based on a threshold scheme, our policy handles
the inherent tradeoff between bandwidth utilization and processing
costs. In each virtual path controller the thresholds are chosen so
as to keep bandwidth utilization high, while obtaining a low rate of
processing requests. Two novel ideas are used in our threshold
scheme: {\em adaptivity}, which results in a better prediction of
future bandwidth requirements; and {\em hysteresis}, which prevents
excessive processing of requests due to oscillations around
thresholds. We tested the performance of our new bandwidth control
scheme, and compared it with previously suggested schemes. The
performance measures were the expected amount of unused bandwidth, the
average signaling load and the blocking probability.
Our analysis is based on a {\em time segmentation}
technique, which allows us to reduce a Markov chain with $NM$ states
into $M$ Markov chains with $N$ states and a one-dimensional chain
with $M$ states. Our results show that our policy significantly
improves upon previously suggested approaches.

By: Ariel Orda, Giovanni Pacifici and Dimitrios Pendarakis

Published in: RC20331 in 1996


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.

Questions about this service can be mailed to .