Share Email Print

Proceedings Paper

Scheduling mechanisms and admission control policies for DQPB and ATM
Author(s): Kris Steenhaut; Kurt Degieter; Wouter Brissinck
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Scheduling mechanisms and admission policies play an important role in optimizing resource allocation in networks offering integrated services. The scheduler mediates the low-level contention for service between cells of different classes, while admission control regulates the acceptance or blocking of incoming traffic on a connection-by-connection basis. These two levels of control are of course closely related in the sense that if too much traffic is allowed to enter the network by an overly lax admission control policy, then no scheduler will be able to provide the requested Quality of Service (QoS) for all traffic classes. A functioning admission control is a prerequisite for any guarantee of cell-level QoS while its merit is to guarantee QoS efficiently and fairly. We focus on a DQDB and an ATM switch to demonstrate these principles.

Paper Details

Date Published: 17 February 1995
PDF: 12 pages
Proc. SPIE 2450, Broadband Networks: Strategies and Technologies, (17 February 1995); doi: 10.1117/12.201274
Show Author Affiliations
Kris Steenhaut, Vrije Univ. Brussels (Belgium)
Kurt Degieter, Vrije Univ. Brussels (Belgium)
Wouter Brissinck, Vrije Univ. Brussels (Belgium)

Published in SPIE Proceedings Vol. 2450:
Broadband Networks: Strategies and Technologies
Robert A. Cryan; P. Nalinaj Fernando; Pierpaolo Ghiggino; John M. Senior, Editor(s)

© SPIE. Terms of Use
Back to Top