1 / 21

COSC 5341 High-Performance Computer Networks

Welcom to. Presentation for. COSC 5341 High-Performance Computer Networks. By Linghai Zhang ID:205715354. Improved Multicast Routing with Delay and Delay Variation Constrains. Sanjiv Kapoor, Srivatsan Raghavan Global Telecommunications conference, 2000, GLOBECOM’00. Outline. Graph Model

deacon
Download Presentation

COSC 5341 High-Performance Computer Networks

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. Welcom to Presentation for COSC 5341High-Performance Computer Networks By Linghai Zhang ID:205715354

  2. Improved Multicast Routing with Delay and Delay Variation Constrains Sanjiv Kapoor, Srivatsan Raghavan Global Telecommunications conference, 2000, GLOBECOM’00

  3. Outline • Graph Model • Problem description • Proposed algorithm • Analysis of the algorithm • Performance evaluation • Conclusion

  4. Graph Model Directed Graph G(V,E) • V: the entire set of nodes in the multicast. • E: the set of edges in the graph. • Delay Function D and Cost Function C: E -> R+ • Source Node: s • Destination Node Set:

  5. Example of the graph V={s,a,b,c,d,e,f} E={(s,a),(s,b),(c,a),(b,c),(b,f),(c,d),(c,e)} S={a,c,d,f} The red number stands for the delay of the edge and the green number represents the cost.

  6. Problem Description Given a delay bound Δ, a variation bound δ, find a multicast tree T such that: and Then try to minimize the total cost

  7. Example of a Multicast Tree The delay of longest path is equal to 10 andthe delay variation between different destinations is less than 9 while the total cost of the tree is 14.

  8. The proposed algorithm 1 Find a multicast tree satisfied above requirement is proved to be a NP-Complete problem. The proposed algorithm is a heuristic algorithm. Let the minimum cost path from s to j with delay exactly equal to t. The following recurrence is used.

  9. The proposed algorithm 1(Cont’d)

  10. Analysis of the algorithm 1 The algorithm correctly generates minimum cost paths to the multicast nodes if they exist within the delay bound Δand variation bound δ. The overall time complexity is And examples show that the algorithm can finds paths with variation bounds which are not found by DVMA (Delay Variation Bounded Multicast Algorithm) as well as cases where the overall cost of the paths is less than that found by DVMA.

  11. The proposed algorithm 2

  12. Analysis of the algorithm 2

  13. Approximation schemes

  14. Approximation Schemes (Cont’d)

  15. Performance Evaluation The figure show that we can find paths with variances an order of magnitude lower than that founded by DVMA

  16. Performance Evaluation (Cont’d) The execution times of both the approaches were also much less as compared to that of the DVMA algorithm.

  17. Performance Evaluation (Cont’d) DPDVB gives competitive results in terms of the cost of the paths compared to DVMA whereas DPDVBC expectedly does much better.

  18. Performance Evaluation (Cont’d)

  19. Performance Evaluation (Cont’d)

  20. Conclusion This paper focused on the problem of Multicast Routing with delay boundedness and delay variation boundedness as constraints. A routing protocol is proposed and compared with previous schemes DVMA. The results show that the scheme proposed improves over the DVMA in the variation bounds achieved and is comparatively far more efficient.

  21. Thanks @_@ any QUESTIONS? 

More Related