JoBS Class Reference

#include <jobs.h>

Inheritance diagram for JoBS:

[legend]Collaboration diagram for JoBS:

[legend]List of all members.

Public Member Functions
	JoBS ()
virtual int	command (int argc, const char *const *argv)
void	enque (Packet *)
Packet *	deque ()
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	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	link_id_
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
long	total_backlog_Pkts_
long	total_backlog_Bits_
double	mean_pkt_size_
int	drop_front_
int	trace_hop_
int	adc_resolution_type_
int	shared_buffer_
LinkDelay *	link_
char *	file_name_
int	sampling_period_
PacketQueue *	cls_ [NO_CLASSES+1]
int	concerned_RDC_ [NO_CLASSES+1]
int	concerned_RLC_ [NO_CLASSES+1]
int	concerned_ADC_ [NO_CLASSES+1]
int	concerned_ALC_ [NO_CLASSES+1]
int	concerned_ARC_ [NO_CLASSES+1]
double	RDC_ [NO_CLASSES+1]
double	RLC_ [NO_CLASSES+1]
double	ADC_ [NO_CLASSES+1]
double	ALC_ [NO_CLASSES+1]
double	ARC_ [NO_CLASSES+1]
double	loss_prod_others_ [NO_CLASSES+1]
double	prod_others_ [NO_CLASSES+1]
double	service_rate_ [NO_CLASSES+1]
double	current_loss_ [NO_CLASSES+1]
double	Rin_ [NO_CLASSES+1]
double	Rout_ [NO_CLASSES+1]
double	Rout_th_ [NO_CLASSES+1]
double	Arrival_ [NO_CLASSES+1]
double	last_rate_update_ [NO_CLASSES+1]
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_
Private Member Functions
void	updateError ()
double	projDelay (int)
double *	assignRateDropsADC ()
double *	adjustRatesRDC ()
int	minRatesNeeded (int)
void	arvAccounting (Packet *)
int	pickDroppedRLC (int)
void	dropTail (int, int)
void	dropFront (int, int)
int	enforceWC ()
void	updateStats (Packet *, int)
Private Attributes
int	idle_
double	idletime_
int	pkt_count_
double	min_share_
double	last_arrival_
double	sliding_inter_
double	sliding_avg_pkt_size_
double	sliding_arv_pkts_
double	sliding_arv_pkts_c [NO_CLASSES+1]
double	sliding_serviced_pkts_ [NO_CLASSES+1]
double	sliding_serviced_bits_ [NO_CLASSES+1]
double	sliding_class_service_rate_ [NO_CLASSES+1]
double	sliding_class_delay_ [NO_CLASSES+1]
double	last_xmit_ [NO_CLASSES+1]
long	backlog_Bits_ [NO_CLASSES+1]
long	backlog_Pkts_ [NO_CLASSES+1]
double	error_ [NO_CLASSES+1]
double	min_rate_ [NO_CLASSES+1]
double	min_drop_ [NO_CLASSES+1]
double	max_drop_ [NO_CLASSES+1]
double	Rout_last_up_ [NO_CLASSES+1]
double	avg_elapsed_ [NO_CLASSES+1]
double	excess_drops_ [NO_CLASSES+1]
double	util_
double	Kp_static_
double	Kp_dynamic_
int	ABS_present_
double	monitoring_window_
double	last_monitor_update_
FILE *	hop_trace_

---

Constructor & Destructor Documentation

JoBS::JoBS (   )

