Convergence complexity of optimistic rate based flow control algorithms (extended abstract)

Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract)

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing

The global efficiency of distributed, rate-based, flow control algorithms

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing

Fast, fair, and frugal bandwidth allocation in ATM networks

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

Combining fairness with throughput: online routing with multiple objectives

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Approximate majorization and fair online load balancing

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Using approximate majorization to characterize protocol fairness

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Equitable cost allocations via primal-dual-type algorithms

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing

Fairness in Routing and Load Balancing

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Fairness and load balancing in wireless LANs using association control

Proceedings of the 10th annual international conference on Mobile computing and networking

Fairness and load balancing in wireless LANs using association control

IEEE/ACM Transactions on Networking (TON)

Bandwidth allocation in networks: a single dual update subroutine for multiple objectives

CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking