On the implementation of weighted fair queuing in high speed networks

The fluid generalized processor sharing (GPS) algorithm has desirable properties for integrated services networks and many weighted fair queuing (WFQ) algorithms have been proposed to approximate the GPS. The implementation of WFQ algorithms using calendars (i.e. WFQ calendar) has been proved to be...

Full description

Saved in:
Bibliographic Details
Main Authors: Lu, J., Robotham, R.
Format: Conference Proceeding
Language:English
Subjects:
Bandwidth
Calendars
Global Positioning System
High-speed networks
Intelligent networks
Intserv networks
Processor scheduling
Robots
Switches
Technological innovation
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The fluid generalized processor sharing (GPS) algorithm has desirable properties for integrated services networks and many weighted fair queuing (WFQ) algorithms have been proposed to approximate the GPS. The implementation of WFQ algorithms using calendars (i.e. WFQ calendar) has been proved to be a practical way to realize the WFQ scheduler which supports a large number of queues with diverse rate requirements and at the same time maintains all the important properties of the GPS. However, a WFQ calendar will introduce errors due to the granularity of a calendar and the implementation methods and limitations. What the impacts of the errors are and how to design a WFQ calendar to meet the traffic management requirements become very important in the WFQ calendar design. But there have not been any discussion on this topic. In this paper, a WFQ calendar is modelled, and the implementation errors of WFQ calendars are discovered and analyzed. In addition, the impacts of the errors are discussed, and a few ways to reduce the errors are given.
ISSN:0840-7789
2576-7046
DOI:10.1109/CCECE.2004.1345237