Title of article
Minimum-time multidrop broadcast Original Research Article
Author/Authors
Arthur M. Farley، نويسنده , , Andrzej Pelc، نويسنده , , Andrzej Proskurowski، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
17
From page
61
To page
77
Abstract
The multidrop communication model assumes that a message originated by a sender is sent along a path in a network and is communicated to each site along that path. In the presence of several concurrent senders, we require that the transmission paths be vertex-disjoint. The time analysis of such communication includes both start-up time and drop-off time terms. We determine the minimum time required to broadcast a message under this communication model in several classes of graphs.
Journal title
Discrete Applied Mathematics
Serial Year
1998
Journal title
Discrete Applied Mathematics
Record number
884724
Link To Document