Local reconfiguration policies

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...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344) pp. 48 - 56
Main Author Millen, J.K.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1999
Subjects
Aggregates
Computer architecture
Computer networks
Computer science
Computer security
Context-aware services
Fault tolerance
Hardware
Hazards
Laboratories
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9780769501765
0769501761
ISSN:1081-6011
2375-1207
DOI:10.1109/SECPRI.1999.766717