Scaling laws for reliable data dissemination in shared loss multicast trees

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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 α 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.

Original languageEnglish
Title of host publication2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages894-900
Number of pages7
ISBN (Electronic)9781509018239
DOIs
StatePublished - 4 Apr 2016
Event53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015 - Monticello, United States
Duration: 29 Sep 20152 Oct 2015

Publication series

Name2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015

Conference

Conference53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015
Country/TerritoryUnited States
CityMonticello
Period29/09/152/10/15

Keywords

  • Completion time
  • Extreme Value Theory
  • broadcasting
  • delay analysis
  • information dissemination
  • time-complexity

Fingerprint

Dive into the research topics of 'Scaling laws for reliable data dissemination in shared loss multicast trees'. Together they form a unique fingerprint.

Cite this