<s>
In	O
a	O
communication	O
network	O
,	O
sometimes	O
a	O
max-min	B-Algorithm
fairness	I-Algorithm
of	O
the	O
network	O
is	O
desired	O
,	O
usually	O
opposed	O
to	O
the	O
basic	O
first-come	O
first-served	O
policy	O
.	O
</s>
<s>
With	O
max-min	B-Algorithm
fairness	I-Algorithm
,	O
data	O
flow	O
between	O
any	O
two	O
nodes	O
is	O
maximized	O
,	O
but	O
only	O
at	O
the	O
cost	O
of	O
more	O
or	O
equally	O
expensive	O
data	O
flows	O
.	O
</s>
<s>
To	O
put	O
it	O
another	O
way	O
,	O
in	O
case	O
of	O
network	B-Protocol
congestion	I-Protocol
any	O
data	O
flow	O
is	O
only	O
impacted	O
by	O
smaller	O
or	O
equal	O
flows	O
.	O
</s>
<s>
In	O
such	O
context	O
,	O
a	O
bottleneck	B-Protocol
link	I-Protocol
for	O
a	O
given	O
data	O
flow	O
is	O
a	O
link	O
that	O
is	O
fully	O
utilized	O
(	O
is	O
saturated	O
)	O
and	O
of	O
all	O
the	O
flows	O
sharing	O
this	O
link	O
,	O
the	O
given	O
data	O
flow	O
achieves	O
maximum	O
data	O
rate	O
network-wide	O
.	O
</s>
<s>
Note	O
that	O
this	O
definition	O
is	O
substantially	O
different	O
from	O
a	O
common	O
meaning	O
of	O
a	O
bottleneck	B-Protocol
.	O
</s>
<s>
Also	O
note	O
,	O
that	O
this	O
definition	O
does	O
not	O
forbid	O
a	O
single	O
link	O
to	O
be	O
a	O
bottleneck	B-Protocol
for	O
multiple	O
flows	O
.	O
</s>
<s>
A	O
data	O
rate	O
allocation	O
is	O
max-min	B-Algorithm
fair	I-Algorithm
if	O
and	O
only	O
if	O
a	O
data	O
flow	O
between	O
any	O
two	O
nodes	O
has	O
at	O
least	O
one	O
bottleneck	B-Protocol
link	I-Protocol
.	O
</s>
