## 摘要

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.

原文 | 英語 |
---|---|

頁（從 - 到） | 39-49 |

頁數 | 11 |

期刊 | Networks |

卷 | 53 |

發行號 | 1 |

DOIs | |

出版狀態 | 已發佈 - 2009 一月 |

對外發佈 | 是 |

## ASJC Scopus subject areas

- 資訊系統
- 電腦網路與通信