loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Information Technology: Coding and Computing
Maintaining Consistency of the Security Policy using Timestamp Ordering
Las Vegas, Nevada
April 08-April 10
ISBN: 0-7695-1506-1
Sudsanguan Ngamsuriyaroj, Pennsylvania State University
Ali R. Hurson, Pennsylvania State University
Thomas F. Keefe, Oracle Corporation
In this paper, we propose an invalidation-based consistency protocol using timestamp ordering for concurrency control. The protocol works for a system composed of a Security Server and Object Managers located on different machines. The Security Server defines the security policy in a small database and Object Managers enforce the policy replicated on each machine. Thus, the system can be modeled as a replicated database. Since transient inconsistency among replicas may lead to unauthorized accesses, our goal of consistency is one-copy serializability (1SR) because it guarantees one-copy view of the security policy regardless of which copy is accessed. However, the requirement for good performance is also desirable.We evaluate the performance of the proposed protocol and compare it with the performance of the Transactional Consistency Protocol, an invalidation-based consistency protocol based on locking mechanism. Both protocols guarantee 1SR consistency. The results show that both protocols demonstrate compatible performance. However, the proposed protocol offers 1SR consistency with less overhead.
Index Terms:
Consistency control, Security policy, Concurrency control, Timestamp ordering, Performance
Citation:
Sudsanguan Ngamsuriyaroj, Ali R. Hurson, Thomas F. Keefe, "Maintaining Consistency of the Security Policy using Timestamp Ordering," itcc, pp.0164, International Conference on Information Technology: Coding and Computing, 2002
Usage of this product signifies your acceptance of the Terms of Use.