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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
No takes yet. Share an insight, caveat, or question.
Jonathan K. Millen (2003) studied this question.