메뉴 건너뛰기




Volumn , Issue , 2003, Pages 143-152

Virtual landmarks for the Internet

Author keywords

Network Coordinates; Network Distance; Principal Component Analysis

Indexed keywords

EMBEDDED SYSTEMS; NONLINEAR SYSTEMS; OPTIMIZATION; PRINCIPAL COMPONENT ANALYSIS; SET THEORY; VECTORS;

EID: 19544365926     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/948221.948223     Document Type: Conference Paper
Times cited : (224)

References (29)
  • 1
    • 84860944506 scopus 로고    scopus 로고
    • The NLANR active measurement project. http://amp.nlanr.net/active/.
  • 5
    • 51249178997 scopus 로고
    • On Lipschitz embedding of finite metric spaces in Hubert space
    • J. Bourgain. On Lipschitz embedding of finite metric spaces in Hubert space. Israel J. Math., 52(1-2):46-52, 1985.
    • (1985) Israel J. Math. , vol.52 , Issue.1-2 , pp. 46-52
    • Bourgain, J.1
  • 9
    • 0032669826 scopus 로고    scopus 로고
    • An architecture for a global Internet host distance estimation service
    • New York, NY, March. IEEE
    • 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 IEEE INFOCOM 1999, pages 210-217, New York, NY, March 1999. IEEE.
    • (1999) IEEE INFOCOM 1999 , pp. 210-217
    • Francis, P.1    Jamin, S.2    Paxson, V.3    Zhang, L.4    Gryniewicz, D.F.5    Jin, Y.6
  • 16
    • 0000652415 scopus 로고
    • The geometry of graphs and some of its algorithmic implications
    • N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic implications. Combinatorica, 15:215-245, 1995.
    • (1995) Combinatorica , vol.15 , pp. 215-245
    • Linial, N.1    London, E.2    Rabinovich, Y.3
  • 17
    • 0036346553 scopus 로고    scopus 로고
    • Predicting Internet network distance with coordinates-based approaches
    • E. Ng and H. Zhang. Predicting Internet network distance with coordinates-based approaches. In Proceedings of Infocom, 2002.
    • (2002) Proceedings of Infocom
    • Ng, E.1    Zhang, H.2
  • 20
    • 84860946891 scopus 로고    scopus 로고
    • RouteViews. http://www.routeviews.org.
  • 21
    • 84860949221 scopus 로고    scopus 로고
    • The skitter project. http://www.caida.org/tools/measurement/skitter/.
  • 22
    • 84860946893 scopus 로고    scopus 로고
    • Sockeye Networks, http://www.sockeye.com/.
  • 25
    • 0041472446 scopus 로고    scopus 로고
    • Big-bang simulation for embedding network distances in Euclidean space
    • April
    • T. Tankel and Y. Shavitt. Big-bang simulation for embedding network distances in Euclidean space. In Proceedings of IEEE INFOCOM 2003, April 2003.
    • (2003) Proceedings of IEEE INFOCOM 2003
    • Tankel, T.1    Shavitt, Y.2
  • 26
    • 84950351930 scopus 로고
    • Multidimensional scaling: I. Theory and method
    • W. S. Torgerson. Multidimensional scaling: I. theory and method. Psychometrika, 17:401-419, 1952.
    • (1952) Psychometrika , vol.17 , pp. 401-419
    • Torgerson, W.S.1
  • 27
    • 0036132154 scopus 로고    scopus 로고
    • Efficient image retrieval through vantage objects
    • Jan
    • J. Vleugels and R. C. Veltkamp. Efficient image retrieval through vantage objects. Pattern Recognition, 35(1):69-80, Jan 2002.
    • (2002) Pattern Recognition , vol.35 , Issue.1 , pp. 69-80
    • Vleugels, J.1    Veltkamp, R.C.2
  • 28
    • 31244436296 scopus 로고    scopus 로고
    • A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
    • Q. Wong and Z. Wu. A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances. Journal of Global Optimization, pages 365-375, 2002.
    • (2002) Journal of Global Optimization , pp. 365-375
    • Wong, Q.1    Wu, Z.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.