| Network
Flow Control Problem |
|
|
|
| Design source and
link control laws to achieve: |
||
| stability,
utilization, fairness, robustness |
||
| Optimization approach:
Kelly, Low, Srikant, … |
| x N |
| y L |
| Rf |
| N
sources |
| L
links |
|
|
|
|
|
| Forward routing |
||||
| matrix (including |
||||
| delays) |
||||
|
|
|
|
|
| Source |
||||
| contro |
||||
| l |
||||
|
|
|
|
|
| link |
||||
| contro |
||||
| l |
||||
|
|
|
|
|
|
|
|
|
| Adjust sending |
||||||||
| rate based on |
||||||||
| congestion |
||||||||
| indication |
||||||||
| (AIMD, TCP |
||||||||
| Reno, Vegas) |
||||||||
|
|
|
|
|
|
|
|
|
| AQM: Provide |
||||||||
| congestion |
||||||||
| information |
||||||||
| (RED, REM, |
||||||||
| AVQ) |
||||||||
| Rb |
| p L |
| q N |
|
|
|
| Return routing matrix |
||
| (including
delays) |
||
