Allocating Servers in Infostations for On-Demand Communications

Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation 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. Sinc ethis problem is computationally intractable, a 2-appr oximationonline algorithm is exhibite dwhich asymptotically gives a ; 2 ; h k -appr oximation,where h = minfhcg. Generalizations of the problem are considered, where each request r is also char acterized by a bandwidth rate wr, and the sum of the bandwidth rates of the simultaneous requests is bounded, and where each request is characterize dalso by a gender bandwidth. Such gener alizations contain Bin-Packing and Multiprocessor T ask schedulingas special cases, and they admit on-...

• Type: Conference
• Year: 2003
• Where: IPPS
• Authors: Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Phalguni Gupta
• Keywords: Bandwidth Rates, Distributed And Parallel Computing, Integer Hc, IPPS 2003, Simultaneous Requests