Scheduling policies for protocol stacks for user application requirements

Author

Sidou, D. ; Vijayananda, K. ; Berthet, G.

Author_Institution

Inst. Eurocom, Sophia Antipolis, France

fYear

1995

fDate

3-7 Jul 1995

Firstpage

111

Lastpage

115

Abstract

Presents some of the scheduling issues in a communication protocol stack and discusses it with respect to the requirements of the user applications. The authors present the architecture of LITMAP and discuss its salient features from the performance point of view. In particular, the flexible 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 benefits of the FQ discipline. Fair queuing policy provides relatively small delay for short communications and stable overall performance at high loads

Keywords

client-server systems; computer networks; delays; multi-access systems; performance evaluation; protocols; queueing theory; scheduling; FCFS; FQ; LITMAP; delay; fair queuing discipline; first-come first-served discipline; performance; protocol stacks; scheduling policies; user application requirements; Application software; Computer networks; Data engineering; Delay effects; Processor scheduling; Protocols; Robustness; Tires;

fLanguage

English

Publisher

ieee

Conference_Titel

Networks, 1995. Theme: Electrotechnology 2000: Communications and Networks. [in conjunction with the] International Conference on Information Engineering., Proceedings of IEEE Singapore International

Print_ISBN

0-7803-2579-6

Type

conf

DOI

10.1109/SICON.1995.526002

Filename

526002