Schedeling policies for protocol stacks for user application requierements

Sidou, Dominique; Vijayananda, Kateel; Berthet, Guy
SICON 1995, ICIE International conference on information engineering, 3-7 July 1995, Singapore

This paper presents some of the scheduling issues in a communication protocol stack and discuss it with respect to the requirements of the user applications. We present the architecture of LITMAP and discusses its salient features from the performance point of view. In particular, the exible scheduling facility provided by LITMAP is presented in detail. Two scheduling policies are considered : First-Come First-Served (FCFS) discipline and Fair Queuing (FQ) discipline. Experimental results show the expected bene ts of the FQ discipline. Fair queuing policy provides relatively small delay for short communications and stable overall performance at high loads.


DOI
Type:
Conférence
City:
Singapore
Date:
1995-07-03
Department:
Sécurité numérique
Eurecom Ref:
80
Copyright:
© 1995 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also:

PERMALINK : https://www.eurecom.fr/publication/80