GF.Queuing

	GF	Queuing	Version:	0.3
	Document type:	Generic Function	Owner:	Mischa Frenk

Description

This Generic Function belongs to Working Area Network. Function to optimise traffic or resource usage based on various queuing policies. Examples of queuing policies can be:

First in first out
This policy states that data elements are processed one at a time and that the data elements that has been waiting the longest is served first.
Last in first out
This policy also serves data elements one at a time, however the data element with the shortest waiting time will be served first.
Resource sharing
Service capacity is shared equally.
Priority
Data elements with an assigned priority that is higher than that of another data element is served first. Priority queues can be of two types, non-pre-emptive (where a job in service cannot be interrupted) and pre-emptive (where a job in service can be interrupted by a higher priority job). No work is lost in either model.
Shortest job first
The next job to be served is the one with the smallest size
Pre-emptive shortest job first
The next job to be served is the one with the original smallest size
Shortest remaining processing time
The next job to serve is the one with the smallest remaining processing requirement.

Icon

The image "Icon" (shown below) can be used to represent this infrastructure function in graphical Pattern representations that it might be part of:

Icon for this function

Generic Patterns using this Generic Function

The following Generic Patterns use this function:

Semantic query

Applied Pattern	Owner	Maturity
Access Distribution	J.A.H. Schoonderbeek	3

Applied versions of this Generic Function

The following variants of this function have been defined: