메뉴 건너뛰기




Volumn 15, Issue 3, 2007, Pages 335-354

Enhanced DHT-based P2P architecture for effective resource discovery and management

Author keywords

Complex queries; Distributed hash tables; Load balancing; Peer to Peer systems; Resource localization; Service discovery

Indexed keywords

COMPLEX QUERIES; DISTRIBUTED HASH TABLES; PEER-TO-PEER SYSTEMS; RESOURCE LOCALIZATION; SERVICE DISCOVERY;

EID: 34547498802     PISSN: 10647570     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10922-007-9067-8     Document Type: Article
Times cited : (18)

References (24)
  • 1
    • 84864177728 scopus 로고    scopus 로고
    • Gnutella, http://www.gnutella.wego.com/
  • 2
    • 2442421260 scopus 로고    scopus 로고
    • A peer-to-peer information system based the XOR metric
    • Cambridge, MA, USA
    • Meymounkov, P., Mazieres, D.: Kademilia: A peer-to-peer information system based the XOR metric. In: Proceedings of the 1st IPTPS, pp. 7-8. Cambridge, MA, USA (2002)
    • (2002) Proceedings of the 1st IPTPS , pp. 7-8
    • Meymounkov, P.1    Mazieres, D.2    Kademilia3
  • 4
  • 6
    • 25844481024 scopus 로고    scopus 로고
    • A performance vs. cost framework for evaluating DHT design tradeoffs under churn
    • Miami, FL, USA
    • Li, J., Stribling, J., Kaashoek, F., Morris, R., Gil, T.: A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In: Proceedings of IEEE INFOCOM 2005, pp. 13-17. Miami, FL, USA (2005)
    • (2005) Proceedings of IEEE INFOCOM 2005 , pp. 13-17
    • Li, J.1    Stribling, J.2    Kaashoek, F.3    Morris, R.4    Gil, T.5
  • 8
    • 0003007594 scopus 로고    scopus 로고
    • Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems
    • Heidelberg, Germany
    • Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems. In: Proceedings of ACM/IFIP Middleware 2001, pp. 12-16. Heidelberg, Germany (2001)
    • (2001) Proceedings of ACM/IFIP Middleware 2001 , pp. 12-16
    • Rowstron, A.1    Druschel, P.2
  • 11
    • 33646067648 scopus 로고    scopus 로고
    • Making peer-to-peer searching feasible using multi-level partitioning
    • San Diego, CA, USA
    • Shi, S., Yang, G., Wang, D., Yu, J., Qu, S.: Making peer-to-peer searching feasible using multi-level partitioning. In: Proceedings of the 3rd IPTPS, pp. 26-27. San Diego, CA, USA (2004)
    • (2004) Proceedings of the 3rd IPTPS , pp. 26-27
    • Shi, S.1    Yang, G.2    Wang, D.3    Yu, J.4    Qu, S.5
  • 12
    • 2442450698 scopus 로고    scopus 로고
    • On the feasibility of peer-to-peer web indexing and search
    • Berkeley, CA, USA
    • Li, J., Loo, B.T.: On the feasibility of peer-to-peer web indexing and search. In: Proceedings of the 2nd IPTPS, pp. 20-21. Berkeley, CA, USA (2003)
    • (2003) Proceedings of the 2nd IPTPS , pp. 20-21
    • Li, J.1    Loo, B.T.2
  • 13
    • 3142728016 scopus 로고    scopus 로고
    • Efficient semantic-based content search in P2P network
    • Tao Shen, H., Shu, Y., Yu, B.: Efficient Semantic-Based Content Search in P2P Network. IEEE T. Knowledge Data Eng. 7, 813-826 (2004)
    • (2004) IEEE T. Knowledge Data Eng. , vol.7 , pp. 813-826
    • Shen, H.T.1    Shu, Y.2    Yu, B.3
  • 16
    • 8344261691 scopus 로고    scopus 로고
    • Simple load balancing for distributed hash tables
    • Berkeley, CA, USA
    • Byers, J., Considine, J., Mitzenmacher.: Simple load balancing for distributed hash tables. In: Proceedings of the 2nd IPTPS, pp. 20-21. Berkeley, CA, USA (2003)
    • (2003) Proceedings of the 2nd IPTPS , pp. 20-21
    • Byers, J.1    Considine, J.2    Mitzenmacher3
  • 17
    • 0003629991 scopus 로고
    • FIPS 180-1 U.S. Department of Commerce/NIST, Springfield, VA, April
    • FIPS 180-1.: Secure hash standard. U.S. Department of Commerce/NIST, Springfield, VA, April (1995)
    • (1995) Secure Hash Standard
  • 19
    • 84864173988 scopus 로고    scopus 로고
    • p2psim
    • p2psim, http://pdos.lcs.mit.edu/p2psim/
  • 20
    • 33646711258 scopus 로고    scopus 로고
    • High availability in DHTs: Erasure coding vs. replication
    • Ithaca, NY, USA
    • Rodrigues, R., Liskov, B.: High availability in DHTs: erasure coding vs. replication. In: Proceedings of the 4th IPTPS, pp. 24-25. Ithaca, NY, USA (2005)
    • (2005) Proceedings of the 4th IPTPS , pp. 24-25
    • Rodrigues, R.1    Liskov, B.2
  • 21
  • 23
    • 34247377421 scopus 로고    scopus 로고
    • Distributed segment tree: Support of range query and cover query over DHT
    • Santa Barbara, USA
    • Zheng, C., Shen, G., Li, S., Shenker, S.: Distributed segment tree: support of range query and cover query over DHT. In: Proceedings of the 5th IPTPS, pp. 27-28. Santa Barbara, USA (2006)
    • (2006) Proceedings of the 5th IPTPS , pp. 27-28
    • Zheng, C.1    Shen, G.2    Li, S.3    Shenker, S.4
  • 24
    • 39049156961 scopus 로고    scopus 로고
    • Performance of full text search in structured and unstructured peer-to-peer systems
    • Barcelona, Spain
    • Yang, Y., Dunlap, R., Rexroad, M., Cooper, B.: Performance of full text search in structured and unstructured peer-to-peer systems. In: Proceedings of IEEE INFOCOM 2006, pp. 23-29. Barcelona, Spain (2006)
    • (2006) Proceedings of IEEE INFOCOM 2006 , pp. 23-29
    • Yang, Y.1    Dunlap, R.2    Rexroad, M.3    Cooper, B.4


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