Broadcasting with Universal Lists Revisited: Using Competitive Analysis

Authors:
Jae-Hoon Kim;Kyung-Yong Chwa
Affiliations:
-;-
Venue:
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Year:
2001

Citing 4
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Developments from a June 1996 seminar on Online algorithms: the state of the art

Developments from a June 1996 seminar on Online algorithms: the state of the art
Deterministic Radio Broadcasting

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Fast broadcasting and gossiping in radio networks

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a variant of broadcasting: each node has a predetermined ordered list of neighbors (regardless of the node, called the source, from which the message is originated to be transmitted to all nodes in a network) and transmits a received message to neighbors in order of the list. This problem was introduced in [3].We propose a new measure of the efficiency of a broadcasting scheme, which is obtained from the competitve analysis [4,7], and we design new broadcasting schemes for lines, complete k-ary trees, grids, complete graphs, and hypercubes.