Abstract

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

Document Downloads