Digital Commons Network^™

Information Dissemination By Compounding, Bohe (Bob) Wang

Graduate Theses, Dissertations, and Problem Reports

Gossiping and broadcasting are two problems of information dissemination. In gossiping, every point in the network knows a unique item of information and needs to communicate it to all other points. Most of the recent interest in gossiping is due to its importance in the area of network communications and other areas of parallel and distributed computing.;Determining precisely the values of the minimum number of edges in a gossip graph is known to be a very hard problem. Very few values are known in the general case. G. Fertin and R. Labahn[Fer00],[FL00] used the k-way compounding method to construct gossip …