Login | Register

An algorithm for gossiping and broadcasting


An algorithm for gossiping and broadcasting

Chen, Guo Tai (2006) An algorithm for gossiping and broadcasting. Masters thesis, Concordia University.

[thumbnail of MR14319.pdf]
Text (application/pdf)
MR14319.pdf - Accepted Version


Effectively disseminating the information among processors is an important feature for an interconnection network. Among all information dissemination models, broadcasting and gossiping are two of the most popular research topics. Finding the optimal broadcasting and gossiping schedule in an arbitrary net is an NP-Hard complete problem. This thesis presents an algorithm for both broadcasting and gossiping in arbitrary networks. The time complexity of this algorithm is O ( Rn 3 ), where R is the rounds used for the broadcasting or gossiping, and n is the total number of nodes in the network. The test has been implemented in both regularly used graphs and four of the NS-2 network design models. The regularly used graph models include Butterfly, CCC d , de Bruijn and Shuffle Exchange . And the four NS-2 internet models include GT-ITM random, GT-ITM Transit-Stub, Tiers and Inet

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Masters)
Authors:Chen, Guo Tai
Pagination:xii, 89 leaves : ill. (some col.) ; 29 cm.
Institution:Concordia University
Degree Name:M. Comp. Sc.
Program:Computer Science and Software Engineering
Thesis Supervisor(s):Harutyunyan, Hovhannes
Identification Number:LE 3 C66C67M 2006 C48
ID Code:8892
Deposited By: Concordia University Library
Deposited On:18 Aug 2011 18:38
Last Modified:13 Jul 2020 20:05
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

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