Fault-tolerant broadcasting and gossiping in communication network

Thesis Overview

<p> </p><div><p>INTRODUCTION</p><p>1.1 BACKGROUND OF THE RESEARCH</p><p>This research is mostly concerned with two fundamental tasks in network communication: broadcasting and gossiping. They both aim at disseminating information among nodes. In broadcasting, also called one-to-all communication, information originally held in one node of the network (called the source) has to be transmitted to all other nodes. In gossiping, or all-to-all communication, every node holds a message (value) which must be transmitted to all other nodes. These types of network communication often occur in distributed computing, e.g., in global processor synchronization and updating distributed databases. Moreover, such communication tasks are implicit in many parallel computation problems, where data and results are distributed among processors. This happens, e.g., in matrix multiplication, parallel solving of linear systems, parallel computing of Discrete Fourier Transform, or parallel sorting</p><p>As communication networks grow in size, they become increasingly vulnerable to component failures. Some links and/or nodes of the network may fail. It becomes important to design communication algorithms in such a way that the desired communication task be accomplished efficiently in spite of these faults, usually without knowing their location ahead of time.</p><p>1.2STATEMENT OF RESEARCH PROBLEM </p><p>Reliability of message transmission is a critical issue in communication networks. As communication networks grow in size, they become increasingly vulnerable to component faults, such as link or node failures. Broadcasting and gossiping are fundamental tasks in network communication, and it becomes important to design reliable broadcasting and gossiping schemes that work for networks as sparse as possible. </p><p>Even though a component in a communication network may not fail completely, nevertheless a message may be corrupted when passing through this component. One way to verify the correctness of a given message is to arrange for nodes in the network to receive the message multiple times. For example, in broadcasting (one-to-all communication) from a given source node u, if a message sent by u is received by all other nodes at least k+1 times, then each node can perform k checks against the original message to verify that it has not been corrupted in transmission. Similar behavior would be useful for gossiping (all-to-all communication) where information originally held in each node is to be communicated to all other nodes. In gossiping, in a communication step, all information held by each end node in the link is exchanged. For an n-node network, we consider the problem of determining the minimum number of network links required to support this k-fold verifiability for broadcasting and gossiping.</p><p>1.3 OBJECTIVES OF THE STUDY</p><p>A fault-tolerant broadcast protocol is a distributed program that ensures delivery of a message to the functioning processors in a computer network, despite the fact that processors may fail at any time. Fault-tolerant broadcast protocols have application in a wide variety of distributed programming problems.</p><p>Based on the issues discussed as the research problem the researcher now seeks to address the problem by solving them</p><p></p><p>A network where the buffer memory will have enough space to manage all message it received by the interface unit,</p><p>A network interface unit that will be monitoring the network at the time the message is delivered</p><p>Thus, while current broadcast networks allow messages to be broadcast, they do not directly support fault-tolerant broadcasts so this research work will be design to have such.</p><p>1.4 SIGNIFICANCE OF THE STUDY</p><p>i. Academicians and students of accounting and other allied courses in tertiary institutions in Nigeria will benefit from this study. This is because this study will enable them (at least to some extent) to know the gap between fault tolerant in communication network and gossiping in broadcasting.</p><p>ii. The research will also be beneficial to the researcher. This is because the study will expose the researcher to so many related areas in the course of carrying out his research. This will enhance the researcher’s experience, knowledge and understanding of fault tolerant broadcasting and gossiping in communication network.</p><p>iii. Finally, the research will contribute to knowledge and serve as a secondary document for any other researcher in a related area.</p><p>1.5DEFINITION OF TERMS</p><p>Fault tolerance: is the property that enables a system to continue operating properly in the event of the failure of (or one or more faults within) some of its components.</p><p>Gossip protocol: A gossip protocol is a style of computer-to-computer communication protocol inspired by the form of gossip seen in social networks. Modern distributed systems often use gossip protocols to solve problems that might be difficult to solve in other ways, either because the underlying network has an inconvenient structure, is extremely large, or because gossip solutions are the most efficient ones available.</p><p>Networks: A network is a group of two or more computer systems linked together. There are many types of computer networks, including the following: local-area networks (LANs): The computers are geographically close together (that is, in the same building)</p><p></p></div><h3></h3><br> <br><p></p>