Scaling laws for reliable data dissemination in shared loss multicast trees

Ron Yadgar; Asaf Cohen; Omer Gurewitz

doi:10.1109/ALLERTON.2015.7447101

Scaling laws for reliable data dissemination in shared loss multicast trees

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015
Publisher	Institute of Electrical and Electronics Engineers
Pages	894-900
Number of pages	7
ISBN (Electronic)	9781509018239
DOIs	https://doi.org/10.1109/ALLERTON.2015.7447101
State	Published - 4 Apr 2016
Event	53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015 - Monticello, United States Duration: 29 Sep 2015 → 2 Oct 2015

Publication series

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

Conference

Conference	53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015
Country/Territory	United States
City	Monticello
Period	29/09/15 → 2/10/15

Keywords

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

ASJC Scopus subject areas

Computer Networks and Communications
Computer Science Applications
Control and Systems Engineering

Access to Document

10.1109/ALLERTON.2015.7447101

Cite this

Yadgar, R., Cohen, A., & Gurewitz, O. (2016). Scaling laws for reliable data dissemination in shared loss multicast trees. In 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015 (pp. 894-900). Article 7447101 (2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ALLERTON.2015.7447101

Yadgar, Ron ; Cohen, Asaf ; Gurewitz, Omer. / Scaling laws for reliable data dissemination in shared loss multicast trees. 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015. Institute of Electrical and Electronics Engineers, 2016. pp. 894-900 (2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015).

@inproceedings{dbb2d31b07e34f429a07203694645acf,

title = "Scaling laws for reliable data dissemination in shared loss multicast trees",

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.",

keywords = "Completion time, Extreme Value Theory, broadcasting, delay analysis, information dissemination, time-complexity",

author = "Ron Yadgar and Asaf Cohen and Omer Gurewitz",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015 ; Conference date: 29-09-2015 Through 02-10-2015",

year = "2016",

month = apr,

day = "4",

doi = "10.1109/ALLERTON.2015.7447101",

language = "English",

series = "2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015",

publisher = "Institute of Electrical and Electronics Engineers",

pages = "894--900",

booktitle = "2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015",

address = "United States",

}

Yadgar, R, Cohen, A & Gurewitz, O 2016, Scaling laws for reliable data dissemination in shared loss multicast trees. in 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015., 7447101, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015, Institute of Electrical and Electronics Engineers, pp. 894-900, 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015, Monticello, United States, 29/09/15. https://doi.org/10.1109/ALLERTON.2015.7447101

Scaling laws for reliable data dissemination in shared loss multicast trees. / Yadgar, Ron; Cohen, Asaf ; Gurewitz, Omer.
2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015. Institute of Electrical and Electronics Engineers, 2016. p. 894-900 7447101 (2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Scaling laws for reliable data dissemination in shared loss multicast trees

AU - Yadgar, Ron

AU - Cohen, Asaf

AU - Gurewitz, Omer

PY - 2016/4/4

Y1 - 2016/4/4

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

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

KW - Completion time

KW - Extreme Value Theory

KW - broadcasting

KW - delay analysis

KW - information dissemination

KW - time-complexity

UR - http://www.scopus.com/inward/record.url?scp=84969836644&partnerID=8YFLogxK

U2 - 10.1109/ALLERTON.2015.7447101

DO - 10.1109/ALLERTON.2015.7447101

M3 - Conference contribution

AN - SCOPUS:84969836644

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

SP - 894

EP - 900

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

PB - Institute of Electrical and Electronics Engineers

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

Y2 - 29 September 2015 through 2 October 2015

ER -

Yadgar R, Cohen A , Gurewitz O. Scaling laws for reliable data dissemination in shared loss multicast trees. In 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015. Institute of Electrical and Electronics Engineers. 2016. p. 894-900. 7447101. (2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015). doi: 10.1109/ALLERTON.2015.7447101

Scaling laws for reliable data dissemination in shared loss multicast trees

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this