Constructing Internet coordinate system based on delay measurement

Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC

Volumn , Issue , 2003, Pages 129-142

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

^a Seoul National University   (South Korea)

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

Author keywords

Coordinate system; Internet distance service; Principal component analysis

Indexed keywords

BANDWIDTH; COMPUTATIONAL COMPLEXITY; ELECTRIC NETWORK TOPOLOGY; PRINCIPAL COMPONENT ANALYSIS; ROBUSTNESS (CONTROL SYSTEMS); ROUTERS;

COORDINATE SYSTEM; INTERNET DISTANCE SERVICE; INTERNET TOPOLOGY; PEER-TO-PEER COMPUTING;

INTERNET;

EID: 19544368640     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/948221.948222     Document Type: Conference Paper

References (18)

1. 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 Proceedings of IEEE Infocom, 1999.
2. E. Ng and H. Zhang, "Predicting Internet network distance with coordinates-based approaches," in Proceedings of Infocom, 2002.
3. S. Hotz, Routing information organization to support scalable interdomain routing with heterogeneous path requirements, Ph.d. thesis, Univ. of Southern California, 1994.
4. J. D. Guyton and M. F. Schwartz, "Locating nearby copies of replicated Internet servers," in Proceedings of ACM Sigcomm, 1995.
5. L. Tang and M. Crovella, "Virtual landmarks for the Internet," in Proceedings of ACM Internet Measurement Conference, 2003.
6. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, 1990.
7. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "Topologically-Aware overlay construction and server selection," in Proceedings of Infocom, 2002.
8. J. A. Nelder and R. Mead, "A simplex method for function minimization," Computer Journal, vol. 7, pp. 308-313, 1965.
9. I. T. Jolliffe, Principal component analysis, New York: Springer-Verlag, 1986.
10. B. Noble and J. W. Daniel, Applied Linear Algebra, Prentice Hall, 1988.
11. K. Y. Yeung and W. L. Ruzzo, "Principal component analysis for clustering gene expression data," Bioinformatics, vol. 17, no. 9, pp. 763-774, 2001.
12. C. Ding, X. He, H. Zha, and H. Simon, "Adaptive dimension reduction for clustering high dimensional data," in Proceedings of the 2nd IEEE Int'l Conf. Data Mining, 2002, pp. 147-154.
13. T. P. Minka, "Automatic choice of dimensionality for PCA," in Technical report 514, MIT Media Laboratory, 2000.
14. V. Paxson, "End-to-end routing behavior in the Internet," in Proceedings of SIGCOMM '96, August 1996.
15. National laboratory for applied network research, "Active measurement project (AMP)," http://watt.nlanr.net/.
16. A. Jain and R. C. Dubes, Algorithms for clustering data, Prentice Hall, 1988.
17. E. W. Zegura, K. Calvert, and S. Bhattacharjee, "How to model an Internetwork," in Proceedings of IEEE Infocom, 1996.
18. J. Fall and K. Varadhan, "ns manual," http://www.isi.edu/nsnam/ns/ns-documentation, 2001.