Performance Characteristics of Multicast Flows on Random Trees

DOI10.1081/STM-200025742MaRDI QIDQ3157869zbMATH OpenOpenAlexFDO

Authors Bartlomiej Blaszczyszyn, Konstantin Tchoumatchenko

Publication date 19 January 2005

Published in Stochastic Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1081/stm-200025742

zbMATH Keywords

Galton-Watson treesmulticast sessionPoisson processrandom tree

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Applications of branching processes (60J85) Network design and communication in computer systems (68M10)

Recommendations

• Markov random field models of multicasting in tree networks
• scientific article; zbMATH DE number 2119681
• Multicast tree structure and the power law
• Dynamic tree algorithms
• Blocking of dynamic multicast connections

Cites work

• Bounds for clump size characteristics in the Boolean model
• scientific article; zbMATH DE number 786469 (Why is no real title available?)
• On a coverage process ranging from the Boolean model to the Poisson-Voronoi tessellation with applications to wireless communications
• On continuum percolation
• The capacity of wireless networks

Cited in

(2)

• Multicast tree structure and the power law
• scientific article; zbMATH DE number 2119681 (Why is no real title available?)

This page was built for publication: Performance Characteristics of Multicast Flows on Random Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3157869)