edgeQueue Class Reference

#include <dsEdge.h>

Inheritance diagram for edgeQueue:

Collaboration diagram for edgeQueue:

[legend]

---

Detailed Description

Definition at line 49 of file dsEdge.h.

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

---

Constructor & Destructor Documentation

edgeQueue::edgeQueue (   )

Definition at line 65 of file dsEdge.cc. { // policy = NULL; }

---

Member Function Documentation

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

Definition at line 375 of file dsred.cc. References phbParam::codePt_, MAX_CP, dsREDQueue::phb_, dsREDQueue::phbEntries, phbParam::prec_, phbParam::queue_, dsREDQueue::stats, and statType::valid_CP. Referenced by dsREDQueue::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, inherited]

Definition at line 529 of file dsred.cc. References dsREDQueue::queueMaxRate. { 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, inherited]

Definition at line 520 of file dsred.cc. References dsREDQueue::queueWeight. { 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, inherited]

Definition at line 150 of file dsred.cc. References Scheduler::clock(), Scheduler::instance(), dsREDQueue::queueArrTime, and dsREDQueue::queueAvgRate. Referenced by dsREDQueue::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 132 of file queue.h. References Queue< T >::blocked_. { blocked_ = 1; }

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

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

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

Definition at line 136 of file queue.h. References PacketQueue::byteLength(), and Queue< T >::pq_. Referenced by XCPQueue::deque(), and XCPQueue::Tq_timeout(). { return pq_->byteLength(); } /* number of bytes * Here is the call graph for this function:

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

Reimplemented from dsREDQueue. Definition at line 93 of file dsEdge.cc. References PolicyClassifier::addPolicerEntry(), PolicyClassifier::addPolicyEntry(), dsREDQueue::command(), DEWPPolicy::couple(), EWPolicy::coupleEW(), EWPolicy::detectBr(), EWPolicy::detectPr(), DEWP, EW, PolicyClassifier::getCBucket(), EWPolicy::limitBr(), EWPolicy::limitPr(), policy, PolicyClassifier::policy_pool, PolicyClassifier::printPolicerTable(), and PolicyClassifier::printPolicyTable(). { if (strcmp(argv[1], "addPolicyEntry") == 0) { // Note: the definition of policy has changed. policy.addPolicyEntry(argc, argv); return(TCL_OK); }; if (strcmp(argv[1], "addPolicerEntry") == 0) { // Note: the definition of policy has changed. policy.addPolicerEntry(argc, argv); return(TCL_OK); }; if (strcmp(argv[1], "couple") == 0) { /* printf("%d ", argc); for (int i = 1; i < argc; i++) printf("%d(%s) ", i, argv[i]); printf("\n"); */ DEWPPolicy *ewp = (DEWPPolicy *)(policy.policy_pool[DEWP]); // Get the pointer to the queue to be coupled (in c++) //Tcl& tcl = Tcl::instance(); edgeQueue *cq = (edgeQueue*) TclObject::lookup(argv[2]); DEWPPolicy *ewpc = (DEWPPolicy *)((cq->policy).policy_pool[DEWP]); ewp->couple(ewpc); return(TCL_OK); }; // couple the EW on request and response links if (strcmp(argv[1], "coupleEW") == 0) { //printf("%d ", argc); //for (int i = 1; i < argc; i++) //printf("%d(%s) ", i, argv[i]); //printf("\n"); EWPolicy *ewp = (EWPolicy *)(policy.policy_pool[EW]); // Get the pointer to the queue to be coupled (in c++) //Tcl& tcl = Tcl::instance(); edgeQueue *cq = (edgeQueue*) TclObject::lookup(argv[2]); EWPolicy *ewpc = (EWPolicy *)((cq->policy).policy_pool[EW]); // couple the EW detector if (argc > 3) ewp->coupleEW(ewpc, atof(argv[3])); else ewp->coupleEW(ewpc); return(TCL_OK); }; // Set a rate limitor if (strcmp(argv[1], "limit") == 0) { //printf("%d ", argc); //for (int i = 1; i < argc; i++) // printf("%d(%s) ", i, argv[i]); //printf("\n"); EWPolicy *ewp = (EWPolicy *)(policy.policy_pool[EW]); // Packet rate limitor if (strcmp(argv[2], "P") == 0) { ewp->limitPr(atoi(argv[3])); return(TCL_OK); } // bits rate limitor if (strcmp(argv[2], "B") == 0) { ewp->limitBr(atoi(argv[3])); return(TCL_OK); } }; // Setup an EW detector on a link if (strcmp(argv[1], "detect") == 0) { //printf("%d ", argc); //for (int i = 1; i < argc; i++) // printf("%d(%s) ", i, argv[i]); //printf("\n"); EWPolicy *ewp = (EWPolicy *)(policy.policy_pool[EW]); if (strcmp(argv[2], "P") == 0) { if (argc > 4) ewp->detectPr(atoi(argv[3]), atoi(argv[4])); else if (argc > 3) ewp->detectPr(atoi(argv[3])); else ewp->detectPr(); return(TCL_OK); } if (strcmp(argv[2], "B") == 0) { if (argc > 4) ewp->detectBr(atoi(argv[3]), atoi(argv[4])); else if (argc > 3) ewp->detectBr(atoi(argv[3])); else ewp->detectBr(); return(TCL_OK); } }; if (strcmp(argv[1], "getCBucket") == 0) { Tcl& tcl = Tcl::instance(); tcl.resultf("%f", policy.getCBucket(argv)); return(TCL_OK); } if (strcmp(argv[1], "printPolicyTable") == 0) { policy.printPolicyTable(); return(TCL_OK); } if (strcmp(argv[1], "printPolicerTable") == 0) { policy.printPolicerTable(); return(TCL_OK); } return(dsREDQueue::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, HbAfterRtoSctpAgent, MfrHbAfterRtoSctpAgent, MfrTimestampSctpAgent, MultipleFastRtxSctpAgent, NewRenoSctpAgent, TimestampSctpAgent, SctpAgent, FullTcpAgent, SackFullTcpAgent, RFC793eduTcpAgent, TcpSink, TcpAgent, VegasTcpAgent, XcpAgent, and XcpSink. 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, HbAfterRtoSctpAgent, MfrHbAfterRtoSctpAgent, MfrTimestampSctpAgent, MultipleFastRtxSctpAgent, NewRenoSctpAgent, TimestampSctpAgent, SctpAgent, FullTcpAgent, SackFullTcpAgent, RFC793eduTcpAgent, TcpSink, TcpAgent, VegasTcpAgent, XcpAgent, and XcpSink. 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, inherited]

