Package NetStrategies.QueuePutStrategies

package NetStrategies.QueuePutStrategies

Queue insertion strategies that select the position in the queue where an arriving job is placed, implementing queueing disciplines such as FCFS and priority-based placement.

Related Packages

Package	Description
NetStrategies	Strategy interfaces and base classes used by the JSIM simulation engine to implement the behaviour of the network elements.

Class	Description
EDDStrategy	Earliest Due Date queue insertion strategy: the job with the earliest due date is placed ahead of the others.
EDDStrategyPriority	Earliest Due Date queue insertion strategy with priorities.
EDFStrategy	Earliest Deadline First queue insertion strategy, preemptive variant of the earliest due date discipline.
EDFStrategyPriority	Earliest Deadline First queue insertion strategy with priorities.
FCFSPRStrategy	This class implements a specific preemptive strategy: all arriving jobs are put to the queue in a First-Come-First-Served manner.
FCFSPRStrategyPriority	This class implements a specific preemptive strategy: all arriving jobs are ordered according to their priorities.
HeadStrategy	This class implements a specific queue put strategy: all arriving jobs are put at the head of the queue.
HeadStrategyPriority	This class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.
LCFSPRStrategy	This class implements a specific preemptive strategy: all arriving jobs are put to the queue in a Last-Come-First-Served manner.
LCFSPRStrategyPriority	This class implements a specific preemptive strategy: all arriving jobs are ordered according to their priorities.
LEPTStrategy	This class implements a specific queue put strategy: all arriving jobs are put to the queue in a Longest-Expected-Processing-Time manner.
LEPTStrategyPriority	This class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.
LJFStrategy	This class implements a specific queue put strategy: all arriving jobs are put to the queue in a Longest-Job-First manner.
LJFStrategyPriority	This class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.
PreemptiveStrategy	To be implemented by preemptive strategies
RandStrategy	This class implements a specific queue put strategy: all arriving jobs are put at random positions of the queue.
RandStrategyPriority	This class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.
SEPTStrategy	This class implements a specific queue put strategy: all arriving jobs are put to the queue in a Shortest-Expected-Processing-Time manner.
SEPTStrategyPriority	This class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.
SJFStrategy	This class implements a specific queue put strategy: all arriving jobs are put to the queue in a Shortest-Job-First manner.
SJFStrategyPriority	This class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.
SRPTStrategy	This class implements a specific preemptive strategy: all arriving jobs are put to the queue in a Shortest-Remaining-Processing-Time manner.
SRPTStrategyPriority	This class implements a specific preemptive strategy: all arriving jobs are ordered according to their priorities.
TailStrategy	This class implements a specific queue put strategy: all arriving jobs are put at the tail of the queue.
TailStrategyPriority	This class implements a specific queue put strategy: all arriving jobs are ordered according to their priorities.
TBSStrategyPriority	This is an adaptation of the Total Bandwidth Server scheduling algorithm.