asim Class Reference

Inheritance diagram for asim:

[legend]Collaboration diagram for asim:

[legend]List of all members.

Public Member Functions
double	min (double x, double y)
double	padhye (double rtt, double p)
double	Po (double rho, int K)
double	Pk (double rho, int K, int k)
double	Lq (double rho, int K)
int	command (int argc, const char *const *argv)
double	get_link_drop (int x)
double	get_link_delay (int x)
double	get_link_qdelay (int x)
double	get_link_pdelay (int x)
double	get_link_tput (int x)
double	get_flow_delay (int x)
double	get_flow_tput (int x)
double	get_flow_drop (int x)
void	GetInputs (char *argv)
double	redFn (double minth, double pmin, double maxth, double pmax, double qlength)
void	CalcLinkDelays (int flag=0)
void	CalcPerFlowDelays ()
void	PrintData ()
void	PrintResults ()
void	UpdateHelper (int flag=0)
void	Update (int niter)
void	Update2 ()
int	allscaled ()
void	Update3 (int flag=0)
void	newupdate (int niter)
	asim ()
void	recv (Packet *, Handler *=0)
virtual void	recv (Packet *p, const char *s)
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	nConnections
int	K
int	MaxHops
int	nLinks
int **	Adj
int *	nAdj
link_stats *	links
flow_stats *	flows
Protected Member Functions
virtual void	reset ()
void	handle (Event *)
Protected Attributes
int	debug_

---

Constructor & Destructor Documentation

asim::asim (   )  [inline]

Definition at line 944 of file asim.cc. { // cout << "Reached here\n"; }

---

Member Function Documentation

int asim::allscaled (   )  [inline]

Definition at line 714 of file asim.cc. References flows, c::is_sflow, nConnections, and c::scaled. Referenced by Update3(). { //cout << nConnections; for(int i=0; i<nConnections; i++) if(!flows[i].is_sflow && !flows[i].scaled){ cout << "Connection " << i << " not scaled as yet\n"; return 0; } //cout << "All are scaled\n"; return 1; }

void asim::CalcLinkDelays (  int  flag = 0  )  [inline]

Definition at line 547 of file asim.cc. References n::lambda, links, Lq(), nLinks, and Pk(). Referenced by command(). { // flag = 1 means enable RED // Calculate Link delays ... basically queuing delays for(int i=0; i<nLinks; i++){ double rho = links[i].lambda/links[i].mu; double qlength = Lq(rho,links[i].buffer); links[i].qdelay = qlength/links[i].mu; links[i].drop = Pk(rho,links[i].buffer,links[i].buffer); //cout << "rho = " << rho << " drop = " << links[i].drop << endl; // Special code for RED gateways if(flag){ if(links[i].red){ double minth, maxth, pmin, pmax, delay,p; minth = links[i].minth; maxth = links[i].maxth; pmin = links[i].pmin; pmax = links[i].pmax; /* Debo's RED approx links[i].drop = redFn(minth,pmin,maxth,pmax,qlength/links[i].buffer); qlength = (1-links[i].drop)*links[i].buffer; links[i].qdelay = qlength/links[i].mu; */ // Ashish's RED approx. p=(links[i].redrouter)->ComputeProbability(rho, delay); links[i].drop = p; qlength = Lq(rho*(1-p), links[i].buffer); links[i].qdelay = delay; } } //cout << "delay = " << links[i].qdelay << " and drop = " << links[i].drop << endl; } }

Here is the call graph for this function:

void asim::CalcPerFlowDelays (   )  [inline]

Definition at line 592 of file asim.cc. References Adj, c::delay, c::drop, n::drop, flows, c::is_sflow, links, nAdj, nConnections, c::no, c::p_tput, padhye(), c::slambda, and c::t. Referenced by command(). { for(int i=0; i<nConnections; i++){ double d = 0, p = 1 ; // Calculate drops and delays for(int j=0;j<nAdj[i];j++){ d += 2*links[Adj[i][j]].prop; //links[Adj[i][j]].qdelay; p *= 1-links[Adj[i][j]].drop; } p = 1-p; flows[i].no = nAdj[i]; flows[i].delay = d; flows[i].drop = p; flows[i].t = flows[i].p_tput; // p is the end2end drop prob // If its normal flow, calculate Padhye's stuff // If its short flow, use our approximations // Nothing more if(flows[i].is_sflow){ // If k flows come and each each flow has n packets to // send then double t = (flows[i].slambda*flows[i].snopkts); flows[i].p_tput = t/(1-p); } else{ // regular bulk TCP connections, Padhye et. al. if(!p){ // cout << "Oops, something wrong"; } flows[i].p_tput = padhye(d,p); } // cout << "connection " << sp << i << sp << d << sp << p; //cout << sp << flows[i].p_tput << endl; } }

Here is the call graph for this function:

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

Reimplemented from NsObject. Definition at line 146 of file asim.cc. References CalcLinkDelays(), CalcPerFlowDelays(), get_flow_delay(), get_flow_drop(), get_flow_tput(), get_link_delay(), get_link_drop(), get_link_tput(), GetInputs(), and newupdate(). { if (strcmp(argv[1], "run") == 0) { int niter=0; for(int i=0; i<20; i++){ CalcLinkDelays(1); CalcPerFlowDelays(); newupdate(niter); } //PrintResults(); return (TCL_OK); } if (strcmp(argv[1], "readinput") == 0) { GetInputs((char*)argv[2]); //cout << "All inputs properly obtained from " << argv[2] <<endl ; return (TCL_OK); } if (strcmp(argv[1], "get-link-drop") == 0) { cout << "Hi"; Tcl& tcl = Tcl::instance(); tcl.resultf("%lf",get_link_drop(atoi(argv[2]))); return (TCL_OK); } if (strcmp(argv[1], "get-link-delay") == 0) { Tcl& tcl = Tcl::instance(); tcl.resultf("%lf",get_link_delay(atoi(argv[2]))); return (TCL_OK); } if (strcmp(argv[1], "get-link-tput") == 0) { Tcl& tcl = Tcl::instance(); tcl.resultf("%lf",get_link_tput(atoi(argv[2]))); return (TCL_OK); } if (strcmp(argv[1], "get-flow-tput") == 0) { Tcl& tcl = Tcl::instance(); tcl.resultf("%lf",get_flow_tput(atoi(argv[2]))); return (TCL_OK); } if (strcmp(argv[1], "get-flow-delay") == 0) { Tcl& tcl = Tcl::instance(); tcl.resultf("%lf",get_flow_delay(atoi(argv[2]))); return (TCL_OK); } if (strcmp(argv[1], "get-flow-drop") == 0) { Tcl& tcl = Tcl::instance(); tcl.resultf("%lf",get_flow_drop(atoi(argv[2]))); return (TCL_OK); } }

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

double asim::get_flow_delay (  int  x  )  [inline]

Definition at line 231 of file asim.cc. References c::delay, flows, and nConnections. Referenced by command(). { assert(x<nConnections); return flows[x].delay; }

double asim::get_flow_drop (  int  x  )  [inline]

Definition at line 241 of file asim.cc. References c::drop, flows, and nConnections. Referenced by command(). { assert(x<nConnections); return flows[x].drop; }

double asim::get_flow_tput (  int  x  )  [inline]

Definition at line 236 of file asim.cc. References flows, nConnections, and c::p_tput. Referenced by command(). { assert(x<nConnections); return flows[x].p_tput; }

double asim::get_link_delay (  int  x  )  [inline]

Definition at line 211 of file asim.cc. References links, nLinks, n::prop, and n::qdelay. Referenced by command(). { assert(x<nLinks); return links[x].qdelay + links[x].prop ; }

double asim::get_link_drop (  int  x  )  [inline]

Definition at line 204 of file asim.cc. References n::drop, links, nLinks, and PrintResults(). Referenced by command(). { assert(x<nLinks); return links[x].drop; cout << "Hi there"; PrintResults(); }

Here is the call graph for this function:

double asim::get_link_pdelay (  int  x  )  [inline]

Definition at line 221 of file asim.cc. References links, nLinks, and n::prop. { assert(x<nLinks); return links[x].prop; }

double asim::get_link_qdelay (  int  x  )  [inline]

Definition at line 216 of file asim.cc. References links, nLinks, and n::qdelay. { assert(x<nLinks); return links[x].qdelay; }

double asim::get_link_tput (  int  x  )  [inline]

Definition at line 226 of file asim.cc. References n::lambda, links, and nLinks. Referenced by command(). { assert(x<nLinks); return links[x].lambda; }

void asim::GetInputs (  char *  argv  )  [inline]

Definition at line 246 of file asim.cc. References Adj, n::buffer, c::drop, flows, c::is_sflow, n::lambda, links, MaxHops, n::maxth, n::minth, n::mu, nAdj, nConnections, n::nflows, nLinks, n::plambda, n::pmax, n::pmin, n::prop, n::red, n::redrouter, c::scaled, c::slambda, c::snopkts, t1, n::theflows, and n::tlambda. Referenced by command(). { // error if usage is wrong /* if (argc != 2) { fprintf(stderr,"Usage: %s <InputFile>\n", argv[0]); exit(-1); }*/ // No error MaxHops = 0; // K = atoi(argv[1]); // assert(K >= 1); // Init links and connections nConnections = 0; nLinks = 0; // Start the reading process FILE *f; f = fopen(argv,"r"); assert(f); char s[256]; while (fgets(s, 255, f)) { // Read a token char *t; t = strtok(s, " \t\n"); // Ignore comments if (!t || !t[0] || (t[0] == '#') || !strncasecmp(t, "comment", 6)) continue; // Define the number of connections if (!strcasecmp(t,"n")) { t = strtok(NULL," \t"); assert(t); nConnections = atoi(t); assert(nConnections > 0); assert(nConnections >= 0); nAdj = new int[nConnections]; Adj = new int*[nConnections]; flows = new flow_stats[nConnections]; for (int i=0; i<nConnections; ++i) nAdj[i] = -1; continue; } // Define the number of links else if (!strcasecmp(t,"m")) { t = strtok(NULL," \t"); assert(t); // #of links defined nLinks = atoi(t); assert(nLinks > 0); // Allocate space for sotring lambdas and mus links = new link_stats[nLinks]; continue; } // Enter each route else if (!strcasecmp(t,"route")) { assert (nConnections > 0); assert (nLinks > 0); t = strtok(NULL," \t"); assert(t); int i = atoi(t); assert(i > 0 && i<= nConnections); i--; // We dunno whether this will be short flow specs flows[i].is_sflow = 0; // Lets assume its a normal flow flows[i].drop = 0; // Assume ideal case to start off flows[i].scaled = 0; // Not scaled as yet t = strtok(NULL," \t"); assert(t); nAdj[i] = atoi(t); assert(nAdj[i] > 0 && nAdj[i] <= nLinks); Adj[i] = new int[nAdj[i]]; for (int j=0; j<nAdj[i]; ++j) { t = strtok(NULL," \t"); assert(t); int l = atoi(t); assert(l > 0 && l <= nLinks); l--; Adj[i][j] = l; } if (MaxHops < nAdj[i]) MaxHops = nAdj[i]; t = strtok(NULL," \t"); // assert(t); // Short flows stuff if (t && !strcasecmp(t,"sh")) { // There are short flows on this route. flows[i].is_sflow = 1; // read the slambda t = strtok(NULL," \t"); assert(t); double tmp = atof(t); flows[i].slambda = tmp; // read the snopkts t = strtok(NULL," \t"); assert(t); int tmpi = atoi(t); flows[i].snopkts = tmpi; } continue; } else if(!strcasecmp(t,"link")){ assert (nLinks > 0); // Get the link number t = strtok(NULL," \t"); assert(t); int i = atoi(t); assert(i > 0 && i<= nLinks); i--; // Get the prop delay t = strtok(NULL," \t"); assert(t); double p = atof(t); assert(p>=0); links[i].prop = p; // Get the lambda for this link t = strtok(NULL," \t"); assert(t); p = atof(t); assert(p>=0); links[i].lambda = 0; links[i].tlambda = p; links[i].plambda = p; // Get the mu for this link t = strtok(NULL," \t"); assert(t); p = atof(t); assert(p>=0); links[i].mu = p; // Get the buffer for this link t = strtok(NULL," \t"); assert(t); int t1 = atoi(t); assert(t1>0); links[i].buffer = t1; // Check for RED Q or not t = strtok(NULL," \t"); if(t && !strcasecmp(t,"red")){ // must be a red queue // input red parameters // all parameters between 0 and 1 links[i].red=1; // get minth t = strtok(NULL," \t"); double dt = atof(t); //assert(dt>=0 && dt<=1); links[i].minth=dt; // get pmin t = strtok(NULL," \t"); dt = atof(t); //assert(dt>=0 && dt<=1); links[i].pmin=dt; // get maxth t = strtok(NULL," \t"); dt = atof(t); //assert(dt>=0 && dt<=1); links[i].maxth=dt; // get pmax t = strtok(NULL," \t"); dt = atof(t); //assert(dt>=0 && dt<=1); links[i].pmax=dt; // Invoke Ashish's RED module ... ignore pmin ..... links[i].redrouter = new RedRouter((int)links[i].minth, (int)links[i].maxth, links[i].pmax); assert(links[i].red); } else{ links[i].red=0; } continue; } assert(0); } // Check whether everything is all right assert (nConnections > 0); assert (nLinks > 0); int i; for (i=0; i<nConnections; ++i) assert(nAdj[i] > 0); // check all the edges and store all the connections that flow // through a particular link for(i=0;i<nLinks;i++){ // cout << i << sp; int c=0; links[i].tlambda=0; for(int j=0;j<nConnections;j++){ for(int k=0;k<nAdj[j];k++){ if(Adj[j][k]==i){ c++; } } } links[i].nflows=c; //cout << c << sp; if(c){ links[i].theflows = new int[c]; c = 0; // Store teh flows for(int j=0;j<nConnections;j++){ for(int k=0;k<nAdj[j];k++){ if(Adj[j][k]==i){ if(flows[j].is_sflow){ links[i].lambda+=flows[j].slambda*flows[j].snopkts; } links[i].theflows[c++]=j; // cout << links[i].theflows[c-1] << sp; } } } // cout << " slambda = " << links[i].lambda; } else links[i].theflows = 0; // no connection passing through this edge //cout << endl; } /* char c= getchar(); for(int i=0;i<nConnections;i++){ cout << "connection" << sp << i << sp << "-"; for(int j=0;j<nAdj[i];j++){ cout << sp << Adj[i][j]; } cout << endl; } */ }

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:

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

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

double asim::Lq (  double  rho, int  K )  [inline]

Definition at line 131 of file asim.cc. References pow(), and t1. Referenced by CalcLinkDelays(). { double t1,t2; if(rho==1){ return (1.0*K*(K-1))/(2.0*(K+1)); } t1=rho*1.0/(1-rho); t2=rho*1.0/(1-pow(rho,K+1)); t2*=K*pow(rho,K)+1; return (t1-t2)/2; }

Here is the call graph for this function:

double asim::min (  double  x, double  y )  [inline]

Definition at line 96 of file asim.cc. Referenced by padhye(). { return (x<y)?x:y; }

void asim::newupdate (  int  niter  )  [inline]

Definition at line 824 of file asim.cc. References Adj, flows, c::is_sflow, links, n::mu, nAdj, nConnections, n::nflows, nLinks, c::p_tput, c::scaled, n::uc, Update(), and n::utput. Referenced by command(). { int i; // 1st init all unscaled tputs and cap for (i=0;i<nLinks;i++){ links[i].uc = links[i].mu*(1.1); links[i].utput = 0; } // calc all the unscaled tputs and C set all short flows // to be scaled already for(i=0; i<nConnections; i++){ if(flows[i].is_sflow) flows[i].scaled = 1; else flows[i].scaled = 0; for(int j=0;j<nAdj[i];j++){ if(flows[i].is_sflow) links[Adj[i][j]].uc -= flows[i].p_tput; else links[Adj[i][j]].utput += flows[i].p_tput; } } // for(i=0; i<nLinks; i++ ){ //cout << i << sp << links[i].uc << sp << links[i].utput << endl; //} double maxgamma; // most congested link int bneck; double t; bneck = -1; maxgamma = 0; for(i=0; i<nLinks; i++){ if(links[i].uc){ t=links[i].utput/links[i].uc; if(t > maxgamma){ bneck = i; maxgamma = t; } } } //cout << bneck << endl; //char c= getchar(); /* for(i=0;i<nConnections;i++){ cout << "connection" << sp << i << sp << "-"; for(int j=0;j<nAdj[i];j++){ cout << sp << Adj[i][j]; } cout << endl; } */ // c= getchar(); while(bneck+1){ // cout << "bneck = " << bneck << sp << links[bneck].uc << sp << links[bneck].utput << sp << maxgamma << sp << links[bneck].nflows <<endl; for(i=0; i<links[bneck].nflows; i++){ // For all the connections passing through this link int t = links[bneck].theflows[i]; // get a connection id // cout << i<< sp << t << sp ; // Now reduce its p_tput iff its not a short flow // For short flows we dont do scaling if(!flows[t].is_sflow && !flows[t].scaled){ flows[t].p_tput /= maxgamma; //cout << "Flow " << t << " getting scaled to << " << flows[t].p_tput; flows[t].scaled = 1; // we have scaled this flow already for(int j=0;j<nAdj[t];j++){ // subtract this scaled throughout from all teh links that // have this flow. links[Adj[t][j]].uc -= flows[t].p_tput; links[Adj[t][j]].utput -= flows[t].p_tput*maxgamma; // cout << sp << Adj[i][j]; } //cout << endl; } } // cout << links[bneck].uc << sp << links[bneck].utput << endl; links[bneck].uc = 0; bneck = -1; maxgamma = 0; for(i=0; i<nLinks; i++){ if(links[i].uc){ t=links[i].utput/links[i].uc; if(t > maxgamma){ bneck = i; maxgamma = t; } } } /* c = getchar(); for(i=0;i<nConnections;i++){ cout << "connection" << sp << i << sp << "-"; for(int j=0;j<nAdj[i];j++){ cout << sp << Adj[i][j]; } cout << endl; }*/ // c=getchar(); } Update(niter); }

Here is the call graph for this function:

double asim::padhye (  double  rtt, double  p )  [inline]

Definition at line 100 of file asim.cc. References min(). Referenced by CalcPerFlowDelays(). { double rto = 1; double t=1; t = rtt*sqrt(2*p/3)+rto*min(1,(3*sqrt(3*p/8)))*p*(1+32*p*p); return min(20/rtt,1/t); }

Here is the call graph for this function:

double asim::Pk (  double  rho, int  K, int  k )  [inline]

Definition at line 120 of file asim.cc. References pow(). Referenced by CalcLinkDelays(). { if(rho==1) return 1.0/(K+1); double t; t=(1-rho)*pow(rho,k); t/=1-pow(rho,K+1); return t; }

Here is the call graph for this function:

double asim::Po (  double  rho, int  K )  [inline]

Definition at line 109 of file asim.cc. References pow(). { if(rho==1) return 1.0/(K+1); double t; t=(1.0*(1-rho))/(1.0-pow(rho,K)); return t; }

Here is the call graph for this function:

void asim::PrintData (   )  [inline]

Definition at line 634 of file asim.cc. References n::lambda, links, nLinks, and sp. { for(int i=0;i<nLinks;i++){ cout << i << sp << links[i].lambda << sp << links[i].mu; cout << sp << links[i].buffer << endl; } }

void asim::PrintResults (   )  [inline]

Definition at line 641 of file asim.cc. References c::delay, flows, links, nConnections, nLinks, n::prop, and sp. Referenced by get_link_drop(). { int i; for(i=0;i<nLinks;i++){ // cout << i << sp << links[i].qdelay << sp << links[i].drop; cout << sp << "Qdelay = " << links[i].prop << sp << links[i].lambda; cout << sp << links[i].drop << endl; } for(i=0; i<nConnections; i++){ cout << i << sp << flows[i].delay << sp; cout << flows[i].drop << sp << flows[i].p_tput << sp; cout << sp << endl; } }

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:

void asim::recv (  Packet *  , Handler *  = 0 )  [inline, virtual]

Implements NsObject. Definition at line 948 of file asim.cc. {}

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

double asim::redFn (  double  minth, double  pmin, double  maxth, double  pmax, double  qlength )  [inline]

Definition at line 526 of file asim.cc. { assert(qlength>=0 && qlength<=1); assert(pmax>=0 && pmax<=1); assert(pmin>=0 && pmin<=1); assert(minth>=0 && minth<=1); assert(maxth>=0 && maxth<=1); assert(maxth>=minth); assert(pmax>pmin); double t; if(qlength<minth) return 0; if(qlength>maxth) return 1; return pmin + (qlength-minth)/(pmax-pmin); }

void NsObject::reset (   )  [protected, virtual, inherited]

Reimplemented in BayFullTcpAgent, HashClassifier, IvsSource, dsREDQueue, DiffusionRate, SinkAgent, DiffusionAgent, FloodingAgent, OmniMcastAgent, LinkDelay, CBQueue, DropTail, ErrorModel, PIQueue, Queue< T >, RedPDQueue, REDQueue, REMQueue, RIOQueue, Snoop, FackTcpAgent, FullTcpAgent, SackFullTcpAgent, RFC793eduTcpAgent, Sack1TcpAgent, TcpSink, DelAckSink, TcpAgent, VegasTcpAgent, toraAgent, and Queue< T >. Definition at line 70 of file object.cc. Referenced by NsObject::command(). { }

void asim::Update (  int  niter  )  [inline]

Definition at line 678 of file asim.cc. References n::lambda, links, n::mu, nLinks, n::plambda, and UpdateHelper(). Referenced by newupdate(), and Update3(). { UpdateHelper(); for(int i=0; i<nLinks; i++){ links[i].plambda = links[i].lambda; double t; double tk=links[i].mu*(1.1); if(niter){ if(links[i].tlambda>tk) //t = pow((sqrt(links[i].lambda)+sqrt(links[i].mu+5))/2,2); t = ((links[i].lambda)+tk)/2; // t = exp((log(links[i].lambda)+log(links[i].mu+5))/2); else //t = pow((sqrt(links[i].tlambda)+sqrt(links[i].lambda))/2,2); t= ((links[i].tlambda)+(links[i].lambda))/2; // t = exp((log(links[i].tlambda)+log(links[i].lambda))/2); } else t = links[i].tlambda; links[i].lambda = t; // Update the lambda .......... } }

Here is the call graph for this function:

void asim::Update2 (   )  [inline]

Definition at line 704 of file asim.cc. References n::lambda, links, nLinks, n::plambda, n::tlambda, and UpdateHelper(). { UpdateHelper(); for(int i=0; i<nLinks; i++){ links[i].plambda = links[i].lambda; links[i].lambda = (links[i].lambda + links[i].tlambda)/2; } }

Here is the call graph for this function:

void asim::Update3 (  int  flag = 0  )  [inline]

Definition at line 731 of file asim.cc. References allscaled(), flows, c::is_sflow, links, n::mu, nConnections, nLinks, c::p_tput, c::scaled, sp, n::tlambda, Update(), and UpdateHelper(). { // flag = 1 means dont touch short flows in your scaling algo double maxtlambda = -1e7; int bneck = -1; int i; // 1st get set scaled var of all flows to 0 for(i=0; i<nConnections; i++) flows[i].scaled = 0; // Calculate the tlambdas UpdateHelper(); // Find out the link with the max throughput for(i=0; i<nLinks; i++){ //cout << "after updatehelper link #" << i << " " << links[i].tlambda << "\n"; if(links[i].tlambda>maxtlambda){ bneck = i; maxtlambda = links[i].tlambda; } } cout << "bottleneck = " << bneck << sp << maxtlambda <<endl; double tk = links[bneck].mu*(1+links[bneck].drop)+5; // We cant go above this tk ...... while((maxtlambda > tk + 1) && ! allscaled()){ cout << "Maxtlambda = " << maxtlambda << " bneck = " << bneck << endl; // cout << "tk = "<< tk << " maxlambda = " << maxtlambda << endl; // Now lets reduce this to tk assert(bneck>=0 && bneck<=nLinks); int i; for(i=0; i<links[bneck].nflows; i++){ // For all the connections passing through this link int t = links[bneck].theflows[i]; // get a connection id // Now reduce its p_tput iff its not a short flow // For short flows we dont do scaling if(flag){ if(!flows[t].is_sflow && !flows[t].scaled){ flows[t].p_tput *= (tk)/maxtlambda; //cout << "Flow " << t << " getting scaled to << " << flows[t].p_tput <<" \n"; flows[t].scaled = 1; // we have scaled this flow already } } else flows[t].p_tput *= (tk)/maxtlambda; flows[t].scaled = 1; // we have scaled this flow already } for (i=0; i<nLinks;i++){ cout << "Link " << i << " tlambda = " << links[i].tlambda << endl; } char x =getchar(); // Recalculate the flows' stats UpdateHelper(0); // Find out the link with the max throughput bneck = -1; maxtlambda = -1e7; for(i=0; i<nLinks; i++){ if(links[i].tlambda>maxtlambda){ bneck = i; maxtlambda = links[i].tlambda; } } tk = links[bneck].mu*(1+links[bneck].drop)+5; } Update(0); cout << "Out of the converge loop\n"; for (i =0; i<nLinks;i++){ cout << "Link " << i << " tlambda = " << links[i].tlambda << endl; } }

Here is the call graph for this function:

void asim::UpdateHelper (  int  flag = 0  )  [inline]

Definition at line 658 of file asim.cc. References Adj, flows, links, nAdj, nConnections, nLinks, c::p_tput, c::scaled, and n::tlambda. Referenced by Update(), Update2(), and Update3(). { // if flag = 1 then update only when link is unscaled as of now // if flag = 0 then do the usual update int i; for(i=0; i<nLinks; i++){ links[i].tlambda=0; } for(i=0; i<nConnections; i++){ if(!flag || !flows[i].scaled) for(int j=0;j<nAdj[i];j++) links[Adj[i][j]].tlambda += flows[i].p_tput; // cout << flows[i].p_tput << "\n"; } }

---

Member Data Documentation

int** asim::Adj

Definition at line 90 of file asim.cc. Referenced by CalcPerFlowDelays(), GetInputs(), newupdate(), and UpdateHelper().

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

flow_stats* asim::flows

Definition at line 94 of file asim.cc. Referenced by allscaled(), CalcPerFlowDelays(), get_flow_delay(), get_flow_drop(), get_flow_tput(), GetInputs(), newupdate(), PrintResults(), Update3(), and UpdateHelper().

int asim::K

Definition at line 88 of file asim.cc.

link_stats* asim::links

Definition at line 93 of file asim.cc. Referenced by CalcLinkDelays(), CalcPerFlowDelays(), get_link_delay(), get_link_drop(), get_link_pdelay(), get_link_qdelay(), get_link_tput(), GetInputs(), newupdate(), PrintData(), PrintResults(), Update(), Update2(), Update3(), and UpdateHelper().

int asim::MaxHops

Definition at line 88 of file asim.cc. Referenced by GetInputs().

int* asim::nAdj

Definition at line 91 of file asim.cc. Referenced by CalcPerFlowDelays(), GetInputs(), newupdate(), and UpdateHelper().

int asim::nConnections

Definition at line 87 of file asim.cc. Referenced by allscaled(), CalcPerFlowDelays(), get_flow_delay(), get_flow_drop(), get_flow_tput(), GetInputs(), newupdate(), PrintResults(), Update3(), and UpdateHelper().

int asim::nLinks

Definition at line 89 of file asim.cc. Referenced by CalcLinkDelays(), get_link_delay(), get_link_drop(), get_link_pdelay(), get_link_qdelay(), get_link_tput(), GetInputs(), newupdate(), PrintData(), PrintResults(), Update(), Update2(), Update3(), and UpdateHelper().

---

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

• asim.cc

---