Distributed, compressed Bloom filter Web cache server

Details Distributed, compressed Bloom filter Web cache server Distributed, compressed Bloom filter Web cache server

2005-07-19

2005-07-19

Knight, Anthony (Department: 2121)

Electrical computers and digital processing systems: multicomput

Distributed data processing

Client/server

C709S214000, C709S216000, C709S218000, C709S246000, C707S793000, C711S118000, C711S113000

Reexamination Certificate

active

06920477

ABSTRACT:
Compressed Bloom filters that act as a message as well as a data structure provide smaller false positive rates, reduced bits broadcast and/or reduced computational overhead in distributed Web proxy servers and other distributed networks.

REFERENCES:
patent: 4882754 (1989-11-01), Weaver et al.
patent: 5394471 (1995-02-01), Ganesan et al.
patent: 5649183 (1997-07-01), Berkowitz et al.
patent: 5701464 (1997-12-01), Aucsmith
patent: 5737747 (1998-04-01), Vishlitzky et al.
patent: 5813000 (1998-09-01), Furlani
patent: 5832479 (1998-11-01), Berkowitz et al.
patent: 5864854 (1999-01-01), Boyle
patent: 5946692 (1999-08-01), Faloutsos et al.
patent: 5953503 (1999-09-01), Mitzenmacher et al.
patent: 5995961 (1999-11-01), Levy et al.
patent: 6032144 (2000-02-01), Srivastava et al.
patent: 6052120 (2000-04-01), Nahi et al.
patent: 6058416 (2000-05-01), Mukherjee et al.
patent: 6061676 (2000-05-01), Srivastava et al.
patent: 6073160 (2000-06-01), Grantham et al.
patent: 6105020 (2000-08-01), Lindsay et al.
patent: 6112279 (2000-08-01), Wang
patent: 6134551 (2000-10-01), Aucsmith
patent: 6182111 (2001-01-01), Inohara et al.
patent: 6829654 (2004-12-01), Jungck
Fan et al. “Summary Cache: a Scalable Wide-area Web Cache Sharing Protocol,” Proceedings of SIGCOMM '98, (1998: pp. 254-265).
Bloom, “Space/time Trade-offs in Hash Coding with Allowable Errors,” Communication of the ACM (1970, 13 (7): pp. 422-426).
Carter et al. “Universal Classes of Hash Functions,” Journal of Computer and System Sciences, (1979: pp. 143-154).
Ramakrishna, “Practical Performance of Bloom Filters and Parallel Free-text Searching,” Communications of the ACM (1989, 32 (10): pp. 1237-1239).
Moffat et al., “Arithmetic Coding Revisited,” ACM Transactions on Information Systems, (1998, 16(3): pp. 256-294).
Witten et al., Managing Gigabytes, (1999: pp. 35-41).
Pai-Hsiang Hsiao, “Geographical Region Summary Service for Geographical Routing” (2000, submitted to Mobicom 2001).

Affiliated with

Also associated with

Rating

Distributed, compressed Bloom filter Web cache server does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Distributed, compressed Bloom filter Web cache server, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed, compressed Bloom filter Web cache server will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3403988