Asymptotic Analysis for Reliable Data Dissemination in Shared loss Multicast Trees Academic Article uri icon


  • The completion time for the dissemination (or alternatively, aggregation) of information from all nodes in a network plays a critical role in the design and analysis of communication systems, especially in real time applications for which delay is critical. In this work, we analyse the completion time of data dissemination in a shared loss (ie, unreliable links) multicast tree, at the limit of large number of nodes. Specifically, analytic expressions for upper and lower bounds on the expected completion time are provided, and, in particular, it is shown that both these bounds scale as $\alpha\log n $. For example, on a full binary tree with $ n $ end users, and packet loss probability of $0.1 $, we bound the expected completion time for disseminating one packet from below by $1.41\log_2 n+ o\left (\log n\right) $ and from above by $1.78\log_2 n+ o\left (\log n\right) $. Clearly, the completion …

publication date

  • January 1, 2015