[ee122] [Project2] Congestion "Fairness"

Jorge Ortiz jortiz at cs.berkeley.edu
Tue Nov 6 22:21:05 PST 2007

There's a common fairness metric used called Jain's fairness metric
(http://en.wikipedia.org/wiki/Fairness_measure).  This is used to
compare fairness among senders.


On 11/6/07, Jorge Ortiz <jortiz at cs.berkeley.edu> wrote:
> Fairness is essentially related to every participant getting their
> fair share of the network resources (bandwidth).  If two sources are
> continuously sending data they should each get half the bandwidth.
> Fairness measure can actually be a bit more complicated if you
> consider each source's send rate.  The intuition is that if a sender
> does not have as much to send, it doesn't necessarily need half the
> bandwidth.  Queue-management mechanisms can assure fairness for a set
> of senders by trying to determine the send rate for each sender and
> alotting enough bandwidth (queue space) for each source to obtain
> their maximum send rate.
> Jorge
> On 11/6/07, Jonathan D. Ellithorpe <jde at berkeley.edu> wrote:
> > I was just wondering what is meant by "Fairness" with respect to
> > congestion control algorithms. I can see that simply having congestion
> > control is more "fair" in relation to the use of the network by many
> > users, but I don't really know how to compare the fairness of two
> > different congestion control algorithms. Any guidance would be greatly
> > appreciated.
> >
> > Jonathan
> > _______________________________________________
> > ee122 mailing list
> > ee122 at mailman.ICSI.Berkeley.EDU
> > http://mailman.ICSI.Berkeley.EDU/mailman/listinfo/ee122
> >

More information about the ee122 mailing list