Fairness in QoS guaranteed networks

The Internet protocol, based on packet switching technique, provides an efficient sharing of network bandwidth. However, fairness is always an important issue when resources are shared among users. For networks with quality of service guarantee, the fairness criteria will be different from that of best effort networks. In particular, due to bandwidth reservation and call admission control, connection´s blocking probability becomes a more important fairness measures based on the blocking probability. We then propose three admission control schemes that try to improve fairness while maintaining high network throughput and revenue. The proposed schemes are evaluated via simulations as well as analytical models. Our numerical results show that the proposed schemes yield good fairness with only slightly degradation in network throughput and revenue.