P2P directory search: Signature array hash table

Proceedings - Conference on Local Computer Networks, LCN

Volumn , Issue , 2008, Pages 506-508

  Jimeno, Miguel ^a   Christensen, Ken ^a  

^a University of South Florida   (United States)

Author keywords

Bloom filter; P2P; Signature array hash list

Indexed keywords

COMPUTER NETWORKS; COMPUTERS; DATA STRUCTURES; FILE ORGANIZATION; INTERNET;

APPROXIMATE SETS; BLOOM FILTER; ELEMENT TESTING; ELEMENT TESTS; FALSE POSITIVE RATES; HASH TABLES; MEMORY ACCESSES; P2P; SIGNATURE ARRAY HASH LIST;

BLOOMS (METAL);

EID: 58049114856     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LCN.2008.4664213     Document Type: Conference Paper

References (5)

1. A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters: A Survey," Internet Mathematics, Vol. 1, No. 4, pp. 485-509, 2005.
2. L. Fan, P. Cao, J. Almeida, and A. Broder, "Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol," IEEE/ACM Transactions on Networking, Vol. 8, No. 3, pp. 281-293, June 2000.
3. M. Jimeno and K. Christensen, "A Prototype Power Management Proxy for Gnutella Peer-to-Peer File Sharing," Proceedings of the IEEE Conference on Local Computer Networks, pp. 210-212, October 2007.
4. A. Kirsch and M. Mitzenmacher, "Less Hashing, Same Performance: Building a Better Bloom Filter," Lecture Notes In Computer Science; Vol. 4168, pp. 456-467, 2006.
5. J. Komlós and E. Szemerédi, "Storing a Sparse Table with O(1) Worst Case Access Time," Journal of the ACM, Vol. 31, No. 3, pp. 538-544, July 1984.