Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well (Q5323085)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5585637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well |
scientific article; zbMATH DE number 5585637 |
Statements
Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well (English)
0 references
23 July 2009
0 references
distributed flow algorithms
0 references
oblivious routing
0 references
network algorithms
0 references
maximal flow
0 references
1.0000001
0 references
0.86002123
0 references
0 references
0.83143747
0 references
0.82867384
0 references
0 references
