메뉴 건너뛰기




Volumn 3, Issue , 2002, Pages 1190-1199

Topologically-aware overlay construction and server selection

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GEOGRAPHIC INFORMATION SYSTEMS; INFORMATION RETRIEVAL; TELECOMMUNICATION LINKS;

EID: 0036343302     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (636)

References (34)
  • 1
    • 0010021445 scopus 로고    scopus 로고
    • Gnutella
  • 2
    • 0010053208 scopus 로고    scopus 로고
    • FreeNet
  • 5
    • 0004003593 scopus 로고    scopus 로고
    • Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
    • (2001)
    • Rowstron, A.1    Druschel, P.2
  • 8
    • 0010025351 scopus 로고    scopus 로고
    • Infrasearch
  • 10
    • 0010057713 scopus 로고    scopus 로고
    • Inktomi
  • 11
    • 0010028068 scopus 로고    scopus 로고
    • Akamai
  • 12
    • 0010057094 scopus 로고    scopus 로고
    • Cisco CDN
  • 13
    • 0010022139 scopus 로고    scopus 로고
    • Napster
  • 15
    • 0003713823 scopus 로고    scopus 로고
    • Yoid: Extending the internet multicast architecture
    • Unpublished paper; Apr.
    • (2000)
    • Francis, P.1
  • 17
    • 4244098932 scopus 로고    scopus 로고
    • Predicting internet network distance with coordinates-based approaches
    • Under submission
    • (2001)
    • Ng, E.1    Zhang, H.2
  • 30
    • 0003397095 scopus 로고
    • Routing information organization to support scalable routing with heterogeneous path requirements
    • Tech. Rep. PhD thesis (draft), University of Southern California
    • (1994)
    • Hotz, S.1


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