This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Globally Consistent Event Ordering in One-Directional Distributed Environments
June 1996 (vol. 7 no. 6)
pp. 665-670

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.

[1] P. Ammann and S. Jajodia, "Planar Lattice Security Structures for Multi-Level Replicated Databases," Database Security VII: Status and Prospects, T. Keefe and C. Landwehr, eds., pp. 125-134. NorthHolland, 1994.
[2] D.E. Bell and L.J. LaPadula, "Secure Computer Systems: Unified Exposition and Multics Interpretation," Technical Report No. MTR-2997, Mitre Corp., Bedford, Mass., Mar. 1976.
[3] V. Bouchitté, "Chordal Bipartite Graphs and Crowns," Order, vol. 2, pp. 119-122, 1985.
[4] "Committee on Multilevel Data Management Security, Multilevel Data Management Security, U.S. Air Force Studies Board, National Research Council, Washington, D.C., 1983.
[5] O. Costich, "Transaction Processing Using an Untrusted Scheduler in a Multilevel Database With Replicated Architecture," Database Security V: Status and Prospects, C. Landwehr and S. Jajodia, eds., NorthHolland, pp. 173-190, 1992.
[6] D.E.R. Denning, Cryptography and Data Security. Addison-Wesley, 1983.
[7] D. Duffus, I. Rival, and P. Winkler, "Minimizing Setups for Cycle-Free Ordered Sets," Proc. Am. Math. Soc., vol. 85, no. 4, pp. 509-513, Aug. 1982.
[8] M.C. Golumbic and C.F. Goss, "Perfect Elimination and Chordal Bipartite Graphs," J. Graph Theory, vol. 2, pp. 155-163, 1978.
[9] M. Hsu and A. Chan, "Partitioned Two-Phase Locking," ACM Trans. Database Systems, vol. 11, no. 4, pp. 431-446, Dec. 1986.
[10] S. Jajodia and B. Kogan, “Transaction Processing in Multilevel Secure Databases Using Replicated Architecture,” Proc. IEEE Symp. Research in Security and Privacy, pp. 360–368, May 1990.
[11] I.E. Kang and T.F. Keefe, "On Transaction Processing for Multilevel Secure Replicated Databases," Proc. European Symp. Research in Computer Security, pp. 329-347,Toulouse, France, vol. 648, Lecture Notes in Computer Science, Springer-Verlag, 1992.
[12] L. Lamport, "Time, clocks and the ordering of events in a distributed system," Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[13] Graphs and Order: The Role of Graphs in the Theory of Ordered Sets, I. Rival, ed. Dordrecht, Holland: Reidel Publishing, 1985.
[14] W.T. Trotter Jr., "Stacks and Splits of Partially Ordered Sets," Discrete Math., vol. 35, pp. 229-256, 1981.

Index Terms:
Crowns, partial orders, distributed networks, graph algorithms, hierarchically decomposed databases, multilevel databases, security.
Citation:
Paul Ammann, Sushil Jajodia, Phyllis G. Frankl, "Globally Consistent Event Ordering in One-Directional Distributed Environments," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 6, pp. 665-670, June 1996, doi:10.1109/71.506704
Usage of this product signifies your acceptance of the Terms of Use.