A Study of Fairness Problem in QoS Guaranteed Networks

• Main Authors: Ching-Fang Chi, 紀靜芳
• Other Authors: Ren-Hung Hwang
• Format: Others
• Language: en_US
• Published: 2001
• Online Access: http://ndltd.ncl.edu.tw/handle/59532256157850488718

碩士 === 國立中正大學 === 資訊工程研究所 === 89 === The Internet Protocol, based on packet switching technique, provides an efficient sharing of network bandwidth, which is especially effective for bursty data sources. However, fairness is always an important issue when resources are shared among users. For networks with quality of service, 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 measure in networks that provide bandwidth guarantee. In this thesis, we first propose a fairness measure based on the blocking probability. We then propose four admission control schemes that try to improve fairness while maintaining high network throughput. Analytical models are proposed for some of these schemes. Numerical results show that LA, BB, TR, and TRP policies yield good fairness with only slightly degradation in network throughput.