Combining fairness with throughput
- 1 May 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 670-679
- https://doi.org/10.1145/335305.335400
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Converging to approximated max-min flow fairness in logarithmic timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- PhantomPublished by Association for Computing Machinery (ACM) ,1996
- Convergence complexity of optimistic rate based flow control algorithms (extended abstract)Published by Association for Computing Machinery (ACM) ,1996
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- On-line load balancing with applications to machine scheduling and virtual circuit routingPublished by Association for Computing Machinery (ACM) ,1993
- Optimal flows in networks with multiple sources and sinksMathematical Programming, 1974