Package: inet.queueing.scheduler
PriorityScheduler
simple moduleThis classifier pops packets from the first non-empty among its connected packet providers.
Inheritance diagram
The following diagram shows inheritance relationships for this type. Unresolved types are missing from the diagram.
Used in compound modules
| Name | Type | Description |
|---|---|---|
| CompoundPendingQueue | compound module | (no description) |
| DiffservQueue | compound module |
This is an example queue, that can be used in interfaces of DS core and edge nodes to support the AFxy (RFC 2597) and EF (RFC 3246) PHBs. |
Extends
| Name | Type | Description |
|---|---|---|
| PacketSchedulerBase | simple module |
This is a 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 popped packet. |
Parameters
| Name | Type | Default value | Description |
|---|---|---|---|
| displayStringTextFormat | string | "scheduled %p pk (%l)" |
determines the text that is written on top of the submodule |
Properties
| Name | Value | Description |
|---|---|---|
| display | i=block/join | |
| class | PriorityScheduler |
Gates
| Name | Direction | Size | Description |
|---|---|---|---|
| in [ ] | input | ||
| out | output |
Signals
| Name | Type | Unit |
|---|---|---|
| packetPopped | inet::Packet |
Statistics
| Name | Title | Source | Record | Unit | Interpolation Mode |
|---|---|---|---|---|---|
| packetPopped | packets popped | count, sum(packetBytes), vector(packetBytes) | none |
Source code
// // This classifier pops packets from the first non-empty among its connected // packet providers. // simple PriorityScheduler extends PacketSchedulerBase like IPacketScheduler { parameters: @class(PriorityScheduler); }File: src/inet/queueing/scheduler/PriorityScheduler.ned