Scheduling policies for protocol stacks for user application requirements

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