SRR Class Reference

Inheritance diagram for SRR:

[legend]Collaboration diagram for SRR:

[legend]List of all members.

Public Member Functions
	SRR ()
virtual int	command (int argc, const char *const *argv)
Packet *	deque (void)
void	enque (Packet *pkt)
void	clear ()
PacketSRR *	getMaxflow ()
int	length ()
int	blength ()
int	add_to_WM (int queueid, int weight)
int	del_from_WM (int queueid, int weight)
wm_node *	getNextNode ()
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	byteLength ()
virtual double	utilization (void)
virtual void	reset ()
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,...)
Public Attributes
int	maxqueuenumber_
int	blimit_
int	bytecnt
int	pktcnt
int	flwcnt
int	last_queueid
int	last_size
PacketSRR	srr [MAXFLOW]
int	f2q [MAXFLOW]
int	private_rate [MAXFLOW]
int	mtu_
int	granularity_
int	maxRate
int	minRate
WSS	wss
wm_node	wmHead [MAXWSSORDER]
wm_node	wmTail [MAXWSSORDER]
wm_node *	pwmCurr
wm_node *	pRowHead [MAXFLOW]
wm_node *	pRowTail [MAXFLOW]
int	wmEmptyFlag
int	maxColumn
int	currMaxColumn
int	min_quantum
Protected Member Functions
void	reset ()
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
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

SRR::SRR (   )

