Skip to content
RDL
Network
Ecosystem
Switch app
TR
About
FAQ
Sign in
Get started
Approximate fair allocation of link bandwidth — Rong Pan (2003) | RDL Network
Back
Cite
Save
Save for later
Share
Home
Publications
Approximate fair allocation of link bandwidth
Shared by
Scott Shenker
University of California, Berkeley
Approximate fair allocation of link bandwidth
Article
2003
en
Authors
+1 more
RP
Rong Pan
BP
Balaji Prabhakar
LB
Lee Breslau
Abstract
1 min read
Approximate fair dropping (AFD), an active queue management scheme, allocates link bandwidth in an approximately fair manner. AFD-NFT, an enhancement to AFD, performs similarly and is much easier to implement.
Discussion
(0)
Sign in
to like and join the discussion.
No comments yet. Be the first to comment.
Related publications
Article
2003
A flow table-based design to approximate fairness
Rong Pan
,
Lee Breslau
,
B. Prbhakar
,
Scott Shenker
Article
2003
Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks
Ion Stoica
,
Scott Shenker
,
Hui Zhang
Article
2003
Approximate fairness through differential dropping
Rong Pan
,
Lee Breslau
,
Balaji Prabhakar
,
Scott Shenker
Article
1998
<i>Core</i> -stateless fair queueing
Ion Stoica
,
Scott Shenker
,
Hui Zhang
Article
1998
<i>Core</i> -stateless fair queueing
Ion Stoica
,
Scott Shenker
,
Hui Zhang
.webp){kind=small}
Discussion(0)
No comments yet. Be the first to comment.