dsREDQueue Class Reference

#include <dsred.h>

Inheritance diagram for dsREDQueue:

[legend]Collaboration diagram for dsREDQueue:

[legend]List of all members.

Public Member Functions
	dsREDQueue ()
int	command (int argc, const char *const *argv)
virtual void	recv (Packet *, Handler *)
virtual void	recv (Packet *p, const char *s)
virtual void	updateStats (int queuesize)
void	resume ()
int	blocked () const
void	unblock ()
void	block ()
int	limit ()
int	length ()
int	byteLength ()
virtual double	utilization (void)
virtual void	destroy ()
void	enqueue (QueueElem< T > *e)
QueueElem< T > *	dequeue ()
void	detach (QueueElem< T > *e)
QueueElem< T > *	getHead ()
int	is_empty () const
int	size () const
NsObject *	target ()
virtual void	drop (Packet *p)
virtual void	recvOnly (Packet *)
virtual void	delay_bind_init_all ()
virtual int	delay_bind_dispatch (const char *varName, const char *localName, TclObject *tracer)
int	isdebug () const
virtual void	debug (const char *fmt,...)
Protected Member Functions
void	reset ()
void	edrop (Packet *p)
void	enque (Packet *pkt)
Packet *	deque (void)
int	getCodePt (Packet *p)
int	selectQueueToDeque ()
void	lookupPHBTable (int codePt, int *queue, int *prec)
void	addPHBEntry (int codePt, int queue, int prec)
void	setNumPrec (int curPrec)
void	setMREDMode (const char *mode, const char *queue)
void	printStats ()
double	getStat (int argc, const char *const *argv)
void	printPHBTable ()
void	setSchedularMode (const char *schedtype)
void	addQueueWeights (int queueNum, int weight)
void	addQueueRate (int queueNum, int rate)
void	printWRRcount ()
void	applyTSWMeter (int q_id, int pkt_size)
void	utilUpdate (double int_begin, double int_end, int link_state)
virtual void	drop (Packet *p, const char *s)
void	send (Packet *p, Handler *h)
void	handle (Event *)
Protected Attributes
redQueue	redq_ [MAX_QUEUES]
NsObject *	de_drop_
statType	stats
int	qToDq
int	numQueues_
int	numPrec
phbParam	phb_ [MAX_CP]
int	phbEntries
int	ecn_
LinkDelay *	link_
int	schedMode
int	queueWeight [MAX_QUEUES]
double	queueMaxRate [MAX_QUEUES]
double	queueAvgRate [MAX_QUEUES]
double	queueArrTime [MAX_QUEUES]
int	slicecount [MAX_QUEUES]
int	pktcount [MAX_QUEUES]
int	wirrTemp [MAX_QUEUES]
unsigned char	wirrqDone [MAX_QUEUES]
int	queuesDone
int	qlim_
int	blocked_
int	unblock_on_resume_
QueueHandler	qh_
PacketQueue *	pq_
double	true_ave_
double	total_time_
double	last_change_
double	old_util_
double	util_weight_
QueueElem< T > *	head_
QueueElem< T > *	tail_
int	size_
NsObject *	target_
NsObject *	drop_
int	debug_

---

Constructor & Destructor Documentation

dsREDQueue::dsREDQueue (   )

