Seminar presentation final

161 views

Published on

Published in: Education, Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
161
On SlideShare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
3
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Seminar presentation final

  1. 1. Performance Evaluation of Gossiping Algorithm In Distributed System Marjia Ahmed Jui (090232) Nazmul Hossain Bilash (090236) 03 April, 2013
  2. 2. Distributed Systems Data Transmission Gossiping Algorithm Gossip based Randomized Algorithm Gossip based Perfect knowledge algorithm Gossip based Proposed Virtual tree algorithm. OverviewOverview 2/16
  3. 3. Non-centralized interconnected network, sub networks. Processing & databases are distributed . Communicate with one another to compute some value. Distributed SystemsDistributed Systems 3/16
  4. 4.  Many Algorithms used for transmitting data.  Epidemic Routing Algorithm: Fig: Message delivery from node S to D Data TransmissionData Transmission 4/16
  5. 5.  Simple and easy to deploy  It refers – Exchange mechanism Network components- source of information. Capable of information transfer. Scalability. Gossiping AlgorithmGossiping Algorithm 5/16
  6. 6.  Gossip-based Algorithm-  Randomized algorithm Perfect knowledge algorithm Proposed Virtual tree algorithm Continue…Continue… 6/16
  7. 7.  Nodes are selected randomly Fig: Randomized algorithm redundancy example Randomized AlgorithmRandomized Algorithm 7/16
  8. 8.  Dynamic knowledge  No waste of transmissions.  Very expensive ,difficult for synchronization & replication. Perfect Knowledge Algorithm 8/16
  9. 9. Fig: Propagating information in a network Continue….Continue…. 9/16
  10. 10. Continue…Continue… 10/16 Fig: Node update process in case of perfect knowledge algorithm
  11. 11.  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
  12. 12. Fig: Communication path for the network of 32 nodes Continues…Continues… 12/16
  13. 13. Continues…Continues… 13/16
  14. 14. Virtual Tree Algorithm 14/16  Used for – Data aggregation Resource allocation. Propagating information Reduce redundant transmission
  15. 15.  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
  16. 16. ReferenceReference 16/16  Reetu Dhar , “PERFORMANCE EVALUATION OF GOSSIPING ALGORITHMS ,“ Southern Connecticut State University ,2009.
  17. 17. Thank You Any Questions?

×