Skip to Main Content
 

Global Search Box

 
 
 

ETD Abstract Container

Abstract Header

Byzantine Fault Tolerant Collaborative Editing

BABI, MAMDOUH O
http://orcid.org/0000-0001-6255-2909
http://rave.ohiolink.edu/etdc/view?acc_num=csu1495203726396979

Abstract Details

, Doctor of Engineering, Cleveland State University, Washkewicz College of Engineering.
Collaborative work applications involve shared views by multiple users. In a collaborative editing system, multiple users can view, edit, and save the same document simultaneously. Therefore, any infrastructure in collaborative work must support consistency and some type of concurrency. Some systems support strict consistency. Driven by the needs for highly reliable real-time collaborative editing systems, I am introducing a lightweight solution for protecting real-time collaborative editing systems against Byzantine faults. The Byzantine Fault Tolerance (BFT) mechanisms are being used to protect such systems from malicious faults. I observe that a centralized coordination algorithm not only reduces the complexity of the editing system, but it also makes it easier to harden the system with Byzantine fault tolerance. In this dissertation, a comprehensive analysis of the potential threats towards collaborative editing systems will be described and a set of Byzantine fault tolerance mechanisms without requiring any additional redundant resources will be introduced. If the system has sufficient redundancy, such mechanisms can be used to ensure strong protection against various malicious faults. Even without sufficient redundancy in the system, mechanisms outlined in this dissertation would still help limit the damages caused by a faulty participant. My contributions are outlined as follows: (1) A case will be made to favor the use of centralized coordination algorithms for real-time collaborative editing systems. (2) A comprehensive threat analysis on collaborative editing systems will be performed. (3) A set of lightweight BFT mechanisms that can be used to protect such editing systems from malicious faults without restoring to additional redundant resources will be presented. It has been shown, during my threat analysis, that threats from faulty participant and/or from publisher can case a serious damage to the system. It has also been shown that a centralized algorithm has the side benefits that the participants are insulated from each other. In the next phase of my dissertation research, lightweight BFT mechanisms to control any inconsistent updates and to some degree, to control malicious updates will be implemented. The former could help to develop robust real-time collaborative editing systems able to overcome malicious activities and help limit the damage caused by a faulty participant.
Wenbing Zhao, Ph.D. (Advisor)
Lili Dong, Ph.D. (Committee Member)
Timothy Arndt, Ph.D. (Committee Member)
Janche Sang, Ph.D. (Committee Member)
Sanchita Mal-Sarkar, Ph.D. (Committee Member)
119 p.
Computer Engineering; Computer Science; Engineering
Byzantine fault tolerance, Collaborative editing, distributed algorithms, optimistic replication, operational transformation, replica consistency

Recommended Citations

Citations

  • BABI, M. O. (n.d.). Byzantine Fault Tolerant Collaborative Editing [Doctoral dissertation, Cleveland State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=csu1495203726396979

    APA Style (7th edition)

  • BABI, MAMDOUH. Byzantine Fault Tolerant Collaborative Editing. Cleveland State University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=csu1495203726396979.

    MLA Style (8th edition)

  • BABI, MAMDOUH. "Byzantine Fault Tolerant Collaborative Editing." Doctoral dissertation, Cleveland State University. Accessed MAY 20, 2024. http://rave.ohiolink.edu/etdc/view?acc_num=csu1495203726396979

    Chicago Manual of Style (17th edition)

csu1495203726396979
451
© , all rights reserved.
This open access ETD is published by Cleveland State University and OhioLINK.