M. Selvara j, G.Y. Lazarou, and R. Hu


  1. [1] C. Dovrolis, D. Stiliadis, & P. Ramanathan, Proportional differ-entiated services: Delay differentiation and packet scheduling,IEEE/ACM Transactions on Networking, 10 (1), 2002, 12–26. doi:10.1109/90.986503
  2. [2] M. Leung, J. Lui, & D. Yau, Adaptive proportional delay dif-ferentiated services: Characterization and performance evalu-ation, IEEE Transactions on Networking, 9 (6), 2001, 801–817. doi:10.1109/90.974533
  3. [3] L. Essafi, G. Bolch, & A. Andres, An adaptive waiting timepriority scheduler for the proportional differentiation model,Proc. ASTC High-Performance Computing Symposium, Seat-tle, WA, 2001, 322–330.
  4. [4] M. Markaki, M. Saltouros, & I. Venieris, Proportional packetloss differentiation and buffer management for differentiatedservices in the Internet, Proc. 25th Annual IEEE Conferenceon Local Computer Networks, Tampa, FL, 2000, 306–313. doi:10.1109/LCN.2000.891061
  5. [5] V. Jacobson & S. Floyd, Random early detection gateways forcongestion avoidance, IEEE/ACM Transactions on Network-ing, 1 (4), 1993, 397–413. doi:10.1109/90.251892
  6. [6] T. Soetens, S.D. Cnodder, & O. Elloumi, A relative bandwidthdifferentiated service for the TCP micro-flows, Proc. FirstIEEE/ACM Int. Symp. on Cluster Computing and the Grid,Brisbane, Qld., Australia, 2001, 602–609.
  7. [7] G. Ruzzo & N. Chiminelli, WRED tuning for bottlenecklink [Online], Available:, 2000.
  8. [8] W. Yi, R. Makkar, I. Lambadaris, & I. Marmorkos, Gatewayalgorithm for fair bandwidth sharing, Proc. IEEE Intl. Conf.on Communications, Paris, France, 2004, 1141–1145.
  9. [9] D. Clark & W. Fang, Explicit allocation of best-effort packetdelivery service, IEEE/ACM Transactions on Networking,6 (4), 1998, 362–373. doi:10.1109/90.720870
  10. [10] J. Heinanen, F. Baker, W. Weiss, & J. Wroclawski, Assuredforwarding PHB group, Request for Comment – RFC 2597,1999.
  11. [11] UCB/LBNL/VINT, Ns-2 Network Simulator [Online], Avail-able:, 2002.
  12. [12] R. Jain, The Art of Computer Systems Performance Analysis(New York: John Wiley and Sons, 1991).AppendixFairness index was calculated using the following formulaas given in [12]:Fairness index FI =[ixi]2N ·xi2(6)115where fairness index ranges between 0 and 1 and xi is themean throughput of traffic source i, and N is the totalnumber of sources under consideration. The closer thefairness index to 1, the fairer is the bandwidth distributionbetween sources.

Important Links:

Go Back