We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Allocating servers in infostations for on-demand communications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Bertossi, A.A. ; Dept. of Comput. Sci., Bologna Univ., Italy ; Pinotti, M.C. ; Rizzi, R. ; Gupta, P.

Given a set of service requests, each characterized by a temporal interval and a category, an integer k, and an integer hc for each category c, the Server Allocation with Bounded Simultaneous Requests problem consists in assigning a server to each request in such a way that at most k mutually simultaneous requests are assigned to the same server at the same time, out of which at most hc are of category c, and the minimum number of servers is used. Since this problem is computationally intractable, a 2-approximation on-line algorithm is exhibited which asymptotically gives a (2 $h/k)-approximation, where h = min{hc}. Generalizations of the problem are considered, where each request r is also characterized by a bandwidth rate wr, and the sum of the bandwidth rates of the simultaneous requests is bounded, and where each request is characterized also by a gender bandwidth. Such generalizations contain bin-packing and multiprocessor task scheduling as special cases, and they admit on-line algorithms providing constant approximations.

Published in:

Parallel and Distributed Processing Symposium, 2003. Proceedings. International

Date of Conference:

22-26 April 2003