A resource allocation model for denial of service
A denial-of-service protection base (DPB) is characterized as a resource monitor closely related to a TCB, supporting a waiting-time policy for benign processes. Resource monitor algorithms and policies can be stated in the context of a state-transition model of a resource allocation system. Probabi...
Saved in:
Published in | Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy pp. 137 - 147 |
---|---|
Main Author | |
Format | Conference Proceeding Journal Article |
Language | English |
Published |
IEEE Comput. Soc. Press
01.01.1992
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | A denial-of-service protection base (DPB) is characterized as a resource monitor closely related to a TCB, supporting a waiting-time policy for benign processes. Resource monitor algorithms and policies can be stated in the context of a state-transition model of a resource allocation system. Probabilistic waiting-time policies are suggested in addition to the finite- and maximum-waiting-time policies. The model supports concurrency, multiprocessing and networking. A simple example of a DPB is given, as a feasibility and consistency check on the definitions.< > |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISBN: | 0818628251 9780818628252 |
DOI: | 10.1109/RISP.1992.213265 |