MarkovSchedulerTutorialStep

Package: inet.tutorials.queueing

MarkovSchedulerTutorialStep

network

(no description)

PassivePacketSource PassivePacketSource MarkovScheduler ActivePacketSink

Usage diagram

The following diagram shows usage relationships between types. Unresolved types are missing from the diagram.

Properties

Name Value Description
isNetwork
display bgb=600,300

Unassigned submodule parameters

Name Type Default value Description
provider1.displayStringTextFormat string "created %p pk (%l)"

determines the text that is written on top of the submodule

provider1.packetNameFormat string "%a-%c"

see directives in module documentation

provider1.packetRepresentation string "byteCount"

determines the chunk of the packet data

provider1.packetLength int
provider1.packetData int -1
provider1.attachCreationTimeTag bool true
provider1.attachIdentityTag bool true
provider1.attachDirectionTag bool true
provider1.clockModule string ""

relative path of a module that implements IClock(1,2); optional

provider1.providingInterval double 0s

elapsed time between subsequent packets allowed to be pulled by the connected packet collector, 0 means any number of packets can be pulled at the same simulation time

provider1.scheduleForAbsoluteTime bool true

when a clock is used relative means that setting the clock will not affect the simulation time of the event

provider2.displayStringTextFormat string "created %p pk (%l)"

determines the text that is written on top of the submodule

provider2.packetNameFormat string "%a-%c"

see directives in module documentation

provider2.packetRepresentation string "byteCount"

determines the chunk of the packet data

provider2.packetLength int
provider2.packetData int -1
provider2.attachCreationTimeTag bool true
provider2.attachIdentityTag bool true
provider2.attachDirectionTag bool true
provider2.clockModule string ""

relative path of a module that implements IClock(1,2); optional

provider2.providingInterval double 0s

elapsed time between subsequent packets allowed to be pulled by the connected packet collector, 0 means any number of packets can be pulled at the same simulation time

provider2.scheduleForAbsoluteTime bool true

when a clock is used relative means that setting the clock will not affect the simulation time of the event

scheduler.displayStringTextFormat string "classified %p pk (%l)\ncurrent state: %s"

determines the text that is written on top of the submodule

scheduler.reverseOrder bool false
scheduler.clockModule string ""

relative path of a module that implements IClock(1,2); optional

scheduler.initialState int 0

the start state of the Markov process

scheduler.transitionProbabilities string

the transition matrix (N x N) of the Markov process, specified as a list of probabilities

scheduler.waitIntervals string

the amount of time the Markov process stays in a given state, a list of intervals (N) indexed by the state

collector.displayStringTextFormat string "received %p pk (%l)"

determines the text that is written on top of the submodule

collector.clockModule string ""

relative path of a module that implements IClock(1,2); optional

collector.initialCollectionOffset double 0s
collector.collectionInterval double

elapsed time between subsequent packets pulled from the connected packet provider

collector.scheduleForAbsoluteTime bool true

when a clock is used relative means that setting the clock will not affect the simulation time of the event

Source code

network MarkovSchedulerTutorialStep
{
    @display("bgb=600,300");
    submodules:
        provider1: PassivePacketSource {
            @display("p=100,100");
        }
        provider2: PassivePacketSource {
            @display("p=100,200");
        }
        scheduler: MarkovScheduler {
            @display("p=300,100");
        }
        collector: ActivePacketSink {
            @display("p=500,100");
        }
    connections allowunconnected:
        provider1.out --> scheduler.in++;
        provider2.out --> scheduler.in++;
        scheduler.out --> collector.in;
}

//-------------------------------------------------

File: tutorials/queueing/QueueingTutorial.ned