Allerton 2015 Paper Abstract


Paper ThA4.4

Yadgar, Ron (Ben-Gurion University of the Negev), Cohen, Asaf (Ben-Gurion University of the Negev), Gurewitz, Omer (Ben-GurionUniversity of the Negev)

Scaling Laws for Reliable Data Dissemination in Shared Loss Multicast Trees

Scheduled for presentation during the Regular Session "Sensor Networks I" (ThA4), Thursday, October 1, 2015, 09:30−09:50, Pine

53rd Annual Allerton Conference on Communication, Control, and Computing, Sept 29-Oct 2, 2015, Allerton Park and Retreat Center, Monticello, IL, USA

This information is tentative and subject to change. Compiled on December 5, 2021

Keywords Performance Analysis, Sensor Networks in Communications, Reliable and Trustworthy Networks


The completion time for the dissemination of information to all nodes in a network plays a critical role in the design and analysis of communication systems. In this work, we analyse the completion time of data dissemination in a shared loss (i.e., 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$, where $n$ is the number of nodes.

Clearly, the completion time is determined by the last end user who receives the message, that is, a maximum over all arrival times. We derive asymptotic bounds on the expectation of this maximum and use them to obtain tight bounds on the completion time. The results are validated by simulations and numerical analysis.



All Content © PaperCept, Inc..

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2021 PaperCept, Inc.
Page generated 2021-12-05  10:17:02 PST  Terms of use