메뉴 건너뛰기




Volumn , Issue , 2008, Pages 71-76

Efficient semantic based search in unstructured peer-to-peer networks

Author keywords

[No Author keywords available]

Indexed keywords

ALPHA PARTICLE SPECTROMETERS; ASSET MANAGEMENT; CANNING; INFORMATION THEORY; INTERNET; LEARNING ALGORITHMS; ONTOLOGY; PARTICLE SPECTROMETERS; ROUTING ALGORITHMS; SEMANTICS; TELECOMMUNICATION NETWORKS;

EID: 50249104462     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AMS.2008.138     Document Type: Conference Paper
Times cited : (6)

References (11)
  • 1
    • 0037728316 scopus 로고    scopus 로고
    • Efficient search in peer-to-peer networks
    • B. Yang, H., Garcia-Molina, Efficient search in peer-to-peer networks. In: Proc. ICDCS, 2002
    • (2002) Proc. ICDCS
    • Yang, B.1    Garcia-Molina, H.2
  • 3
    • 33748551294 scopus 로고    scopus 로고
    • Survey of research towards robust peer-to-peer networks:, Elsevier
    • J. Risson , T. Moors, Survey of research towards robust peer-to-peer networks: Search methods, Computer Networks, Elsevier, volume 50, 2006, pp. 3485-3521.
    • (2006) Search methods, Computer Networks , vol.50 , pp. 3485-3521
    • Risson, J.1    Moors, T.2
  • 5
    • 33749603123 scopus 로고    scopus 로고
    • Hypercup shaping up peer-to-peer networks
    • Technical report, Stanford University
    • Schlosser, M., Sintek, M., Decker, S., Nejdl, W., Hypercup shaping up peer-to-peer networks. Technical report, Stanford University, 2001.
    • (2001)
    • Schlosser, M.1    Sintek, M.2    Decker, S.3    Nejdl, W.4
  • 6
    • 0002245383 scopus 로고    scopus 로고
    • Chord: A scalable P2P lookup service for internet applications
    • Stoica, I., et al., Chord: A scalable P2P lookup service for internet applications. In: Proc. ACM SIGCOMM'01, 2001.
    • (2001) Proc. ACM SIGCOMM'01
    • Stoica, I.1
  • 7
    • 0026971891 scopus 로고
    • Computing least common sub-sumer in description logics
    • Swartout, W, ed, San Jose, CA, MIT, MIT Press
    • Cohen, W., Borgida, A., Hirsh, H., Computing least common sub-sumer in description logics. In Swartout, W., ed.: Proc. AAAI92'92, San Jose, CA, MIT, MIT Press, 754-760, 1992.
    • (1992) Proc. AAAI92'92 , pp. 754-760
    • Cohen, W.1    Borgida, A.2    Hirsh, H.3
  • 8
    • 24644442325 scopus 로고    scopus 로고
    • Planetsim: A new overlay network simulation framework
    • SEM
    • Garca, P., Pairot, C., Mondjar, R., Pujol, J., Tejedor, H., Rallo, R.: Planetsim: A new overlay network simulation framework. In: SEM 2004, Springer LNCS. Volume 3437. (2005) 123-137.
    • (2004) Springer LNCS , vol.3437 , pp. 123-137
    • Garca, P.1    Pairot, C.2    Mondjar, R.3    Pujol, J.4    Tejedor, H.5    Rallo, R.6
  • 9
    • 0038742218 scopus 로고    scopus 로고
    • Mapping the Gnutella Network -Macroscopic Properties of Large-scale P2P Networks and Implications for System Design
    • M. Ripeanu and I. Foster. Mapping the Gnutella Network -Macroscopic Properties of Large-scale P2P Networks and Implications for System Design. In Internet Computing Journal 6(1), 2002.
    • (2002) Internet Computing Journal , vol.6 , Issue.1
    • Ripeanu, M.1    Foster, I.2


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