class <Queue/CBQ/WRR> WRR_CBQueue : public CBQueue


Inheritance:


Public Methods

void addallot(int prio, double diff)
WRR_CBQueue()

Protected Fields

double alloc_[MAXPRIO]
int cnt_[MAXPRIO]
classes at prio of index
double M_[MAXPRIO]

Protected Methods

int command(int argc, const char*const* argv)
Packet* deque()
int insert_class(CBQClass*)
void setM()

Inherited from CBQueue:

Public Fields

Queue/CBQ instvar compat_qlim_

Public Methods

void enque(Packet*)
CBQClass* level(int n)
LinkDelay* link()
Packet* pending_pkt()
void recv(Packet*, Handler*)
void reset()
void sched()
Queue/CBQ instproc set args
int toplevel()
void toplevel_arrival(CBQClass*, double)

Protected Classes

enum eligible_type_

Protected Fields

CBQClass* active_[MAXPRIO]
eligible_type_ eligible_
Event intr_
CBQClass* last_lender_
CBQClass* levels_[MAXLEVEL+1]
LinkDelay* link_
int maxlevel_
int maxpkt_
int maxprio_
Packet* pending_pkt_
int toplevel_

Protected Methods

int algorithm(const char *)
int eligible_ancestors(CBQClass*, double)
int eligible_formal(CBQClass*, double)
int eligible_toplevel(CBQClass* cl, double)
CBQClass* find_lender(CBQClass*, double)
int send_permitted(CBQClass*, double)
void toplevel_departure(CBQClass*, double)

Protected

enum eligible_type_

Inherited from Queue:

Public Methods

QueueElem <T> * dequeue()
virtual void destroy()
void detach(QueueElem<T>* e)
void enqueue(QueueElem<T> *e)
QueueElem <T> * getHead()
int is_empty()
int size()

Protected Fields

QueueElem <T> * head_
int size_

Documentation

WRR_CBQueue()

void addallot(int prio, double diff)

Packet* deque()

int insert_class(CBQClass*)

void setM()

double alloc_[MAXPRIO]

double M_[MAXPRIO]

int cnt_[MAXPRIO]
classes at prio of index

int command(int argc, const char*const* argv)


This class has no child classes.

alphabetic index hierarchy of classes


this page has been generated automatically by doc++

Adapted for the NS documentation page

(c)opyright by Malte Zöckler, Roland Wunderling
contact: doc++@zib.de