메뉴 건너뛰기




Volumn , Issue , 2006, Pages 22-31

Rumor riding: Anonymizing unstructured peer-to-peer systems

Author keywords

Mutual anonymity; Non path based; P2P

Indexed keywords

(R ,S)-SYMMETRIC; EXPERIMENTAL RESULTS; HEAVY LOADS; INTERNATIONAL CONFERENCES; P2P SYSTEMS; PATH CONSTRUCTION; PEER-TO-PEER (P2P) SYSTEMS; RANDOM WALK (RW); TRACE-DRIVEN SIMULATIONS; TRANSFER EFFICIENCY (TE); UNSTRUCTURED PEER-TO-PEER;

EID: 46149086782     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2006.320195     Document Type: Conference Paper
Times cited : (34)

References (24)
  • 1
    • 0019532104 scopus 로고
    • Untraceable electronic mail return addresses, and digital pseudonyms
    • D. Chaum, "Untraceable electronic mail return addresses, and digital pseudonyms", Communications of the ACM, 1981.
    • (1981) Communications of the ACM
    • Chaum, D.1
  • 11
  • 19
    • 33749389215 scopus 로고    scopus 로고
    • Modeling and analysis of random walk search algorithms in P2P networks
    • N. Bisnik and A. Abouzeid, "Modeling and analysis of random walk search algorithms in P2P networks", In Proceedings of HOT-P2P, 2005.
    • (2005) Proceedings of HOT-P2P
    • Bisnik, N.1    Abouzeid, A.2
  • 20


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