Hello Alex Sorry for my stubborn question. I read the S.Floyd paer "Link-sharing and resource mamagement...." On page 5, they said" The estimator estimates the bandwidth used byeach class over the appropriate time interval, to determine whether or not each class has been receiveing its link -sharing bandwidth..." Also as I know CBQ building block, they have general scheduler, link-sharing scheduler, estimater, classifier etc. complonents. This is why I ask you how about its implementation in linux. I read the sch_cbq.c comments, not quite sure one line" Linux has no EOI event, so that we ca not estimater true idle class idle time..." what's EOI event, This is why in Linux, CBQ canot measure bandwidth? regards yuxiao ----- Original Message ----- From: <kuznet@ms2.inr.ac.ru> To: "yuxiao" <yxjia@site.uottawa.ca> Cc: <lartc@mailman.ds9a.nl>; <stef.coene@docum.org> Sent: Friday, September 06, 2002 11:31 AM Subject: Re: questiona about CBQ algorithm in Linux > Hello! > > > average), how about Linux implemenatation about estimator?=20 > > also do you have link for this algorithm? I canot find it. > > The questions are answered in papers, references are in comments > in sch_cbq.c, look at http://www.icir.org/floyd/cbq.html > > > > 3. In linux how CBQ measure used bandwidth per class? does it measure > > bandwith bits/sec? > > No, it does not measure bandwdith at all. Read papers, please. > > > > 7. Can HTB do the same job as CBQ right now, can HTB do borrow ?=20 > > Yes, it does. And does it better than CBQ. > > Alexey _______________________________________________ LARTC mailing list / LARTC@mailman.ds9a.nl http://mailman.ds9a.nl/mailman/listinfo/lartc HOWTO: http://lartc.org/
