Performance Evaluation of Gossiping AlgorithmIn Distributed System

Marjia Ahmed Jui (090232)

Nazmul Hossain Bilash (090236)

03 April, 2013

Distributed SystemsData TransmissionGossiping AlgorithmGossip based Randomized AlgorithmGossip based Perfect knowledge algorithmGossip based Proposed Virtual tree algorithm.

OverviewOverview

2/16

Non-centralized interconnected network, sub networks.

Processing & databases are distributed .

Communicate with one another to compute some value.

Distributed SystemsDistributed Systems

3/16

Many Algorithms used for transmitting data.

Epidemic Routing Algorithm:

Fig: Message delivery from node S to D

Data TransmissionData Transmission

4/16

Simple and easy to deploy

It refers –Exchange mechanismNetwork components- source of information.Capable of information transfer.Scalability.

Gossiping AlgorithmGossiping Algorithm

5/16

Gossip-based Algorithm- Randomized algorithm Perfect knowledge algorithmProposed Virtual tree algorithm

Continue…Continue…

6/16

Nodes are selected randomly

Fig: Randomized algorithm redundancy example

Randomized AlgorithmRandomized Algorithm

7/16

Dynamic knowledge No waste of transmissions. Very expensive ,difficult for synchronization & replication.

Perfect Knowledge Algorithm

8/16

Fig: Propagating information in a network

Continue….Continue….

9/16

Continue…Continue…

10/16

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

11/16

Fig: Communication path for the network of 32 nodes

Continues…Continues…

12/16

Continues…Continues…

13/16

Virtual Tree Algorithm

14/16

Used for –Data aggregationResource allocation.Propagating informationReduce 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

mobile nodes.

Problems of GossipingGossiping Algorithm :

15/16

ReferenceReference

16/16

Reetu Dhar , “PERFORMANCE EVALUATION OF GOSSIPING ALGORITHMS ,“ Southern Connecticut State University ,2009.

Thank You

Any Questions?