Title :
Local reconfiguration policies
Author :
Millen, Jonathan K.
Author_Institution :
Comput. Sci. Lab., SRI Int., Menlo Park, CA, USA
Abstract :
Survivable systems are modelled abstractly as collections of services supported by any of a set of configurations of components. Reconfiguration to restore services as a result of component failure is viewed as a kind of “flow” analogous to information flow. We apply C. Meadows´ (1990) theorem on datset aggregates to characterize the maximum safe flow policy for distributed systems. For reconfiguration, safety means that services are preserved and that that reconfiguration rules may be stated and applied locally, with respect to just the failed components
Keywords :
distributed processing; fault tolerant computing; reconfigurable architectures; component failure; datset aggregates; distributed systems; failed components; information flow; local reconfiguration policies; maximum safe flow policy; reconfiguration rules; survivable systems; Aggregates; Computer architecture; Computer networks; Computer science; Computer security; Context-aware services; Fault tolerance; Hardware; Hazards; Laboratories;
Conference_Titel :
Security and Privacy, 1999. Proceedings of the 1999 IEEE Symposium on
Conference_Location :
Oakland, CA
Print_ISBN :
0-7695-0176-1
DOI :
10.1109/SECPRI.1999.766717
