메뉴 건너뛰기




Volumn 3947 LNCS, Issue , 2006, Pages 83-92

The peering problem in tree-based master/worker overlays

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; INTERCONNECTION NETWORKS; PROBLEM SOLVING; TREES (MATHEMATICS);

EID: 33745819920     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11745693_9     Document Type: Conference Paper
Times cited : (1)

References (12)
  • 1
    • 84941149396 scopus 로고    scopus 로고
    • (Napster) http://www.napster.com/.
  • 2
    • 84941162212 scopus 로고    scopus 로고
    • (Gnutella) http://rfc-gnutella.sourceforge.net/.
  • 5
    • 84941154542 scopus 로고    scopus 로고
    • (SETI@home) http://setiathome.ssl.berkeley.edu/.
  • 8
    • 33745816815 scopus 로고    scopus 로고
    • The peering problem in tree-based master/worker overlays
    • National Cheng-Kung University, Taiwan
    • Hsiao, H.C., Liao, H.: The Peering Problem in Tree-based Master/Worker Overlays. Technical report, National Cheng-Kung University, Taiwan (2005)
    • (2005) Technical Report
    • Hsiao, H.C.1    Liao, H.2
  • 10
    • 2442537008 scopus 로고    scopus 로고
    • Analyzing peer-to-peer traffic across large networks
    • Sen, S., Wang, J.: Analyzing Peer-to-Peer Traffic Across Large Networks. ACM/IEEE Transactions on Networking 12 (2004) 219-232
    • (2004) ACM/IEEE Transactions on Networking , vol.12 , pp. 219-232
    • Sen, S.1    Wang, J.2
  • 11
    • 0036346553 scopus 로고    scopus 로고
    • Predicting internet network distance with coordinates-based approaches
    • Ng, T., Zhang, H.: Predicting Internet Network Distance with Coordinates-Based Approaches. In: Proceedings of IEEE INFOCOM. (2002) 170-179
    • (2002) Proceedings of IEEE INFOCOM , pp. 170-179
    • Ng, T.1    Zhang, H.2
  • 12
    • 84941161178 scopus 로고    scopus 로고
    • (SPEC) http://www.spec.org/.


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