Absolute and Proportional Guarantees in Enhancing Class-Based Service Architectures

Chien Trinh NGUYEN  Shinji SUGAWARA  Tetsuya MIKI  

IEICE TRANSACTIONS on Communications   Vol.E89-B   No.4   pp.1239-1251
Publication Date: 2006/04/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e89-b.4.1239
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
network QoS,  service differentiation,  buffer management,  weighted fair queueing,  traffic prediction,  

Full Text: PDF>>
Buy this Article

Supporting Quality of Service (QoS) over the Internet is a very important issue and many mechanism have been already devised or are under way towards achieving this goal. One of the most important approaches is the class-based architecture, which provides a scalable mechanism for QoS support in a TCP/IP network. Class-based service differentiation can be realized without resource reservation, admission control and traffic policing. However, the resulting services are only relative. While it is, in principle, not feasible to provision for absolute guarantees without admission control and/or traffic policing, such a service can be reasonably well emulated using adaptive rate allocation at the link scheduler of routers. In this paper, we propose mechanism for link scheduler of router that achieve emulated absolute and other relative guarantees using dynamic weighted fair queueing (DWFQ) combining with class packet dropping. The weights of DWFQ are frequently adjusted to current load conditions and based on prediction of realistic class traffic. These mechanisms can realize many approaches to QoS guarantees and class-based differentiation.