Globally Consistent Event Ordering in One-Directional Distributed Environments

Authors:
Paul Ammann;Sushil Jajodia;Phyllis G. Frankl
Affiliations:
-;-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1996

Citing 6
Cited 1

Partitioned two-phase locking

ACM Transactions on Database Systems (TODS)
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Cryptography and data security

Cryptography and data security
Transaction Processing Using an Untrusted Scheduler in a Multilevel Database with Replicated Architecture

Results of the IFIP WG 11.3 Workshop on Database Security V: Status and Prospects
Planar Lattice Security Structures for Multilevel Replicated Databases

Proceedings of the IFIP WG11.3 Working Conference on Database Security VII
On Transaction Processing for Multilevel Secure Replicated Databases

ESORICS '92 Proceedings of the Second European Symposium on Research in Computer Security

Transaction Processing in Multilevel Secure Databases with Kernelized Architecture: Challenges and Solutions

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider communication structures for event ordering algorithms in distributed environments where information flows only in one direction. Example applications are multilevel security and hierarchically decomposed databases. Although the most general one-directional communication structure is a partial order, partial orders do not enjoy the property of being consistently ordered, a formalization of the notion that local ordering decisions are ensured to be globally consistent. Our main result is that the crown-free property is necessary and sufficient for a communication structure to be consistently ordered. We discuss the computational complexity of detecting crowns and sketch typical applications.