Package: inet.tutorials.queueing
MarkovClassifierTutorialStep
network(no description)
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 |
|---|---|---|---|
| producer.displayStringTextFormat | string | "created %p pk (%l)" |
determines the text that is written on top of the submodule |
| producer.packetNameFormat | string | "%a-%c" |
see directives in module documentation |
| producer.packetRepresentation | string | "byteCount" |
determines the chunk of the packet data |
| producer.packetLength | int | ||
| producer.packetData | int | -1 | |
| producer.attachCreationTimeTag | bool | true | |
| producer.attachIdentityTag | bool | true | |
| producer.attachDirectionTag | bool | true | |
| producer.clockModule | string | "" |
relative path of a module that implements IClock(1,2); optional |
| producer.initialProductionOffset | double | 0s | |
| producer.productionInterval | double |
elapsed time between subsequent packets pushed to the connected packet consumer |
|
| producer.scheduleForAbsoluteTime | bool | true |
when a clock is used relative means that setting the clock will not affect the simulation time of the event |
| classifier.displayStringTextFormat | string | "classified %p pk (%l)\ncurrent state: %s" |
determines the text that is written on top of the submodule |
| classifier.reverseOrder | bool | false | |
| classifier.clockModule | string | "" |
relative path of a module that implements IClock(1,2); optional |
| classifier.initialState | int | 0 |
the index of the start state of the Markov process |
| classifier.transitionProbabilities | string |
the transition matrix (N x N) of the Markov process, specified as a list of probabilities |
|
| classifier.waitIntervals | string |
the amount of time the Markov process stays in a given state, a list of intervals (N) indexed by the state |
|
| consumer1.displayStringTextFormat | string | "received %p pk (%l)" |
determines the text that is written on top of the submodule |
| consumer1.clockModule | string | "" |
relative path of a module that implements IClock(1,2); optional |
| consumer1.consumptionInterval | double | 0s |
elapsed time between subsequent packets allowed to be pushed by the connected packet producer, 0 means any number of packets can be pushed at the same simulation time |
| consumer1.scheduleForAbsoluteTime | bool | true |
when a clock is used relative means that setting the clock will not affect the simulation time of the event |
| consumer2.displayStringTextFormat | string | "received %p pk (%l)" |
determines the text that is written on top of the submodule |
| consumer2.clockModule | string | "" |
relative path of a module that implements IClock(1,2); optional |
| consumer2.consumptionInterval | double | 0s |
elapsed time between subsequent packets allowed to be pushed by the connected packet producer, 0 means any number of packets can be pushed at the same simulation time |
| consumer2.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 MarkovClassifierTutorialStep { @display("bgb=600,300"); submodules: producer: ActivePacketSource { @display("p=100,100"); } classifier: MarkovClassifier { @display("p=300,100"); } consumer1: PassivePacketSink { @display("p=500,100"); } consumer2: PassivePacketSink { @display("p=500,200"); } connections allowunconnected: producer.out --> classifier.in; classifier.out++ --> consumer1.in; classifier.out++ --> consumer2.in; } //-------------------------------------------------File: tutorials/queueing/QueueingTutorial.ned