𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multiple use of a shortest route tree for ordering

✍ Scribed by Kaveh, A.

Book ID
102115784
Publisher
Wiley (John Wiley & Sons)
Year
1986
Tongue
English
Weight
238 KB
Volume
2
Category
Article
ISSN
0748-8025

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A scalable multicast routing protocol fo
A scalable multicast routing protocol for building shortest path trees
✍ Baoxian Zhang; Jun Zheng; Hussein T. Mouftah πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 220 KB πŸ‘ 1 views

## Abstract Scalability is a great concern in the design of multicast routing protocols for the global Internet. Building shortest path trees (SPT) is currently one of the most widely used approaches to supporting multicast routing because of the simplicity and low per‐destination cost of such tree

The likelihood ratio test for simple tre
The likelihood ratio test for simple tree order: A useful asymptotic expansion
✍ Andreas Futschik; Georg Ch. Pflug πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 495 KB

We derive new approximations for the likelihood ratio statistics that are used in testing hypotheses involving simple tree order. They are based on asymptotics when the number of populations tends to infinity and variances are equal. As an application quantiles are obtained that are much easier to