[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [ns] FRED in ns.
Here is a FRED implementation in ns-2.
http://www.cs.berkeley.edu/~istoica/csfq/disciplines-ns2.1b7a.tar.gz
Details of installation procedures are shown in the following:
http://www.cs.berkeley.edu/~istoica/csfq/
Recently, there have been many advances in the area of active queue mangement(AQM). You will find some advances in CSFQ(Core-Stateless Fair Queueing), RFQ(Rainbow Fair Queueing) and TUF(Tag-based Unified Fairness).
----------------------------------------------------------------------
Cho, Jeong-woo
Communication and Information Systems Laboratory
Dept. of Electrical Engineering and Computer Science
Korea Advanced Institute of Science and Technology(KAIST)
373-1 Kusong-dong, Yusong-gu, Taejon 305-701, Korea
TEL: +82-42-869-8067 (ex.107) FAX: +82-42-867-0550
E-mail: [email protected]
----------------------------------------------------------------------
----- Original Message -----
From: "hai22" <[email protected]>
To: <[email protected]>
Sent: Thursday, December 13, 2001 7:24 AM
Subject: [ns] FRED in ns.
> Hi,
> I want to know that is some one has implemented FRED in ns or not ?
> Thanks very much,
> Aun.
> -----------------------------------------------------------------------------------------
> Flow Red (FRED) is a modified RED algorithm presented by Dong Lin and
> Robert Morris
> in their paper titled as "Dynamics of Random Early Detection" in SIGCOMM
> 1997.
> -----------------------------------------------------------------------------------------
>
>
>