Definition at line 67 of file dsred.cc. References ecn_, MAX_PREC, MAX_QUEUES, numPrec, numQueues_, phbEntries, queueMaxRate, queuesDone, queueWeight, reset(), schedMode, and schedModeRR. : de_drop_(NULL), link_(NULL) { bind("numQueues_", &numQueues_); bind_bool("ecn_", &ecn_); int i; numPrec = MAX_PREC; schedMode = schedModeRR; for(i=0;i<MAX_QUEUES;i++){ queueMaxRate[i] = 0; queueWeight[i]=1; } queuesDone = MAX_QUEUES; phbEntries = 0; // Number of entries in PHB table reset(); }

Here is the call graph for this function:

---

Member Function Documentation

void dsREDQueue::addPHBEntry (  int  codePt, int  queue, int  prec )  [protected]

Definition at line 371 of file dsred.cc. References MAX_CP, phb_, phbEntries, stats, and statType::valid_CP. Referenced by command(). { if (phbEntries == MAX_CP) { printf("ERROR: PHB Table size limit exceeded.\n"); } else { phb_[phbEntries].codePt_ = codePt; phb_[phbEntries].queue_ = queue; phb_[phbEntries].prec_ = prec; stats.valid_CP[codePt] = 1; phbEntries++; } }

void dsREDQueue::addQueueRate (  int  queueNum, int  rate )  [protected]

Definition at line 525 of file dsred.cc. References MAX_QUEUES, and queueMaxRate. Referenced by command(). { if(queueNum < MAX_QUEUES){ // Convert to BYTE/SECOND queueMaxRate[queueNum]=(double)rate/8.0; } else { printf("The queue number is out of range.\n"); } }

void dsREDQueue::addQueueWeights (  int  queueNum, int  weight )  [protected]

Definition at line 516 of file dsred.cc. References MAX_QUEUES, and queueWeight. Referenced by command(). { if(queueNum < MAX_QUEUES){ queueWeight[queueNum]=weight; } else { printf("The queue number is out of range.\n"); } }

void dsREDQueue::applyTSWMeter (  int  q_id, int  pkt_size )  [protected]

Definition at line 150 of file dsred.cc. References Scheduler::clock(), Scheduler::instance(), queueArrTime, and queueAvgRate. Referenced by deque(). { double now, bytesInTSW, newBytes; double winLen = 1.0; bytesInTSW = queueAvgRate[q_id] * winLen; // Modified by xuanc(xuanc@isi.edu) Oct 18, 2001, // referring to the patch contributed by // Sergio Andreozzi <sergio.andreozzi@lut.fi> newBytes = bytesInTSW + pkt_size; // Calculate the average rate (SW) now = Scheduler::instance().clock(); queueAvgRate[q_id] = newBytes / (now - queueArrTime[q_id] + winLen); queueArrTime[q_id] = now; }

Here is the call graph for this function:

template<class T> void Queue< T >::block (   )  [inline, inherited]

Definition at line 131 of file queue.h. References Queue< T >::blocked_. { blocked_ = 1; }

template<class T> int Queue< T >::blocked (   )  const [inline, inherited]

Definition at line 129 of file queue.h. References Queue< T >::blocked_. Referenced by CBQClass::recv(). { return (blocked_ == 1); }

template<class T> int Queue< T >::byteLength (   )  [inline, inherited]

Definition at line 135 of file queue.h. References PacketQueue::byteLength(), and Queue< T >::pq_. { return pq_->byteLength(); } /* number of bytes *

Here is the call graph for this function:

int dsREDQueue::command (  int  argc, const char *const *  argv )  [virtual]

Reimplemented from Connector. Reimplemented in coreQueue, and edgeQueue. Definition at line 538 of file dsred.cc. References addPHBEntry(), addQueueRate(), addQueueWeights(), Connector::command(), redQueue::config(), de_drop_, getStat(), link_, MAX_QUEUES, printPHBTable(), printStats(), printWRRcount(), redq_, redQueue::setMPS(), setMREDMode(), setNumPrec(), and setSchedularMode(). Referenced by edgeQueue::command(), and coreQueue::command(). { if (strcmp(argv[1], "configQ") == 0) { // modification to set the parameter q_w by Thilo redq_[atoi(argv[2])].config(atoi(argv[3]), argc, argv); return(TCL_OK); } if (strcmp(argv[1], "addPHBEntry") == 0) { addPHBEntry(atoi(argv[2]), atoi(argv[3]), atoi(argv[4])); return (TCL_OK); } if (strcmp(argv[1], "meanPktSize") == 0) { for (int i = 0; i < MAX_QUEUES; i++) redq_[i].setMPS(atoi(argv[2])); return(TCL_OK); } if (strcmp(argv[1], "setNumPrec") == 0) { setNumPrec(atoi(argv[2])); return(TCL_OK); } if (strcmp(argv[1], "getAverage") == 0) { Tcl& tcl = Tcl::instance(); tcl.resultf("%f", redq_[atoi(argv[2])].getWeightedLength()); return(TCL_OK); } if (strcmp(argv[1], "getStat") == 0) { Tcl& tcl = Tcl::instance(); tcl.resultf("%f", getStat(argc,argv)); return(TCL_OK); } if (strcmp(argv[1], "getCurrent") == 0) { Tcl& tcl = Tcl::instance(); tcl.resultf("%f", redq_[atoi(argv[2])].getRealLength()*1.0); return(TCL_OK); } if (strcmp(argv[1], "printStats") == 0) { printStats(); return (TCL_OK); } if (strcmp(argv[1], "printWRRcount") == 0) { printWRRcount(); return (TCL_OK); } if (strcmp(argv[1], "printPHBTable") == 0) { printPHBTable(); return (TCL_OK); } if (strcmp(argv[1], "link") == 0) { Tcl& tcl = Tcl::instance(); LinkDelay* del = (LinkDelay*) TclObject::lookup(argv[2]); if (del == 0) { tcl.resultf("RED: no LinkDelay object %s", argv[2]); return(TCL_ERROR); } link_ = del; return (TCL_OK); } if (strcmp(argv[1], "early-drop-target") == 0) { Tcl& tcl = Tcl::instance(); NsObject* p = (NsObject*)TclObject::lookup(argv[2]); if (p == 0) { tcl.resultf("no object %s", argv[2]); return (TCL_ERROR); } de_drop_ = p; return (TCL_OK); } if (strcmp(argv[1], "setSchedularMode") == 0) { setSchedularMode(argv[2]); return(TCL_OK); } if (strcmp(argv[1], "setMREDMode") == 0) { if (argc == 3) setMREDMode(argv[2],0); else setMREDMode(argv[2],argv[3]); return(TCL_OK); } if (strcmp(argv[1], "addQueueWeights") == 0) { addQueueWeights(atoi(argv[2]), atoi(argv[3])); return(TCL_OK); } if (strcmp(argv[1], "addQueueRate") == 0) { addQueueRate(atoi(argv[2]), atoi(argv[3])); return(TCL_OK); } // Returns the weighted RED queue length for one virtual queue in packets // Added by Thilo if (strcmp(argv[1], "getAverageV") == 0) { Tcl& tcl = Tcl::instance(); tcl.resultf("%f", redq_[atoi(argv[2])].getWeightedLength_v(atoi(argv[3]))); return(TCL_OK); } // Returns the length of one virtual queue, in packets // Added by Thilo if (strcmp(argv[1], "getCurrentV") == 0) { Tcl& tcl = Tcl::instance(); tcl.resultf("%f", redq_[atoi(argv[2])].getRealLength_v(atoi(argv[3]))*1.0); return(TCL_OK); } return(Queue::command(argc, argv)); }

Here is the call graph for this function:

void NsObject::debug (  const char *  fmt, ...  )  [virtual, inherited]

Definition at line 102 of file object.cc. References NsObject::debug_. { if (!debug_) return; va_list ap; va_start(ap, fmt); vprintf(fmt, ap); }

int NsObject::delay_bind_dispatch (  const char *  varName, const char *  localName, TclObject *  tracer )  [virtual, inherited]

Reimplemented in BayFullTcpAgent, Agent, MPLSAddressClassifier, LDPAgent, FullTcpAgent, SackFullTcpAgent, RFC793eduTcpAgent, TcpSink, TcpAgent, and VegasTcpAgent. Definition at line 63 of file object.cc. References NsObject::debug_. Referenced by MPLSAddressClassifier::delay_bind_dispatch(), and Agent::delay_bind_dispatch(). { if (delay_bind_bool(varName, localName, "debug_", &debug_, tracer)) return TCL_OK; return TclObject::delay_bind_dispatch(varName, localName, tracer); }

void NsObject::delay_bind_init_all (   )  [virtual, inherited]

Reimplemented in BayFullTcpAgent, Agent, MPLSAddressClassifier, LDPAgent, FullTcpAgent, SackFullTcpAgent, RFC793eduTcpAgent, TcpSink, TcpAgent, and VegasTcpAgent. Definition at line 57 of file object.cc. Referenced by MPLSAddressClassifier::delay_bind_init_all(), and Agent::delay_bind_init_all(). { delay_bind_init_one("debug_"); }

Packet * dsREDQueue::deque (  void   )  [protected, virtual]

Implements Queue< T >. Definition at line 216 of file dsred.cc. References hdr_cmn::access(), hdr_ip::access(), applyTSWMeter(), redQueue::deque(), hdr_ip::flowid(), getCodePt(), lookupPHBTable(), numQueues_, pktcount, queueMaxRate, redq_, schedMode, schedModePRI, selectQueueToDeque(), and Queue< T >::size(). { Packet *p = NULL; int queue, prec; hdr_ip* iph; int fid; int dq_id; // Select queue to deque under the scheduling scheme specified. dq_id = selectQueueToDeque(); // Dequeue a packet from the underlying queue: if (dq_id < numQueues_) p = redq_[dq_id].deque(); if (p) { iph= hdr_ip::access(p); fid = iph->flowid()/32; pktcount[dq_id]+=1; // update the average rate for pri-queue // Modified by xuanc(xuanc@isi.edu) Oct 18, 2001, // referring to the patch contributed by // Sergio Andreozzi <sergio.andreozzi@lut.fi> // When there is a packet dequeued, // update the average rate of each queue () if (schedMode==schedModePRI) for (int i=0;i<numQueues_;i++) if (queueMaxRate[i]) applyTSWMeter(i, (i == dq_id) ? hdr_cmn::access(p)->size() : 0); // Get the precedence level (or virtual queue id) // for the packet dequeued. lookupPHBTable(getCodePt(p), &queue, &prec); // decrement virtual queue length // Previously in updateREDStateVar, moved by xuanc (12/03/01) //redq_[dq_id].qParam_[prec].qlen--; redq_[dq_id].updateVREDLen(prec); // update state variables for that "virtual" queue redq_[dq_id].updateREDStateVar(prec); } // Return the dequed packet: return(p); }

Here is the call graph for this function:

template<class T> QueueElem<T>* Queue< T >::dequeue (   )  [inline, inherited]

Definition at line 378 of file mcache.h. References Queue< T >::head_, QueueElem< T >::next(), QueueElem< T >::next_, Queue< T >::size_, and Queue< T >::tail_. Referenced by Queue< T >::detach(), and MediaServer::get_next_segment(). { QueueElem<T> *p = head_; if (head_ != 0) head_ = head_->next(); if (head_ == 0) tail_ = 0; p->next_ = 0; size_--; if (size_ == 0) assert((head_ == 0) && (tail_ == 0)); return p; }

Here is the call graph for this function:

template<class T> virtual void Queue< T >::destroy (   )  [inline, virtual, inherited]

Definition at line 358 of file mcache.h. References QueueElem< T >::data(), Queue< T >::head_, and QueueElem< T >::next(). { QueueElem<T> *p = head_, *q; while (p != NULL) { q = p; p = p->next(); delete q->data(); delete q; } head_ = NULL; }

Here is the call graph for this function:

template<class T> void Queue< T >::detach (  QueueElem< T > *  e  )  [inline, inherited]

Definition at line 390 of file mcache.h. References Queue< T >::dequeue(), Queue< T >::head_, QueueElem< T >::next_, Queue< T >::size_, and Queue< T >::tail_. Referenced by MediaServer::command(). { assert(head_ != 0); if (head_ == e) { dequeue(); return; } QueueElem<T> *p = head_; while (p != NULL) { if (p->next_ != e) p = p->next_; else break; } assert(p != NULL); p->next_ = e->next_; if (tail_ == e) tail_ = p; size_--; if (size_ == 0) assert((head_ == 0) && (tail_ == 0)); }

Here is the call graph for this function:

void Connector::drop (  Packet *  p, const char *  s )  [protected, virtual, inherited]

Definition at line 114 of file connector.cc. References Connector::drop_, Packet::free(), and NsObject::recv(). { if (drop_ != 0) drop_->recv(p, s); else Packet::free(p); }

Here is the call graph for this function:

void Connector::drop (  Packet *  p  )  [virtual, inherited]

Definition at line 106 of file connector.cc. References Connector::drop_, Packet::free(), and NsObject::recv(). Referenced by DSRAgent::acceptRouteReply(), ARPTable::arpresolve(), JoBS::dropFront(), Vq::dropPacketForECN(), DSRAgent::dropSendBuff(), JoBS::dropTail(), edrop(), Vq::enque(), SRR::enque(), SimpleIntServ::enque(), SFQ::enque(), rtqueue::enque(), RIOQueue::enque(), REMQueue::enque(), REDQueue::enque(), RedPDQueue::enque(), PIQueue::enque(), Marker::enque(), GK::enque(), enque(), DRR::enque(), DropTail::enque(), Demarker::enque(), aodv_rqueue::enque(), toraAgent::forward(), AODV::forward(), LandmarkAgent::ForwardPacket(), DSDV_Agent::forwardPacket(), DSRAgent::getRouteForPacket(), Snoop::handle(), DSRAgent::handleFlowForwarding(), DSRAgent::handleForwarding(), DSDV_Agent::lost_link(), TCPTapAgent::processpkt(), CMUPriQueue::prq_enqueue(), rtqueue::purge(), imepAgent::purgeReXmitQ(), SessionTTLChecker::recv(), TTLChecker::recv(), toraAgent::recv(), FullTcpAgent::recv(), BayFullTcpAgent::recv(), TBF::recv(), SatLL::recv(), LL::recv(), GAFPartner::recv(), FloodAgent::recv(), Filter::recv(), DynamicLink::recv(), DSDV_Agent::recv(), AODV::recv(), AODV::recvError(), PriQueue::recvHighPriority(), AODV::recvReply(), toraAgent::reset(), Queue< T >::reset(), LinkDelay::reset(), AODV::rt_ll_failed(), AODV::rt_purge(), AODV::rt_resolve(), toraAgent::rtRoutePacket(), TCPTapAgent::sendpkt(), TapAgent::sendpkt(), IPTapAgent::sendpkt(), AODV::sendRequest(), SatLL::sendUp(), LL::sendUp(), PriQueue::Terminate(), DSRAgent::Terminate(), CMUPriQueue::Terminate(), ARPTable::Terminate(), and DSRAgent::undeliverablePkt(). { if (drop_ != 0) drop_->recv(p); else Packet::free(p); }

Here is the call graph for this function:

void dsREDQueue::edrop (  Packet *  p  )  [protected]

Definition at line 129 of file dsred.cc. References de_drop_, Connector::drop(), and NsObject::recv(). Referenced by enque(). { if (de_drop_ != 0){ de_drop_->recv(p); } else { drop(p); } }

Here is the call graph for this function:

void dsREDQueue::enque (  Packet *  pkt  )  [protected, virtual]

Implements Queue< T >. Reimplemented in edgeQueue. Definition at line 174 of file dsred.cc. References hdr_flags::access(), hdr_ip::access(), hdr_flags::ce(), Connector::drop(), statType::drops, statType::drops_CP, ecn_, hdr_flags::ect(), edrop(), statType::edrops, statType::edrops_CP, redQueue::enque(), lookupPHBTable(), PKT_DROPPED, PKT_EDROPPED, PKT_ENQUEUED, PKT_MARKED, statType::pkts, statType::pkts_CP, hdr_ip::prio(), redq_, and stats. Referenced by edgeQueue::enque(). { int codePt, eq_id, prec; hdr_ip* iph = hdr_ip::access(pkt); //extracting the marking done by the edge router codePt = iph->prio(); int ecn = 0; //looking up queue and prec numbers for that codept lookupPHBTable(codePt, &eq_id, &prec); // code added for ECN support //hdr_flags* hf = (hdr_flags*)(pkt->access(off_flags_)); // Changed for the latest version instead of 2.1b6 hdr_flags* hf = hdr_flags::access(pkt); if (ecn_ && hf->ect()) ecn = 1; stats.pkts_CP[codePt]++; stats.pkts++; switch(redq_[eq_id].enque(pkt, prec, ecn)) { case PKT_ENQUEUED: break; case PKT_DROPPED: stats.drops_CP[codePt]++; stats.drops++; drop(pkt); break; case PKT_EDROPPED: stats.edrops_CP[codePt]++; stats.edrops++; edrop(pkt); break; case PKT_MARKED: hf->ce() = 1; // mark Congestion Experienced bit break; default: break; } }

Here is the call graph for this function:

template<class T> void Queue< T >::enqueue (  QueueElem< T > *  e  )  [inline, inherited]

Definition at line 369 of file mcache.h. References QueueElem< T >::append(), Queue< T >::head_, Queue< T >::size_, and Queue< T >::tail_. Referenced by MediaServer::command(), and MediaServer::get_next_segment(). { if (tail_ == 0) head_ = tail_ = e; else { tail_->append(e); tail_ = e; } size_++; }

Here is the call graph for this function:

int dsREDQueue::getCodePt (  Packet *  p  )  [protected]

Definition at line 263 of file dsred.cc. References hdr_ip::access(), and hdr_ip::prio(). Referenced by deque(). { hdr_ip* iph = hdr_ip::access(p); return(iph->prio()); }

Here is the call graph for this function:

template<class T> QueueElem<T>* Queue< T >::getHead (   )  [inline, inherited]

Definition at line 411 of file mcache.h. References Queue< T >::head_. Referenced by MediaServer::find_prefinfo(). { return head_; }

double dsREDQueue::getStat (  int  argc, const char *const *  argv )  [protected]

Definition at line 388 of file dsred.cc. References statType::drops, statType::drops_CP, statType::edrops, statType::edrops_CP, statType::pkts, statType::pkts_CP, and stats. Referenced by command(). { if (argc == 3) { if (strcmp(argv[2], "drops") == 0) return (stats.drops*1.0); if (strcmp(argv[2], "edrops") == 0) return (stats.edrops*1.0); if (strcmp(argv[2], "pkts") == 0) return (stats.pkts*1.0); } if (argc == 4) { if (strcmp(argv[2], "drops") == 0) return (stats.drops_CP[atoi(argv[3])]*1.0); if (strcmp(argv[2], "edrops") == 0) return (stats.edrops_CP[atoi(argv[3])]*1.0); if (strcmp(argv[2], "pkts") == 0) return (stats.pkts_CP[atoi(argv[3])]*1.0); } return -1.0; }

void NsObject::handle (  Event *   )  [protected, virtual, inherited]

Implements Handler. Reimplemented in LinkDelay, LL, AckRecons, and Snoop. Definition at line 91 of file object.cc. References NsObject::recv(). { recv((Packet*)e); }

Here is the call graph for this function:

template<class T> int Queue< T >::is_empty (   )  const [inline, inherited]

Definition at line 412 of file mcache.h. References Queue< T >::size_. Referenced by MediaServer::command(), and MediaServer::get_next_segment(). { return (size_ == 0); }

int NsObject::isdebug (   )  const [inline, inherited]

Definition at line 61 of file object.h. References NsObject::debug_. { return debug_; }

template<class T> int Queue< T >::length (   )  [inline, inherited]

Reimplemented in DRR, and SRR. Definition at line 133 of file queue.h. References PacketQueue::length(), and Queue< T >::pq_. Referenced by REMQueue::run_updaterule(), Snoop::snoop_data(), and JoBS::updateStats(). { return pq_->length(); } /* number of pkts currently in

Here is the call graph for this function:

template<class T> int Queue< T >::limit (   )  [inline, inherited]

Definition at line 132 of file queue.h. References Queue< T >::qlim_. Referenced by reset(), and Snoop::snoop_data(). { return qlim_; }

void dsREDQueue::lookupPHBTable (  int  codePt, int *  queue, int *  prec )  [protected]

Definition at line 355 of file dsred.cc. References phbParam::codePt_, phb_, phbEntries, and phbParam::queue_. Referenced by deque(), and enque(). { for (int i = 0; i < phbEntries; i++) { if (phb_[i].codePt_ == codePt) { *queue = phb_[i].queue_; *prec = phb_[i].prec_; return; } } printf("ERROR: No match found for code point %d in PHB Table.\n", codePt); }

void dsREDQueue::printPHBTable (   )  [protected]

Definition at line 461 of file dsred.cc. References phb_, and phbEntries. Referenced by command(). { printf("PHB Table:\n"); for (int i = 0; i < phbEntries; i++) printf("Code Point %d is associated with Queue %d, Precedence %d\n", phb_[i].codePt_, phb_[i].queue_, phb_[i].prec_); printf("\n"); }

void dsREDQueue::printStats (   )  [protected]

Definition at line 473 of file dsred.cc. References statType::drops, statType::drops_CP, statType::edrops, statType::edrops_CP, MAX_CP, statType::pkts, statType::pkts_CP, and stats. Referenced by command(). { printf("\nPackets Statistics\n"); printf("=======================================\n"); printf(" CP TotPkts TxPkts ldrops edrops\n"); printf(" -- ------- ------ ------ ------\n"); printf("All %8ld %8ld %8ld %8ld\n",stats.pkts,stats.pkts-stats.drops-stats.edrops,stats.drops,stats.edrops); for (int i = 0; i < MAX_CP; i++) if (stats.pkts_CP[i] != 0) printf("%3d %8ld %8ld %8ld %8ld\n",i,stats.pkts_CP[i],stats.pkts_CP[i]-stats.drops_CP[i]-stats.edrops_CP[i],stats.drops_CP[i],stats.edrops_CP[i]); }

void dsREDQueue::printWRRcount (   )  [protected]

Definition at line 486 of file dsred.cc. References numQueues_, pktcount, queueWeight, and slicecount. Referenced by command(). { int i; for (i = 0; i < numQueues_; i++){ printf("%d: %d %d %d.\n", i, slicecount[i],pktcount[i],queueWeight[i]); } }

void NsObject::recv (  Packet *  p, const char *  s )  [virtual, inherited]

Reimplemented in CMUTrace. Definition at line 96 of file object.cc. References Packet::free(). { Packet::free(p); }

Here is the call graph for this function:

template<class T> void Queue< T >::recv (  Packet *  , Handler *  )  [virtual, inherited]

Reimplemented from Connector. Reimplemented in CBQueue, FQ, and PriQueue. Definition at line 101 of file queue.cc. References Queue< T >::blocked_, Scheduler::clock(), Queue< T >::deque(), Queue< T >::enque(), Scheduler::instance(), Queue< T >::last_change_, Queue< T >::qh_, NsObject::recv(), Connector::target_, and Queue< T >::utilUpdate(). Referenced by PriQueue::recv(). { double now = Scheduler::instance().clock(); enque(p); if (!blocked_) { /* * We're not blocked. Get a packet and send it on. * We perform an extra check because the queue * might drop the packet even if it was * previously empty! (e.g., RED can do this.) */ p = deque(); if (p != 0) { utilUpdate(last_change_, now, blocked_); last_change_ = now; blocked_ = 1; target_->recv(p, &qh_); } } }

Here is the call graph for this function:

virtual void NsObject::recvOnly (  Packet *   )  [inline, virtual, inherited]

Reimplemented in Agent, and Trace. Definition at line 56 of file object.h. Referenced by Trace::recvOnly(). {};

void dsREDQueue::reset (   )  [protected, virtual]

Reimplemented from Queue< T >. Definition at line 87 of file dsred.cc. References LinkDelay::bandwidth(), statType::drops, statType::drops_CP, statType::edrops, statType::edrops_CP, Queue< T >::limit(), link_, MAX_CP, MAX_QUEUES, pktcount, statType::pkts, statType::pkts_CP, redQueue::qlim, qToDq, queueArrTime, queueAvgRate, redq_, Queue< T >::reset(), redQueue::setPTC(), slicecount, stats, wirrqDone, and wirrTemp. Referenced by dsREDQueue(). { int i; qToDq = 0; // q to be dequed, initialized to 0 for(i=0;i<MAX_QUEUES;i++){ queueAvgRate[i] = 0.0; queueArrTime[i] = 0.0; slicecount[i]=0; pktcount[i]=0; wirrTemp[i]=0; wirrqDone[i]=0; } stats.drops = 0; stats.edrops = 0; stats.pkts = 0; for(i=0;i<MAX_CP;i++){ stats.drops_CP[i]=0; stats.edrops_CP[i]=0; stats.pkts_CP[i]=0; } for (i = 0; i < MAX_QUEUES; i++) redq_[i].qlim = limit(); // Compute the "packet time constant" if we know the // link bandwidth. The ptc is the max number of (avg sized) // pkts per second which can be placed on the link. if (link_) for (int i = 0; i < MAX_QUEUES; i++) redq_[i].setPTC(link_->bandwidth()); Queue::reset(); }

Here is the call graph for this function:

template<class T> void Queue< T >::resume (   )  [inherited]

Definition at line 154 of file queue.cc. References Queue< T >::blocked_, Scheduler::clock(), Queue< T >::deque(), Scheduler::instance(), Queue< T >::last_change_, Queue< T >::qh_, NsObject::recv(), Connector::target_, Queue< T >::unblock_on_resume_, and Queue< T >::utilUpdate(). Referenced by WRR_CBQueue::deque(), CBQueue::deque(), and QueueHandler::handle(). { double now = Scheduler::instance().clock(); Packet* p = deque(); if (p != 0) { target_->recv(p, &qh_); } else { if (unblock_on_resume_) { utilUpdate(last_change_, now, blocked_); last_change_ = now; blocked_ = 0; } else { utilUpdate(last_change_, now, blocked_); last_change_ = now; blocked_ = 1; } } }

Here is the call graph for this function:

int dsREDQueue::selectQueueToDeque (   )  [protected]

Definition at line 269 of file dsred.cc. References redQueue::getRealLength(), numQueues_, qToDq, queueAvgRate, queueMaxRate, queuesDone, queueWeight, redq_, schedMode, schedModePRI, schedModeRR, schedModeWIRR, schedModeWRR, wirrqDone, and wirrTemp. Referenced by deque(). { // If the queue to be dequed has no elements, // look for the next queue in line int i = 0; // Round-Robin if(schedMode==schedModeRR){ //printf("RR\n"); qToDq = ((qToDq + 1) % numQueues_); while ((i < numQueues_) && (redq_[qToDq].getRealLength() == 0)) { qToDq = ((qToDq + 1) % numQueues_); i++; } } else if (schedMode==schedModeWRR) { // Weighted Round Robin if(wirrTemp[qToDq]<=0){ qToDq = ((qToDq + 1) % numQueues_); wirrTemp[qToDq] = queueWeight[qToDq] - 1; } else { wirrTemp[qToDq] = wirrTemp[qToDq] -1; } while ((i < numQueues_) && (redq_[qToDq].getRealLength() == 0)) { wirrTemp[qToDq] = 0; qToDq = ((qToDq + 1) % numQueues_); wirrTemp[qToDq] = queueWeight[qToDq] - 1; i++; } } else if (schedMode==schedModeWIRR) { qToDq = ((qToDq + 1) % numQueues_); while ((i<numQueues_) && ((redq_[qToDq].getRealLength()==0) || (wirrqDone[qToDq]))) { if (!wirrqDone[qToDq]) { queuesDone++; wirrqDone[qToDq]=1; } qToDq = ((qToDq + 1) % numQueues_); i++; } if (wirrTemp[qToDq] == 1) { queuesDone +=1; wirrqDone[qToDq]=1; } wirrTemp[qToDq]-=1; if(queuesDone >= numQueues_) { queuesDone = 0; for(i=0;i<numQueues_;i++) { wirrTemp[i] = queueWeight[i]; wirrqDone[i]=0; } } } else if (schedMode==schedModePRI) { // Find the queue with highest priority, which satisfies: // 1. nozero queue length; and either // 2.1. has no MaxRate specified; or // 2.2. has MaxRate specified and // its average rate is not beyond that limit. i = 0; while (i < numQueues_ && (redq_[i].getRealLength() == 0 || (queueMaxRate[i] && queueAvgRate[i]>queueMaxRate[i]))){ i++; } qToDq = i; // If no queue satisfies the condition above, // find the Queue with highest priority, // which has packet to dequeue. // NOTE: the high priority queue can still have its packet dequeued // even if its average rate has beyond the MAX rate specified! // Ideally, a NO_PACKET_TO_DEQUEUE should be returned. if (i == numQueues_) { i = qToDq = 0; while ((i < numQueues_) && (redq_[qToDq].getRealLength() == 0)) { qToDq = ((qToDq + 1) % numQueues_); i++; } } } return(qToDq); }

Here is the call graph for this function:

void Connector::send (  Packet *  p, Handler *  h )  [inline, protected, inherited]

Reimplemented in Agent, and LinkDelay. Definition at line 54 of file connector.h. References NsObject::recv(), and Connector::target_. Referenced by SessionTTLChecker::recv(), TTLChecker::recv(), DequeTrace::recv(), Trace::recv(), TraceIpMac::recv(), TraceIp::recv(), SatDequeTrace::recv(), SALink::recv(), SnoopQueueEDrop::recv(), SnoopQueueTagger::recv(), SnoopQueueDrop::recv(), SnoopQueueOut::recv(), SnoopQueueIn::recv(), PktCounter::recv(), NetworkInterface::recv(), MeasureMod::recv(), Filter::recv(), Connector::recv(), CMUTrace::recv(), CBQClass::recv(), and AddSR::recv(). { target_->recv(p, h); }

Here is the call graph for this function:

void dsREDQueue::setMREDMode (  const char *  mode, const char *  queue )  [protected]

Definition at line 432 of file dsred.cc. References dropTail, MAX_QUEUES, redQueue::mredMode, mredModeType, redq_, rio_c, rio_d, and wred. Referenced by command(). { int i; mredModeType tempMode; if (strcmp(mode, "RIO-C") == 0) tempMode = rio_c; else if (strcmp(mode, "RIO-D") == 0) tempMode = rio_d; else if (strcmp(mode, "WRED") == 0) tempMode = wred; else if (strcmp(mode, "DROP") == 0) tempMode = dropTail; else { printf("Error: MRED mode %s does not exist\n",mode); return; } if (!queue) for (i = 0; i < MAX_QUEUES; i++) redq_[i].mredMode = tempMode; else redq_[atoi(queue)].mredMode = tempMode; }

void dsREDQueue::setNumPrec (  int  curPrec  )  [protected]

Definition at line 415 of file dsred.cc. References MAX_PREC, MAX_QUEUES, redQueue::numPrec, numPrec, and redq_. Referenced by command(). { int i; if (prec > MAX_PREC) { printf("ERROR: Cannot declare more than %d prcedence levels (as defined by MAX_PREC)\n",MAX_PREC); } else { numPrec = prec; for (i = 0; i < MAX_QUEUES; i++) redq_[i].numPrec = numPrec; } }

void dsREDQueue::setSchedularMode (  const char *  schedtype  )  [protected]

Definition at line 498 of file dsred.cc. References schedMode, schedModePRI, schedModeRR, schedModeWIRR, and schedModeWRR. Referenced by command(). { if (strcmp(schedtype, "RR") == 0) schedMode = schedModeRR; else if (strcmp(schedtype, "WRR") == 0) schedMode = schedModeWRR; else if (strcmp(schedtype, "WIRR") == 0) schedMode = schedModeWIRR; else if (strcmp(schedtype, "PRI") == 0) schedMode = schedModePRI; else printf("Error: Scheduler type %s does not exist\n",schedtype); }

template<class T> int Queue< T >::size (   )  const [inline, inherited]

Definition at line 413 of file mcache.h. References Queue< T >::size_. Referenced by JoBS::arvAccounting(), JoBS::assignRateDropsADC(), deque(), JoBS::dropFront(), JoBS::dropTail(), RedPDQueue::enque(), JoBS::enque(), MediaServer::get_next_segment(), JoBS::pickDroppedRLC(), and FQ::recv(). { return size_; }

NsObject* Connector::target (   )  [inline, inherited]

Definition at line 48 of file connector.h. References Connector::target_. Referenced by JoBS::assignRateDropsADC(), FQ::deque(), QSAgent::recv(), and MIPMHAgent::reg(). { return target_; }

template<class T> void Queue< T >::unblock (   )  [inline, inherited]

Definition at line 130 of file queue.h. References Queue< T >::blocked_. { blocked_ = 0; }

template<class T> void Queue< T >::updateStats (  int  queuesize  )  [virtual, inherited]

Definition at line 141 of file queue.cc. References Scheduler::clock(), Scheduler::instance(), Queue< T >::total_time_, and Queue< T >::true_ave_. Referenced by REDQueue::deque(), DropTail::deque(), REDQueue::enque(), and DropTail::enque(). { double now = Scheduler::instance().clock(); double newtime = now - total_time_; if (newtime > 0.0) { double oldave = true_ave_; double oldtime = total_time_; double newtime = now - total_time_; true_ave_ = (oldtime * oldave + newtime * queuesize) /now; total_time_ = now; } }

Here is the call graph for this function:

template<class T> double Queue< T >::utilization (  void   )  [virtual, inherited]

Definition at line 130 of file queue.cc. References Queue< T >::blocked_, Scheduler::clock(), Scheduler::instance(), Queue< T >::last_change_, Queue< T >::old_util_, and Queue< T >::utilUpdate(). Referenced by QSAgent::recv(). { double now = Scheduler::instance().clock(); utilUpdate(last_change_, now, blocked_); last_change_ = now; return old_util_; }

Here is the call graph for this function:

template<class T> void Queue< T >::utilUpdate (  double  int_begin, double  int_end, int  link_state )  [protected, inherited]

Definition at line 122 of file queue.cc. References Queue< T >::old_util_, and Queue< T >::util_weight_. Referenced by Queue< T >::recv(), Queue< T >::resume(), and Queue< T >::utilization(). { double decay; decay = exp(-util_weight_ * (int_end - int_begin)); old_util_ = link_state + (old_util_ - link_state) * decay; }

---

Member Data Documentation

template<class T> int Queue< T >::blocked_ [protected, inherited]

Definition at line 143 of file queue.h. Referenced by Queue< T >::block(), Queue< T >::blocked(), Queue< T >::Queue(), Queue< T >::recv(), FQ::recv(), CBQueue::recv(), PriQueue::recvHighPriority(), Queue< T >::resume(), CBQueue::sched(), Queue< T >::unblock(), and Queue< T >::utilization().

NsObject* dsREDQueue::de_drop_ [protected]

Definition at line 125 of file dsred.h. Referenced by command(), and edrop().

int NsObject::debug_ [protected, inherited]

Reimplemented in FECModel, FloodAgent, and LandmarkAgent. Definition at line 66 of file object.h. Referenced by REDQueue::command(), RedPDQueue::command(), PushbackQueue::command(), NsObject::debug(), NsObject::delay_bind_dispatch(), RedPDQueue::enque(), PushbackQueue::enque(), NsObject::isdebug(), NsObject::NsObject(), TfrcAgent::recv(), PushbackQueue::reportDrop(), and REDQueue::reset().

NsObject* Connector::drop_ [protected, inherited]

Definition at line 57 of file connector.h. Referenced by Connector::command(), Connector::drop(), and ErrorModel::recv().

int dsREDQueue::ecn_ [protected]

Definition at line 132 of file dsred.h. Referenced by dsREDQueue(), and enque().

template<class T> QueueElem<T>* Queue< T >::head_ [protected, inherited]

Definition at line 416 of file mcache.h. Referenced by Queue< T >::dequeue(), Queue< T >::destroy(), Queue< T >::detach(), Queue< T >::enqueue(), Queue< T >::getHead(), Queue< T >::Queue(), Queue< T >::reset(), and Queue< T >::~Queue().

template<class T> double Queue< T >::last_change_ [protected, inherited]

Definition at line 154 of file queue.h. Referenced by Queue< T >::recv(), Queue< T >::resume(), and Queue< T >::utilization().

LinkDelay* dsREDQueue::link_ [protected]

Definition at line 133 of file dsred.h. Referenced by command(), and reset().

int dsREDQueue::numPrec [protected]

Definition at line 129 of file dsred.h. Referenced by dsREDQueue(), and setNumPrec().

int dsREDQueue::numQueues_ [protected]

Definition at line 128 of file dsred.h. Referenced by deque(), dsREDQueue(), printWRRcount(), and selectQueueToDeque().

template<class T> double Queue< T >::old_util_ [protected, inherited]

Definition at line 155 of file queue.h. Referenced by Queue< T >::utilization(), and Queue< T >::utilUpdate().

phbParam dsREDQueue::phb_[MAX_CP] [protected]

Definition at line 130 of file dsred.h. Referenced by addPHBEntry(), lookupPHBTable(), and printPHBTable().

int dsREDQueue::phbEntries [protected]

Definition at line 131 of file dsred.h. Referenced by addPHBEntry(), dsREDQueue(), lookupPHBTable(), and printPHBTable().

int dsREDQueue::pktcount[MAX_QUEUES] [protected]

Definition at line 141 of file dsred.h. Referenced by deque(), printWRRcount(), and reset().

template<class T> PacketQueue* Queue< T >::pq_ [protected, inherited]

Definition at line 146 of file queue.h. Referenced by Queue< T >::byteLength(), Vq::command(), REMQueue::command(), REDQueue::command(), PIQueue::command(), GK::command(), DropTail::command(), DropTail::DropTail(), GK::GK(), Queue< T >::length(), SemanticRIOQueue::pickPacketForECN(), SemanticREDQueue::pickPacketForECN(), SemanticRIOQueue::pickPacketToDrop(), SemanticREDQueue::pickPacketToDrop(), PIQueue::PIQueue(), REDQueue::REDQueue(), REMQueue::REMQueue(), and Vq::Vq().

template<class T> QueueHandler Queue< T >::qh_ [protected, inherited]

Definition at line 145 of file queue.h. Referenced by Queue< T >::recv(), FQ::recv(), PriQueue::recvHighPriority(), Queue< T >::resume(), and CBQueue::sched().

template<class T> int Queue< T >::qlim_ [protected, inherited]

Definition at line 142 of file queue.h. Referenced by Vq::checkPacketForECN(), Vq::enque(), SRR::enque(), RIOQueue::enque(), REMQueue::enque(), REDQueue::enque(), PIQueue::enque(), Marker::enque(), JoBS::enque(), GK::enque(), DropTail::enque(), Demarker::enque(), Queue< T >::limit(), RIOQueue::print_edp(), REDQueue::print_edp(), Queue< T >::Queue(), and PriQueue::recvHighPriority().

int dsREDQueue::qToDq [protected]

Definition at line 127 of file dsred.h. Referenced by reset(), and selectQueueToDeque().

double dsREDQueue::queueArrTime[MAX_QUEUES] [protected]

Definition at line 139 of file dsred.h. Referenced by applyTSWMeter(), and reset().

double dsREDQueue::queueAvgRate[MAX_QUEUES] [protected]

Definition at line 138 of file dsred.h. Referenced by applyTSWMeter(), reset(), and selectQueueToDeque().

double dsREDQueue::queueMaxRate[MAX_QUEUES] [protected]

Definition at line 137 of file dsred.h. Referenced by addQueueRate(), deque(), dsREDQueue(), and selectQueueToDeque().

int dsREDQueue::queuesDone [protected]

Definition at line 144 of file dsred.h. Referenced by dsREDQueue(), and selectQueueToDeque().

int dsREDQueue::queueWeight[MAX_QUEUES] [protected]

Definition at line 136 of file dsred.h. Referenced by addQueueWeights(), dsREDQueue(), printWRRcount(), and selectQueueToDeque().

redQueue dsREDQueue::redq_[MAX_QUEUES] [protected]

Definition at line 124 of file dsred.h. Referenced by command(), deque(), enque(), reset(), selectQueueToDeque(), setMREDMode(), and setNumPrec().

int dsREDQueue::schedMode [protected]

Definition at line 134 of file dsred.h. Referenced by deque(), dsREDQueue(), selectQueueToDeque(), and setSchedularMode().

template<class T> int Queue< T >::size_ [protected, inherited]

Definition at line 417 of file mcache.h. Referenced by Queue< T >::dequeue(), Queue< T >::detach(), Queue< T >::enqueue(), Queue< T >::is_empty(), Queue< T >::Queue(), and Queue< T >::size().

int dsREDQueue::slicecount[MAX_QUEUES] [protected]

Definition at line 140 of file dsred.h. Referenced by printWRRcount(), and reset().

statType dsREDQueue::stats [protected]

Definition at line 126 of file dsred.h. Referenced by addPHBEntry(), enque(), getStat(), printStats(), and reset().

template<class T> QueueElem<T> * Queue< T >::tail_ [protected, inherited]

Definition at line 416 of file mcache.h. Referenced by Queue< T >::dequeue(), Queue< T >::detach(), Queue< T >::enqueue(), and Queue< T >::Queue().

NsObject* Connector::target_ [protected, inherited]

Definition at line 56 of file connector.h. Referenced by SRAgent::command(), SA_Agent::command(), IvsReceiver::command(), MultiFieldFilter::command(), Filter::command(), Connector::command(), DiffusionAgent::DiffusionAgent(), DSRAgent::DSRAgent(), PromotionTimer::expire(), FloodingAgent::FloodingAgent(), toraAgent::forward(), AODV::forward(), LandmarkAgent::ForwardPacket(), DSDV_Agent::forwardPacket(), SensorQueryAgent::generate_query(), DSDVTriggerHandler::handle(), AckRecons::handle(), DSRAgent::handlePacketReceipt(), DSDV_Agent::helper_callback(), AODV::initialized(), DSDV_Agent::lost_link(), OmniMcastAgent::OmniMcastAgent(), LandmarkAgent::periodic_callback(), LandmarkAgent::ProcessHierUpdate(), TCPTapAgent::processpkt(), IPTapAgent::processpkt(), CMUPriQueue::prq_enqueue(), CMUPriQueue::prq_resume(), DequeTrace::recv(), Trace::recv(), TraceIpMac::recv(), TraceIp::recv(), TBF::recv(), SRMAgent::recv(), SSMSRMAgent::recv(), SatDequeTrace::recv(), SAack_Agent::recv(), Queue< T >::recv(), PingResponder::recv(), MIPEncapsulator::recv(), LmsAgent::recv(), HackLossyLink::recv(), GAFPartner::recv(), FQ::recv(), FloodAgent::recv(), ErrorModel::recv(), DynamicLink::recv(), DumbAgent::recv(), DSRAgent::recv(), DelayModel::recv(), LinkDelay::recv(), CtrMcastDecap::recv(), CtrMcastEncap::recv(), CMUTrace::recv(), PriQueue::recvHighPriority(), Trace::recvOnly(), TapAgent::recvpkt(), Queue< T >::resume(), LinkDelay::send(), Connector::send(), Agent::send(), MIPBSAgent::send_ads(), SRMAgent::send_ctrl(), SSMSRMAgent::send_ctrl(), MFTPSndAgent::send_data(), LmsSender::send_dmcast(), LmsReceiver::send_dmcast(), LmsAgent::send_downstream(), SSMSRMAgent::send_glb_sess(), LmsSender::send_lms_pkt(), SSMSRMAgent::send_loc_sess(), MFTPRcvAgent::send_nak(), LmsReceiver::send_nak(), LmsReceiver::send_refresh(), SSMSRMAgent::send_rep_sess(), SRMAgent::send_sess(), MIPMHAgent::send_sols(), LmsSender::send_spm(), MFTPSndAgent::send_status_request(), LmsAgent::send_upstream(), LandmarkAgent::SendChangedTagListUpdate(), AODV::sendError(), AODV::sendHello(), UdpAgent::sendmsg(), SRMAgent::sendmsg(), SA_Agent::sendmsg(), RTPAgent::sendmsg(), LmsSender::sendmsg(), DSDV_Agent::sendOutBCastPkt(), SA_Agent::sendpkt(), rtProtoDV::sendpkt(), RTPAgent::sendpkt(), RTCPAgent::sendpkt(), IvsSource::sendpkt(), AODV::sendReply(), AODV::sendRequest(), LmsSender::solicit_naks(), Connector::target(), TBF::timeout(), and toraAgent::tora_output().

template<class T> double Queue< T >::total_time_ [protected, inherited]

Definition at line 150 of file queue.h. Referenced by REDQueue::print_summarystats(), DropTail::print_summarystats(), Queue< T >::reset(), and Queue< T >::updateStats().

template<class T> double Queue< T >::true_ave_ [protected, inherited]

Definition at line 149 of file queue.h. Referenced by REDQueue::print_summarystats(), DropTail::print_summarystats(), Queue< T >::reset(), and Queue< T >::updateStats().

template<class T> int Queue< T >::unblock_on_resume_ [protected, inherited]

Definition at line 144 of file queue.h. Referenced by Queue< T >::Queue(), and Queue< T >::resume().

template<class T> double Queue< T >::util_weight_ [protected, inherited]

Definition at line 156 of file queue.h. Referenced by Queue< T >::Queue(), and Queue< T >::utilUpdate().

unsigned char dsREDQueue::wirrqDone[MAX_QUEUES] [protected]

Definition at line 143 of file dsred.h. Referenced by reset(), and selectQueueToDeque().

int dsREDQueue::wirrTemp[MAX_QUEUES] [protected]

Definition at line 142 of file dsred.h. Referenced by reset(), and selectQueueToDeque().

---

The documentation for this class was generated from the following files:

• dsred.h
• dsred.cc

---