TL k ) s.t. ? TL k is the new token list with all processes that sent ack 4. execute consensus among TL i processes, with initial k as the initial value 5. let (TL) be the consensus decision 6. if p k ? TL, then "install" TL as the next view TL i+1On the Weakest Failure Detector for Quiescent Reliable CommunicationBuilding Secure and Reliable Network Applications, 1996. ,
Reliable broadcast protocols, ACM Transactions on Computer Systems, vol.2, issue.3, pp.251-273, 1984. ,
DOI : 10.1145/989.357400
A New Look at Broadcasting Messages in Fault?Tolerant Distributed SystemsThe Pinwheel asynchronous atomic broadcast protocolsAgreement?related Problems: from semi?passive replication to tottally ordered broadcasts, 2 nd Intl. Symposium on Autonomous Descentralized Systems, 1995. ,
An Internet multicast system for the stock market, ACM Transactions on Computer Systems, vol.19, issue.3, pp.384-412, 2001. ,
DOI : 10.1145/380749.380771
Design, Implementation and Verification of the Reliable Multicast Protocol, 1994. ,
Fault Recovery in the Reliable Multicast Protocol, 1995. ,
Distributed Algorithms: lecture notes for the Graduate School in Computer Science, 2002. ,
DOI : 10.1007/3-540-57271-6
Neko: A single environment to simulate and prototype distributed algorithmsGroup Communication Specifications: A Comprehensive StudyA High Performance Totally Ordered Multicast Protocol, Proc. of the 15th Int'l Conf. on Information Networking (ICOIN?15) Theory and Practice in Distributed Systems: International Workshop, pp.33-57, 1995. ,