Uses of Class
NetStrategies.QueuePutStrategy

Packages that use QueuePutStrategy

Package	Description
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.
NodeSections	Node sections, the building blocks from which the JSIM simulation engine stations are composed.

Uses of QueuePutStrategy in NetStrategies.QueuePutStrategies

Subclasses of QueuePutStrategy in NetStrategies.QueuePutStrategies

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

Uses of QueuePutStrategy in NodeSections

Constructors in NodeSections with parameters of type QueuePutStrategy

Modifier	Constructor	Description
	PreemptiveServer(Integer numberOfServers, Integer[] numberOfVisits, ServiceStrategy[] serviceStrategies, QueuePutStrategy[] preemptiveStrategies)
	PreemptiveServer(Integer numberOfServers, Integer[] numberOfVisitsPerClass, ServiceStrategy[] serviceStrategies, QueuePutStrategy[] preemptiveStrategies, Integer[] serverNumRequired, String[] serverNames, Integer[] serversPerServerType, Object[] serverCompatibilities, String schedulingPolicy)
	Queue(Integer capacity, String[] dropStrategies, QueueGetStrategy getStrategy, QueuePutStrategy[] putStrategies)
	Queue(Integer capacity, String[] dropStrategies, QueueGetStrategy getStrategy, QueuePutStrategy[] putStrategies, Impatience[] impatienceStrategies)
	Queue(Integer capacity, String[] dropStrategies, QueueGetStrategy getStrategy, QueuePutStrategy[] putStrategies, TransitionMatrix[] enablingConditions, TransitionMatrix[] inhibitingConditions, TransitionMatrix[] resourceConditions)
	Queue(Integer capacity, String[] dropStrategies, ServiceStrategy[] retrialDistributions, QueueGetStrategy getStrategy, QueuePutStrategy[] putStrategies)
	Queue(Integer capacity, String[] dropStrategies, ServiceStrategy[] retrialDistributions, QueueGetStrategy getStrategy, QueuePutStrategy[] putStrategies, Impatience[] impatienceStrategies, Boolean workingAsTransition, TransitionMatrix[] enablingConditions, TransitionMatrix[] inhibitingConditions, TransitionMatrix[] resourceConditions)	Creates a new instance of finite Queue.
	Server(Integer numberOfServers, Integer[] numberOfVisits, ServiceStrategy[] serviceStrategies, QueuePutStrategy[] preemptiveStrategies)
	Server(Integer numberOfServers, Integer[] numberOfVisits, ServiceStrategy[] serviceStrategies, QueuePutStrategy[] preemptiveStrategies, Integer[] serverNumRequired, String[] serverTypesNames, Integer[] serverTypesNumOfServers, Object[] serverTypesCompatibilities, String schedulingPolicy)
	Server(Integer numberOfServers, Integer[] numberOfVisits, ServiceStrategy[] serviceStrategies, QueuePutStrategy[] preemptiveStrategies, Object[] switchoverStrategies, Object[] delayOffStrategies, Object[] setUpStrategies, Integer[] serverNumRequired, String[] serverNames, Integer[] serversPerServerType, Object[] serverCompatibilities, String schedulingPolicy)
	Storage(Integer totalCapacity, Integer[] capacities, String[] dropRules, QueueGetStrategy getStrategy, QueuePutStrategy[] putStrategies)	Creates a new instance of the storage section.