CORE
πΊπ¦Β
Β make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Metrical Service Systems with Multiple Servers
Authors
Ashish Chiplunkar
Sundar Vishwanathan
Publication date
21 May 2014
Publisher
Doi
Cite
View
on
arXiv
Abstract
We study the problem of metrical service systems with multiple servers (MSSMS), which generalizes two well-known problems -- the
k
k
k
-server problem, and metrical service systems. The MSSMS problem is to service requests, each of which is an
l
l
l
-point subset of a metric space, using
k
k
k
servers, with the objective of minimizing the total distance traveled by the servers. Feuerstein initiated a study of this problem by proving upper and lower bounds on the deterministic competitive ratio for uniform metric spaces. We improve Feuerstein's analysis of the upper bound and prove that his algorithm achieves a competitive ratio of
k
(
(
k
+
l
l
)
β
1
)
k({{k+l}\choose{l}}-1)
k
(
(
l
k
+
l
β
)
β
1
)
. In the randomized online setting, for uniform metric spaces, we give an algorithm which achieves a competitive ratio
O
(
k
3
log
β‘
l
)
\mathcal{O}(k^3\log l)
O
(
k
3
lo
g
l
)
, beating the deterministic lower bound of
(
k
+
l
l
)
β
1
{{k+l}\choose{l}}-1
(
l
k
+
l
β
)
β
1
. We prove that any randomized algorithm for MSSMS on uniform metric spaces must be
Ξ©
(
log
β‘
k
l
)
\Omega(\log kl)
Ξ©
(
lo
g
k
l
)
-competitive. We then prove an improved lower bound of
(
k
+
2
l
β
1
k
)
β
(
k
+
l
β
1
k
)
{{k+2l-1}\choose{k}}-{{k+l-1}\choose{k}}
(
k
k
+
2
l
β
1
β
)
β
(
k
k
+
l
β
1
β
)
on the competitive ratio of any deterministic algorithm for
(
k
,
l
)
(k,l)
(
k
,
l
)
-MSSMS, on general metric spaces. In the offline setting, we give a pseudo-approximation algorithm for
(
k
,
l
)
(k,l)
(
k
,
l
)
-MSSMS on general metric spaces, which achieves an approximation ratio of
l
l
l
using
k
l
kl
k
l
servers. We also prove a matching hardness result, that a pseudo-approximation with less than
k
l
kl
k
l
servers is unlikely, even for uniform metric spaces. For general metric spaces, we highlight the limitations of a few popular techniques, that have been used in algorithm design for the
k
k
k
-server problem and metrical service systems.Comment: 18 pages; accepted for publication at COCOON 201
Similar works
Full text
Available Versions
CiteSeerX
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:CiteSeerX.psu:10.1.1.758.5...
Last time updated on 30/10/2017