ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Performance Evaluation
Volume 64, Issues 9-12, October 2007, Pages 1169-1180
Performance 2007, 26th International Symposium on Computer Performance, Modeling, Measurements, and Evaluation
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (993 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.peva.2007.06.002    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2007 Elsevier Ltd All rights reserved.

Multicast inference of temporal loss characteristics

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Vijay Aryaa, Corresponding Author Contact Information, E-mail The Corresponding Author, N.G. Duffieldb and Darryl Veitchc

aNational ICT Australia (NICTA), Victorian Research Laboratory, Department of EEE, University of Melbourne, Australia

bAT&T Labs–Research, Florham Park, NJ, USA

cARC Special Research Centre on Ultra-Broadband Information Networks (CUBIN1), Department of EEE, University of Melbourne, Australia


Available online 13 June 2007.

Abstract

Multicast-based inference has been proposed as a method of estimating average loss rates of internal network links, using end-to-end loss measurements of probes sent over a multicast tree. We show that, in addition to loss rates, temporal characteristics of losses can also be estimated. Knowledge of temporal loss characteristics has applications for services such as voip which are sensitive to loss bursts, as well as for bottleneck detection. Under the assumption of mutually independent, but otherwise general, link loss processes, we show that probabilities of arbitrary loss patterns, mean loss-run length, and even the loss-run distribution, can be recovered for each link. Alternative estimators are presented which trade-off efficiency of data use against implementation complexity. A second contribution is a novel method of reducing the computational complexity of estimation, which can also be used by existing minc estimators. We analyse estimator performance using a combination of theory and simulation.

Keywords: Network tomography; End-to-end measurement; Loss inference; minc

Article Outline

1. Introduction
2. Tree model and probe processes
2.1. Model definition
2.2. Consequences and examples
3. Temporal characteristics of loss processes
4. Estimation of temporal loss characteristics
4.1. From path passage to link passage probabilities
4.2. Path passage probabilities: General temporal estimators
4.3. Subtree partitioning
4.4. Simpler temporal estimators
4.5. Estimator names, relations and definitions
5. Experiments
6. Analysis of estimator properties
7. Conclusion
References
Vitae








Corresponding Author Contact InformationCorresponding author.
1 CUBIN is an affiliated program of NICTA.

Performance Evaluation
Volume 64, Issues 9-12, October 2007, Pages 1169-1180
Performance 2007, 26th International Symposium on Computer Performance, Modeling, Measurements, and Evaluation
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.