WrrScheduler

Package: inet.queueing.scheduler

WrrScheduler

simple module

This module 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 is no 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.

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

reverseOrder bool false
weights string

Properties

Name Value Description
display i=block/join
class WrrScheduler

Gates

Name Direction Size Description
in [ ] input
out output

Signals

Name Type Unit
packetPulled inet::Packet

Statistics

Name Title Source Record Unit Interpolation Mode
packetLengths packet lengths packetLength(packetPulled) sum, histogram, vector b none
dataRate data rate throughput(packetPulled) vector bps linear
packets packets packetPulled count pk

Direct method calls (observed)

call tofunctioninfo
Pppinet::Ppp::handleCanPullPacketChangedhandleCanPullPacketChanged
DropTailQueueinet::queueing::PacketQueue::pullPacketpullPacket
PacketQueueinet::queueing::PacketQueue::pullPacketpullPacket
PrioritySchedulerinet::queueing::PriorityScheduler::handleCanPullPacketChangedhandleCanPullPacketChanged
ActivePacketSinkinet::queueing::ActivePacketSink::handleCanPullPacketChangedhandleCanPullPacketChanged
PassivePacketSourceinet::queueing::PassivePacketSource::pullPacketpullPacket

Called methods (observed)

functioninfocall from
inet::queueing::WrrScheduler::handleCanPullPacketChangedhandleCanPullPacketChangedDropTailQueue, PacketQueue, PassivePacketSource
inet::queueing::WrrScheduler::pullPacketpullPacketinet.examples.diffserv.onedomain.DSQueue2, PriorityScheduler, ActivePacketSink

Pull in messages (observed)

gatemsgkindctrlsrcModuletags
in[]Packet0DropTailQueueDispatchProtocolInd, InterfaceInd, InterfaceReq, NetworkProtocolInd, PacketProtocolTag, MacAddressInd?
in[]Packet0PacketQueueDispatchProtocolInd, InterfaceInd, InterfaceReq, NetworkProtocolInd, PacketProtocolTag, MacAddressInd?
in[]Packet0PassivePacketSourceDirectionTag, PacketProtocolTag

Pulled out messages (observed)

gatemsgkindctrldestModuletags
outPacket0PppDispatchProtocolInd, InterfaceInd, InterfaceReq, NetworkProtocolInd, PacketProtocolTag, MacAddressInd?
outPacket0PrioritySchedulerDispatchProtocolInd, InterfaceInd, InterfaceReq, NetworkProtocolInd, PacketProtocolTag, MacAddressInd?
outPacket0ActivePacketSinkDirectionTag, PacketProtocolTag

Source code

//
// This module 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 is no 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