The b2/c3 Problem: How Big Buffers Overcome Covert Channel Cynicism in Trusted Database Systems
Abstract
We present a mechanism for communication from low to high security classes that allows partial acknowledgments and flow control without introducing covert channels. By restricting our mechanism to the problem of maintaining mutual consistency in replicated architecture database systems, we overcome the negative general results in this problem area. A queueing theory model shows that big buffers can be practical mechanisms for real database systems.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1994
- Accession Number
- ADA465578
Entities
People
- J. Mcdermott
Organizations
- United States Naval Research Laboratory