Performability of an Algorithm for Connection Admission Control
IEEE Transactions on Computers
| Hi-index | 0.00 |
Connection admission control (CAC) in broadband, ATM-based telecommunication networks is a problem of recognized importance. We consider algorithms for a purpose that accommodate variable bit rate (VBR) connections and are based on effective bandwidth computations. Arriving VBR traffic streams are assumed to be leaky-bucket regulated and are represented by worst-case, periodic, on-off, fluid sources that are randomly phased. Moreover, certain traffic classes may benefit from statistical multiplexing (S-VBR) while others may not (NS-VBR). We then evaluate the ability of such CAC algorithms to perform in the presence of fluctuating channel capacity, where the performability variable Y_T is the fraction of some specified busy period T during which the quality of service requirement is violated. A general base model that supports Y_T is then formulated and instances of the resulting performability model are constructed and solved using UltraSAN.