Estimation of network link loss rates via chaining in multicast trees (2001) [5 citations — 1 self]
Abstract:
Of increasing importance is estimation of internal link parameters in communications networks. Multicast probes are a way to gather statistics about internal links from edge node measurements. The problem of estimating link loss probabilities for a multicast distribution tree is examined here. Our model assumes loss statistics are distributed to session participants by a network protocol such as RTCP. We propose a decentralized algorithm for ML estimation of the link loss probabilities in a chain of nodes rooted at the source node of the multicast distribution tree and terminating at a given leaf. An expression for the Cramer-Rao bound and an approximate form for the probability distribution function of the estimator are given. The performance of the algorithm is evaluated using computer simulations for a bottleneck detection application. 1.
Citations
| 1790 | Congestion avoidance and control – Jacobson - 1988 |
| 175 | Multicastbased inference of network-internal delay distributions – Presti, Duffield, et al. - 2002 |
| 128 | Network tomography : Estimating sourcedestination traffic intensities from link data – Vardi - 1996 |
| 73 | Inference of multicast routing trees and bottleneck bandwidths using end-to-end measurements – Ratnasamy, McCanne - 1999 |
| 44 | Time-varying Network Tomography – Wiel, Cao, et al. - 1999 |
| 23 | A Transport Protocol for Real-Time Applications – RFC |
| 1 | Yu "Time-Varying Network Tomography : Router Link Data – Cao, Davis, et al. |
| 1 | McCanne "Inference of Multicast Routing Trees and Bottleneck Bandwidths using End-to-end Measurements – Ratnasamy, S |
| 1 | 1889, "RTP: A Transport Protocol for Real-Time Applications – RFC - 1996 |
