MarkovScheduler¶

simple module MarkovScheduler

Implements a packet scheduler using a Markov process that has as many states as input gates the scheduler has. The input gate for the next packet is determined by the current state of the Markov process.

Usage diagram¶

Inheritance diagram¶

Used in compound modules¶

Name	Type	Description
TelnetClientApp	compound module	This client application contains a configurable pre-composed telnet traffic source and traffic sink.
BurstyPacketProducer	compound module	Mixes two different packet sources to generate bursty traffic.

Extends¶

Name	Type	Description
PacketSchedulerBase	simple module	Base module for various packet scheduler modules. Derived modules must implement a single packet scheduler function which determines the index of the input gate for the pulled packet.

Parameters¶

Name	Type	Default value	Description
displayStringTextFormat	string	“classified %p pk (%l)\ncurrent state: %s”	Determines the text that is written on top of the submodule, supports displaying pars, watches, and module-specific information
reverseOrder	bool	false
clockModule	string	“”	Relative path to a module that implements IClock(1,:ref:2 <neddoc-msg-inet-iclock>); optional
initialState	int	0	The starting state of the Markov process
transitionProbabilities	string		The transition matrix (N x N) of the Markov process, specified as a list of probabilities
waitIntervals	string		The amount of time the Markov process stays in a given state, a list of intervals (N) indexed by the state

Properties¶

Name	Value	Description
class	MarkovScheduler
display	i=block/join

Gates¶

Name	Direction	Size	Description
in [ ]	input
out	output

Signals¶

Name	Type	Unit	Description
packetPulled	inet::Packet

Statistics¶

Name	Title	Source	Record	Unit	Interpolation Mode	Description
dataRate	data rate	throughput(packetPulled)	vector	bps	linear	the statistical value is the data rate of the scheduled packets
packetLengths	packet lengths	packetLength(packetPulled)	sum,histogram,vector	b	none	the statistical value is the length of the scheduled packet
packets	packets	packetPulled	count	pk		the statistical value is the scheduled packet

Source code¶

//
// Implements a packet scheduler using a Markov process that has
// as many states as input gates the scheduler has. The input gate for the next
// packet is determined by the current state of the Markov process.
//
simple MarkovScheduler extends PacketSchedulerBase like IPacketScheduler
{
    parameters:
        displayStringTextFormat = default("classified %p pk (%l)\ncurrent state: %s");
        string clockModule = default(""); // Relative path to a module that implements IClock; optional
        int initialState = default(0); // The starting state of the Markov process
        string transitionProbabilities; // The transition matrix (N x N) of the Markov process, specified as a list of probabilities
        string waitIntervals; // The amount of time the Markov process stays in a given state, a list of intervals (N) indexed by the state
        @class(MarkovScheduler);
}

File: src/inet/queueing/scheduler/MarkovScheduler.ned