on leveled networks
play

on Leveled Networks Costas Busch Shailesh Kelkar Malik - PowerPoint PPT Presentation

Efficient Bufferless Routing on Leveled Networks Costas Busch Shailesh Kelkar Malik Magdon-Ismail Rensselaer Polytechnic Institute 1 Talk Outline Introduction Centralized Algorithm Distributed Algorithm Conclusion 2 Leveled


  1. Pipelining using Boats Frame Frame F F i i 1  3 3 1 2 2 2 1 1 1 2 1 3 Boat 1 i i Packets of color follow boat 78

  2. Pipelining using Boats Frame Frame F F i i 1  3 3 1 2 2 2 1 1 1 2 1 3 Boat 1 i i Packets of color follow boat 79

  3. Pipelining using Boats Frame Frame F F i i 1  3 3 1 2 2 2 1 1 1 2 3 1 Boat 1 deflected i i Packets of color follow boat 80

  4. Pipelining using Boats Frame Frame F F i i 1  3 3 1 2 2 2 1 1 1 2 3 1 Boat 2 Back Boat 1 In position i i Packets of color follow boat 81

  5. Pipelining using Boats Frame Frame F F i i 1  3 1 3 2 2 1 2 1 2 1 3 1 Boat 2 Boat 1 i i Packets of color follow boat 82

  6. Pipelining using Boats Frame Frame F F i i 1  3 1 3 2 2 1 2 1 2 1 3 1 Boat 2 Boat 1 i i Packets of color follow boat 83

  7. Pipelining using Boats Frame Frame F F i i 1  3 1 2 3 1 2 2 1 1 2 3 1 Boat 2 Boat 1 i i Packets of color follow boat 84

  8. Pipelining using Boats Frame Frame F F i i 1  3 1 2 3 1 2 2 1 1 2 3 1 Boat 3 Boat 2 Boat 1 i i Packets of color follow boat 85

  9. Pipelining using Boats Frame Frame F F i i 1  3 1 3 2 1 2 1 2 1 3 2 1 Boat 3 Boat 2 Boat 1 i i Packets of color follow boat 86

  10. Pipelining using Boats Frame Frame F F i i 1  3 1 3 2 1 2 1 2 1 3 2 1 Boat 3 Boat 2 Boat 1 i i Packets of color follow boat 87

  11. Pipelining using Boats Frame Frame F F i i 1  3 1 3 2 1 2 1 2 1 3 2 1 Boat 3 Boat 2 Boat 1 i i Packets of color follow boat 88

  12. Pipelining using Boats Frame Frame F F i i 1  3 1 3 2 1 2 1 2 1 3 2 1 Boat 3 Boat 2 i i Packets of color follow boat 89

  13. Pipelining using Boats Frame Frame F F i i 1  1 3 2 1 2 3 1 2 1 3 2 1 Boat 3 Boat 2 i i Packets of color follow boat 90

  14. Pipelining using Boats Frame Frame F F i i 1  1 3 2 1 2 3 1 2 1 3 2 1 Boat 3 i i Packets of color follow boat 91

  15. Pipelining using Boats Frame Frame F F i i 1  1 3 2 1 2 3 1 2 1 3 2 1 Boat 3 i i Packets of color follow boat 92

  16. Pipelining using Boats Frame Frame F F i i 1  1 3 2 1 2 3 1 2 1 3 2 1 i i Packets of color follow boat 93

  17. Wave time: Time until last boat reaches target level Frame size Number of colors 4 2 log( DN )   4 log( DN ) log( DN )   (log( DN ))   94

  18. Talk Outline • Introduction • Centralized Algorithm • Distributed Algorithm • Conclusion 95

  19. In the distributed version, we assume that every node knows parameters C , D , N Nodes do not know the packet paths, except for the packets in them. 96

  20. The distributed algorithm is the same with the centralized, except for one thing: The conflict graph is colored in a distributed manner 97

  21. Distributed coloring – Basic Idea During a wave: 1. each packet chooses a random color Between 0 and 2log(DN) 2. each packet assumes the color is correct and follows the respective boat 3. For packets that conflict, the process repeats 98

  22. This process repeats a logarithmic number of times, thus it gives an extra logarithmic factor in the performance 99

  23. Talk Outline • Introduction • Centralized Algorithm • Distributed Algorithm • Conclusion 100

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend