ikr.simlib.algorithms.queuingDisciplines

Class DeficitRoundRobinFairQueuing

java.lang.Object

ikr.simlib.algorithms.queuingDisciplines.StackableQueuingDiscipline

ikr.simlib.algorithms.queuingDisciplines.FairQueuing

ikr.simlib.algorithms.queuingDisciplines.DeficitRoundRobinFairQueuing

All Implemented Interfaces:

QueuingDiscipline, ReflectionConstructable, ReflectionConstructable2<SimNode,Parameters>

public class DeficitRoundRobinFairQueuing
extends FairQueuing

This class implements a fair queuing on the basis of Virtual Finish Times, and therefore achieves fairness regarding the number of units (e.g. Bytes) transmitted.

Author:

dwagner

Nested Class Summary

Nested classes/interfaces inherited from interface ikr.simlib.algorithms.queuingDisciplines.QueuingDiscipline

QueuingDiscipline.QueueEntry

Field Summary

Fields

Modifier and Type	Field and Description
protected int	activeQIndex
protected java.util.LinkedList<ikr.simlib.algorithms.queuingDisciplines.FairQueuing.SortableQDiscContainer>	activeQs
protected long	deficitIncrement

Fields inherited from class ikr.simlib.algorithms.queuingDisciplines.FairQueuing

activeQ, longestQList, maxSizeInUnits, queues

Fields inherited from class ikr.simlib.algorithms.queuingDisciplines.StackableQueuingDiscipline

lossProbability, numberOfMessages, numberOfUnits, parent, simNode, transferTime, waitingTime

Fields inherited from interface ikr.simlib.parameters.reflection.ReflectionConstructable

CREATE_INSTANCE_METHOD_NAME

Constructor Summary

Constructors

Constructor and Description
DeficitRoundRobinFairQueuing(SimNode ownNode, Parameters pars)

Method Summary

Methods

Modifier and Type	Method and Description
protected boolean	activeQListIsEmpty() update the sortedQList, that defines which Q is dequeued next, and the longestQList, which defines which Q would be dropped from next, if push() makes that necessary
protected void	addToActiveQList(ikr.simlib.algorithms.queuingDisciplines.FairQueuing.SortableQDiscContainer sq)
protected void	advanceActiveQ()
static DeficitRoundRobinFairQueuing	createInstance(SimNode ownNode, Parameters pars) as required by ReflectionConstructable
ikr.simlib.algorithms.queuingDisciplines.FairQueuing.SortableQDiscContainer	createSortableQDisc(StackableQueuingDiscipline q)
protected void	updateActiveQList(ikr.simlib.algorithms.queuingDisciplines.FairQueuing.SortableQDiscContainer sq, double oldPos)
boolean	wouldStore(Message msg) This is just a simplified option to implement the dropping estimation.

Methods inherited from class ikr.simlib.algorithms.queuingDisciplines.FairQueuing

bufferStealing, getMaxSizeInUnits, isEmpty, peek, pop, push, updateLongestQList

Methods inherited from class ikr.simlib.algorithms.queuingDisciplines.StackableQueuingDiscipline

dequeue, dropScheduledNext, enqueue, getCurrentNumberOfMessages, getCurrentNumberOfUnits, getName, getNode, getParent, handleLossMessage, handleMessage, handleRejectedMessage, hasSpaceFor, statsUpdateDequeue, statsUpdateEnqueue, statsUpdateLoss, statsUpdateReject

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

activeQs

protected java.util.LinkedList<ikr.simlib.algorithms.queuingDisciplines.FairQueuing.SortableQDiscContainer> activeQs

activeQIndex

protected int activeQIndex

deficitIncrement

protected final long deficitIncrement

Constructor Detail

DeficitRoundRobinFairQueuing

public DeficitRoundRobinFairQueuing(SimNode ownNode,
                            Parameters pars)

Method Detail

createInstance

public static DeficitRoundRobinFairQueuing createInstance(SimNode ownNode,
                                          Parameters pars)

as required by ReflectionConstructable

wouldStore

public boolean wouldStore(Message msg)

This is just a simplified option to implement the dropping estimation. It just removes one message from all queues longer than the queue the message would be inserted in but in fact, it might be necessary to remove several messages from one of these queues. When overriding it, keep in mind that with a stochastic classifier packets at the head of the queue might belong to a completely different flow

Specified by:

wouldStore in interface QueuingDiscipline

Specified by:

wouldStore in class FairQueuing

Returns:

true if the queue would store the given message. May return false due to a bounded buffer size or a probabilistic decision, for ProbabilisticQeuingDisciplines. For these, two subsequent calls with the same message may return different results!

addToActiveQList

protected void addToActiveQList(ikr.simlib.algorithms.queuingDisciplines.FairQueuing.SortableQDiscContainer sq)

Specified by:

addToActiveQList in class FairQueuing

updateActiveQList

protected void updateActiveQList(ikr.simlib.algorithms.queuingDisciplines.FairQueuing.SortableQDiscContainer sq,
                     double oldPos)

Specified by:

updateActiveQList in class FairQueuing

advanceActiveQ

protected void advanceActiveQ()

Specified by:

advanceActiveQ in class FairQueuing

createSortableQDisc

public ikr.simlib.algorithms.queuingDisciplines.FairQueuing.SortableQDiscContainer createSortableQDisc(StackableQueuingDiscipline q)

Specified by:

createSortableQDisc in class FairQueuing

activeQListIsEmpty

protected boolean activeQListIsEmpty()

Description copied from class: FairQueuing

update the sortedQList, that defines which Q is dequeued next, and the longestQList, which defines which Q would be dropped from next, if push() makes that necessary

Specified by:

activeQListIsEmpty in class FairQueuing