TY - GEN

T1 - Rigid and competitive fault tolerance for logical information structures in networks

AU - Chechik, Shiri

AU - Peleg, David

PY - 2010

Y1 - 2010

N2 - Consider a logical structure S constructed over a given network G and possessing certain properties specified by a requirement predicate P(S, G). Consider a failure event involving a set F of disconnected edges or crashed vertices. The paper deals with making S fault-tolerant, i.e., ensuring that after the failure event, the surviving structure S′ = S\F continues to satisfy P. This requirement for fault-tolerance can be interpreted in two different ways. Rigid fault-tolerance means that after the failure event F, we insist on imposing on the surviving structure S′ the requirements of P with respect to the original network G, i.e., demanding that S′ satisfies the predicate P(S′, G). Alternatively, competitive fault tolerance involves evaluating the performance of the surviving S′ with respect to the surviving network G′ = G \ F, i.e., requiring that subsequent to the failure event F, the surviving S′ satisfies P(S′, G′). The paper introduces the distinction between rigid and competitive fault tolerance in network structures, and explores this distinction through studying MST structures, connectivity structures and flow structures. In particular, necessary and sufficient conditions are established for the existence of rigid fault tolerant structures, and constructions are presented for both types of structures.

AB - Consider a logical structure S constructed over a given network G and possessing certain properties specified by a requirement predicate P(S, G). Consider a failure event involving a set F of disconnected edges or crashed vertices. The paper deals with making S fault-tolerant, i.e., ensuring that after the failure event, the surviving structure S′ = S\F continues to satisfy P. This requirement for fault-tolerance can be interpreted in two different ways. Rigid fault-tolerance means that after the failure event F, we insist on imposing on the surviving structure S′ the requirements of P with respect to the original network G, i.e., demanding that S′ satisfies the predicate P(S′, G). Alternatively, competitive fault tolerance involves evaluating the performance of the surviving S′ with respect to the surviving network G′ = G \ F, i.e., requiring that subsequent to the failure event F, the surviving S′ satisfies P(S′, G′). The paper introduces the distinction between rigid and competitive fault tolerance in network structures, and explores this distinction through studying MST structures, connectivity structures and flow structures. In particular, necessary and sufficient conditions are established for the existence of rigid fault tolerant structures, and constructions are presented for both types of structures.

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

U2 - 10.1109/EEEI.2010.5662210

DO - 10.1109/EEEI.2010.5662210

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

AN - SCOPUS:78651252144

SN - 9781424486809

T3 - 2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010

SP - 24

EP - 25

BT - 2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010

T2 - 2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010

Y2 - 17 November 2010 through 20 November 2010

ER -