Fault tolerant overlay networks design

In this thesis designs a reliable and scalable overlay network with fault-tolerance incorporation to support topic-based publish/subscribe communication. For scalability and efficiency, it is important to keep the degree of the nodes in the publish/subscribe system low. We proposes a new optimization problem named Fault-Tolerant Overlay Networks Design, where the trade-offs among several key dimensions such as fault tolerance, scalability, performance, and message dissemination are captured by it. The Fault-Tolerant Overlay Networks design problem is: given a set of nodes and their topic subscriptions connect the nodes to create a topic 2-connected overlay for pub/sub systems with minimum maximum degree, i.e., for each topic the sub-overlay induced by nodes interested in the topic is 2- connected. It presents an algorithm, namely GM3 for this problem which guarantees that the overlay network will be topic 2-connected and which aims at keeping the maximum node degree low.Experimental results show that GM3 algorithm is able to achieve low maximum node degree of publish/subscribe overlay systems.