Login | Register

Near optimal shared-tree based multicasting in mesh networks


Near optimal shared-tree based multicasting in mesh networks

Moradian, Talin (2008) Near optimal shared-tree based multicasting in mesh networks. Masters thesis, Concordia University.

Text (application/pdf)
MR45494.pdf - Accepted Version


Multicasting is an efficient information dissemination for a subscribed user group on networks. In this thesis the problem of multicasting in mesh-connected networks is studied. Having a group of processors distributed on mesh, the goal is to present a routing strategy such that every member of the group can effectively transmit data to the other members. The conventional strategies in solving the problem are source-based and shared-tree approaches, each having drawbacks in efficiency or scalability for large networks. To compromise between these two, we use the multi-shared trees approach. We apply a core-selection algorithm based on taxicab geometry to create a small number of distribution trees that are almost optimum with respect to multicast time and traffic.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Masters)
Authors:Moradian, Talin
Pagination:x, 66 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:M. Comp. Sc.
Program:Computer Science and Software Engineering
Thesis Supervisor(s):Harutyunyan, Hovhannes
ID Code:975916
Deposited By: Concordia University Library
Deposited On:22 Jan 2013 16:17
Last Modified:18 Jan 2018 17:41
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Back to top Back to top