ePrints

Using bloom filters to speed-up name lookup in distributed systems

Lookup NU author(s): Professor Mark Little, Emeritus Professor Santosh Shrivastava, Dr Neil Speirs

Downloads

• Accepted version [.pdf]

Abstract

Bloom filters make use of a 'Probabilistic' hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its size and the probability that the filter returns the wrong result. It does this without storing the entire set, at the cost of occasionally incorrectly answering yes to the question 'Is x a member of s?'. How Bloom filters can be used to speed up the name to location resolution process in large-scale distributed systems is discussed. The approach presented offers trade-offs between performance (the time taken to resolve an object's name to its location) and resource utilization (the amount of physical memory to store location information and the number of messages exchanged to obtain the object's address).

Publication metadata

Author(s): Little MC, Shrivastava SK, Speirs NA

Publication type: Article

Publication status: Published

Journal: Computer Journal

Year: 2002

Volume: 45

Issue: 6

Pages: 645-652

Print publication date: 01/01/2002

Date deposited: 09/02/2011

ISSN (print): 00104620

ISSN (electronic): 1460-2067

Publisher: Oxford University Press

URL: http://dx.doi.org/10.1093/comjnl/45.6.645

DOI: 10.1093/comjnl/45.6.645

Altmetrics

Share