| | |
Summary: 1
Improved Upper Bound on -Time-Relaxed
-Broadcasting Communication Networks
A. Averbuch I. Peeri Y. Roditty
School of Computer Sciences
Tel Aviv University
Ramat Aviv, Tel Aviv 69978
Israel
e-mail: jr@post.tau.ac.il
Abstract
Broadcasting is a process in which an individual has an item of information which needs to be transmitted
to all of the members in a network (which is viewed as a connected graph).
-broadcasting is a variant of
broadcasting in which each processor can transmit the message to up to
of its neighbors in one time unit.
Another variant of broadcasting is the concept of m-time-relaxed broadcasting, where we allow adding ¡ time
units to the optimal broadcast time, in exchange for fewer edges. The combination of ¡ -time-relaxed and
-
broadcasting is studied in this paper.
The result shown here is an improvement in the upper bound obtained by Harutyunyan and Listman in [9]
|
