Resource allocation and admission control are critical tasks in a communication network, that often must be performed online. Algorithms for these types of problems have been considered both under benefit models (e.g., with a goal of approximately ...
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the capacity limitations of the network. The admission control problem has been ...
In this paper we consider the following problems: we are given a set of n items {u"1,...,u"n} and a number of unit-capacity bins. Each item u"i has a size w"i@?(0,1] and a penalty p"i>=0. An item can be either rejected, in which case we pay its penalty, ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in