Implements Queue< T >. Definition at line 216 of file dsred.cc. References hdr_cmn::access(), hdr_ip::access(), dsREDQueue::applyTSWMeter(), redQueue::deque(), hdr_ip::flowid(), dsREDQueue::getCodePt(), dsREDQueue::lookupPHBTable(), dsREDQueue::numQueues_, dsREDQueue::pktcount, dsREDQueue::queueMaxRate, dsREDQueue::redq_, dsREDQueue::schedMode, schedModePRI, dsREDQueue::selectQueueToDeque(), Queue< T >::size(), redQueue::updateREDStateVar(), and redQueue::updateVREDLen(). { 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 400 of file mcache.h. References Queue< T >::head_, 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; }

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

Definition at line 380 of file mcache.h. References 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 412 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]

Reimplemented in XCPQueue. Definition at line 106 of file connector.cc. References Connector::drop_, Packet::free(), and NsObject::recv(). Referenced by ARPTable::arpresolve(), XCPQueue::drop(), JoBS::dropFront(), Vq::dropPacketForECN(), DSRAgent::dropSendBuff(), JoBS::dropTail(), dsREDQueue::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(), dsREDQueue::enque(), DRR::enque(), DropTail::enque(), Demarker::enque(), aodv_rqueue::enque(), toraAgent::forward(), AODV::forward(), DSDV_Agent::forwardPacket(), DSRAgent::getRouteForPacket(), HDLC::goBackNMode(), Snoop::handle(), DSRAgent::handleFlowForwarding(), DSRAgent::handleForwarding(), HDLC::handleRR(), DSDV_Agent::lost_link(), TCPTapAgent::processpkt(), CMUPriQueue::prq_enqueue(), rtqueue::purge(), SessionTTLChecker::recv(), TTLChecker::recv(), FullTcpAgent::recv(), BayFullTcpAgent::recv(), SatLL::recv(), LL::recv(), GAFPartner::recv(), Filter::recv(), DynamicLink::recv(), AODV::recvError(), PriQueue::recvHighPriority(), HDLC::recvIncoming(), toraAgent::reset(), HDLC::reset(), Queue< T >::reset(), LinkDelay::reset(), AODV::rt_ll_failed(), AODV::rt_purge(), toraAgent::rtRoutePacket(), HDLC::selectiveRepeatMode(), AODV::sendRequest(), SatLL::sendUp(), LL::sendUp(), DropTail::shrink_queue(), 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, inherited]

