메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 132-143

Z-Ring: Fast prefix routing via a low maintenance membership protocol

Author keywords

DHT; Group membership; Peer to peer; Routing

Indexed keywords

GROUP MEMBERSHIP; MEMBERSHIP PROTOCOLS; PEER TO PEER (P2P); ROUTING;

EID: 33750963287     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2005.45     Document Type: Conference Paper
Times cited : (9)

References (17)
  • 1
    • 4544303626 scopus 로고    scopus 로고
    • Performance and dependability of structured peer-to-peer overlays
    • Florence Italy, June
    • Castro, M., Costa, M. and Rowstron, A., "Performance and dependability of structured peer-to-peer overlays", In Proc. of DSN, Florence Italy, June 2004.
    • (2004) Proc. of DSN
    • Castro, M.1    Costa, M.2    Rowstron, A.3
  • 2
    • 0001776520 scopus 로고    scopus 로고
    • Group communication specifications: A comprehensive study
    • Chockler, G. V., Keidar, I., and Vitenberg, R., "Group communication specifications: A comprehensive study", ACM computing Surveys, 33:4, pp.427-469, 2001.
    • (2001) ACM Computing Surveys , vol.33 , Issue.4 , pp. 427-469
    • Chockler, G.V.1    Keidar, I.2    Vitenberg, R.3
  • 4
    • 0036921929 scopus 로고    scopus 로고
    • SWIM; Scalable weakly-consistent infection-style process group membership protocol
    • Washington DC, June
    • Das, A., Gupta, I., Motivala, A., "SWIM; Scalable Weakly-consistent Infection-style Process Group Membership Protocol", In Proc. of DSN, Washington DC, June, 2002
    • (2002) Proc. of DSN
    • Das, A.1    Gupta, I.2    Motivala, A.3
  • 5
    • 0002112484 scopus 로고
    • Epidemic algorithms for replicated database maintenance
    • Jan.
    • Demers, A., et al, "Epidemic algorithms for replicated database maintenance". Operating Systems Review, 22(1):8-32 (Jan. 1988).
    • (1988) Operating Systems Review , vol.22 , Issue.1 , pp. 8-32
    • Demers, A.1
  • 7
    • 84883649048 scopus 로고    scopus 로고
    • Efficient routing for peer-to-peer overlays
    • San Francisco, CA, April
    • Gupta, A., Liskov, B., and Rodrigues, R., "Efficient routing for peer-to-peer overlays", In Proc. of NSDI, San Francisco, CA, April, 2004.
    • (2004) Proc. of NSDI
    • Gupta, A.1    Liskov, B.2    Rodrigues, R.3
  • 8
    • 2642549950 scopus 로고    scopus 로고
    • Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead
    • Berkeley, CA, Feb.
    • Gupta, I., Birman, K., Linga, P., Demers, A., van Renesse, R., "Kelips: building an efficient and stable P2P DHT through increased memory and background overhead", In Proc. of IPTPS, Berkeley, CA, Feb. 2003.
    • (2003) Proc. of IPTPS
    • Gupta, I.1    Birman, K.2    Linga, P.3    Demers, A.4    Van Renesse, R.5
  • 10
    • 33646926224 scopus 로고    scopus 로고
    • WiDS: An integrated toolkit for distributed system development
    • Santa Fe, NM, June
    • Lin, S., Pan, A., Zhang, Z., Guo, R. and Guo, Z., "WiDS: an Integrated Toolkit for Distributed System Development", In Proc of HotOS, Santa Fe, NM, June 2005.
    • (2005) Proc of HotOS
    • Lin, S.1    Pan, A.2    Zhang, Z.3    Guo, R.4    Guo, Z.5
  • 12
    • 33750963702 scopus 로고    scopus 로고
    • When multi-hop peer-to-peer lookup matters
    • San Diego, CA, USA, February
    • Rodrigues, R. and Blake, C., "When Multi-Hop Peer-to-Peer Lookup Matters", In Proc. of IPTPS, San Diego, CA, USA, February, 2004.
    • (2004) Proc. of IPTPS
    • Rodrigues, R.1    Blake, C.2
  • 13
    • 0003007594 scopus 로고    scopus 로고
    • Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
    • Heidelberg, Germany, November
    • Rowstron, A. and Druschel, P., "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems". In Proc. of ACM Middleware, Heidelberg, Germany, November, 2001.
    • (2001) Proc. of ACM Middleware
    • Rowstron, A.1    Druschel, P.2
  • 15
    • 0002245383 scopus 로고    scopus 로고
    • Chord: A scalable peer-to-peer lookup service for internet applications
    • San Diego, CA, August
    • Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., and Balakrishnan, H., "Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications", In Proc. of SIGCOMM, San Diego, CA, August 2001.
    • (2001) Proc. of SIGCOMM
    • Stoica, I.1    Morris, R.2    Karger, D.3    Kaashoek, M.F.4    Balakrishnan, H.5
  • 17
    • 0742267177 scopus 로고    scopus 로고
    • Tapestry: A resilient global-scale overlay for service deployment
    • January
    • Zhao, B. Y. et al, "Tapestry: A Resilient Global-scale Overlay for Service Deployment", IEEE Journal on Selected Areas in Communications, January 2004, Vol. 22, No. 1.
    • (2004) IEEE Journal on Selected Areas in Communications , vol.22 , Issue.1
    • Zhao, B.Y.1


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