메뉴 건너뛰기




Volumn 3144, Issue , 2004, Pages 83-95

Multicast in DKS (N, k, f) overlay networks

Author keywords

Distributed Algorithms; Distributed Hash Tables; Multicast; Peer to Peer Computing

Indexed keywords

DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; MULTICASTING; OVERLAY NETWORKS; PARALLEL ALGORITHMS; TELECOMMUNICATION NETWORKS;

EID: 35048871122     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27860-3_10     Document Type: Article
Times cited : (7)

References (9)
  • 5
    • 27944445090 scopus 로고    scopus 로고
    • Mozart Consortium, http://www.mozart-oz.org, 2003.
    • (2003) Mozart Consortium
  • 8
    • 57349142855 scopus 로고    scopus 로고
    • Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
    • Antony Rowstron and Peter Druschel. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. Lecture Notes in Computer Science, 2218, 2001. citeseer.nj.nec.com/rowstron01pastry.html.
    • (2001) Lecture Notes in Computer Science , vol.2218
    • Rowstron, A.1    Druschel, P.2
  • 9
    • 0034782005 scopus 로고    scopus 로고
    • Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications
    • San Deigo, CA, August
    • I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In ACM SIGCOMM 2001, pages 149-160, San Deigo, CA, August 2001.
    • (2001) ACM SIGCOMM 2001 , pp. 149-160
    • Stoica, I.1    Morris, R.2    Karger, D.3    Kaashoek, M.4    Balakrishnan, H.5


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