On multicast trees: Structure and size estimation

Danny Dolev; Osnat Mokryn; Yuval Shavitt

doi:10.1109/INFCOM.2003.1208938

On multicast trees: Structure and size estimation

Danny Dolev
, Osnat Mokryn
, Yuval Shavitt

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

Abstract

This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and real Internet data, we characterize the structure of such trees and show that they obey the rank-degree power law; that most high degree tree nodes are concentrated in a low diameter neighborhood; and that the sub-tree size also obeys a power law. Our most surprising empirical finding suggests that there is a linear ratio between the number of highdegree network nodes, namely nodes whose tree degree is higher than some constant, and the number of leaf nodes in the multicast tree (clients). We also derive this ratio analytically. Based on this finding, we develop the Fast Algorithm, that estimates the number of clients, and show that it converges faster than one round trip delay from the root to a randomly selected client.

Original language	English
Title of host publication	IEEE INFOCOM 2003
Subtitle of host publication	The Conference on Computer Communications - 22nd Annual Joint Conference of the IEEE Computer and Communications Societies
Pages	1011-1021
Number of pages	11
DOIs	https://doi.org/10.1109/INFCOM.2003.1208938
State	Published - 2003
Externally published	Yes
Event	22nd Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE INFOCOM 2003 - San Francisco, CA, United States Duration: 30 Mar 2003 → 3 Apr 2003

Publication series

Name	Proceedings - IEEE INFOCOM
Volume	2
ISSN (Print)	0743-166X

Conference

Conference	22nd Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE INFOCOM 2003
Country/Territory	United States
City	San Francisco, CA
Period	30/03/03 → 3/04/03

ASJC Scopus subject areas

General Computer Science
Electrical and Electronic Engineering

Access to Document

10.1109/INFCOM.2003.1208938

Cite this

@inproceedings{42b0448a3bd4489fbc0b7f6954193603,

title = "On multicast trees: Structure and size estimation",

abstract = "This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and real Internet data, we characterize the structure of such trees and show that they obey the rank-degree power law; that most high degree tree nodes are concentrated in a low diameter neighborhood; and that the sub-tree size also obeys a power law. Our most surprising empirical finding suggests that there is a linear ratio between the number of highdegree network nodes, namely nodes whose tree degree is higher than some constant, and the number of leaf nodes in the multicast tree (clients). We also derive this ratio analytically. Based on this finding, we develop the Fast Algorithm, that estimates the number of clients, and show that it converges faster than one round trip delay from the root to a randomly selected client.",

author = "Danny Dolev and Osnat Mokryn and Yuval Shavitt",

year = "2003",

doi = "10.1109/INFCOM.2003.1208938",

language = "English",

isbn = "0780377524",

series = "Proceedings - IEEE INFOCOM",

pages = "1011--1021",

booktitle = "IEEE INFOCOM 2003",

note = "22nd Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE INFOCOM 2003 ; Conference date: 30-03-2003 Through 03-04-2003",

}

Dolev, D, Mokryn, O & Shavitt, Y 2003, On multicast trees: Structure and size estimation. in IEEE INFOCOM 2003: The Conference on Computer Communications - 22nd Annual Joint Conference of the IEEE Computer and Communications Societies., 1208938, Proceedings - IEEE INFOCOM, vol. 2, pp. 1011-1021, 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE INFOCOM 2003, San Francisco, CA, United States, 30/03/03. https://doi.org/10.1109/INFCOM.2003.1208938

On multicast trees: Structure and size estimation. / Dolev, Danny; Mokryn, Osnat; Shavitt, Yuval.
IEEE INFOCOM 2003: The Conference on Computer Communications - 22nd Annual Joint Conference of the IEEE Computer and Communications Societies. 2003. p. 1011-1021 1208938 (Proceedings - IEEE INFOCOM; Vol. 2).

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

TY - GEN

T1 - On multicast trees

T2 - 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE INFOCOM 2003

AU - Dolev, Danny

AU - Mokryn, Osnat

AU - Shavitt, Yuval

PY - 2003

Y1 - 2003

N2 - This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and real Internet data, we characterize the structure of such trees and show that they obey the rank-degree power law; that most high degree tree nodes are concentrated in a low diameter neighborhood; and that the sub-tree size also obeys a power law. Our most surprising empirical finding suggests that there is a linear ratio between the number of highdegree network nodes, namely nodes whose tree degree is higher than some constant, and the number of leaf nodes in the multicast tree (clients). We also derive this ratio analytically. Based on this finding, we develop the Fast Algorithm, that estimates the number of clients, and show that it converges faster than one round trip delay from the root to a randomly selected client.

AB - This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and real Internet data, we characterize the structure of such trees and show that they obey the rank-degree power law; that most high degree tree nodes are concentrated in a low diameter neighborhood; and that the sub-tree size also obeys a power law. Our most surprising empirical finding suggests that there is a linear ratio between the number of highdegree network nodes, namely nodes whose tree degree is higher than some constant, and the number of leaf nodes in the multicast tree (clients). We also derive this ratio analytically. Based on this finding, we develop the Fast Algorithm, that estimates the number of clients, and show that it converges faster than one round trip delay from the root to a randomly selected client.

UR - https://www.scopus.com/pages/publications/0042440617

U2 - 10.1109/INFCOM.2003.1208938

DO - 10.1109/INFCOM.2003.1208938

M3 - Conference contribution

AN - SCOPUS:0042440617

SN - 0780377524

SN - 9780780377523

T3 - Proceedings - IEEE INFOCOM

SP - 1011

EP - 1021

BT - IEEE INFOCOM 2003

Y2 - 30 March 2003 through 3 April 2003

ER -

On multicast trees: Structure and size estimation

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint