Stable and utility-maximizing scheduling for stochastic processing networks

Authors:
Libin Jiang;Jean Walrand
Affiliations:
EECS Department, University of California at Berkeley;EECS Department, University of California at Berkeley
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 5
Cited 4

Optimal control of a two-station Brownian network

Mathematics of Operations Research
Optimization flow control—I: basic algorithm and convergence

IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control

IEEE/ACM Transactions on Networking (TON)
Maximum Pressure Policies in Stochastic Processing Networks

Operations Research
Stability and Asymptotic Optimality of Generalized MaxWeight Policies

SIAM Journal on Control and Optimization

A unified modeling framework for distributed resource allocation of general fork and join processing networks

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Utility optimal scheduling in processing networks

Performance Evaluation
Robust Design and Control of Call Centers with Flexible Interactive Voice Response Systems

Manufacturing & Service Operations Management
Towards a queueing-based framework for in-network function computation

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Stochastic Processing Networks (SPNs) model manufacturing, communication, and service systems. In such a network, service activities require parts and resources to produce other parts. Because service activities compete for resources, a scheduling problem arises. This paper proposes a deficit maximum weight (DMW) algorithm to achieve throughput optimality and maximize the net utility of the production. It overcomes the instability problem of Maximum-Weight Scheduling in SPNs.