Skip to main content
SpringerLink
Log in

Deterministic Time-Varying Packet Fair Queueing for Integrated Services Networks

  • Published:
Journal of VLSI signal processing systems for signal, image and video technology Aims and scope Submit manuscript

Abstract

In integrated services networks, the provision of Quality of Service (QoS) guarantees depends critically upon the scheduling algorithm employed at the network layer. In this work we review fundamental results on scheduling, and we focus on Packet Fair Queueing (PFQ) algorithms, which have been proposed for QoS wireline-wireless networking. The basic notion in PFQ is that the bandwidth allocated to a session is proportional to a positive weight φ i . Because of the fixed weight assignment, the inherent in PFQ delay-bandwidth coupling imposes limitations on the range of QoS that can be supported. We develop PFQ with deterministic time-varying weight assignments, and we propose a low-overhead algorithm capable of supporting arbitrary piecewise linear service curves which achieve delay-bandwidth decoupling. Unlike existing service-curve based algorithms, our time-varying PFQ scheme does not exhibit the punishment phenomenon, and allows sessions to exploit the extra bandwidth in under-loaded networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Chuang and N. Sollenberger, “Beyond 3G: Wideband Wireless Data Access Based on OFDM and Dynamic Packet Assignment,” IEEE Communications Magazine, vol. 7,no. 38, 2000, pp. 78-87.

    Article  Google Scholar 

  2. A.K. Parekh and R.G. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case,” IEEE/ACM Transactions on Networking, vol. 1,no. 3, 1993, pp. 344-357.

    Article  Google Scholar 

  3. A. Stamoulis and G.B. Giannakis, “Packet Fair Queueing Scheduling Based on Multirate Multipath-Transparent CDMA for Wireless Networks,” in Proc. of INFOCOM'2000, Tel Aviv, Israel, March 2000, pp. 1067-1076.

  4. Z.-L. Zhang, D. Towsley, and J. Kurose, “Statistical Analysis of Generalized Processor Sharing Scheduling Discipline,” IEEE Journal on Selected Areas in Communications, vol. 13,no. 6, 1995, pp. 1071-1080.

    Article  Google Scholar 

  5. H. Sariowan, R.L. Cruz, and G.G. Polyzos, “SCED: A Generalized Scheduling Policy for Guaranteeing Quality-of-Service,” IEEE Transactions on Networking, vol. 7,no. 5, 1999, pp. 669-684.

    Article  Google Scholar 

  6. I. Stoica, H. Zhang, and T.S.E. Ng, “A Hiearchical Fair Service Curve Algorithm for Link-Sharing, Real-Time and Priority Services,” in Proc. ACM Sigcomm'97, 1997, pp. 249-262.

  7. W. Willinger, M.S. Taqqu, R. Sherman, and D.V. Wilson, “Self-Similarity Through High-Variability: Statistical Analysis of Ethernet LAN traffic at the Source Level,” IEEE/ACM Transactions on Networking, vol. 5,no. 1, 1997, pp. 71-86.

    Article  Google Scholar 

  8. R.L. Cruz, “A Calculus for Network Delay, Part I: Network Elements in Isolation,” IEEE Transactions on Information Theory, vol. 37,no. 1, 1991, pp. 114-131.

    Article  MathSciNet  MATH  Google Scholar 

  9. D.E. Wrege, E.W. Knightly, H. Zhang, and J. Liebeherr, “Deterministic Delay Bounds for vbr Video in Packet-Switching Networks: Fundamental Limits and Practical Tradeoffs,” IEEE Transactions on Networking, vol. 4, 1996, pp. 352-362.

    Article  Google Scholar 

  10. J.Y. Le Boudec, “Application of Network Calculus to Guaranteed Service Networks,” IEEE Trans. on Information Theory, vol. 44,no. 3, 1998, pp. 1087-1096.

    Article  MathSciNet  MATH  Google Scholar 

  11. http://www.atmforum.com/atmforum/market_awareness/whitepapers/6.html

  12. C.-S. Chang, “On Deterministic Traffic Regulation and Service Guarantees: A Systematic Approach by Filtering,” IEEE Trans. on Information Theory, vol. 44,no. 3, 1998, pp. 1097-1110.

    Article  MATH  Google Scholar 

  13. A. Goldsmith, “Adaptive Modulation and Coding for Fading Channels,” in Proceedings of the 1999 IEEE Information Theory and Communications Workshop, 1999, pp. 24-26.

  14. H. Zhang, “Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks,” Proceedings of the IEEE, vol. 83,no. 10, 1995, pp. 1374-1396.

    Article  Google Scholar 

  15. R. Szabo, P. Barta, J. Biro, F. Nemeth, and C.-G. Perntz, “Non Rate-Proportional Weighting of Generalized Processor Sharing Schedulers,” in Proc. of GLOBECOM, Rio de Janeiro, Brazil, Dec. 1999, pp. 1334-1339.

  16. A. Elwalid and D. Mitra, “Design of Generalized Processor Sharing Schedulers Which Statistically Multiplex Heterogeneous QoS Classes,” in Proc. of INFOCOM'99, Piscataway, NJ, USA, 1999, pp. 1220-1230.

  17. A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queueing Algorithm,” in Proc. ACM Sigcomm'89, 1989, pp. 1-12.

  18. S.J. Golestani, “A Self-Clocked Fair Queueing Scheme for Broadband Applications,” in Proc. IEEE Infocom '94, 1994, pp. 636-646.

  19. P. Goyal, H.M. Vin, and H. Cheng, “Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks,” IEEE Transactions on Networking, vol. 5,no. 5, 1997, pp. 690-704.

    Article  Google Scholar 

  20. D. Saha, S. Mukherjee, and S.K. Tripathi, “Carry-Over Round Robin: A Simple Cell Scheduling Mechanism for ATM Networks,” IEEE Transactions on Networking, vol. 6,no. 6, 1998, pp. 779-796.

    Article  Google Scholar 

  21. S. Shreedhar and G. Varghese, “Efficient Fair Queueing Using Deficit Round Robin,” IEEE Transactions on Networking, vol. 4,no. 3, 1996, pp. 375-385.

    Article  Google Scholar 

  22. D. Stiliadis and A. Varma, “Efficient Fair Queueing Algorithms for Packet Switched Networks,” IEEE Transactions on Networking, vol. 6,no. 2, 1998, pp. 175-185.

    Article  Google Scholar 

  23. L. Georgiadis, R. Guerin, and A. Parekh, “Optimal Multiplexing on a Single Link: Delay and Buffer Requirements,” IEEE Trans. on Information Theory, vol. 43, 1997, pp. 1518-1535.

    Article  MathSciNet  MATH  Google Scholar 

  24. J. Liebeherr, D. Wrege, and D. Ferrari, “Exact Admission Control for Networks with a Bounded Delay Service,” IEEE Transactions on Networking, vol. 4, 1996, pp. 885-901.

    Article  Google Scholar 

  25. L. Georgiadis, R. Guerin, V. Peris, and K.N. Sivarajan, “Efficient Network QoS Provisioning Based on Per Node Traffic Shaping,” IEEE/ACM Transactions on Networking, vol. 4,no. 4, 1996, pp. 482-501.

    Article  Google Scholar 

  26. V. Sivaraman and F. Chiussi, “End-to-End Statistical Delay Guarantees Using Earliest Deadline First (EDF) Packet Scheduling,” in Proc. of GLOBECOM, Rio de Janeiro, Brazil, Dec. 1999, pp. 1307-1312.

  27. C-S. Chang and K.-C. Chen, “Service Curve Proportional Sharing Algorithm for Service-Guaranteed Multiaccess in Integrated-Service Distributed Networks,” in Proc. of GLOBECOM, Rio de Janeiro, Brazil, Dec. 1999, pp. 1340-1344.

  28. H-T Ngin, C-K Tham, and W-S Sho, “Generalized Minimum Queueing Delay: An Adaptive Multi-Rate Service Discipline for ATM Networks,” in Proc. of INFOCOM'99, Piscataway, NJ, USA, 1999, pp. 398-404.

  29. D. Saha, S. Mukherjee, and S.K. Tripathi, “Multirate Scheduling of vbr Video Traffic in ATM Networks,” IEEE Journal on Selected Areas in Communications, vol. 15,no. 6, 1997, pp. 1132-1147.

    Article  Google Scholar 

  30. D. Stiliadis and A. Varma, “Rate-Proportional Servers: A Design Methodology for Fair Queueing Algorithms,” IEEE Transactions on Networking, vol. 6,no. 2, 1998, pp. 164-174.

    Article  Google Scholar 

  31. D. Stiliadis and A. Varma, “Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms,” IEEE Transactions on Networking, vol. 6,no. 5, 1998, pp. 611-624.

    Article  Google Scholar 

  32. DC. Stephens and H. Zhang, “Implementing Distributed Packet Fair Queueing in a Scalable Switch Architecture,” in Proc. of INFOCOM98, 1998, pp. 282-290.

  33. V. Tabatabaee, L. Georgiadis, and L. Tassiulas, “QoS Provisioning and Tracking Fluid Policies in Input Queueing Switches,” in Proc. of INFOCOM'2000, Tel Aviv, Israel, March 2000, vol. 3, pp. 1624-1633.

    Google Scholar 

  34. F.M. Chiussi and A. Francini, “Implementing Fair Queueing in ATM Switches: The Discrete-Rate Approach,” in Proceedings of INFOCOM'98, San Francisco, CA, USA, 1998, vol. 1, pp. 272-281.

    Google Scholar 

  35. Z.-L. Zhang, Z. Duan, and Y.T. Hou, “Virtual Time Reference System: A Unifying Scheduling Framework for Scalable Support of Guaranteed Services,” IEEE Journal on Selected Areas in Communications, vol. 18,no. 12, 2000, pp. 2684-2695.

    Article  Google Scholar 

  36. D.A. Eckhardt and P. Steenkiste, “Effort-Limited Fair (ELF) Scheduling for Wireless Networks,” in Proc. of INFOCOM2000, Tel Aviv, Israel, March 2000, pp. 1097-1106.

  37. S. Lu, V. Bharghavan, and R. Srikant, “Fair Scheduling in Wireless Packet Networks,” IEEE Transactions on Networking, vol. 7,no. 4, 1999, pp. 473-489.

    Article  Google Scholar 

  38. P. Ramanathan and P. Agrawal, “Adapting Packet Fair Queueing Algorithms to Wireless Networks,” in Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom'98), New York, NY, 1998, pp. 1-9.

  39. N. Tse, I. Stoica, and H. Zhang, “Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors,” in Proc. IEEE INFOCOM '98, New York, NY, 1998, vol. 3, pp. 1103-1101.

    Google Scholar 

  40. P. Goyal, A. Greenberg, C.R. Kalmanek, W.T. Marshall, P. Mishra, D. Nortz, and K.K. Ramakrishnan, “Integration of Call Signaling and Resource Management for IP Telephony,” IEEE Network, vol. 13,no. 3, 1999, pp. 24-32.

    Article  Google Scholar 

  41. D.E. Wrege, “Multimedia Networks with Deterministic Quality-of-Service Guarantees,” Ph.D. Thesis, University of Virginia, Aug. 1996.

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Minnesota, 200 Union Street. S.E., Minneapolis, MN, 55455, USA

    Anastasios Stamoulis & Georgios B. Giannakis

Authors
  1. Anastasios Stamoulis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georgios B. Giannakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stamoulis, A., Giannakis, G.B. Deterministic Time-Varying Packet Fair Queueing for Integrated Services Networks. The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology 30, 71–87 (2002). https://doi.org/10.1023/A:1014042708061

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014042708061

Search

Navigation