Definition at line 129 of file dsred.cc. References dsREDQueue::de_drop_, Connector::drop(), and NsObject::recv(). Referenced by dsREDQueue::enque(). { if (de_drop_ != 0){ de_drop_->recv(p); } else { drop(p); } } Here is the call graph for this function:

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

Reimplemented from dsREDQueue. Definition at line 78 of file dsEdge.cc. References dsREDQueue::enque(), PolicyClassifier::mark(), and policy. { int codePt; // Mark the packet with the specified priority: //printf("before ,mark\n"); codePt = policy.mark(pkt); // printf("after ,mark\n"); dsREDQueue::enque(pkt); } Here is the call graph for this function:

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

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

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

Definition at line 263 of file dsred.cc. References hdr_ip::access(), and hdr_ip::prio(). Referenced by dsREDQueue::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 433 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, inherited]

Definition at line 392 of file dsred.cc. References statType::drops, statType::drops_CP, statType::edrops, statType::edrops_CP, statType::pkts, statType::pkts_CP, and dsREDQueue::stats. { 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 434 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 134 of file queue.h. References PacketQueue::length(), and Queue< T >::pq_. Referenced by XCPQueue::deque(), SimpleIntServ::deque(), XCPQueue::enque(), SimpleIntServ::enque(), XCPQueue::everyRTT(), PriQueue::filter(), XCPQueue::init_vars(), XCPWrapQ::queueToDeque(), REMQueue::run_updaterule(), and Snoop::snoop_data(). { 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 133 of file queue.h. References Queue< T >::qlim_. Referenced by Snoop::snoop_data(). { return qlim_; }

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

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

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

Definition at line 176 of file queue.cc. References Queue< T >::blocked_, Scheduler::clock(), Scheduler::instance(), Queue< T >::last_change_, Queue< T >::util_buf_, Queue< T >::util_records_, Queue< T >::utilization(), and Queue< T >::utilUpdate(). Referenced by QSAgent::process(). { double now = Scheduler::instance().clock(); double peak = 0; int i; // PS: if peak_utilization tracking is disabled, // return the weighed avg instead if (util_records_ == 0) return utilization(); utilUpdate(last_change_, now, blocked_); last_change_ = now; for (i = 0; i < util_records_; i++) { if (util_buf_[i] > peak) peak = util_buf_[i]; } return peak; } Here is the call graph for this function:

void dsREDQueue::printPHBTable (   )  [protected, inherited]

Definition at line 465 of file dsred.cc. References dsREDQueue::phb_, and dsREDQueue::phbEntries. { 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, inherited]

Definition at line 477 of file dsred.cc. References statType::drops, statType::drops_CP, statType::edrops, statType::edrops_CP, MAX_CP, statType::pkts, statType::pkts_CP, and dsREDQueue::stats. { 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, inherited]

Definition at line 490 of file dsred.cc. References dsREDQueue::numQueues_, dsREDQueue::pktcount, dsREDQueue::queueWeight, and dsREDQueue::slicecount. { 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, PriQueue, and XCPWrapQ. Definition at line 116 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 XCPWrapQ::recv(), and 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, inherited]

Reimplemented from Queue< T >. Definition at line 87 of file dsred.cc. References MAX_QUEUES, dsREDQueue::pktcount, dsREDQueue::qToDq, dsREDQueue::queueArrTime, dsREDQueue::queueAvgRate, dsREDQueue::slicecount, dsREDQueue::wirrqDone, and dsREDQueue::wirrTemp. { 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(); }

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

Definition at line 210 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 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, inherited]

Definition at line 269 of file dsred.cc. References redQueue::getRealLength(), dsREDQueue::numQueues_, dsREDQueue::qToDq, dsREDQueue::queuesDone, dsREDQueue::queueWeight, dsREDQueue::redq_, dsREDQueue::schedMode, schedModeRR, schedModeWIRR, schedModeWRR, dsREDQueue::wirrqDone, and dsREDQueue::wirrTemp. Referenced by dsREDQueue::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 56 of file connector.h. References NsObject::recv(), and Connector::target_. Referenced by SessionTTLChecker::recv(), TTLChecker::recv(), Trace::recv(), TraceIpMac::recv(), TraceIp::recv(), SnoopQueueEDrop::recv(), SnoopQueueTagger::recv(), SnoopQueueDrop::recv(), SnoopQueueOut::recv(), SnoopQueueIn::recv(), PktCounter::recv(), NetworkInterface::recv(), MeasureMod::recv(), Filter::recv(), Connector::recv(), CMUTrace::recv(), and AddSR::recv(). { target_->recv(p, h); } Here is the call graph for this function:

void Connector::setDropTarget (  NsObject *  dt  )  [inline, inherited]

Definition at line 51 of file connector.h. References Connector::drop_. Referenced by XCPWrapQ::command(). {drop_ = dt; }

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

Definition at line 436 of file dsred.cc. References dropTail, redQueue::mredMode, dsREDQueue::redq_, rio_c, rio_d, and wred. { 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, inherited]

Definition at line 419 of file dsred.cc. References MAX_PREC, dsREDQueue::numPrec, and dsREDQueue::redq_. Referenced by dsREDQueue::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, inherited]

Definition at line 502 of file dsred.cc. References dsREDQueue::schedMode, schedModePRI, schedModeRR, schedModeWIRR, and schedModeWRR. { 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 435 of file mcache.h. References Queue< T >::size_. Referenced by JoBS::arvAccounting(), REMQueue::deque(), dsREDQueue::deque(), XCPQueue::do_before_packet_departure(), XCPQueue::do_on_packet_arrival(), JoBS::dropFront(), JoBS::dropTail(), MediaServer::get_next_segment(), and FQ::recv(). { return size_; }

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

Definition at line 49 of file connector.h. References Connector::target(), and Connector::target_. { target_ = target; } Here is the call graph for this function:

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

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

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

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

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

Definition at line 197 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 165 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 Queue< T >::peak_utilization(), and QSAgent::process(). { 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 137 of file queue.cc. References Queue< T >::buf_slot_, Queue< T >::cur_util_, Queue< T >::old_util_, Queue< T >::period_begin_, Queue< T >::util_buf_, Queue< T >::util_check_intv_, Queue< T >::util_records_, and Queue< T >::util_weight_. Referenced by Queue< T >::peak_utilization(), 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; // PS: measuring peak utilization if (util_records_ == 0) return; // We don't track peak utilization double intv = int_end - int_begin; double tot_intv = int_begin - period_begin_; if (intv || tot_intv) { int guard = 0; // for protecting against long while loops cur_util_ = (link_state * intv + cur_util_ * tot_intv) / (intv + tot_intv); while (tot_intv + intv > util_check_intv_ && guard++ < util_records_) { period_begin_ = int_end; util_buf_[buf_slot_] = cur_util_; buf_slot_ = (buf_slot_ + 1) % util_records_; cur_util_ = link_state; intv -= util_check_intv_; } } }

---

Field Documentation

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

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

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

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

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

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

NsObject* dsREDQueue::de_drop_ [protected, inherited]

Definition at line 125 of file dsred.h. Referenced by dsREDQueue::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(), PushbackQueue::enque(), NsObject::isdebug(), NsObject::NsObject(), TfrcAgent::recv(), PushbackQueue::reportDrop(), SctpAgent::Reset(), REDQueue::reset(), DropTail::shrink_queue(), and Delayer::try_send().

NsObject* Connector::drop_ [protected, inherited]

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

int dsREDQueue::ecn_ [protected, inherited]

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

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

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

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

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

LinkDelay* dsREDQueue::link_ [protected, inherited]

Definition at line 133 of file dsred.h.

int dsREDQueue::numPrec [protected, inherited]

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

int dsREDQueue::numQueues_ [protected, inherited]

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

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

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

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

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

phbParam dsREDQueue::phb_[MAX_CP] [protected, inherited]

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

int dsREDQueue::phbEntries [protected, inherited]

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

int dsREDQueue::pktcount[MAX_QUEUES] [protected, inherited]

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

PolicyClassifier edgeQueue::policy [protected]

Definition at line 55 of file dsEdge.h. Referenced by command(), and enque().

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

Definition at line 152 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 151 of file queue.h. Referenced by Queue< T >::recv(), FQ::recv(), Queue< T >::resume(), and CBQueue::sched().

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

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

int dsREDQueue::qToDq [protected, inherited]

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

double dsREDQueue::queueArrTime[MAX_QUEUES] [protected, inherited]

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

double dsREDQueue::queueAvgRate[MAX_QUEUES] [protected, inherited]

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

double dsREDQueue::queueMaxRate[MAX_QUEUES] [protected, inherited]

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

int dsREDQueue::queuesDone [protected, inherited]

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

int dsREDQueue::queueWeight[MAX_QUEUES] [protected, inherited]

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

redQueue dsREDQueue::redq_[MAX_QUEUES] [protected, inherited]

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

int dsREDQueue::schedMode [protected, inherited]

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

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

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

int dsREDQueue::slicecount[MAX_QUEUES] [protected, inherited]

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

statType dsREDQueue::stats [protected, inherited]

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

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

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

NsObject* Connector::target_ [protected, inherited]

Definition at line 58 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(), SctpAgent::ForceSource(), toraAgent::forward(), AODV::forward(), DSDV_Agent::forwardPacket(), SensorQueryAgent::generate_query(), DSDVTriggerHandler::handle(), AckRecons::handle(), DSDV_Agent::helper_callback(), DSDV_Agent::lost_link(), OmniMcastAgent::OmniMcastAgent(), LandmarkAgent::periodic_callback(), TCPTapAgent::processpkt(), IPTapAgent::processpkt(), CMUPriQueue::prq_enqueue(), CMUPriQueue::prq_resume(), Trace::recv(), TraceIpMac::recv(), TraceIp::recv(), SRMAgent::recv(), SSMSRMAgent::recv(), SAack_Agent::recv(), Queue< T >::recv(), PingResponder::recv(), MIPEncapsulator::recv(), LmsAgent::recv(), HackLossyLink::recv(), FQ::recv(), ErrorModel::recv(), DynamicLink::recv(), DSRAgent::recv(), DelayModel::recv(), LinkDelay::recv(), CtrMcastDecap::recv(), CtrMcastEncap::recv(), CMUTrace::recv(), Trace::recvOnly(), Queue< T >::resume(), LinkDelay::send(), Connector::send(), Agent::send(), MIPBSAgent::send_ads(), SRMAgent::send_ctrl(), SSMSRMAgent::send_ctrl(), LmsSender::send_dmcast(), LmsReceiver::send_dmcast(), LmsAgent::send_downstream(), LmsSender::send_lms_pkt(), LmsReceiver::send_nak(), LmsReceiver::send_refresh(), MIPMHAgent::send_sols(), LmsSender::send_spm(), LmsAgent::send_upstream(), LandmarkAgent::SendChangedTagListUpdate(), AODV::sendError(), AODV::sendHello(), UdpAgent::sendmsg(), SRMAgent::sendmsg(), SA_Agent::sendmsg(), RTPAgent::sendmsg(), MessagePassingAgent::sendmsg(), LmsSender::sendmsg(), DSDV_Agent::sendOutBCastPkt(), SA_Agent::sendpkt(), rtProtoDV::sendpkt(), RTPAgent::sendpkt(), RTCPAgent::sendpkt(), IvsSource::sendpkt(), AODV::sendReply(), AODV::sendRequest(), TPAgent::sendto(), MessagePassingAgent::sendto(), SctpAgent::SetSource(), LmsSender::solicit_naks(), Connector::target(), toraAgent::tora_output(), and Delayer::try_send().

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

Definition at line 156 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 155 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 150 of file queue.h. Referenced by Queue< T >::Queue(), and Queue< T >::resume().

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

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

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

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

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

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

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

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

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

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

int dsREDQueue::wirrTemp[MAX_QUEUES] [protected, inherited]

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

---

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

• dsEdge.h
• dsEdge.cc

---