Globally consistent event ordering in one-directional distributed environments

Paul Ammann, Sushil Jajodia, Phyllis G. Frankl

    Research output: Contribution to journalArticle

    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 properly is necessary and sufficient for a communication structure to be consistently ordered. We discuss the computational complexity of detecting crowns and sketch typical applications.

    Original languageEnglish (US)
    Pages (from-to)665-670
    Number of pages6
    JournalIEEE Transactions on Parallel and Distributed Systems
    Volume7
    Issue number6
    DOIs
    StatePublished - 1996

    Fingerprint

    Distributed Environment
    Partial Order
    Communication
    Information Flow
    Formalization
    Computational complexity
    Computational Complexity
    Sufficient
    Necessary

    Keywords

    • Crowns
    • Databases
    • Distributed networks
    • Graph algorithms
    • Hierarchically decomposed databases
    • Multilevel
    • Partial orders
    • Security

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Theoretical Computer Science
    • Computational Theory and Mathematics

    Cite this

    Globally consistent event ordering in one-directional distributed environments. / Ammann, Paul; Jajodia, Sushil; Frankl, Phyllis G.

    In: IEEE Transactions on Parallel and Distributed Systems, Vol. 7, No. 6, 1996, p. 665-670.

    Research output: Contribution to journalArticle

    Ammann, Paul ; Jajodia, Sushil ; Frankl, Phyllis G. / Globally consistent event ordering in one-directional distributed environments. In: IEEE Transactions on Parallel and Distributed Systems. 1996 ; Vol. 7, No. 6. pp. 665-670.
    @article{148614a4bee2472fad53f1f13f7411b0,
    title = "Globally consistent event ordering in one-directional distributed environments",
    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 properly is necessary and sufficient for a communication structure to be consistently ordered. We discuss the computational complexity of detecting crowns and sketch typical applications.",
    keywords = "Crowns, Databases, Distributed networks, Graph algorithms, Hierarchically decomposed databases, Multilevel, Partial orders, Security",
    author = "Paul Ammann and Sushil Jajodia and Frankl, {Phyllis G.}",
    year = "1996",
    doi = "10.1109/71.506704",
    language = "English (US)",
    volume = "7",
    pages = "665--670",
    journal = "IEEE Transactions on Parallel and Distributed Systems",
    issn = "1045-9219",
    publisher = "IEEE Computer Society",
    number = "6",

    }

    TY - JOUR

    T1 - Globally consistent event ordering in one-directional distributed environments

    AU - Ammann, Paul

    AU - Jajodia, Sushil

    AU - Frankl, Phyllis G.

    PY - 1996

    Y1 - 1996

    N2 - 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 properly is necessary and sufficient for a communication structure to be consistently ordered. We discuss the computational complexity of detecting crowns and sketch typical applications.

    AB - 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 properly is necessary and sufficient for a communication structure to be consistently ordered. We discuss the computational complexity of detecting crowns and sketch typical applications.

    KW - Crowns

    KW - Databases

    KW - Distributed networks

    KW - Graph algorithms

    KW - Hierarchically decomposed databases

    KW - Multilevel

    KW - Partial orders

    KW - Security

    UR - http://www.scopus.com/inward/record.url?scp=0030164538&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0030164538&partnerID=8YFLogxK

    U2 - 10.1109/71.506704

    DO - 10.1109/71.506704

    M3 - Article

    VL - 7

    SP - 665

    EP - 670

    JO - IEEE Transactions on Parallel and Distributed Systems

    JF - IEEE Transactions on Parallel and Distributed Systems

    SN - 1045-9219

    IS - 6

    ER -