메뉴 건너뛰기




Volumn 3015, Issue , 2004, Pages 63-72

Geometric exploration of the landmark selection problem

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; INTERNET; OVERLAY NETWORKS;

EID: 34547669768     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24668-8_7     Document Type: Article
Times cited : (17)

References (16)
  • 7
    • 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
  • 9
    • 0003235158 scopus 로고    scopus 로고
    • An investigation of geographic mapping techniques for Internet hosts
    • August
    • V.N. Padmanabhan and L. Subramanian. An investigation of geographic mapping techniques for Internet hosts. In Proceedings of ACM/SIGCOMM '01, August 2001.
    • (2001) Proceedings of ACM/SIGCOMM '01
    • Subramanian, L.1
  • 11
    • 51349090593 scopus 로고    scopus 로고
    • The skitter project, http://www.caida.org/tools/measurement/skitter/.
    • The Skitter Project
  • 14
    • 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


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