Login | Register

Deep Heuristic: A Heuristic for Message Broadcasting in Arbitrary Networks

Title:

Deep Heuristic: A Heuristic for Message Broadcasting in Arbitrary Networks

Majithiya, Rakshit Batukbhai (2015) Deep Heuristic: A Heuristic for Message Broadcasting in Arbitrary Networks. Masters thesis, Concordia University.

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

Abstract

With the increasing popularity of interconnection networks, efficient information dissemination has become a popular research area. Broadcasting is one of the information dissemination primitives. Finding the optimal broadcasting scheme for any originator in an arbitrary network has been proved to be an NP-Hard problem. In this thesis, a new heuristic that generates broadcast schemes in arbitrary networks is presented, which has O(|E| + |V | log |V |) time complexity. Based on computer simulations of this heuristic in some commonly used topologies and network models, and comparing the results with the best existing heuristics, we conclude that the new heuristic show comparable performances while having lower complexity.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Masters)
Authors:Majithiya, Rakshit Batukbhai
Institution:Concordia University
Degree Name:M. Comp. Sc.
Program:Computer Science
Date:7 January 2015
ID Code:979627
Deposited By: RAKSHIT MAJITHIYA
Deposited On:13 Jul 2015 14:28
Last Modified:18 Jul 2019 16:02
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

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top