Deterministic Time-Varying Packet Fair Queueing for Integrated Services Networks

  • Authors:

  • Anastasios Stamoulis;Georgios B. Giannakis

  • Affiliations:

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

  • Venue:
  • Journal of VLSI Signal Processing Systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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 &phis;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.