16 search results - page 3 / 4 » New Bounds on the Competitiveness of Randomized Online Call ... |
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We consider a network providing Differentiated Services (DiffServ) which allow network service providers to offer different levels of Quality of Service (QoS) to different traffic...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
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...
SIGECOM
2011
ACM
12 years 10 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
IPPS
2000
IEEE
14 years 2 days ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...