On the flow-level dynamics of a packet-switched network
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Diffusion limit of a two-class network: stationary distributions and interchange of limits
ACM SIGMETRICS Performance Evaluation Review
Fixed-point approximations of bandwidth sharing networks with rate constraints
ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
Asymptotic Optimality of Balanced Routing
Operations Research
Hi-index | 0.00 |
We study a stochastic network that consists of a set of servers processing multiple classes of jobs. Each class of jobs requires a concurrent occupancy of several servers while being processed, and each server is shared among the job classes in a head-of-the-line processor-sharing mechanism. The allocation of the service capacities is a real-time control mechanism: in each network state, the resource allocation is the solution to an optimization problem that maximizes a general utility function. Whereas this resource allocation optimizes in a “greedy” fashion with respect to each state, we establish its asymptotic optimality in terms of (a) deriving the fluid and diffusion limits of the network under this allocation scheme, and (b) identifying a cost function that is minimized in the diffusion limit, along with a characterization of the so-called fixed-point state of the network.