WrrScheduler

Package: inet.queueing.scheduler

WrrScheduler

simple module

C++ definition

Implements weighted round-robin scheduling.

There is a weight associated with each input gate. Initially, each input gate gets as many tokens as their weight. When a packet is requested, then the first input gate is selected that has a packet and enough tokens, and one token is consumed. When there are waiting input packets, but there are not enough tokens to schedule one, then each token bucket is filled up.

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
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.

DSQueue1 compound module

Diffserv Queue used in Experiment 1.1 - 1.6 and 5.1.

DSQueue2 compound module

Diffserv Queue used in Experiment 2.1 - 2.4.

Used in

Name Type Description
WrrSchedulerTutorialStep network (no description)

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 "scheduled %p pk (%l)"

Determines the text that is written on top of the submodule, supports displaying pars, watches, and module-specific information

reverseOrder bool false
weights string

Properties

Name Value Description
class WrrScheduler
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
packetLengths packet lengths packetLength(packetPulled) sum, histogram, vector b none

the statistical value is the length of the scheduled packet

dataRate data rate throughput(packetPulled) vector bps linear

the statistical value is the data rate of the scheduled packets

packets packets packetPulled count pk

the statistical value is the scheduled packet

Source code

//
// Implements weighted round-robin scheduling.
//
// There is a weight associated with each input gate.
// Initially, each input gate gets as many tokens as their
// weight. When a packet is requested, then the first input
// gate is selected that has a packet and enough tokens,
// and one token is consumed. When there are waiting input
// packets, but there are not enough tokens to schedule one,
// then each token bucket is filled up.
//
simple WrrScheduler extends PacketSchedulerBase like IPacketScheduler
{
    parameters:
        string weights;
        @class(WrrScheduler);
}

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