Constructing internet coordinate system based on delay measurement

IEEE/ACM Transactions on Networking

Volumn 13, Issue 3, 2005, Pages 513-525

  Lim, Hyuk ^a   Hou, Jennifer C ^a   Choi, Chong Ho ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b Seoul National University   (South Korea)

Author keywords

Internet; Measurement techniques; Modeling techniques; Network topology

Indexed keywords

MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; PRINCIPAL COMPONENT ANALYSIS;

INTERNET COORDINATE SYSTEM; MEASUREMENT TECHNIQUES; MODELING TECHNIQUES; NETWORK TOPOLOGY;

INTERNET;

EID: 23344444006     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.850197     Document Type: Article

References (20)

1. H. Lim, J. C. Hou, and C.-H. Choi, "Constructing Internet coordinate system based on delay measurement," in Proc. ACM Internet Measurement Conf., 2003, pp. 129-142.
2. P. Francis, S. Jamin, V. Paxson, L. Zhang, D. F. Gryniewicz, and Y. Jin, "An architecture for a global Internet host distance estimation service," in Proc. IEEE INFOCOM, 1999, pp. 210-217.
3. E. Ng and H. Zhang, "Predicting Internet network distance with coordinates-based approaches," in Proc. IEEE INFOCOM, 2002, pp. 170-179.
4. S. Hotz, "Routing Information Organization to Support Scalable Interdomain Routing with Heterogeneous Path Requirements," Ph.D. Thesis, Univ. of Southern California, 1994.
5. J. D. Guyton and M. F. Schwartz, "Locating nearby copies of replicated Internet servers," in Proc. ACM SIGCOMM, 1995, pp. 288-298.
6. L. Tang and M. Crovella, "Virtual landmarks for the Internet," Proc. ACM Internet Measurement Conf., pp. 143-152, 2003.
7. M. Pias, J. Crowcroft, S. Wilbur, T. Hams, and S. Bhatti, "Lighthouses for scalable distributed location," in Proc. Int. Workshop on Peer-to-Peer Systems (IPTPS), 2003, pp. 278-291.
8. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.
9. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "Topologically-aware overlay construction and server selection," in Proc. IEEE INFOCOM, 2002, pp. 1190-1199.
10. J. A. Nelder and R. Mead, "A simplex method for function minimization," Comput. J., vol. 7, pp. 308-313, 1965.
11. I. T. Jolliffe, Principal Component Analysis. New York, NY: Springer-Verlag, 1986.
12. B. Noble and J. W. Daniel, Applied Linear Algebra. Englewood Cliffs, NJ: Prentice-Hall, 1988.
13. K. Y. Yeung and W. L. Ruzzo, "Principal component analysis for clustering gene expression data," Bioinformatics, vol. 17, no. 9, pp. 763-774, 2001.
14. C. Ding, X. He, H. Zha, and H. Simon, "Adaptive dimension reduction for clustering high dimensional data," in Proc. 2nd IEEE Int. Conf. Data Mining, 2002, pp. 147-154.
15. T. P. Minka, "Automatic Choice of Dimensionality for PCA," MIT Media Lab., Tech. Rep. 514, 2000.
16. V. Paxson, "End-to-end routing behavior in the Internet," in Proc. ACM SIGCOMM, Aug. 1996, pp. 25-38.
17. Active Measurement Project (AMP), National Laboratory for Applied Network Research [Online]. Available: http://watt.nlanr.net/
18. A. Jain and R. C. Dubes, Algorithms for Clustering Data. Englewood Cliffs, NJ: Prentice-Hall, 1988.
19. E. W. Zegura, K. Calvert, and S. Bhattacharjee, "How to model an Internetwork," in Proc. IEEE INFOCOM, 1996, pp. 594-602.
20. Network Simulator-ns-2 (2001). [Online]. Available: http://www. isi.edu/nsnam/ns/ns-documentation