REDQueue Class Reference

#include <red.h>

Inheritance diagram for REDQueue:

[legend]Collaboration diagram for REDQueue:

[legend]List of all members.


Public Member Functions
	REDQueue (const char *="Drop")
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
int	command (int argc, const char const argv)
void	enque (Packet *pkt)
virtual Packet *	pickPacketForECN (Packet *pkt)
virtual Packet *	pickPacketToDrop ()
Packet *	deque ()
void	initialize_params ()
void	reset ()
void	run_estimator (int nqueued, int m)
double	estimator (int nqueued, int m, double ave, double q_w)
void	updateMaxP (double new_ave, double now)
void	updateMaxPFeng (double new_ave)
int	drop_early (Packet *pkt)
double	modify_p (double p, int count, int count_bytes, int bytes, int mean_pktsize, int wait, int size)
double	calculate_p_new (double v_ave, double th_max, int gentle, double v_a, double v_b, double v_c, double v_d, double max_p)
double	calculate_p (double v_ave, double th_max, int gentle, double v_a, double v_b, double v_c, double v_d, double max_p_inv)
virtual void	reportDrop (Packet *pkt)
void	print_summarystats ()
int	bcount_ ()
void	trace (TracedVar *)
void	print_edp ()
void	print_edv ()
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	summarystats_
LinkDelay *	link_
int	fifo_
PacketQueue *	q_
int	qib_
NsObject *	de_drop_
NsObject *	EDTrace
char	traceType [20]
Tcl_Channel	tchan_
TracedInt	curq_
int	drop_tail_
int	drop_front_
int	drop_rand_
int	ns1_compat_
edp	edp_
int	doubleq_
int	dqthresh_
int	idle_
double	idletime_
edv	edv_
int	first_reset_
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

REDQueue::REDQueue ( const char * = "Drop" )

Definition at line 96 of file red.cc.
References edp::adaptive, edp::alpha, edp::beta, edp::bottom, edp::bytes, edp::cautious, edv::cur_max_p, curq_, drop_front_, drop_rand_, drop_tail_, edp_, edv_, edp::feng_adaptive, edp::gentle, edp::idle_pktsize, edp::interval, edp::mark_p, edp::max_p_inv, edp::mean_pktsize, ns1_compat_, Queue< T >::pq_, print_edp(), print_edv(), q_, edp::q_w, qib_, edp::setbit, summarystats_, edp::targetdelay, edp::th_max_pkts, edp::th_min_pkts, edp::top, trace(), traceType, edv::v_ave, edv::v_prob1, and edp::wait.

00096 : link_(NULL), de_drop_(NULL), EDTrace(NULL), tchan_(0), idle_(1) 00097 { 00098 // printf("Making trace type %s\n", trace); 00099 if (strlen(trace) >=20) { 00100 printf("trace type too long - allocate more space to traceType in red.h and recompile\n"); 00101 exit(0); 00102 } 00103 strcpy(traceType, trace); 00104 bind_bool("bytes_", &edp_.bytes); // boolean: use bytes? 00105 bind_bool("queue_in_bytes_", &qib_); // boolean: q in bytes? 00106 // _RENAMED("queue-in-bytes_", "queue_in_bytes_"); 00107 00108 bind("thresh_", &edp_.th_min_pkts); // minthresh 00109 bind("maxthresh_", &edp_.th_max_pkts); // maxthresh 00110 bind("mean_pktsize_", &edp_.mean_pktsize); // avg pkt size 00111 bind("idle_pktsize_", &edp_.idle_pktsize); // avg pkt size for idles 00112 bind("q_weight_", &edp_.q_w); // for EWMA 00113 bind("adaptive_", &edp_.adaptive); // 1 for adaptive red 00114 bind("cautious_", &edp_.cautious); // 1 for cautious marking 00115 bind("alpha_", &edp_.alpha); // adaptive red param 00116 bind("beta_", &edp_.beta); // adaptive red param 00117 bind("interval_", &edp_.interval); // adaptive red param 00118 bind("feng_adaptive_",&edp_.feng_adaptive); // adaptive red variant 00119 bind("targetdelay_", &edp_.targetdelay); // target delay 00120 bind("top_", &edp_.top); // maximum for max_p 00121 bind("bottom_", &edp_.bottom); // minimum for max_p 00122 bind_bool("wait_", &edp_.wait); 00123 bind("linterm_", &edp_.max_p_inv); 00124 bind("mark_p_", &edp_.mark_p); 00125 bind_bool("setbit_", &edp_.setbit); // mark instead of drop 00126 bind_bool("gentle_", &edp_.gentle); // increase the packet 00127 // drop prob. slowly 00128 // when ave queue 00129 // exceeds maxthresh 00130 00131 bind_bool("summarystats_", &summarystats_); 00132 bind_bool("drop_tail_", &drop_tail_); // drop last pkt 00133 // _RENAMED("drop-tail_", "drop_tail_"); 00134 00135 bind_bool("drop_front_", &drop_front_); // drop first pkt 00136 // _RENAMED("drop-front_", "drop_front_"); 00137 00138 bind_bool("drop_rand_", &drop_rand_); // drop pkt at random 00139 // _RENAMED("drop-rand_", "drop_rand_"); 00140 00141 bind_bool("ns1_compat_", &ns1_compat_); // ns-1 compatibility 00142 // _RENAMED("ns1-compat_", "ns1_compat_"); 00143 00144 bind("ave_", &edv_.v_ave); // average queue sie 00145 bind("prob1_", &edv_.v_prob1); // dropping probability 00146 bind("curq_", &curq_); // current queue size 00147 bind("cur_max_p_", &edv_.cur_max_p); // current max_p 00148 00149 00150 q_ = new PacketQueue(); // underlying queue 00151 pq_ = q_; 00152 //reset(); 00153 #ifdef notdef 00154 print_edp(); 00155 print_edv(); 00156 #endif 00157 00158 }