1 / 100

Broadcast

Broadcast. Root. Use a spanning tree. synchronous. It takes the same time at link to send a message It takes the same time at each node to process the incoming data. nodes. levels. Time complexity:. Message complexity:. asynchronous. Links and nodes may have different delays. slow

connie
Download Presentation

Broadcast

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Broadcast

  2. Root Use a spanning tree

  3. synchronous • It takes the same time at link to send a message • It takes the same time at each node to process • the incoming data

  4. nodes levels Time complexity: Message complexity:

  5. asynchronous Links and nodes may have different delays

  6. slow link

  7. slow link

  8. Actual delivery

  9. nodes levels Time complexity: Message complexity:

  10. Convergecast

  11. synchronous

  12. nodes levels Time complexity: Message complexity:

  13. asynchronous

  14. nodes levels Time complexity: Message complexity:

  15. Building a BFS Spanning Tree

  16. Tree algorithm for node : Upon receipt of <invitation> message from neighbor node : If not member of tree: accept invitation by sending <accept> message to ; (the father) Send invitations to all neighbors, except If member of tree: decline invitation by sending <reject> message to ;

  17. synchronous

  18. A node initiates the BFS process <invitation> <invitation>

  19. become members of tree

  20. <accept> <accept>

  21. <reject>

  22. <reject>

  23. Alternative solution

  24. reject

  25. nodes edges diameter Time complexity: Message complexity:

  26. asynchronous

More Related