40 citations · 112 across the 14 of their papers we have counts for
5 papers · 1 filter
Robust Scheduling for Flexible Processing Networks
Ramtin Pedarsani, Jean Walrand, Yuan Zhong
Modern processing networks often consist of heterogeneous servers with widely varying capabilities, and process job flows with complex structure and requirements. A major challenge…
A service system with packing constraints: Greedy randomized algorithm achieving sublinear in scale optimality gap
Alexander Stolyar, Yuan Zhong
A service system with multiple types of arriving customers is considered. There is an infinite number of homogeneous servers. Multiple customers can be placed for simultaneous serv…
Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints
Alexander Stolyar, Yuan Zhong
We consider a service system model primarily motivated by the problem of efficient assignment of virtual machines to physical host machines in a network cloud, so that the number o…
Optimal queue-size scaling in switched networks
D. Shah, N. S. Walton, Y. Zhong
We consider a switched (queuing) network in which there are constraints on which queues may be served simultaneously; such networks have been used to effectively model input-queued…
Qualitative properties of -fair policies in bandwidth-sharing networks
D. Shah, J. N. Tsitsiklis, Y. Zhong
We consider a flow-level model of a network operating under an -fair bandwidth sharing policy (with ) proposed by Roberts and Massoulié [Telecomunication Systems 15 (2000)…