About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ICIS 2009
Conference paper
Proportional fairness of call blocking probability
Abstract
To guarantee proportional fairness (PF) is an important way to realize predictable and controllable service differentiation. In this paper, a proportional differentiation call admission control (CAC) algorithm, named PBS-PF, is proposed to guarantee the network services' PF in terms of call blocking probability (CBP). PBS-PF is based on the partial bandwidth sharing CAC scheme due to this scheme's high bandwidth utilization rate. PBS-PF dynamically calculates the bandwidth admission threshold of each service class to control the blocking call number for guaranteeing the CBP ratio of high and low priority services to accord with a given value. The simulations show that the CBP of each service class changes with the network load, but their ratio approximately keeps unchanged, which proves the effectiveness of PBS-PF. At last, we analyze the time complexity of PBS-PF. Copyright © 2009 ACM.