Fairness in QoS guaranteed networks

Ren Hung Hwang*, Ching Fang Chi

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

14 Scopus citations


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 measure. In this paper, we first propose a fairness measure 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.

Original languageEnglish
Pages (from-to)218-222
Number of pages5
JournalIEEE International Conference on Communications
StatePublished - 2003
Event2003 International Conference on Communications (ICC 2003) - Anchorage, AK, United States
Duration: 11 May 200315 May 2003


  • Fairness
  • QoS
  • Routing


Dive into the research topics of 'Fairness in QoS guaranteed networks'. Together they form a unique fingerprint.

Cite this