Network kriging

IEEE Journal on Selected Areas in Communications

Volumn 24, Issue 12, 2006, Pages 2263-2272

  Chua, David B ^a,b   Kolaczyk, Eric D ^a,b   Crovella, Mark ^a,c  

^a IEEE   (United States)

^b Boston University   (United States)

^c BOSTON UNIVERSITY   (United States)

Author keywords

Algorithms; Monitoring; Network measurements; Routing matrices; Sampling; Statistics

Indexed keywords

END-TO-END NETWORK PROPERTIES; NETWORK MEASUREMENTS; NETWORK PATHS; ROUTING MATRICES;

ALGORITHMS; MEASUREMENT THEORY; MONITORING; PROBLEM SOLVING; SAMPLING; STATISTICAL METHODS; TELECOMMUNICATION NETWORKS;

TELECOMMUNICATION SERVICES;

EID: 33845619078     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2006.884025     Document Type: Article

References (19)

1. NLANR Active Measurement Project. [Online]. Available: http://amp.nlanr.net/AMP/
2. RIPE Test-Traffic Project. [Online]. Available: http://www.ripe.net/test- traffic/
3. Internet End-to-End Performance Monitoring Project. [Online]. Available: http://www-iepm.slac.stanford.edu/
4. Y. Chen, D. Bindel, and R. H. Katz, "Tomography-based overlay network monitoring," in Proc. 2003 ACM SIGCOMM Conf. Internet Measure., 2003, pp. 216-231.
5. Y. Shavitt, X. Sun, A. Wool, and B. Yener, "Computing the unmeasured: An algebraic approach to Internet mapping," in Pwc. IEEE INFOCOM, Apr. 2001, pp. 1646-1654.
6. N. A. C. Cressie, Statistics for Spatial Data, ser. Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics. New York: Wiley, 1993.
7. Y. Chen, D. Bindel, H. Song, and R. H. Katz, "An algebraic approach to practical and scalable overlay network monitoring," in Proc. ACM SIGCOMM, 2004, pp. 55-66.
8. H. X. Nguyen and P. Thiran, "Active measurement for multiple link failures: Diagnosis in IP networks," in Proc. 5th Int. Workshop Passive Active Network Measure., ser. Lecture Notes in Computer Science, C. Barakat and I. Pratt, Eds. Berlin, Germany: Springer-Verlag, Apr. 2004, vol. 3015, pp. 185-194. [Online]. Available: http://dblp.unitrier.de, isbn 3-540-21492-5.
9. G. H. Golub and C. van Loan, Matrix Computations, 2nd ed. London, U.K.: The Johns Hopkins Univ. Press, 1989.
10. N. Spring, R. Mahajan, and D. Wetherall, "Measuring ISP topologies with Rocketfuel," in Proc. ACM SIGCOMM, 2002, pp. 133-145.
11. D. B. Chua, E. D. Kolaczyk, and M. Crovella, "Efficient monitoring of end-to-end network properties," in Proc. IEEE INFOCOM, 2005, pp. 1701-1711.
12. S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications. Cambridge, U.K.: Cambridge Univ. Press, Nov. 1994.
13. M. Barthélemy, "Betweenness centrality in large complex networks," Eur. Phys. J. B, vol. 38, pp. 163-168, 2004.
14. M. E. J. Newman and M. Girvan, "Finding and evaluating community structure in networks," Phys. Rev. E, vol. 69, no. 2, p. 026113, Feb. 2004.
15. R. Vaillant, A. H. Dorfman, and R. M. Royall, Finite Population Sampling and Inference: A Prediction Approach, New York: Wiley, 2000.
16. R. Christensen, Plane Answers to Complex Questions. New York: Springer-Verlag, 1987.
17. D. B. Chua, E. D. Kolaczyk, and M. Crovella, "A statistical framework for efficient monitoring of end-to end network properties." [Online]. Available: http://arxiv.org/abs/cs.NI/0412037
18. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay, "Clustering large graphs via the singular value decomposition," Mach. Learn., vol. 56, no. 1-3, pp. 9-33, Jul. 2004.
19. R. S. Varga, Geršgorin and His Circles, ser. Springer Series in Computational Mathematics. Berlin, Germany: Springer-Verlag, 2004, vol. 36.