Login | Register

Efficient heuristic for multicasting in arbitrary networks

Title:

Efficient heuristic for multicasting in arbitrary networks

Katragadda, Rahul (2008) Efficient heuristic for multicasting in arbitrary networks. Masters thesis, Concordia University.

[img]
Preview
Text (application/pdf)
MR45305.pdf - Accepted Version
3MB

Abstract

Multicast is a communication model in which a message is sent from a source to an arbitrary number of distinct destinations. Two main parameters that are used to evaluate multicast routing are the time it takes to deliver the message to all destinations and the traffic, i.e., the total number of links involved in the multicast process. It has been proved that finding an optimal multicast solution on both time and traffic is NP-hard. We propose a heuristic for the multicasting problem in an arbitrary network. We perform extensive simulations to test our heuristic for pure random network topology and two types of N-Level Hierarchical topologies.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Masters)
Authors:Katragadda, Rahul
Pagination:viii, 76 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:M. Comp. Sc.
Program:Computer Science and Software Engineering
Date:2008
Thesis Supervisor(s):Harutyunyan, Hovhannes
ID Code:975915
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