Mixed fault tolerance in server assignment: Combining reinforcement and backup

Tal Navon; David Peleg

doi:10.1007/978-3-030-01325-7_23

Mixed fault tolerance in server assignment: Combining reinforcement and backup

Tal Navon, David Peleg

Weizmann Institute of Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

We study the mixed approach to fault tolerance in the general context of server assignment in networks. The approach is based on mixing two different existing strategies, namely, reinforcement and backup. The former strategy protects clients by reinforcing the servers assigned to them and making them fault-resistant (at a possibly high cost), while the latter protects clients by assigning to them alternate low price backup servers that can replace their primary servers in case those fail. Applying the mixed approach to fault tolerance gives rise to new fault-tolerant variations of known server assignment problems. We introduce several NP-hard problems of this type, including the mixed fault-tolerant dominating set problem, the mixed fault-tolerant centers problem, and the mixed fault-tolerant facility location problem, and present polynomial time approximation algorithms for them, demonstrating the viability of the mixed strategy for server assignment problems.

Original language	English
Title of host publication	25th International Colloquium, SIROCCO 2018, Revised Selected Papers
Editors	Zvi Lotker, Boaz Patt-Shamir
Publisher	Springer Verlag
Pages	249-263
Number of pages	15
ISBN (Print)	9783030013240
DOIs	https://doi.org/10.1007/978-3-030-01325-7_23
State	Published - 2018
Externally published	Yes
Event	25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018 - Ma’ale HaHamisha, Israel Duration: 18 Jun 2018 → 21 Jun 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11085
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018
Country/Territory	Israel
City	Ma’ale HaHamisha
Period	18/06/18 → 21/06/18

Bibliographical note

Publisher Copyright:
© Springer Nature Switzerland AG 2018.

Keywords

Approximation
Backup Reinforcement
Dominating set Centers
Facility location
Fault tolerance
Server assignment problems

Access to Document

10.1007/978-3-030-01325-7_23

Cite this

Navon, T., & Peleg, D. (2018). Mixed fault tolerance in server assignment: Combining reinforcement and backup. In Z. Lotker, & B. Patt-Shamir (Eds.), 25th International Colloquium, SIROCCO 2018, Revised Selected Papers (pp. 249-263). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11085). Springer Verlag. https://doi.org/10.1007/978-3-030-01325-7_23

Navon, Tal ; Peleg, David. / Mixed fault tolerance in server assignment : Combining reinforcement and backup. 25th International Colloquium, SIROCCO 2018, Revised Selected Papers. editor / Zvi Lotker ; Boaz Patt-Shamir. Springer Verlag, 2018. pp. 249-263 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b88ae6aa9adb4381a171dc9e583cbc6e,

title = "Mixed fault tolerance in server assignment: Combining reinforcement and backup",

abstract = "We study the mixed approach to fault tolerance in the general context of server assignment in networks. The approach is based on mixing two different existing strategies, namely, reinforcement and backup. The former strategy protects clients by reinforcing the servers assigned to them and making them fault-resistant (at a possibly high cost), while the latter protects clients by assigning to them alternate low price backup servers that can replace their primary servers in case those fail. Applying the mixed approach to fault tolerance gives rise to new fault-tolerant variations of known server assignment problems. We introduce several NP-hard problems of this type, including the mixed fault-tolerant dominating set problem, the mixed fault-tolerant centers problem, and the mixed fault-tolerant facility location problem, and present polynomial time approximation algorithms for them, demonstrating the viability of the mixed strategy for server assignment problems.",

keywords = "Approximation, Backup Reinforcement, Dominating set Centers, Facility location, Fault tolerance, Server assignment problems",

author = "Tal Navon and David Peleg",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2018.; 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018 ; Conference date: 18-06-2018 Through 21-06-2018",

year = "2018",

doi = "10.1007/978-3-030-01325-7_23",

language = "אנגלית",

isbn = "9783030013240",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "249--263",

editor = "Zvi Lotker and Boaz Patt-Shamir",

booktitle = "25th International Colloquium, SIROCCO 2018, Revised Selected Papers",

address = "גרמניה",

}

Navon, T & Peleg, D 2018, Mixed fault tolerance in server assignment: Combining reinforcement and backup. in Z Lotker & B Patt-Shamir (eds), 25th International Colloquium, SIROCCO 2018, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11085, Springer Verlag, pp. 249-263, 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018, Ma’ale HaHamisha, Israel, 18/06/18. https://doi.org/10.1007/978-3-030-01325-7_23

Mixed fault tolerance in server assignment: Combining reinforcement and backup. / Navon, Tal; Peleg, David.
25th International Colloquium, SIROCCO 2018, Revised Selected Papers. ed. / Zvi Lotker; Boaz Patt-Shamir. Springer Verlag, 2018. p. 249-263 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11085).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Mixed fault tolerance in server assignment

T2 - 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018

AU - Navon, Tal

AU - Peleg, David

N1 - Publisher Copyright: © Springer Nature Switzerland AG 2018.

PY - 2018

Y1 - 2018

N2 - We study the mixed approach to fault tolerance in the general context of server assignment in networks. The approach is based on mixing two different existing strategies, namely, reinforcement and backup. The former strategy protects clients by reinforcing the servers assigned to them and making them fault-resistant (at a possibly high cost), while the latter protects clients by assigning to them alternate low price backup servers that can replace their primary servers in case those fail. Applying the mixed approach to fault tolerance gives rise to new fault-tolerant variations of known server assignment problems. We introduce several NP-hard problems of this type, including the mixed fault-tolerant dominating set problem, the mixed fault-tolerant centers problem, and the mixed fault-tolerant facility location problem, and present polynomial time approximation algorithms for them, demonstrating the viability of the mixed strategy for server assignment problems.

AB - We study the mixed approach to fault tolerance in the general context of server assignment in networks. The approach is based on mixing two different existing strategies, namely, reinforcement and backup. The former strategy protects clients by reinforcing the servers assigned to them and making them fault-resistant (at a possibly high cost), while the latter protects clients by assigning to them alternate low price backup servers that can replace their primary servers in case those fail. Applying the mixed approach to fault tolerance gives rise to new fault-tolerant variations of known server assignment problems. We introduce several NP-hard problems of this type, including the mixed fault-tolerant dominating set problem, the mixed fault-tolerant centers problem, and the mixed fault-tolerant facility location problem, and present polynomial time approximation algorithms for them, demonstrating the viability of the mixed strategy for server assignment problems.

KW - Approximation

KW - Backup Reinforcement

KW - Dominating set Centers

KW - Facility location

KW - Fault tolerance

KW - Server assignment problems

UR - http://www.scopus.com/inward/record.url?scp=85061119157&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-01325-7_23

DO - 10.1007/978-3-030-01325-7_23

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85061119157

SN - 9783030013240

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 249

EP - 263

BT - 25th International Colloquium, SIROCCO 2018, Revised Selected Papers

A2 - Lotker, Zvi

A2 - Patt-Shamir, Boaz

PB - Springer Verlag

Y2 - 18 June 2018 through 21 June 2018

ER -

Navon T, Peleg D. Mixed fault tolerance in server assignment: Combining reinforcement and backup. In Lotker Z, Patt-Shamir B, editors, 25th International Colloquium, SIROCCO 2018, Revised Selected Papers. Springer Verlag. 2018. p. 249-263. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-01325-7_23

Mixed fault tolerance in server assignment: Combining reinforcement and backup

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this