Relative differentiated services in the Internet: issues and mechanisms
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Adaptive proportional delay differentiated services: characterization and performance evaluation
IEEE/ACM Transactions on Networking (TON)
Proportional differentiated services: delay differentiation and packet scheduling
IEEE/ACM Transactions on Networking (TON)
Distributed Call Admission Control for a Heterogeneous PCS Network
IEEE Transactions on Computers
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
Complete Sharing versus Partitioning: Quality of Service Management for Wireless Multimedia Networks
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Dynamic Class Selection: From Relative Differentiation to Absolute QoS
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Wireless Personal Communications: An International Journal
Adaptive Call Admission Control Based on Enhanced Genetic Algorithm in Wireless/Mobile Network
ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A case for relative differentiated services and the proportional differentiation model
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
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.