Premium
The backup 2‐center and backup 2‐median problems on trees
Author(s) -
Wang HungLung,
Wu Bang Ye,
Chao KunMao
Publication year - 2009
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20261
Subject(s) - backup , server , computer science , vertex (graph theory) , computer network , combinatorics , mathematics , operating system , theoretical computer science , graph
In this paper, we are concerned with the problem of deploying two servers in a tree network, where each server may fail with a given probability. Once a server fails, the other server will take full responsibility for the services. Here, we assume that the servers do not fail simultaneously. In the backup 2‐center problem, we want to deploy two servers at the vertices such that the expected distance from a farthest vertex to the closest functioning server is minimum. In the backup 2‐median problem, we want to deploy two servers at the vertices such that the expected sum of distances from all vertices to the set of functioning servers is minimum. We propose an O ( n )‐time algorithm for the backup 2‐center problem and an O ( n log n )‐time algorithm for the backup 2‐median problem, where n is the number of vertices in the given tree network. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009