Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints.

Saved in:
Bibliographic Details
Title: Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints.
Authors: Stolyar, Alexander1, stolyar@research.bell-labs.com, Zhong, Yuan2, yz2561@columbia.edu
Source: Queueing Systems; Feb2015, Vol. 79 Issue 2, p117-143, 27p
Database: Applied Science & Technology Source
Be the first to leave a comment!
You must be logged in first