STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Adaptive packet routing for bursty adversarial traffic
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An adversarial model for distributed dynamic load balancing
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Stability of load balancing algorithms in dynamic adversarial systems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Scheduling Over a Time-Varying User-Dependent Channel with Applications to High Speed Wireless Data
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Simple Routing Strategies for Adversarial Systems
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Solving fractional packing problems in Oast(1/ε) iterations
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Queueing Systems: Theory and Applications
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Providing quality of service over a shared wireless link
IEEE Communications Magazine
| Hi-index | 0.00 |
We study the stability of the max-weight protocol for combined routingand scheduling in communication networks. Previous work has shownthat this protocol is stable for adversarial multicommodity trafficin subcritically loaded static networks and for single-commoditytraffic in critically loaded dynamic networks. We show: The max-weight protocol is stable for adversarial multicommodity traffic in adversarial dynamic networks whenever the network is subcriticallyloaded. The max-weight protocol is stable for fixed multicommodity trafficin fixed networks even if the network is critically loaded. The latter result has implications for the running time of themax-weight protocol when it is used to solve multicommodity flowproblems. In particular, for a fixed problem instance we show thatif the value of the optimum solution is known, the max-weight protocolfinds a flow that is within a (1-ε)-factor of optimal in time O(1/ε) (improving the previous bound of O(1/ε2)). If thevalue of the optimum solution is not known, we show how to apply themax-weight algorithm in a binary search procedure that runs in O(1/ε) time.