hi,everyone
I am a new user to ns-2,I simulation the CBQ with the following script,but
produce error,I do not konw why,who can help me ?thank you in advance!
this is my script:
set ns [new Simulator]
set tf [open cbq.tr w]$ns trace-all $tf
proc finish {} {global ns tf nf
Dear All!I have some question to ask for you help! when i use the CBQ flow
to simulate in ns-2,I set the packet-size,set-rate and bandwidth.now I want to
know the meaning of the rate ,the relation between the rate and the
intervar.and how to calculate the total number of the packet
Dear ALL! When i use the CBQ,need i use the topclass,how to understand it ,I
saw a few script and found no flow banding it.how to understand its
priority.what's the difference between the CBQ and CBQ/WRR. Thank you in
advance!
chenmaoxiang
---
大小单双 机会多多,10分钟就开奖,立即返奖(
http://ad4.sina.com.cn/sina/limeng3/mail_zhuiyu/2007/mail_zhuiyu_20070319.html )
===
注册新浪2G免费邮箱( http://mail.sina.com.cn/chooseMode.html
static class WFQAggregClassifierClass : public TclClass { public:
WFQAggregClassifierClass():TclClass(WFQAggregClassifier) {}; TclObject*
create(int,const char*const*) { return(new WFQAggregClassifier); };}
class_wfqsampleclassifier;
how to understand the WFQAggregClassifier and the
hi everyone
how to understand the relation between eligible_formal
,eligible_ancestros,eligible_toplevel and MAXLEVEl
I want to classify some flows into a flow class by their weights,how to do
it by modify the CBQ source code.
Thanks
chenmaoxiang
hi everyone
how to understand the relation between eligible_formal
,eligible_ancestros,eligible_toplevel and MAXLEVEl
I want to classify some flows into a flow class by their weights,how to do
it by modify the CBQ source code.
Thanks
chenmaoxiang
Dear all,
I studied a new packet algorithm named stratified round robin : a low
complexity packet scheduler with bandwidth fairness and bounded delay
recently,who have researched it or have some idea about it .I need your help
If you know something about it ,Please help me ! I am
hi everyone
who have researched a new packet scheduling algorithm called stratified
round robin: a low complexity packet scheduler with bandwidth fairness and
bounded delay ;put forward by sriram ramaahadran.I studied it recently ,but I
have some difficulity.I look for help
Thank you