This module implements a priority queue with multiple inner queues and an optional shared memory buffer.

Usage diagram

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

Inheritance diagram

The following diagram shows inheritance relationships for this type. Unresolved types are missing from the diagram.

Extends

Name	Type	Description
CompoundPacketQueue	compound module	This compound module serves as a base module for complex packet queues formed by combining several queueing components.

Parameters

Name	Type	Default value	Description
displayStringTextFormat	string	"contains %p pk (%l) pushed %u created %c\n popped %o removed %r dropped %d"	determines display string text above the submodule
packetCapacity	int	-1	maximum number of packets in the queue, no limit by default
dataCapacity	int	-1b	maximum total length of packets in the queue, no limit by default
numQueues	int

Properties

Name	Value	Description
display	i=block/queue
class	CompoundPacketQueue

Gates

Name	Direction	Size	Description
in	input
out	output

Signals

Name	Type	Unit
packetRemoved	inet::Packet
packetPushed	inet::Packet
packetDropped	inet::Packet
packetPopped	inet::Packet

Statistics

Name	Title	Source	Record	Unit	Interpolation Mode
packetRemoved	packets removed	localSignal(packetRemoved)	count, sum(packetBytes), vector(packetBytes)		none
queueLength	queue length	count(localSignal(packetPushed)) - count(localSignal(packetPopped)) - count(localSignal(packetRemoved)) - count(packetDropped)	max, timeavg, vector		sample-hold
queueingTime	queueing times	queueingTime(packetPopped)	histogram, vector	s	none
packetPushed	packets pushed	localSignal(packetPushed)	count, sum(packetBytes), vector(packetBytes)		none
packetDropQueueOverflow	packets dropped: queue overflow	packetDropReasonIsQueueOverflow(packetDropped)	count, sum(packetBytes), vector(packetBytes)		none
packetPopped	packets popped	localSignal(packetPopped)	count, sum(packetBytes), vector(packetBytes)		none

Source code

//
// This module implements a priority queue with multiple inner queues and an
// optional shared memory buffer.
//
module PriorityQueue extends CompoundPacketQueue
{
    parameters:
        int numQueues;
    submodules:
        buffer: <default("PriorityBuffer")> like IPacketBuffer if typename != "" {
            parameters:
                @display("p=100,225");
        }
        classifier: <default("PacketClassifier")> like IPacketClassifier {
            parameters:
                @display("p=100,100");
        }
        queue[numQueues]: <default("PacketQueue")> like IPacketQueue {
            parameters:
                bufferModule = default(exists(buffer) ? "^.buffer" : "");
                @display("p=325,100,column,125");
        }
        scheduler: <default("PriorityScheduler")> like IPacketScheduler {
            parameters:
                @display("p=550,100");
        }
    connections:
        in --> { @display("m=w"); } --> classifier.in;
        for i=0..sizeof(queue)-1 {
            classifier.out++ --> queue[i].in;
            queue[i].out --> scheduler.in++;
        }
        scheduler.out --> { @display("m=e"); } --> out;
}

File: src/inet/queueing/queue/PriorityQueue.ned

---

This documentation is released under the Creative Commons license