1 / 3

Multicast Routing in WMNs

Multicast Routing in WMNs. COSC 6590 Fall 2007. Approaches. Minimum cost trees (MCTs) Shortest path trees (SPTs) Recent work: Ruiz et al. redefines tree cost Chou et al. proposes double path routing for more reliable delivery

rene
Download Presentation

Multicast Routing in WMNs

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. Multicast Routing in WMNs COSC 6590 Fall 2007

  2. Approaches • Minimum cost trees (MCTs) • Shortest path trees (SPTs) • Recent work: • Ruiz et al. redefines tree cost • Chou et al. proposes double path routing for more reliable delivery • Xu & Nguyen compares the performance of MCTs and SPTs in WMNs • Some others

  3. Projects Project 1 • Implement either the SDM or MDM algorithm by Chou et al. in QualNet. • Compare the performance of SDM/MDM with that of the SPT algorithm (double path routing vs single path routing). Project 2 • Implement a simple core-based tree (SCBT) protocol in QualNet. • Similar to PIM-DM but we use SPT, not DVMRP, to build a tree rooted at the core • Compare the performance of SCBT with that of the SPT algorithm (core-based trees vs share-based trees). Note • The SPT code will be given for comparison.

More Related