On multicast trees: Structure and size estimation

Danny Dolev*, Osnat Mokryn, Yuval Shavitt

*Corresponding author for this work

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

17 Scopus citations

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 languageEnglish
Title of host publicationIEEE INFOCOM 2003
Subtitle of host publicationThe Conference on Computer Communications - 22nd Annual Joint Conference of the IEEE Computer and Communications Societies
Pages1011-1021
Number of pages11
DOIs
StatePublished - 2003
Event22nd Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE INFOCOM 2003 - San Francisco, CA, United States
Duration: 30 Mar 20033 Apr 2003

Publication series

NameProceedings - IEEE INFOCOM
Volume2
ISSN (Print)0743-166X

Conference

Conference22nd Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE INFOCOM 2003
Country/TerritoryUnited States
CitySan Francisco, CA
Period30/03/033/04/03

Fingerprint

Dive into the research topics of 'On multicast trees: Structure and size estimation'. Together they form a unique fingerprint.

Cite this