|
|
|
|
|
|
|
|
We
know that Td ~ r (utilization
factor)
|
|
If r grows than Td grows
|
|
If linear than C ~ K * 1/Td
|
|
|
If
non-linear We have problem
|
|
|
But
we know that we deal with Bottleneck band hop
|
which can:
|
|
- eliminate previous Td
|
|
- replace them by own Td ~ Lpacket/C
|
|
- Queuing start to play important role
|
|
|
Use non linear solution
|
|