Performance Evaluation of Gossiping Algorithm
In Distributed System
Marjia Ahmed Jui (090232)
Nazmul Hossain Bilash (090236)
03 April, 2013
Gossip based Randomized Algorithm
Gossip based Perfect knowledge algorithm
Gossip based Proposed Virtual tree algorithm.
Non-centralized interconnected network, sub networks.
Processing & databases are distributed .
Communicate with one another to compute some value.
Distributed SystemsDistributed Systems
Many Algorithms used for transmitting data.
Epidemic Routing Algorithm:
Fig: Message delivery from node S to D
Data TransmissionData Transmission
Simple and easy to deploy
It refers –
Network components- source of information.
Capable of information transfer.
Gossiping AlgorithmGossiping Algorithm
Nodes are selected randomly
Fig: Randomized algorithm redundancy example
Randomized AlgorithmRandomized Algorithm
No waste of transmissions.
Very expensive ,difficult for synchronization & replication.
Perfect Knowledge Algorithm
Fig: Propagating information in a network
Fig: Node update process in case of perfect knowledge algorithm
Propagates information to all nodes using virtual tree.
To reduce redundant transmissions.
Creates a tree structure that forms a real world network.
Virtual Tree AlgorithmVirtual Tree Algorithm
Fig: Communication path for the network of 32 nodes
Virtual Tree Algorithm
Used for –
Reduce redundant transmission
To create a tree structure, comparable real world network.
Evaluate the performance for node failures .
To measure actual latency & throughput.
Mobile ad-hoc networks and handle failures of individual
Problems of GossipingGossiping Algorithm :
Reetu Dhar , “PERFORMANCE EVALUATION OF
GOSSIPING ALGORITHMS ,“ Southern Connecticut State