Journal ArticleDOI
The part-time parliament
TLDR
The Paxon parliament's protocol provides a new way of implementing the state machine approach to the design of distributed systems.Abstract:
Recent archaeological discoveries on the island of Paxos reveal that the parliament functioned despite the peripatetic propensity of its part-time legislators. The legislators maintained consistent copies of the parliamentary record, despite their frequent forays from the chamber and the forgetfulness of their messengers. The Paxon parliament's protocol provides a new way of implementing the state machine approach to the design of distributed systems.read more
Citations
More filters
Journal ArticleDOI
The open agent society: retrospective and prospective views
Jeremy Pitt,Alexander Artikis +1 more
TL;DR: It is argued that the continued inter-disciplinary collaboration between computer science and IT lawyers is critical to address issues and challenges of computational justice and polycentric governance, and to explore a number of ethical, legal and social implications.
Maintaining Database Consistency in Peer to Peer Networks
Baruch Awerbuch,Ciprian Tutu +1 more
TL;DR: An algorithm for persistent consistent distributed commit (distributed database commit) in a dynamic, asynchronous, peer to peer network that has constant overhead in time and space and almost constant communication complexity, allowing it to scale to very large size networks.
Book ChapterDOI
A Survey on Machine Learning Applications for Software Defined Network Security
TL;DR: This survey presents studies that employ ML techniques in SDN environments for security applications and classify them into ML techniques (used to identify general anomalies or specific attacks) and IDS frameworks for SDN.
PhD Research Proposal
TL;DR: This is a proposal for PhD research into the use of multi agent systems with distributed hypermedia with a focus on artificial intelligence and machine learning.
Proceedings ArticleDOI
At-most-once semantics in asynchronous shared memory
TL;DR: This paper investigates the feasibility of implementing at-most-once access semantics in a model where a collection of actions is to be performed by failure-prone, asynchronous shared-memory processes, and proves a lower bound of n--f on the effectiveness of any algorithm.
References
More filters
Book ChapterDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
Impossibility of distributed consensus with one faulty process
TL;DR: In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process.
Book
Concurrency Control and Recovery in Database Systems
TL;DR: In this article, the design and implementation of concurrency control and recovery mechanisms for transaction management in centralized and distributed database systems is described. But this can lead to interference between queries and updates.
Journal ArticleDOI
Implementing fault-tolerant services using the state machine approach: a tutorial
TL;DR: The state machine approach is a general method for implementing fault-tolerant services in distributed systems and protocols for two different failure models—Byzantine and fail stop are described.
Related Papers (5)
Impossibility of distributed consensus with one faulty process
Unreliable failure detectors for reliable distributed systems
Tushar Deepak Chandra,Sam Toueg +1 more