Document Type thesis Author Name Soria-Rodriguez, Pedro Email Address sorrodp at alum.wpi.edu URN etd-102599-123244 Title Multicast-Based Interactive-Group Object-Replication For Fault Tolerance Degree MS Department Electrical & Computer Engineering Advisors Dr. David Cyganski, Advisor David Cordella, Committee Member Dr. William Michalson, Committee Member Keywords multicast CORBA commit protocol fault tolerance Date of Presentation/Defense 1998-04-28 Availability unrestricted
Distributed systems are clusters of computers working together on one task. The sharing of information across different architectures, and the timely and efficient use of the network resources for communication among computers are some of the problems involved in the implementation of a distributed system. In the case of a low latency system, the network utilization and the responsiveness of the communication mechanism are even more critical.
This thesis introduces a new approach for the distribution of messages to computers in the system, in which, the Common Object Request Broker Architecture (CORBA) is used in conjunction with IP multicast to implement a fault-tolerant, low latency distributed system. Fault tolerance is achieved by replication of the current state of the system across several hosts. An update of the current state is initiated by a client application that contacts one of the state object replicas. The new information needs to be distributed to all the members of the distributed system (the object replicas).
This state update is accomplished by using a two-phase commit protocol, which is implemented using a binary tree structure along with IP multicast to reduce the amount of network utilization, distribute the computation load associated with state propagation, and to achieve faster communication among the members of the distributed system. The use of IP multicast enhances the speed of message distribution, while the two-phase commit protocol encapsulates IP multicast to produce a reliable multicast service that is suitable for fault tolerant, distributed low latency applications. The binary tree structure, finally, is essential for the load sharing of the state commit response collection processing.
Browse by Author | Browse by Department | Search all available ETDs
Questions? Email firstname.lastname@example.org