Broadcasting and gossiping are fundamental tasks in network communication. In broadcasting, or one-to-all communication, information originally held in one node of the network (called the source) must be transmitted to all other nodes. In gossiping, or all-to-all communication, every node holds a message which has to be transmitted to all other nodes. As communication networks grow in size, they become increasingly vulnerable to component failures. Thus, capabilities for fault-tolerant broadcasting and gossiping gain importance. The present paper is a survey of the fast-growing area of research investigating these capabilities. We focus on two most important efficiency measures of broadcasting and gossiping algorithms: running time and number of elementary transmissions required by the communication process. We emphasize the unifying thread in most results from the research in fault-tolerant communication: the trade-offs between efficiency of communication schemes and their fault-tolerance.




1.0     Introduction

1.1     Background of the research

1.2    Statement of research problem

1.3     Objectives of the study

1.4     Significance of the study

1.5    Definition of terms


2.0     Introduction

2.1    Review of concept

2.2    Review of related work


3.1    Research method

3.2    Research Instrument

3.3    Method of Data Analysis

3.4    Data presentation and Analysis

3.5    Summary

3.6    Conclusion





    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

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.


    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.

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.


    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.

Based on the issues discussed as the research problem the researcher now seeks to address the problem by solving them

A network where the buffer memory will have enough space to manage all message it received by the interface unit,

A network interface unit that will be monitoring the network at the time the message is delivered

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.


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.

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.

iii. Finally, the research will contribute to knowledge and serve as a secondary document for any other researcher in a related area.


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.

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.

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).





Researchwap.org is an online repository for free project topics and research materials, articles and custom writing of research works. We’re an online resource centre that provides a vast database for students to access numerous research project topics and materials. Researchwap.org guides and assist Postgraduate, Undergraduate and Final Year Students with well researched and quality project topics, topic ideas, research guides and project materials. We’re reliable and trustworthy, and we really understand what is called “time factor”, that is why we’ve simplified the process so that students can get their research projects ready on time. Our platform provides more educational services, such as hiring a writer, research analysis, and software for computer science research and we also seriously adhere to a timely delivery.


Please feel free to carefully review some written and captured responses from our satisfied clients.

  • "Exceptionally outstanding. Highly recommend for all who wish to have effective and excellent project defence. Easily Accessable, Affordable, Effective and effective."

    Debby Henry George, Massachusetts Institute of Technology (MIT), Cambridge, USA.
  • "I saw this website on facebook page and I did not even bother since I was in a hurry to complete my project. But I am totally amazed that when I visited the website and saw the topic I was looking for and I decided to give a try and now I have received it within an hour after ordering the material. Am grateful guys!"

    Hilary Yusuf, United States International University Africa, Nairobi, Kenya.
  • "Researchwap.org is a website I recommend to all student and researchers within and outside the country. The web owners are doing great job and I appreciate them for that. Once again, thank you very much "researchwap.org" and God bless you and your business! ."

    Debby Henry George, Massachusetts Institute of Technology (MIT), Cambridge, USA.
  • "Great User Experience, Nice flows and Superb functionalities.The app is indeed a great tech innovation for greasing the wheels of final year, research and other pedagogical related project works. A trial would definitely convince you."

    Lamilare Valentine, Kwame Nkrumah University, Kumasi, Ghana.
  • "I love what you guys are doing, your material guided me well through my research. Thank you for helping me achieve academic success."

    Sampson, University of Nigeria, Nsukka.
  • "researchwap.com is God-sent! I got good grades in my seminar and project with the help of your service, thank you soooooo much."

    Cynthia, Akwa Ibom State University .
  • "Sorry, it was in my spam folder all along, I should have looked it up properly first. Please keep up the good work, your team is quite commited. Am grateful...I will certainly refer my friends too."

    Elizabeth, Obafemi Awolowo University
  • "Am happy the defense went well, thanks to your articles. I may not be able to express how grateful I am for all your assistance, but on my honour, I owe you guys a good number of referrals. Thank you once again."

    Ali Olanrewaju, Lagos State University.
  • "My Dear Researchwap, initially I never believed one can actually do honest business transactions with Nigerians online until i stumbled into your website. You have broken a new legacy of record as far as am concerned. Keep up the good work!"

    Willie Ekereobong, University of Port Harcourt.
  • "WOW, SO IT'S TRUE??!! I can't believe I got this quality work for just 3k...I thought it was scam ooo. I wouldn't mind if it goes for over 5k, its worth it. Thank you!"

    Theressa, Igbinedion University.
  • "I did not see my project topic on your website so I decided to call your customer care number, the attention I got was epic! I got help from the beginning to the end of my project in just 3 days, they even taught me how to defend my project and I got a 'B' at the end. Thank you so much researchwap.com, infact, I owe my graduating well today to you guys...."

    Joseph, Abia state Polytechnic.
  • "My friend told me about ResearchWap website, I doubted her until I saw her receive her full project in less than 15 miniutes, I tried mine too and got it same, right now, am telling everyone in my school about researchwap.com, no one has to suffer any more writing their project. Thank you for making life easy for me and my fellow students... Keep up the good work"

    Christiana, Landmark University .
  • "I wish I knew you guys when I wrote my first degree project, it took so much time and effort then. Now, with just a click of a button, I got my complete project in less than 15 minutes. You guys are too amazing!."

    Musa, Federal University of Technology Minna
  • "I was scared at first when I saw your website but I decided to risk my last 3k and surprisingly I got my complete project in my email box instantly. This is so nice!!!."

    Ali Obafemi, Ibrahim Badamasi Babangida University, Niger State.
  • To contribute to our success story, send us a feedback or please kindly call 2348037664978.
    Then your comment and contact will be published here also with your consent.

    Thank you for choosing researchwap.com.