FAULT-TOLERANT BROADCASTING AND GOSSIPING IN COMMUNICATION NETWORK

TABLE OF CONTENT
Abstract

CHAPTER ONE
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

CHAPTER TWO: LITERATURE REVIEW
2.0 Introduction
2.1 Review of concept
2.2 Review of related work

CHAPTER THREE: RESEARCH METHODOLOGY
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
References

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

CHAPTER ONE
INTRODUCTION
1.1 BACKGROUND OF THE RESEARCH
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.

1.2 STATEMENT OF RESEARCH PROBLEM
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.

For more Computer Science Projects Click here
==================================================================
Item Type: Project Material  |  Attribute: 28 pages  |  Chapters: 1-3
Format: MS Word  |  Price: N3,000  |  Delivery: Within 30Mins.
==================================================================

Share:

No comments:

Post a Comment

Note: Only a member of this blog may post a comment.

Search for your topic here

See full list of Project Topics under your Department Here!

Featured Post

HOW TO WRITE A RESEARCH HYPOTHESIS

A hypothesis is a description of a pattern in nature or an explanation about some real-world phenomenon that can be tested through observ...

Popular Posts