Definition at line 63 of file jobs.cc. References ABS_present_, ADC_, adc_resolution_type_, ALC_, avg_elapsed_, backlog_Bits_, backlog_Pkts_, cls_, current_loss_, drop_front_, error_, excess_drops_, FALSE, idle_, INFINITY, last_arrival_, last_monitor_update_, last_rate_update_, last_xmit_, max_drop_, mean_pkt_size_, min_drop_, min_rate_, monitoring_window_, NO_CLASSES, pkt_count_, RDC_, Rin_, RLC_, Rout_, Rout_last_up_, Rout_th_, service_rate_, shared_buffer_, sliding_arv_pkts_, sliding_arv_pkts_c, sliding_class_delay_, sliding_class_service_rate_, sliding_serviced_bits_, sliding_serviced_pkts_, total_backlog_Bits_, total_backlog_Pkts_, trace_hop_, and util_. : link_(NULL) { for (int i=1; i<=NO_CLASSES; i++) cls_[i] = new PacketQueue; bind_bool("drop_front_", &drop_front_); bind_bool("trace_hop_", &trace_hop_); bind("mean_pkt_size_", &mean_pkt_size_); // avg pkt size bind("adc_resolution_type_", &adc_resolution_type_); bind_bool("shared_buffer_", &shared_buffer_); total_backlog_Pkts_ = 0; total_backlog_Bits_ = 0; pkt_count_ = 0; idle_ = 1; ABS_present_ = FALSE; monitoring_window_ = 0; last_arrival_ = 0; last_monitor_update_ = 0; sliding_arv_pkts_=0; util_ = 0; for (int i=1; i<=NO_CLASSES; i++) { RDC_[i] = (double)i; RLC_[i] = (double)i; ADC_[i] = INFINITY; ALC_[i] = INFINITY; sliding_serviced_pkts_[i] = 0; sliding_serviced_bits_[i] = 0; sliding_arv_pkts_c[i] = 0; sliding_class_delay_[i] = 0; sliding_class_service_rate_[i] = 0; last_xmit_[i] = 0; avg_elapsed_[i] = 0.0; excess_drops_[i] = 0.0; Rout_last_up_[i] = 0.0; min_drop_[i] = 0.0; max_drop_[i] = 1.0; error_[i] = 0.0; min_rate_[i] = 0.0; backlog_Pkts_[i] = 0; backlog_Bits_[i] = 0; service_rate_[i] = 0; current_loss_[i] = 0; Rout_[i] = 0; Rin_[i] = 0; Rout_th_[i] = 0; last_rate_update_[i] = 0; } }

---

Member Function Documentation

double * JoBS::adjustRatesRDC (   )  [private]

Definition at line 558 of file jobs.cc. References Scheduler::clock(), cls_, concerned_RDC_, error_, PacketQueue::head(), Scheduler::instance(), Kp_dynamic_, Kp_static_, link_, max, min_rate_, min_share_, NO_CLASSES, pow(), PRECISION_ERROR, Rin_, service_rate_, updateError(), and util_. Referenced by enque(). { int i, j; int RDC_Classes, activeClasses; double* result; double credit, available, lower_bound, upper_bound; double bk; double cur_time; cur_time = Scheduler::instance().clock(); activeClasses = 0; RDC_Classes = 0; upper_bound = link_ -> bandwidth(); for (i = 1; i <= NO_CLASSES; i++) if (cls_[i]->head() != NULL) { activeClasses++; if (concerned_RDC_[i]) RDC_Classes++; else upper_bound -= service_rate_[i]; } result = new double[NO_CLASSES+1]; if (result == NULL) return NULL; for (i = 0; i <= NO_CLASSES; i++) result[i] = 0; if (upper_bound < PRECISION_ERROR || activeClasses == 0) return result; credit = 0; lower_bound = 0; updateError(); min_share_ = 1.0; bk = 0; for (i = 1; i <= NO_CLASSES; i++) if (concerned_RDC_[i]) bk += Rin_[i]; for (i = 1; i <= NO_CLASSES; i++) if ((double)Rin_[i]/(double)bk < min_share_) min_share_ = (double)Rin_[i]/(double)bk; /* * note that the formula for Kp is slightly different * from the formula derived in CS-2001-21. * the formula used here provides better results * at the expense of more complicated computations. */ Kp_dynamic_ = Kp_static_*pow(upper_bound, 2.)*min_share_*util_*max(util_, 1.0); credit = 0; for (i = 1; i <= NO_CLASSES; i++) { if ((cls_[i]->head() != NULL)&&(concerned_RDC_[i])) { result[i] = Kp_dynamic_*(error_[i]); } } // saturation for (i = 1; i <= NO_CLASSES; i++) if (cls_[i]->head() != NULL) { if (concerned_RDC_[i]) { lower_bound += max(0, min_rate_[i]); } } for (i = 1; i <= NO_CLASSES; i++) { if ((concerned_RDC_[i])&&(result[i] + service_rate_[i] > upper_bound)) { for (j = 0; j <= NO_CLASSES; j++) { if (concerned_RDC_[j]) { if (j == i) result[j] = (upper_bound-service_rate_[j]) + min_rate_[j] - lower_bound; else result[j] = -service_rate_[j]+min_rate_[j]; } } return result; } if (concerned_RDC_[i] && result[i] + service_rate_[i] < min_rate_[i]) { credit += service_rate_[i]+result[i]-min_rate_[i]; // "credit" is in fact a negative number result[i] = -service_rate_[i]+min_rate_[i]; } } for (i = NO_CLASSES; (i > 0)&&(credit < 0); i--) { if ((cls_[i]->head() != NULL)&&(concerned_RDC_[i])) { available = result[i] + service_rate_[i]-min_rate_[i]; if (available >= -credit) { result[i] += credit; credit = 0; } else { result[i] -= available; credit += available; } } } return result; }

Here is the call graph for this function:

void JoBS::arvAccounting (  Packet *   )  [private]

Definition at line 1120 of file jobs.cc. References hdr_ip::access(), hdr_cmn::access(), Arrival_, avg_elapsed_, backlog_Bits_, backlog_Pkts_, Scheduler::clock(), cls_, current_loss_, PacketQueue::head(), Scheduler::instance(), last_rate_update_, max, max_drop_, min, min_drop_, NO_CLASSES, Rin_, Rout_, Rout_th_, service_rate_, Queue< T >::size(), total_backlog_Bits_, and total_backlog_Pkts_. Referenced by enque(). { int i; double cur_time; hdr_cmn* cm_h; hdr_cmn* cm_h1; hdr_cmn* cm_h2; hdr_ip* ip_h; cur_time = Scheduler::instance().clock(); cm_h = hdr_cmn::access(thePacket); ip_h = hdr_ip::access(thePacket); /* Update curves */ Arrival_[ip_h -> prio()] += 8*cm_h -> size(); Rin_ [ip_h -> prio()] += 8*cm_h -> size(); if (last_rate_update_[ip_h -> prio()] == 0) { last_rate_update_[ip_h -> prio()] = cur_time; } else { Rout_th_ [ip_h -> prio()] += (cur_time-last_rate_update_[ip_h -> prio()])*service_rate_[ip_h -> prio()]; last_rate_update_[ip_h -> prio()] = cur_time; } backlog_Pkts_[ip_h -> prio()] ++; backlog_Bits_[ip_h -> prio()] += 8*cm_h -> size(); total_backlog_Bits_ += 8*cm_h -> size(); total_backlog_Pkts_ ++; for (i = 1; i <= NO_CLASSES; i++) { if (Arrival_[i] > 0) { current_loss_[i] = (double)(Arrival_[i] - Rin_[i])/(double)(Arrival_[i]); min_drop_[i] = (double)(max(0.0, (1.0-(double)(Rin_[i])/(double)Arrival_[i]))); max_drop_[i] = (double)(min(1.0, (1.0-(double)((double)Rout_[i]/(double)Arrival_[i])))); } else { current_loss_[i] = 0; min_drop_[i] = 0.0; max_drop_[i] = 0.0; } if (cls_[i]->head() != NULL) { cm_h1 = hdr_cmn::access(cls_[i]->head()); cm_h2 = hdr_cmn::access(cls_[i]->tail()); avg_elapsed_[i] = (2*cur_time - cm_h1 -> ts_ - cm_h2 -> ts_)/((backlog_Pkts_[i]>1)? 2.0 :1.0); } } return; }

Here is the call graph for this function:

double * JoBS::assignRateDropsADC (   )  [private]

Definition at line 672 of file jobs.cc. References hdr_cmn::access(), ADC_, adc_resolution_type_, ALC_, ARC_, Arrival_, backlog_Bits_, Scheduler::clock(), cls_, concerned_ADC_, concerned_ARC_, current_loss_, drop_front_, dropFront(), dropTail(), FALSE, PacketQueue::head(), INFINITY, Scheduler::instance(), max, min_rate_, NO_CLASSES, pickDroppedRLC(), RESOLVE_ADC, service_rate_, SHARED_PAIN, Queue< T >::size(), Connector::target(), TRUE, hdr_cmn::ts_, and WITH_UPDATE. Referenced by enque(). { double* x; //double myRatios[NO_CLASSES+1]; double c[NO_CLASSES+1], n[NO_CLASSES]; double k[NO_CLASSES+1], target[NO_CLASSES+1]; double available[NO_CLASSES+1]; double toDrop; int lowest, highest; int victim_class, keep_going; int i; Packet* p; hdr_cmn* cm_h; double cur_time = Scheduler::instance().clock(); x = new double[NO_CLASSES+1]; if (x == NULL) return NULL; for (i = 0;i <= NO_CLASSES; i++) x[i] = 0; keep_going = TRUE; for (i = 1; i <= NO_CLASSES; i++) { if (cls_[i]->head() != NULL) { p = cls_[i]->head(); cm_h = hdr_cmn::access(p); n[i] = (double)service_rate_[i]; k[i] = (double)backlog_Bits_[i]; available[i] = service_rate_[i]; if (concerned_ADC_[i]) { c[i] = (double)max((double)ADC_[i]-(cur_time-cm_h->ts_),1e-10); target[i] = (double)k[i]/(double)c[i]; available[i] = -(target[i] - n[i]); } if (concerned_ARC_[i]) { if (n[i] - ARC_[i] < available[i]) available[i] = n[i] - ARC_[i]; } } else { available[i] = service_rate_[i]; n[i] = 0; k[i] = 0; c[i] = 0; } } // Step 1: Adjust rates highest = 1; lowest = NO_CLASSES; while ((highest < NO_CLASSES+1)&&(available[highest] >= 0)) highest++; // which is the highest class that needs more service? while ((lowest > 0)&&(available[lowest] <= 0)) lowest--; // which is the lowest class that needs less service? while ((highest != NO_CLASSES+1)&&(lowest != 0)) { // give the excess service from lowest to highest if (available[lowest]+available[highest] > 0) { // Still some "credit" left // Give all that is needed by "highest" n[lowest] -= -available[highest]; n[highest] += -available[highest]; available[lowest] -= -available[highest]; available[highest] = 0; while ((highest < NO_CLASSES+1)&&(available[highest] >= 0)) highest++; // which is the highest class that needs more service? } else if (available[lowest]+available[highest] == 0) { // No more credit left but it's fine n[lowest] -= -available[highest]; n[highest] += -available[highest]; available[highest] = 0; available[lowest] = 0; while ((highest < NO_CLASSES+1)&&(available[highest] >= 0)) highest++; // which is the highest class that needs more service? while ((lowest > 0)&&(available[lowest] <= 0)) lowest--; // which is the lowest class that needs less service? } else if (available[lowest]+available[highest] < 0) { // No more credit left and we need to switch to another class n[lowest] -= available[lowest]; n[highest] += available[lowest]; available[highest] += available[lowest]; available[lowest] = 0; while ((lowest > 0)&&(available[lowest] <= 0)) lowest--; // which is the lowest class that needs less service? } } for (i = 1; i <= NO_CLASSES; i++) { if (cls_[i]->head() != NULL) x[i] = n[i] - (double)service_rate_[i]; else x[i] = - (double)service_rate_[i] ; } // Step 2: Adjust drops if (highest != NO_CLASSES+1) { // Some class still needs additional service if (adc_resolution_type_ == SHARED_PAIN) { // Drop from all classes toDrop = 0; for (i = 1; i <= NO_CLASSES; i++) if (available[i] < 0 && concerned_ADC_[i] && cls_[i]->head()) toDrop += k[i] - c[i]*n[i]; while ((toDrop > 0)&&(keep_going)) { victim_class = pickDroppedRLC(RESOLVE_ADC); if (drop_front_) p = cls_[victim_class] -> head(); else p = cls_[victim_class] -> tail(); cm_h = hdr_cmn::access(p); if (current_loss_[victim_class]+(double)8*cm_h -> size()/(double)Arrival_[victim_class] > ALC_[victim_class]) { keep_going = FALSE; } else { toDrop -= (double)8*cm_h -> size(); if (drop_front_) dropFront(victim_class, WITH_UPDATE); else dropTail(victim_class, WITH_UPDATE); } } } else { // Drop solely from the class(es) that need(s) more service for (i = 1; i <= NO_CLASSES; i++) { if (available[i] < 0 && cls_[i] -> head()) { k[i] = c[i]*n[i]; while ((backlog_Bits_[i] > k[i])&&(keep_going)) { if (drop_front_) { p = cls_[i] -> head(); cm_h = hdr_cmn::access(p); if (current_loss_[i]+(double)8*cm_h -> size()/(double)Arrival_[i] > ALC_[i]) { keep_going = FALSE; } else dropFront(i, WITH_UPDATE); } else { p = cls_[i] -> tail(); cm_h = hdr_cmn::access(p); if (current_loss_[i]+(double)8*cm_h -> size()/(double)Arrival_[i] > ALC_[i]) { keep_going = FALSE; } else dropTail(i, WITH_UPDATE); } } k[i] = backlog_Bits_[i]; } } } } for (i = 1; i <= NO_CLASSES; i++) if (cls_[i]->head() && concerned_ADC_[i]) { if (c[i] > 0) { if (concerned_ADC_[i] && !concerned_ARC_[i]) { min_rate_[i] = (double)k[i]/(double)c[i]; } else min_rate_[i] = (double)n[i]; } else { min_rate_[i] = INFINITY; } } else if (cls_[i]->head() && concerned_ARC_[i]) { min_rate_[i] = n[i]; } else { min_rate_[i] = 0.0; } return (x); }

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 JoBS::command (  int  argc, const char *const *  argv )  [virtual]

Reimplemented from Connector. Definition at line 113 of file jobs.cc. References abort(), ABS_present_, ADC_, ALC_, ARC_, Connector::command(), concerned_ADC_, concerned_ALC_, concerned_ARC_, concerned_RDC_, concerned_RLC_, FALSE, file_name_, hop_trace_, INFINITY, Kp_static_, link_, link_id_, loss_prod_others_, mean_pkt_size_, NO_CLASSES, prod_others_, RDC_, RLC_, sampling_period_, service_rate_, trace_hop_, and TRUE. { Tcl& tcl = Tcl::instance(); double tmp[NO_CLASSES+1]; if (argc >= NO_CLASSES+2) { /* input RDCs/RLCs/ADCs/ALCs */ if (strcmp(argv[1], "init-rdcs") == 0) { RDC_[0] = -1; for (int i=1; i<=NO_CLASSES; i++) { RDC_[i] = atof(argv[i+1]); if (RDC_[i] == -1) concerned_RDC_[i] = FALSE; else concerned_RDC_[i] = TRUE; } for (int i=1; i<=NO_CLASSES;i++) { tmp[i] = 1.0; for (int j = 1; j <= i-1; j++) if (concerned_RDC_[j]) tmp[i] *= RDC_[j]; } for (int i=1; i<=NO_CLASSES; i++) { prod_others_[i] = 1.0; for (int j = 1; j <= NO_CLASSES; j++) if ((j != i)&&(concerned_RDC_[j])) prod_others_[i] *= tmp[j]; } if (argc == NO_CLASSES+2) { fprintf(stdout, "\nConfigured RDC, with:\n"); for (int i=1; i<=NO_CLASSES; i++) { fprintf(stdout, "\tClass %d: ",i); if (concerned_RDC_[i]) fprintf(stdout, "\t%f\t(%f)\n", (double)RDC_[i], (double) prod_others_[i]); else fprintf(stdout, "\tNot concerned\n"); } } return (TCL_OK); } if (strcmp(argv[1], "init-rlcs") == 0) { RLC_[0] = -1; for (int i=1; i<=NO_CLASSES; i++) { RLC_[i] = atof(argv[i+1]); if (RLC_[i] == -1) concerned_RLC_[i] = FALSE; else concerned_RLC_[i] = TRUE; } for (int i=1; i<=NO_CLASSES;i++) { tmp[i] = 1.0; for (int j = 1; j <= i-1; j++) if (concerned_RLC_[j]) tmp[i] *= RLC_[j]; } for (int i=1; i<=NO_CLASSES; i++) { loss_prod_others_[i] = 1.0; for (int j = 1; j <= NO_CLASSES; j++) if ((j != i)&&(concerned_RLC_[j])) loss_prod_others_[i] *= tmp[j]; } if (argc == NO_CLASSES+2) { fprintf(stdout, "\nConfigured RLC, with:\n"); for (int i=1; i<=NO_CLASSES; i++) { fprintf(stdout, "\tClass %d: ",i); if (concerned_RLC_[i]) fprintf(stdout, "\t%f\t(%f)\n", (double)RLC_[i], (double)loss_prod_others_[i]); else fprintf(stdout, "\tNot concerned\n"); } } return (TCL_OK); } if (strcmp(argv[1], "init-adcs") == 0) { ADC_[0] = -1; for (int i=1; i<=NO_CLASSES; i++) { ADC_[i] = atof(argv[i+1]); if (ADC_[i] == -1) { concerned_ADC_[i] = FALSE; ADC_[i] = INFINITY; } else { concerned_ADC_[i] = TRUE; ABS_present_ = TRUE; } } if (argc == NO_CLASSES+2) { fprintf(stdout, "\nConfigured ADC, with:\n"); for (int i=1; i<=NO_CLASSES; i++) { fprintf(stdout, "\tClass %d: ", i); if (concerned_ADC_[i]) fprintf(stdout, "\t%f secs\n", (double)ADC_[i]); else fprintf(stdout, "\tNot concerned\n"); } } return (TCL_OK); } if (strcmp(argv[1], "init-alcs") == 0) { ALC_[0] = -1; for (int i=1; i<=NO_CLASSES; i++) { ALC_[i] = atof(argv[i+1]); if (ALC_[i] == -1) { concerned_ALC_[i] = FALSE; ALC_[i] = INFINITY; } else concerned_ALC_[i] = TRUE; } if (argc == NO_CLASSES+2) { fprintf(stdout, "\nConfigured ALC, with:\n"); for (int i=1; i<=NO_CLASSES; i++) { fprintf(stdout, "\tClass %d: ",i); if (concerned_ALC_[i]) fprintf(stdout, "\t%f\n", (double)ALC_[i]); else fprintf(stdout, "\tNot concerned\n"); } } return (TCL_OK); } if (strcmp(argv[1], "init-arcs") == 0) { ARC_[0] = -1; for (int i=1; i<=NO_CLASSES; i++) { ARC_[i] = atof(argv[i+1]); if (ARC_[i] == -1) { concerned_ARC_[i] = FALSE; ARC_[i] = 0; } else { concerned_ARC_[i] = TRUE; ABS_present_ = TRUE; } } if (argc == NO_CLASSES+2) { fprintf(stdout, "\nConfigured ARC, with:\n"); for (int i=1; i<=NO_CLASSES; i++) { fprintf(stdout, "\tClass %d: ",i); if (concerned_ARC_[i]) fprintf(stdout, "\t%f\n", (double)ARC_[i]); else fprintf(stdout, "\tNot concerned\n"); } } return (TCL_OK); } } else if (argc == 3) { if (strcmp(argv[1], "link") == 0) { LinkDelay* del = (LinkDelay*)TclObject::lookup(argv[2]); if (del == 0) { tcl.resultf("JoBS: no LinkDelay object %s", argv[2]); return(TCL_ERROR); } link_ = del; for (int i=1; i <= NO_CLASSES; i++) service_rate_[i] = 0; return (TCL_OK); } if (strcmp(argv[1], "sampling-period") == 0) { sampling_period_ = atoi(argv[2]); if (sampling_period_ < 0) { fprintf(stderr, "JoBS: sampling period must be positive!!\n"); abort(); return (TCL_ERROR); // __NOT REACHED__ } else return (TCL_OK); } if (strcmp(argv[1], "id") == 0) { link_id_ = (int)atof(argv[2]); return (TCL_OK); } if (strcmp(argv[1], "trace-file") == 0) { file_name_ = new(char[500]); strcpy(file_name_, argv[2]); if (strcmp(file_name_, "null")) { trace_hop_ = true; } else { trace_hop_ = false; } return (TCL_OK); } } else if (argc == 2) { if (strcmp(argv[1], "initialize") == 0) { double myMaxPi=0; for (int i = 1; i <= NO_CLASSES; i++) if (prod_others_[i] > myMaxPi) myMaxPi = prod_others_[i]; Kp_static_ = -2/(double)(myMaxPi*mean_pkt_size_*sampling_period_); // Open files if (trace_hop_) { if ((hop_trace_ = fopen(file_name_, "w"))==NULL) { fprintf(stderr, "Problem with opening the per-hop trace file: %s\n", file_name_); abort(); } } return (TCL_OK); } if (strcmp(argv[1], "copyright-info") == 0) { fprintf(stdout, "\n----------------------------------------------------------\n\n"); fprintf(stdout, "JoBS scheduler/dropper [prototype ns-2 implementation]\n"); fprintf(stdout, "Version 1.0 (CVS Revision: $Id: jobs.cc,v 1.2 2003/02/04 20:45:55 xuanc Exp $)\n\n"); fprintf(stdout, "ns-2 implementation by Nicolas Christin <nicolas@cs.virginia.edu>\n"); fprintf(stdout, "JoBS algorithms proposed by Nicolas Christin and Jorg Liebeherr.\n"); fprintf(stdout, "Grateful acknowledgments to Tarek Abdelzaher for his help and comments.\n"); fprintf(stdout, "Visit http://qosbox.cs.virginia.edu for more\n"); fprintf(stdout, "information.\n\n"); fprintf(stdout, "Copyright (c) 2000-2002 by the Rector and Board of Visitors of the\n"); fprintf(stdout, "University of Virginia.\n"); fprintf(stdout, "All Rights Reserved.\n"); fprintf(stdout, "----------------------------------------------------------\n\n"); 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 * JoBS::deque (   )  [virtual]

Implements Queue< T >. Definition at line 336 of file jobs.cc. References hdr_cmn::access(), backlog_Bits_, backlog_Pkts_, LinkDelay::bandwidth(), Scheduler::clock(), cls_, PacketQueue::deque(), PacketQueue::head(), idle_, idletime_, INFINITY, Scheduler::instance(), last_xmit_, link_, NO_CLASSES, Rout_, Rout_last_up_, Rout_th_, hdr_cmn::size(), sliding_class_delay_, sliding_serviced_bits_, sliding_serviced_pkts_, total_backlog_Bits_, total_backlog_Pkts_, and hdr_cmn::ts_. { // Lower classes are better. double cur_time = Scheduler::instance().clock(); double error; double maxError; int svc_class = 0; error = 0; // Fast translation of service rates into packet forwarding decisions maxError = -INFINITY; for (int i=1; i<=NO_CLASSES; i++) { if (cls_[i]->head()) { error = (double)Rout_th_[i] - Rout_[i]; if (error > maxError) { maxError = error; svc_class = i; } } } if (svc_class == 0) { idle_ = 1; if (&Scheduler::instance() != NULL) idletime_ = cur_time; else idletime_ = 0.0; return NULL; /* Idle system */ } else { idle_ = 0; Packet* p = cls_[svc_class]->deque(); hdr_cmn* cm_h = hdr_cmn::access(p); total_backlog_Pkts_--; total_backlog_Bits_ -= 8*cm_h->size(); backlog_Pkts_[svc_class]--; backlog_Bits_[svc_class] -= 8*cm_h->size(); Rout_[svc_class] += 8*cm_h->size(); Rout_last_up_[svc_class] = cur_time; sliding_serviced_pkts_[svc_class] ++; sliding_serviced_bits_[svc_class] += 8*cm_h->size(); sliding_class_delay_[svc_class] = ((sliding_serviced_pkts_[svc_class]-1)*(sliding_class_delay_[svc_class]) +(cur_time-cm_h->ts_))/(sliding_serviced_pkts_[svc_class]); last_xmit_[svc_class] = cur_time+(8.*cm_h->size()/(double)link_->bandwidth()); 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(), dropFront(), Vq::dropPacketForECN(), DSRAgent::dropSendBuff(), 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(), 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 JoBS::dropFront (  int  , int  )  [private]

Definition at line 1091 of file jobs.cc. References hdr_cmn::access(), Arrival_, backlog_Bits_, backlog_Pkts_, cls_, current_loss_, Connector::drop(), min_drop_, NO_CLASSES, Rin_, Queue< T >::size(), hdr_cmn::size(), total_backlog_Bits_, total_backlog_Pkts_, and WITH_UPDATE. Referenced by assignRateDropsADC(), and enque(). { Packet *p; hdr_cmn *cm_h; p = cls_[prio] -> head(); cm_h = hdr_cmn::access(p); total_backlog_Pkts_ --; total_backlog_Bits_ -= 8*cm_h->size(); backlog_Pkts_[prio] --; backlog_Bits_[prio] -= 8*cm_h->size(); Rin_[prio] -= 8*cm_h->size(); if (strategy == WITH_UPDATE) { for (int i = 1; i <= NO_CLASSES; i++) current_loss_[i] = min_drop_[i]; current_loss_[prio] += (double)8*cm_h -> size() /(double)Arrival_[prio]; } cls_[prio] -> remove(p); drop(p); return; }

Here is the call graph for this function:

void JoBS::dropTail (  int  , int  )  [private]

Definition at line 1063 of file jobs.cc. References hdr_cmn::access(), Arrival_, backlog_Bits_, backlog_Pkts_, cls_, current_loss_, Connector::drop(), min_drop_, NO_CLASSES, Rin_, Queue< T >::size(), hdr_cmn::size(), total_backlog_Bits_, total_backlog_Pkts_, and WITH_UPDATE. Referenced by assignRateDropsADC(), and enque(). { Packet *p; hdr_cmn *cm_h; p = cls_[prio] -> tail(); cm_h = hdr_cmn::access(p); total_backlog_Pkts_ --; total_backlog_Bits_ -= 8*cm_h->size(); backlog_Pkts_[prio] --; backlog_Bits_[prio] -= 8*cm_h->size(); Rin_[prio] -= 8*cm_h->size(); if (strategy == WITH_UPDATE) { for (int i = 1; i <= NO_CLASSES; i++) current_loss_[i] = min_drop_[i]; current_loss_[prio] += (double)8*cm_h -> size() /(double)Arrival_[prio]; } cls_[prio] -> remove(p); drop(p); return; }

Here is the call graph for this function:

int JoBS::enforceWC (   )  [private]

Definition at line 522 of file jobs.cc. References LinkDelay::bandwidth(), cls_, FALSE, PacketQueue::head(), link_, NO_CLASSES, PRECISION_ERROR, service_rate_, and TRUE. Referenced by enque(). { int i; int activeClasses; int updated; updated = FALSE; activeClasses = 0; for (i = 1; i <= NO_CLASSES; i++) { if (cls_[i]->head()) activeClasses++; if ((cls_[i] -> head() && service_rate_[i] <= PRECISION_ERROR) ||(cls_[i] -> head() == NULL && service_rate_[i] > 0)) updated = TRUE; } if (updated) { for (i = 1; i <= NO_CLASSES; i++) { if (cls_[i]->head() == NULL) { service_rate_[i] = 0; } else { if (activeClasses > 0) service_rate_[i] = link_->bandwidth()/(double)activeClasses; else service_rate_[i] = 0 ; } } } return (updated); }

Here is the call graph for this function:

void JoBS::enque (  Packet *   )  [virtual]

Implements Queue< T >. Definition at line 390 of file jobs.cc. References abort(), ABS_present_, hdr_cmn::access(), hdr_ip::access(), adjustRatesRDC(), ALC_, Arrival_, arvAccounting(), assignRateDropsADC(), backlog_Pkts_, Scheduler::clock(), cls_, concerned_ALC_, concerned_RLC_, current_loss_, drop_front_, dropFront(), dropTail(), enforceWC(), PacketQueue::enque(), idle_, Scheduler::instance(), last_monitor_update_, last_rate_update_, minRatesNeeded(), MON_WINDOW_SIZE, monitoring_window_, NO_CLASSES, pickDroppedRLC(), pkt_count_, hdr_ip::prio_, Queue< T >::qlim_, RESET_STATS, RESOLVE_OVERFLOW, Rin_, Rout_, Rout_last_up_, Rout_th_, sampling_period_, service_rate_, shared_buffer_, Queue< T >::size(), total_backlog_Pkts_, hdr_cmn::ts_, UPDATE_STATS, updateStats(), and WITH_UPDATE. { double* DeltaR; int i; hdr_ip* ip_h = hdr_ip::access(pkt); hdr_cmn* cm_h = hdr_cmn::access(pkt); int prio = ip_h->prio_; if ((prio < 1) || (prio > NO_CLASSES)) { printf("Bad priority value\n"); abort(); } double cur_time = Scheduler::instance().clock(); cm_h->ts_ = cur_time; // timestamp the packet cls_[prio]->enque(pkt); monitoring_window_ -= cur_time-last_monitor_update_; last_monitor_update_ = cur_time; if (monitoring_window_ <= 0) { updateStats(pkt, RESET_STATS); monitoring_window_ = MON_WINDOW_SIZE; } else { updateStats(pkt, UPDATE_STATS); } // Reset arrival, input, and service curves if the scheduler is // not busy if (idle_) { for (i=1; i<= NO_CLASSES; i++) { Arrival_[i]=0.0; Rin_[i]=0.0; Rout_[i]=0.0; Rout_th_[i]=0.0; last_rate_update_[i] = 0; Rout_last_up_[i] = cur_time; idle_ = 0; } } arvAccounting(pkt); /* Is the buffer full? */ if (!shared_buffer_ && backlog_Pkts_[prio] > qlim_/NO_CLASSES) { /* separate buffers: no guarantees on packet drops * can be offered * thus we drop the incoming packet */ if (drop_front_) dropFront(prio, WITH_UPDATE); else dropTail(prio, WITH_UPDATE); } else { /* shared buffer */ if (total_backlog_Pkts_ > qlim_) { if (!concerned_RLC_[prio]) { if (!concerned_ALC_[prio]) { // No ALC, no RLC on that class. Drop the incoming packet. if (drop_front_) dropFront(prio, WITH_UPDATE); else dropTail(prio, WITH_UPDATE); } else { // No RLC on that class. Drop the incoming packet if you can... if (current_loss_[prio]+(double)8*cm_h -> size()/(double)Arrival_[prio] <= ALC_[prio]) { if (drop_front_) dropFront(prio, WITH_UPDATE); else dropTail(prio, WITH_UPDATE); } else { // If it doesn't work, pick another class if (drop_front_) dropFront(pickDroppedRLC(RESOLVE_OVERFLOW), WITH_UPDATE); else dropTail(pickDroppedRLC(RESOLVE_OVERFLOW), WITH_UPDATE); } } } else { // RLC on that class (w/ or w/o ALC), pick a class according to the RLC if (drop_front_) dropFront(pickDroppedRLC(RESOLVE_OVERFLOW), WITH_UPDATE); else dropTail(pickDroppedRLC(RESOLVE_OVERFLOW), WITH_UPDATE); } } } pkt_count_ ++; enforceWC(); // Change rates if some classes have entered/left the system // since the last update if ((ABS_present_)&&(!minRatesNeeded(ip_h -> prio()))) { DeltaR = assignRateDropsADC(); if (DeltaR != NULL) { for (i = 1; i <= NO_CLASSES; i++) service_rate_[i] += DeltaR[i]; delete []DeltaR; } DeltaR = adjustRatesRDC(); if (DeltaR) { for (i = 1; i <= NO_CLASSES; i++) service_rate_[i] += DeltaR[i]; delete []DeltaR; } pkt_count_ = 0; } else if (pkt_count_ >= sampling_period_) { /* Is it time for a new evaluation of the system? */ DeltaR = adjustRatesRDC(); if (DeltaR != NULL) { for (i = 1; i <= NO_CLASSES; i++) service_rate_[i] += DeltaR[i]; delete []DeltaR; } pkt_count_ = 0; } return; }

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

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 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 dsREDQueue::reset(), and Snoop::snoop_data(). { return qlim_; }

int JoBS::minRatesNeeded (  int   )  [private]

Definition at line 904 of file jobs.cc. References hdr_cmn::access(), ADC_, ARC_, backlog_Bits_, Scheduler::clock(), cls_, concerned_ADC_, concerned_ARC_, FALSE, PacketQueue::head(), INFINITY, Scheduler::instance(), min_rate_, NO_CLASSES, service_rate_, TRUE, and hdr_cmn::ts_. Referenced by enque(). { int result; int i; double cur_time; Packet* p; hdr_cmn* cm_h; cur_time = Scheduler::instance().clock(); result = TRUE; for (i = 1; i <= NO_CLASSES; i++) { if (cls_[i]->head() != 0 && (concerned_ADC_[i] || concerned_ARC_[i])) { p = cls_[i]->head(); cm_h = hdr_cmn::access(p); if (concerned_ADC_[i]) { if ((ADC_[i] - (cur_time-cm_h->ts_)) > 0 ) { // min rate needed for ADC min_rate_[i] = (double)(backlog_Bits_[i]) /(double)(ADC_[i] - (cur_time-cm_h->ts_)); if (concerned_ARC_[i] && ARC_[i] > min_rate_[i]) { // min rate needed for ADC+ARC min_rate_[i] = ARC_[i]; } } else min_rate_[i] = INFINITY; } else if (concerned_ARC_[i]) { // no ADC, an ARC min_rate_[i] = ARC_[i]; } if (min_rate_[i] > service_rate_[i]) result = FALSE; } else min_rate_[i] = 0.0; } return result; }

Here is the call graph for this function:

int JoBS::pickDroppedRLC (  int   )  [private]

Definition at line 961 of file jobs.cc. References abort(), hdr_cmn::access(), ALC_, Arrival_, Scheduler::clock(), cls_, concerned_RLC_, current_loss_, drop_front_, PacketQueue::head(), INFINITY, Scheduler::instance(), link_id_, loss_prod_others_, NO_CLASSES, RESOLVE_OVERFLOW, and Queue< T >::size(). Referenced by assignRateDropsADC(), and enque(). { double Mean; double loss_error[NO_CLASSES+1]; int i, activeClasses, backloggedClasses; int class_dropped; double maxError; double maxALC; double cur_time = Scheduler::instance().clock(); hdr_cmn* cm_h; class_dropped = -1; maxError = 0; Mean = 0; activeClasses = 0; backloggedClasses = 0; for (i = 1; i <= NO_CLASSES; i++) if (cls_[i]->head() != NULL) { backloggedClasses ++; if (concerned_RLC_[i]) { Mean += loss_prod_others_[i]*current_loss_[i]; activeClasses ++; } } if (activeClasses > 0) Mean /= (double)activeClasses; else if (backloggedClasses == 0) { fprintf(stderr, "JoBS::pickDroppedRLC() called but there's no backlog!\n"); abort(); } if (activeClasses == 0) class_dropped = NO_CLASSES+1; // no classes are concerned by RLCs (NO_CLASSES+1 means "ignore RLC") else { for (i = 1; i <= NO_CLASSES; i++) if ((cls_[i]->head() != NULL)&&(concerned_RLC_[i])) loss_error[i]=loss_prod_others_[i]*current_loss_[i]-Mean; else loss_error[i] = INFINITY; for (i = 1; i <= NO_CLASSES; i++) if ((cls_[i]->head() != NULL)&&(loss_error[i] <= maxError)) { maxError = loss_error[i]; // Find out which class is the most below the mean class_dropped = i; // It's the one that needs to be dropped // Ties are broken in favor of the higher priority classes (i.e., if // two classes present the same deviation, the lower priority class // will get dropped). } if (class_dropped != -1) { if (drop_front_) cm_h = hdr_cmn::access(cls_[class_dropped] -> head()); else cm_h = hdr_cmn::access(cls_[class_dropped] -> tail()); if (current_loss_[class_dropped]+(double)8*cm_h -> size()/(double)Arrival_[class_dropped] > ALC_[class_dropped]) class_dropped = NO_CLASSES+1; // the class to drop for meeting the RLC will defeat the ALC: ignore RLC. } else class_dropped = NO_CLASSES+1; } if (class_dropped != -1) { // this test is here only for "safety purposes" // it should always return true at this point. if (class_dropped == NO_CLASSES+1) { maxALC = -INFINITY; for (i = 1; i <= NO_CLASSES; i++) { if (cls_[i] -> tail() != NULL) { if (ALC_[i]-current_loss_[i] > maxALC); maxALC = ALC_[i]-current_loss_[i]; // pick the class which is the furthest from its ALC class_dropped = i; } } if (drop_front_) cm_h = hdr_cmn::access(cls_[class_dropped]->head()); else cm_h = hdr_cmn::access(cls_[class_dropped]->tail()); if ((mode == RESOLVE_OVERFLOW) &&(current_loss_[class_dropped]+(double)8*cm_h -> size()/(double)Arrival_[class_dropped] > ALC_[class_dropped])) { fprintf(stderr, "*** Warning at time t=%f: ALC violated in class %d on link %d\n(reason: buffer overflow impossible to resolve otherwise)\nPkt size=%d bits\told_loss[%d]=%f\tnew_loss[%d]=%f\tArrival_[%d]=%f\tALC[%d]=%f\n", cur_time, link_id_, class_dropped, 8*cm_h -> size(), class_dropped, current_loss_[class_dropped], class_dropped, current_loss_[class_dropped]+(double)8*cm_h -> size()/(double)Arrival_[class_dropped], class_dropped, (double)Arrival_[class_dropped], class_dropped, ALC_[class_dropped]); } } } else { fprintf(stderr, "Trying to drop a packet, but there's nothing in any queue!\n"); abort(); } return class_dropped; }

Here is the call graph for this function:

double JoBS::projDelay (  int   )  [private]

Definition at line 946 of file jobs.cc. References hdr_cmn::access(), Scheduler::clock(), cls_, PacketQueue::head(), and Scheduler::instance(). Referenced by updateError(). { double cur_time = Scheduler::instance().clock(); if (cls_[i]->head() != NULL) { Packet* p = cls_[i]->head(); hdr_cmn* cm_h = hdr_cmn::access(p); return (cur_time - cm_h -> ts_); } else return 0.0; // __NOT REACHED__ }

Here is the call graph for this function:

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 arvAccounting(), assignRateDropsADC(), dsREDQueue::deque(), dropFront(), dropTail(), RedPDQueue::enque(), enque(), MediaServer::get_next_segment(), pickDroppedRLC(), and FQ::recv(). { return size_; }

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

Definition at line 48 of file connector.h. References Connector::target_. Referenced by 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; }

void JoBS::updateError (   )  [private]

Definition at line 862 of file jobs.cc. References abort(), cls_, concerned_RDC_, error_, PacketQueue::head(), NO_CLASSES, prod_others_, and projDelay(). Referenced by adjustRatesRDC(). { int i; int activeClasses, backloggedClasses; double meanWeightedDelay; meanWeightedDelay = 0; activeClasses = 0 ; backloggedClasses = 0; for (i = 1; i <= NO_CLASSES; i++) if (cls_[i]->head() != NULL) { backloggedClasses++; if (concerned_RDC_[i]) { meanWeightedDelay += prod_others_[i]*projDelay(i); activeClasses ++; } } if (activeClasses > 0) meanWeightedDelay /= (double)activeClasses; else if (backloggedClasses == 0) { fprintf(stderr, "JoBS::updateError() called but there's no backlog!\n"); abort(); } for (i = 1; i <= NO_CLASSES; i++) if ((cls_[i]->head() != NULL)&&(concerned_RDC_[i])) { error_[i] = meanWeightedDelay-prod_others_[i]*projDelay(i); } else { error_[i] = 0.0; // either the class isn't concerned, or it's not backlogged // in any case, the rate shouldn't be adjusted. } return; }

Here is the call graph for this function:

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:

void JoBS::updateStats (  Packet *  , int  )  [private]

Definition at line 1169 of file jobs.cc. References hdr_ip::access(), hdr_cmn::access(), LinkDelay::bandwidth(), Scheduler::clock(), cls_, current_loss_, hop_trace_, Scheduler::instance(), last_arrival_, Queue< T >::length(), link_, max, MON_WINDOW_SIZE, NO_CLASSES, hdr_ip::prio(), RESET_STATS, hdr_cmn::size(), sliding_arv_pkts_, sliding_arv_pkts_c, sliding_avg_pkt_size_, sliding_class_delay_, sliding_class_service_rate_, sliding_inter_, sliding_serviced_bits_, sliding_serviced_pkts_, trace_hop_, UPDATE_STATS, and util_. Referenced by enque(). { double cur_time = Scheduler::instance().clock(); hdr_cmn* cm_h; hdr_ip* ip_h; cm_h = hdr_cmn::access(p); ip_h = hdr_ip::access(p); if (action == UPDATE_STATS) { sliding_arv_pkts_++; sliding_arv_pkts_c[ip_h->prio()]++; sliding_inter_ = (cur_time - last_arrival_ + sliding_inter_ * (sliding_arv_pkts_-1)) /(double)sliding_arv_pkts_; sliding_avg_pkt_size_ = (sliding_avg_pkt_size_*(sliding_arv_pkts_ - 1) + 8*cm_h->size()) /(double)sliding_arv_pkts_; last_arrival_ = cur_time; } else if (action == RESET_STATS) { if (trace_hop_) { fprintf(hop_trace_, "%f\t", cur_time); for (int i=1;i<=NO_CLASSES;i++) { fprintf(hop_trace_, "%.8f\t", max(current_loss_[i],0.00000001)); } for (int i=1;i<=NO_CLASSES;i++) { fprintf(hop_trace_, "%.8f\t", max(sliding_class_delay_[i],0.00000001)); } for (int i=1;i<=NO_CLASSES;i++) { sliding_class_service_rate_[i] = sliding_serviced_bits_[i]/(double)MON_WINDOW_SIZE; fprintf(hop_trace_, "%.0f\t", max(sliding_class_service_rate_[i], 1)); sliding_serviced_pkts_[i] = 0; sliding_serviced_bits_[i] = 0; sliding_class_delay_[i] = 0; sliding_class_service_rate_[i] = 0; } for (int i=1;i<=NO_CLASSES;i++) { fprintf(hop_trace_, "%.0f\t", (double)cls_[i]->length()); } fprintf(hop_trace_, "\n"); } sliding_arv_pkts_ = 1; sliding_arv_pkts_c[ip_h->prio()] = 1; sliding_inter_ = cur_time - last_arrival_; sliding_avg_pkt_size_ = 8*cm_h->size(); last_arrival_ = cur_time; } util_ = sliding_avg_pkt_size_ / (sliding_inter_*link_->bandwidth()); return; }

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 JoBS::ABS_present_ [private]

Definition at line 185 of file jobs.h. Referenced by command(), enque(), and JoBS().

double JoBS::ADC_[NO_CLASSES+1] [protected]

Definition at line 121 of file jobs.h. Referenced by assignRateDropsADC(), command(), JoBS(), and minRatesNeeded().

int JoBS::adc_resolution_type_ [protected]

Definition at line 105 of file jobs.h. Referenced by assignRateDropsADC(), and JoBS().

double JoBS::ALC_[NO_CLASSES+1] [protected]

Definition at line 122 of file jobs.h. Referenced by assignRateDropsADC(), command(), enque(), JoBS(), and pickDroppedRLC().

double JoBS::ARC_[NO_CLASSES+1] [protected]

Definition at line 123 of file jobs.h. Referenced by assignRateDropsADC(), command(), and minRatesNeeded().

double JoBS::Arrival_[NO_CLASSES+1] [protected]

Definition at line 132 of file jobs.h. Referenced by arvAccounting(), assignRateDropsADC(), dropFront(), dropTail(), enque(), and pickDroppedRLC().

double JoBS::avg_elapsed_[NO_CLASSES+1] [private]

Definition at line 179 of file jobs.h. Referenced by arvAccounting(), and JoBS().

long JoBS::backlog_Bits_[NO_CLASSES+1] [private]

Definition at line 172 of file jobs.h. Referenced by arvAccounting(), assignRateDropsADC(), deque(), dropFront(), dropTail(), JoBS(), and minRatesNeeded().

long JoBS::backlog_Pkts_[NO_CLASSES+1] [private]

Definition at line 173 of file jobs.h. Referenced by arvAccounting(), deque(), dropFront(), dropTail(), enque(), and JoBS().

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

PacketQueue* JoBS::cls_[NO_CLASSES+1] [protected]

Definition at line 113 of file jobs.h. Referenced by adjustRatesRDC(), arvAccounting(), assignRateDropsADC(), deque(), dropFront(), dropTail(), enforceWC(), enque(), JoBS(), minRatesNeeded(), pickDroppedRLC(), projDelay(), updateError(), and updateStats().

int JoBS::concerned_ADC_[NO_CLASSES+1] [protected]

Definition at line 116 of file jobs.h. Referenced by assignRateDropsADC(), command(), and minRatesNeeded().

int JoBS::concerned_ALC_[NO_CLASSES+1] [protected]

Definition at line 117 of file jobs.h. Referenced by command(), and enque().

int JoBS::concerned_ARC_[NO_CLASSES+1] [protected]

Definition at line 118 of file jobs.h. Referenced by assignRateDropsADC(), command(), and minRatesNeeded().

int JoBS::concerned_RDC_[NO_CLASSES+1] [protected]

Definition at line 114 of file jobs.h. Referenced by adjustRatesRDC(), command(), and updateError().

int JoBS::concerned_RLC_[NO_CLASSES+1] [protected]

Definition at line 115 of file jobs.h. Referenced by command(), enque(), and pickDroppedRLC().

double JoBS::current_loss_[NO_CLASSES+1] [protected]

Definition at line 128 of file jobs.h. Referenced by arvAccounting(), assignRateDropsADC(), dropFront(), dropTail(), enque(), JoBS(), pickDroppedRLC(), and updateStats().

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 JoBS::drop_front_ [protected]

Definition at line 103 of file jobs.h. Referenced by assignRateDropsADC(), enque(), JoBS(), and pickDroppedRLC().

double JoBS::error_[NO_CLASSES+1] [private]

Definition at line 174 of file jobs.h. Referenced by adjustRatesRDC(), JoBS(), and updateError().

double JoBS::excess_drops_[NO_CLASSES+1] [private]

Definition at line 180 of file jobs.h. Referenced by JoBS().

char* JoBS::file_name_ [protected]

Definition at line 111 of file jobs.h. Referenced by command().

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

FILE* JoBS::hop_trace_ [private]

Definition at line 188 of file jobs.h. Referenced by command(), and updateStats().

int JoBS::idle_ [private]

Definition at line 153 of file jobs.h. Referenced by deque(), enque(), and JoBS().

double JoBS::idletime_ [private]

Definition at line 154 of file jobs.h. Referenced by deque().

double JoBS::Kp_dynamic_ [private]

Definition at line 184 of file jobs.h. Referenced by adjustRatesRDC().

double JoBS::Kp_static_ [private]

Definition at line 183 of file jobs.h. Referenced by adjustRatesRDC(), and command().

double JoBS::last_arrival_ [private]

Definition at line 157 of file jobs.h. Referenced by JoBS(), and updateStats().

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

double JoBS::last_monitor_update_ [private]

Definition at line 187 of file jobs.h. Referenced by enque(), and JoBS().

double JoBS::last_rate_update_[NO_CLASSES+1] [protected]

Definition at line 133 of file jobs.h. Referenced by arvAccounting(), enque(), and JoBS().

double JoBS::last_xmit_[NO_CLASSES+1] [private]

Definition at line 171 of file jobs.h. Referenced by deque(), and JoBS().

LinkDelay* JoBS::link_ [protected]

Definition at line 110 of file jobs.h. Referenced by adjustRatesRDC(), command(), deque(), enforceWC(), and updateStats().

int JoBS::link_id_

Definition at line 96 of file jobs.h. Referenced by command(), and pickDroppedRLC().

double JoBS::loss_prod_others_[NO_CLASSES+1] [protected]

Definition at line 125 of file jobs.h. Referenced by command(), and pickDroppedRLC().

double JoBS::max_drop_[NO_CLASSES+1] [private]

Definition at line 177 of file jobs.h. Referenced by arvAccounting(), and JoBS().

double JoBS::mean_pkt_size_ [protected]

Definition at line 102 of file jobs.h. Referenced by command(), and JoBS().

double JoBS::min_drop_[NO_CLASSES+1] [private]

Definition at line 176 of file jobs.h. Referenced by arvAccounting(), dropFront(), dropTail(), and JoBS().

double JoBS::min_rate_[NO_CLASSES+1] [private]

Definition at line 175 of file jobs.h. Referenced by adjustRatesRDC(), assignRateDropsADC(), JoBS(), and minRatesNeeded().

double JoBS::min_share_ [private]

Definition at line 156 of file jobs.h. Referenced by adjustRatesRDC().

double JoBS::monitoring_window_ [private]

Definition at line 186 of file jobs.h. Referenced by enque(), and JoBS().

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 JoBS::pkt_count_ [private]

Definition at line 155 of file jobs.h. Referenced by enque(), and JoBS().

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

double JoBS::prod_others_[NO_CLASSES+1] [protected]

Definition at line 126 of file jobs.h. Referenced by command(), and updateError().

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(), enque(), GK::enque(), DropTail::enque(), Demarker::enque(), Queue< T >::limit(), RIOQueue::print_edp(), REDQueue::print_edp(), Queue< T >::Queue(), and PriQueue::recvHighPriority().

double JoBS::RDC_[NO_CLASSES+1] [protected]

Definition at line 119 of file jobs.h. Referenced by command(), and JoBS().

double JoBS::Rin_[NO_CLASSES+1] [protected]

Definition at line 129 of file jobs.h. Referenced by adjustRatesRDC(), arvAccounting(), dropFront(), dropTail(), enque(), and JoBS().

double JoBS::RLC_[NO_CLASSES+1] [protected]

Definition at line 120 of file jobs.h. Referenced by command(), and JoBS().

double JoBS::Rout_[NO_CLASSES+1] [protected]

Definition at line 130 of file jobs.h. Referenced by arvAccounting(), deque(), enque(), and JoBS().

double JoBS::Rout_last_up_[NO_CLASSES+1] [private]

Definition at line 178 of file jobs.h. Referenced by deque(), enque(), and JoBS().

double JoBS::Rout_th_[NO_CLASSES+1] [protected]

Definition at line 131 of file jobs.h. Referenced by arvAccounting(), deque(), enque(), and JoBS().

int JoBS::sampling_period_ [protected]

Definition at line 112 of file jobs.h. Referenced by command(), and enque().

double JoBS::service_rate_[NO_CLASSES+1] [protected]

Definition at line 127 of file jobs.h. Referenced by adjustRatesRDC(), arvAccounting(), assignRateDropsADC(), command(), enforceWC(), enque(), JoBS(), and minRatesNeeded().

int JoBS::shared_buffer_ [protected]

Definition at line 108 of file jobs.h. Referenced by enque(), and JoBS().

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

double JoBS::sliding_arv_pkts_ [private]

Definition at line 162 of file jobs.h. Referenced by JoBS(), and updateStats().

double JoBS::sliding_arv_pkts_c[NO_CLASSES+1] [private]

Definition at line 163 of file jobs.h. Referenced by JoBS(), and updateStats().

double JoBS::sliding_avg_pkt_size_ [private]

Definition at line 161 of file jobs.h. Referenced by updateStats().

double JoBS::sliding_class_delay_[NO_CLASSES+1] [private]

Definition at line 167 of file jobs.h. Referenced by deque(), JoBS(), and updateStats().

double JoBS::sliding_class_service_rate_[NO_CLASSES+1] [private]

Definition at line 166 of file jobs.h. Referenced by JoBS(), and updateStats().

double JoBS::sliding_inter_ [private]

Definition at line 160 of file jobs.h. Referenced by updateStats().

double JoBS::sliding_serviced_bits_[NO_CLASSES+1] [private]

Definition at line 165 of file jobs.h. Referenced by deque(), JoBS(), and updateStats().

double JoBS::sliding_serviced_pkts_[NO_CLASSES+1] [private]

Definition at line 164 of file jobs.h. Referenced by deque(), JoBS(), and updateStats().

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

long JoBS::total_backlog_Bits_ [protected]

Definition at line 101 of file jobs.h. Referenced by arvAccounting(), deque(), dropFront(), dropTail(), and JoBS().

long JoBS::total_backlog_Pkts_ [protected]

Definition at line 100 of file jobs.h. Referenced by arvAccounting(), deque(), dropFront(), dropTail(), enque(), and JoBS().

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

int JoBS::trace_hop_ [protected]

Definition at line 104 of file jobs.h. Referenced by command(), JoBS(), and 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().

double JoBS::util_ [private]

Definition at line 182 of file jobs.h. Referenced by adjustRatesRDC(), JoBS(), and updateStats().

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

---

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

• jobs.h
• jobs.cc

---