Definition at line 216 of file srr.cc. References blimit_, bytecnt, currMaxColumn, f2q, flwcnt, granularity_, WSS::init(), last_queueid, last_size, maxColumn, MAXFLOW, maxqueuenumber_, maxRate, MAXWSSORDER, min_quantum, minRate, mtu_, wm_node::next, pktcnt, wm_node::prev, private_rate, pRowHead, pRowTail, pwmCurr, wm_node::queueid, wm_node::weight, wmEmptyFlag, wmHead, wmTail, and wss. { int i; maxqueuenumber_ = 10; blimit_ = 25000; mtu_= 1000; //1000 bytes quantum at default setting granularity_ = 1000; //default to 1K bit/s last_queueid = -1; // -1 means that SRR does not have a previous deque operation last_size = 0; flwcnt = 0; // init bytecnt = 0; pktcnt = 0; min_quantum = 1000; pwmCurr = 0; // at first, pwmCurr points to NULL for(i=0; i<MAXFLOW; i++) { private_rate[i] = granularity_; //default quantum value for each flow f2q[i]=0; // default queue id for all the flow // or it will not works right at the default config } maxRate = 100000000; //100Mbps minRate = 1000; //1kbps // init the WM double queues here too. for(i=0;i<MAXWSSORDER;i++){ wmHead[i].prev=NULL; wmHead[i].next=&wmTail[i]; wmTail[i].prev=&wmHead[i]; wmTail[i].next=NULL; wmHead[i].queueid=wmTail[i].queueid=-1; // wmHead[i].weight=wmHead[i].weight=i; } for (i=0;i<MAXFLOW; i++) pRowHead[i]= pRowTail[i] = NULL; wmEmptyFlag=1; // it is empty at first wss.init(MAXWSSORDER); // create the Weight Spread Sequence currMaxColumn = -1; maxColumn=0; // allow the TCL scripts to change the following values bind("maxqueuenumber_",&maxqueuenumber_); //it is the max queuenumber set in the TCL script bind("mtu_", &mtu_); // set the Max Transfer Unit of the output link bind("granularity_", &granularity_); // set the rate allocation granularity of the // all the flows. bind("blimit_",&blimit_); }

Here is the call graph for this function:

---

Member Function Documentation

int SRR::add_to_WM (  int  queueid, int  weight )

Definition at line 474 of file srr.cc. References currMaxColumn, flwcnt, WSS::get_ptr(), maxColumn, wm_node::next, wm_node::prev, pRowHead, pRowTail, pwmCurr, WSS::set_ptr(), wm_node::sibling, wm_node::weight, wmEmptyFlag, wmTail, and wss. Referenced by enque(). { struct wm_node *pNode; int i; //int j=maxColumn; //int temp=weight; //int flag=0; int old_colno = currMaxColumn; if(weight==0) { fprintf(stderr, "add_to_WM: weight should not be zero"); exit(1); } if(weight > ( (1<<(maxColumn+1))-1) ) { fprintf(stderr, "add_to_WM: weight too big"); exit(1); } // add to the WM // adjust currMaxColumn // if it is a first active flow, put the pwmPtr for(i=maxColumn; i>=0; i--) { if (weight & (1<<i) ) { // // add to queueid= i; wmHead[queueid], wmTail[queueid] pNode=(struct wm_node*)malloc(sizeof(struct wm_node)); if(pNode==NULL) { fprintf(stderr, "no memeory to create WM node"); exit(2); } pNode->queueid = queueid; pNode->weight = i; pNode->sibling = NULL; if(pRowTail[queueid] == NULL){ pRowHead[queueid]= pRowTail[queueid] = pNode; }else{ pRowTail[queueid]->sibling = pNode; pRowTail[queueid] = pNode; } if( pwmCurr && (pwmCurr->weight == i) ){ pNode-> prev = pwmCurr->prev; pNode-> next = pwmCurr; (pwmCurr->prev)->next = pNode; pwmCurr->prev = pNode; }else { pNode->prev = wmTail[i].prev; pNode->next = &wmTail[i]; (wmTail[i].prev)->next = pNode; wmTail[i].prev = pNode; } if(currMaxColumn < i) currMaxColumn = i; // adjust the current max column number if(wmEmptyFlag == 1) { wmEmptyFlag=0; if(pwmCurr == NULL) // we should let it points to the correct place. pwmCurr=pNode; } } } if ( old_colno < currMaxColumn ) { if(old_colno >= 0){ // if(old_colno > 0){ int pc = wss.get_ptr () + 1; pc = pc << (currMaxColumn - old_colno); wss.set_ptr ( pc -1); // printf("set_ptr in add_to_wm: ptr:%d\n", pc-1); // printf("old column no: %d %d\n", old_colno, currMaxColumn); } } //printf("in add_to_wm: k:%d, j:%d\n", currMaxColumn, old_colno); ++flwcnt; return 0; }

Here is the call graph for this function:

int SRR::blength (   )  [inline]

Definition at line 199 of file srr.cc. References bytecnt. { return bytecnt; }

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:

void SRR::clear (   )

Definition at line 456 of file srr.cc. References maxqueuenumber_, PacketSRR::pkts, and srr. { PacketSRR *q =srr; int i = maxqueuenumber_; if (!q) return; while (i--) { if (q->pkts) { fprintf(stderr, "Changing non-empty flow from srr\n"); exit(1); } ++q; } }

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

Reimplemented from Connector. Definition at line 752 of file srr.cc. References blimit_, bytecnt, Connector::command(), f2q, getOrder(), granularity_, maxColumn, MAXFLOW, MAXQUEUE, maxqueuenumber_, maxRate, MAXWSSORDER, min_quantum, minRate, mtu_, and private_rate. { if (argc==3) { if (strcmp(argv[1], "blimit") == 0) { blimit_ = atoi(argv[2]); if (bytecnt > blimit_) { fprintf (stderr,"More packets in buffer than the new limit"); exit (1); } return (TCL_OK); } if (strcmp(argv[1], "maxqueuenumber") == 0) { //clear(); maxqueuenumber_ = atoi(argv[2]); return (TCL_OK); } if (strcmp(argv[1],"mtu")==0) { mtu_= atoi(argv[2]); return (TCL_OK); } if (strcmp(argv[1], "granularity")==0) { granularity_ = atoi(argv[2]); return (TCL_OK); } } if (argc == 4) { if(!strcmp(argv[1],"setrate")) { int rate; int queue,success=0; int temp; success += sscanf(argv[2],"%d",&queue); success += sscanf(argv[3],"%d",&rate); if(success!=2){ fprintf(stderr, "SRR setrate ??"); exit(0); exit(1); } if ( queue>MAXQUEUE ) { fprintf(stderr,"queue id out of range"); exit(0); } min_quantum= min_quantum<rate ? min_quantum:rate; private_rate[queue]=rate; if(private_rate[queue]<minRate) private_rate[queue]=minRate; if(private_rate[queue]>maxRate){ fprintf(stderr, "Rate too hight!\n"); exit(1); } success=private_rate[queue]/granularity_; if(success==0) success=1; /*if(private_rate[queue]%granularity_) success++;*/ temp=getOrder(success); //now we have the order of the WSS if(maxColumn<temp){ maxColumn=temp; } #ifdef DEBUG_SRR printf("maxColumn=%d\n", maxColumn), fflush(0); #endif if(maxColumn>(MAXWSSORDER-1)){ //the order of max band flow is too big! fprintf(stderr, "granularity too small or band too big!"); exit(2); } return (TCL_OK); } else if(!strcmp(argv[1],"setqueue")) { int queue,flow,success=0; success += sscanf(argv[2],"%d",&flow); success += sscanf(argv[3],"%d",&queue); if(success==2) { if ( !(queue<MAXQUEUE) ) { fprintf(stderr,"queue id out of range");exit(1); } if ( !(flow<MAXFLOW) ) { fprintf(stderr,"flow id out of range"); exit(1); } f2q[flow]=queue; 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 SRR::del_from_WM (  int  queueid, int  weight )

Definition at line 574 of file srr.cc. References currMaxColumn, flwcnt, WSS::get(), WSS::get_ptr(), WSS::inc_ptr(), last_queueid, wm_node::next, wm_node::prev, pRowHead, pRowTail, pwmCurr, wm_node::queueid, WSS::set_ptr(), wm_node::sibling, wm_node::weight, wmEmptyFlag, wmHead, wmTail, and wss. Referenced by deque(). { struct wm_node *pNode, *pNode2; int i; int wss_term; int temp; if(pwmCurr->queueid==queueid) // we adjust pwmCurr before we delete the row { if (pwmCurr->next != &wmTail[pwmCurr->weight]) pwmCurr = pwmCurr->next ; else pwmCurr = NULL; } /* for(i=0;i<=currMaxColumn;i++) // travel all double links, and delete the node whose id is queueid { pNode=wmHead[i].next; while(pNode!=&wmTail[i]){ if(pNode->queueid==queueid){ //yes, we get one. //remove it from the link, and free the node. (pNode->prev)->next=pNode->next; (pNode->next)->prev=pNode->prev; free(pNode); break; } else pNode=pNode->next; } } */ pNode = pRowHead[queueid]; while (pNode){ (pNode->prev)->next=pNode->next; (pNode->next)->prev=pNode->prev; pNode2= pNode; pNode = pNode->sibling; free(pNode2); } pRowHead[queueid] = pRowTail[queueid] = NULL; // we should adjust currMaxColumn, //and if currMaxColumn becomes less, we should also adjust WSS's pointer int old_colno = currMaxColumn; for(i=currMaxColumn;i>=0;i--) { if(wmHead[i].next != &wmTail[i]) { currMaxColumn=i; break; } } if(i<0) { // it is empty now. #ifdef DEBUG_SRR //printf("WM empty\n"); #endif wmEmptyFlag=1; currMaxColumn=-1; pwmCurr=NULL; last_queueid=-1; wss.set_ptr (0); // reset the WSS sequence pointer to 0; goto rr; } else if ( currMaxColumn < old_colno) { int pc = wss.get_ptr () +1; //printf("pc = %d \n", pc); int mul = 1 << (old_colno - currMaxColumn ); int tmpc = pc / mul; if (pc % mul){ tmpc += 1; if (tmpc > ((1<<(currMaxColumn+1) )- 1) ) tmpc = 1; } wss.set_ptr (tmpc -1); //printf("set_ptr in del_from__wm: ptr:%d\n", tmpc-1); //printf("k:%d j:%d\n", currMaxColumn, old_colno); } if (pwmCurr == NULL){ loop: wss_term=wss.get(currMaxColumn+1); wss.inc_ptr (currMaxColumn+1 ); temp = currMaxColumn+1-wss_term; // try to point pwmCurr to the right place. if( wmHead[temp].next != &wmTail[temp]) { pwmCurr=wmHead[temp].next; }else goto loop; } rr: --flwcnt; return 0; }

Here is the call graph for this function:

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 * SRR::deque (  void   )  [virtual]

Implements Queue< T >. Definition at line 338 of file srr.cc. References hdr_cmn::access(), hdr_ip::access(), bytecnt, PacketSRR::deficitCounter, del_from_WM(), PacketSRR::deque(), f2q, hdr_ip::flowid(), getNextNode(), granularity_, last_queueid, last_size, PacketSRR::lookup(), mtu_, pktcnt, private_rate, pwmCurr, wm_node::queueid, hdr_cmn::size(), srr, PacketSRR::turn, and wm_node::weight. { hdr_cmn *ch; hdr_ip *iph; Packet *pkt=0; int flowid; int queueid; PacketSRR *pP; // static int dcnt = 0; // if(dcnt <20){ // printf(" in dequeue: %lf \n", Scheduler::instance().clock() ); // dcnt++; // } #ifdef DEBUG_SRR printf(" in deque\n"); #endif if(last_queueid>=0){ //printf("last size=%d\n ", last_size); srr[last_queueid].bcount -= last_size; srr[last_queueid].pkts-=1; --pktcnt; bytecnt -= last_size; if (srr[last_queueid].pkts == 0) { srr[last_queueid].turn=0; srr[last_queueid].deficitCounter=0; // delete the queue from SRR del_from_WM(last_queueid, private_rate[last_queueid]/granularity_ ); } } assert(pktcnt>=0); if (pktcnt==0) { // fprintf (stderr,"No active flow\n"); last_queueid=-1; return(0); } if(pwmCurr == NULL){ printf("wrong, pwmCurr is NULL\n"); exit(0); } //printf("pktcnt=%d\n", pktcnt); while (!pkt) { if(pwmCurr->queueid==-1){ // it should never happen fprintf(stderr,"pwmCurr points to head or tail\n"); fprintf(stderr, "weight:%d", pwmCurr->weight); exit(0); } pP=&srr[pwmCurr->queueid]; pkt=pP->lookup(0); if(pkt==0){ fprintf(stderr, "wrong place, should never be here\n"); exit(2); } iph = hdr_ip::access(pkt); flowid=iph->flowid(); queueid= f2q[flowid]; // get the corresponding queue id assert(queueid== pwmCurr->queueid); if (!pP->turn) { pP->deficitCounter+= mtu_; // each queue shares the same quantum! // this is the difference between DRR! pP->turn=1; } ch=hdr_cmn::access(pkt); if (pP->deficitCounter >= ch->size()) { pP->deficitCounter -= (ch->size()); pkt=pP->deque(); last_size=ch->size( ); // pP->bcount -= ch->size(); // --pP->pkts; // --pktcnt; // bytecnt -= ch->size(); // if (pP->pkts == 0) { // pP->turn=0; // pP->deficitCounter=0; // delete the queue from SRR // del_from_WM(queueid, private_rate[queueid]/granularity_ ); //getNextNode(); // } #ifdef DEBUG_SRR printf("deque a packet, id=%d, size=%d\n", queueid, last_size); #endif last_queueid=queueid; return pkt; } else { pP->turn=0; // pwmCurr should be adjusted. getNextNode( ); pkt=0; } } return 0; // not reached }

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(), dsREDQueue::edrop(), Vq::enque(), 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(), 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 SRR::enque (  Packet *  pkt  )  [virtual]

Implements Queue< T >. Definition at line 274 of file srr.cc. References hdr_ip::access(), hdr_cmn::access(), add_to_WM(), PacketSRR::bcount, bytecnt, PacketSRR::deficitCounter, Connector::drop(), PacketSRR::enque(), f2q, hdr_ip::flowid(), granularity_, maxqueuenumber_, pktcnt, PacketSRR::pkts, private_rate, Queue< T >::qlim_, hdr_cmn::size(), and srr. { PacketSRR *q; //PacketSRR *remq; int flowid, queueid; int weight; hdr_cmn *ch=hdr_cmn::access(pkt); hdr_ip *iph = hdr_ip::access(pkt); flowid= iph->flowid(); //get the flowid queueid= f2q[flowid]; // get the corresponding queue id if(queueid > maxqueuenumber_) { fprintf(stderr, "queueid too big\n"); exit(1); } #ifdef DEBUG_SRR printf(" in enque\n"); fflush(0); #endif // we drop packets from the longest queue /* if( bytecnt+ ch->size() > blimit_){ drop(pkt); return; } */ q=&srr[queueid]; if(q->pkts==qlim_){ drop(pkt); return; } q->enque(pkt); ++q->pkts; ++pktcnt; q->bcount += ch->size(); bytecnt +=ch->size(); if (q->pkts==1) { //add to the WM // adjust currMaxColumn // if it is a first active flow, put the pwmPtr // all the above works are done in add_to_WM weight= private_rate[queueid]; weight/=granularity_; add_to_WM(queueid, weight); q->deficitCounter=0; } }

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:

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_; }

PacketSRR* SRR::getMaxflow (   )  [inline]

Definition at line 171 of file srr.cc. References PacketSRR::bcount, maxqueuenumber_, and srr. { //returns flow with max bytes int j,i; PacketSRR *tmp=0; PacketSRR *maxflow=0; int bcount=0; for (i=0;i<maxqueuenumber_;i++) { tmp=&srr[i]; if (tmp->bcount > bcount){ bcount= tmp->bcount; maxflow=tmp;j=i; } } if(maxflow==0){ fprintf(stderr, "getMaxflow, err"); exit(1); } return maxflow; }

struct wm_node * SRR::getNextNode (   )

Definition at line 689 of file srr.cc. References bytecnt, currMaxColumn, WSS::get(), WSS::inc_ptr(), wm_node::next, pwmCurr, wm_node::queueid, wm_node::weight, wmHead, wmTail, and wss. Referenced by deque(). { //struct wm_node *pNode; int queueid; int weight; int wss_term; int temp; if(bytecnt==0){ // printf("getNextNode, pwmCurr = NULL, wmEmptyFlag=%d\n", wmEmptyFlag); return NULL; } queueid=pwmCurr->queueid; weight= pwmCurr->weight; if(pwmCurr->next != &wmTail[weight]){ // not the tail pwmCurr=pwmCurr ->next; } else{ if (currMaxColumn==-1){ fprintf(stderr, "getNextNode, empty WM"); exit(0); } again: wss_term=wss.get(currMaxColumn+1); wss.inc_ptr (currMaxColumn+1 ); temp = currMaxColumn+1-wss_term; // wss_term according to currMaxColumn+1-wss_term queue if( wmHead[temp].next != &wmTail[temp]) { pwmCurr=wmHead[temp].next; }else goto again; } return pwmCurr; }

Here is the call graph for this function:

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_; }

int SRR::length (   )  [inline]

Reimplemented from Queue< T >. Definition at line 194 of file srr.cc. References pktcnt. { return pktcnt; }

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

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

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(). {};

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

Reimplemented from NsObject. Reimplemented in dsREDQueue, CBQueue, DropTail, PIQueue, RedPDQueue, REDQueue, REMQueue, and RIOQueue. Definition at line 349 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; } head_ = NULL; }

Here is the call graph for this function:

template<class T> void Queue< T >::reset (   )  [protected, virtual, inherited]

Reimplemented from NsObject. Reimplemented in dsREDQueue, CBQueue, DropTail, PIQueue, RedPDQueue, REDQueue, REMQueue, and RIOQueue. Definition at line 174 of file queue.cc. References Queue< T >::deque(), Connector::drop(), Queue< T >::total_time_, and Queue< T >::true_ave_. Referenced by REDQueue::reset(), PIQueue::reset(), dsREDQueue::reset(), and DropTail::reset(). { Packet* p; total_time_ = 0.0; true_ave_ = 0.0; while ((p = deque()) != 0) drop(p); }

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:

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:

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(), dsREDQueue::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

int SRR::blimit_

Definition at line 130 of file srr.cc. Referenced by command(), and SRR().

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().

int SRR::bytecnt

Definition at line 131 of file srr.cc. Referenced by blength(), command(), deque(), enque(), getNextNode(), and SRR().

int SRR::currMaxColumn

Definition at line 167 of file srr.cc. Referenced by add_to_WM(), del_from_WM(), getNextNode(), and SRR().

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 SRR::f2q[MAXFLOW]

Definition at line 140 of file srr.cc. Referenced by command(), deque(), enque(), and SRR().

int SRR::flwcnt

Definition at line 133 of file srr.cc. Referenced by add_to_WM(), del_from_WM(), and SRR().

int SRR::granularity_

Definition at line 144 of file srr.cc. Referenced by command(), deque(), enque(), and SRR().

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().

int SRR::last_queueid

Definition at line 135 of file srr.cc. Referenced by del_from_WM(), deque(), and SRR().

int SRR::last_size

Definition at line 136 of file srr.cc. Referenced by deque(), and SRR().

int SRR::maxColumn

Definition at line 164 of file srr.cc. Referenced by add_to_WM(), command(), and SRR().

int SRR::maxqueuenumber_

Definition at line 129 of file srr.cc. Referenced by clear(), command(), enque(), getMaxflow(), and SRR().

int SRR::maxRate

Definition at line 145 of file srr.cc. Referenced by command(), and SRR().

int SRR::min_quantum

Definition at line 169 of file srr.cc. Referenced by command(), and SRR().

int SRR::minRate

Definition at line 146 of file srr.cc. Referenced by command(), and SRR().

int SRR::mtu_

Definition at line 142 of file srr.cc. Referenced by command(), deque(), and SRR().

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().

int SRR::pktcnt

Definition at line 132 of file srr.cc. Referenced by deque(), enque(), length(), and SRR().

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().

int SRR::private_rate[MAXFLOW]

Definition at line 141 of file srr.cc. Referenced by command(), deque(), enque(), and SRR().

struct wm_node* SRR::pRowHead[MAXFLOW]

Definition at line 158 of file srr.cc. Referenced by add_to_WM(), del_from_WM(), and SRR().

struct wm_node* SRR::pRowTail[MAXFLOW]

Definition at line 159 of file srr.cc. Referenced by add_to_WM(), del_from_WM(), and SRR().

struct wm_node* SRR::pwmCurr

Definition at line 156 of file srr.cc. Referenced by add_to_WM(), del_from_WM(), deque(), getNextNode(), and SRR().

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(), 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().

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().

PacketSRR SRR::srr[MAXFLOW]

Definition at line 138 of file srr.cc. Referenced by clear(), deque(), enque(), and getMaxflow().

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().

int SRR::wmEmptyFlag

Definition at line 162 of file srr.cc. Referenced by add_to_WM(), del_from_WM(), and SRR().

struct wm_node SRR::wmHead[MAXWSSORDER]

Definition at line 154 of file srr.cc. Referenced by del_from_WM(), getNextNode(), and SRR().

struct wm_node SRR::wmTail[MAXWSSORDER]

Definition at line 155 of file srr.cc. Referenced by add_to_WM(), del_from_WM(), getNextNode(), and SRR().

class WSS SRR::wss

Definition at line 148 of file srr.cc. Referenced by add_to_WM(), del_from_WM(), getNextNode(), and SRR().

---

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

• srr.cc

---