Scaling Filename Queries in a Large-Scale Distributed File System

Scaling Filename Queries in a Large-Scale Distributed File System (2002)

Cached

Download Links

by Jonathan Ledlie Laura , Laura Serban , Dafina Toncheva

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Scaling Filename Queries in a Large-Scale Distributed File System	user correction - Legacy Corrections
AUTHOR NAME	Jonathan Ledlie Laura	user correction - Legacy Corrections
AUTHOR NAME	Laura Serban	user correction - Legacy Corrections
AUTHOR NAME	Dafina Toncheva	user correction - Legacy Corrections
ABSTRACT	We have examined the tradeoffs in applying regular and Compressed Bloom filters to the name query problem in distributed file systems and developed and tested a novel mechanism for scaling queries as the network grows large. Filters greatly reduced query messages when using Fan's "Summary Cache" in web cache hierarchies[6], a similar albeit smaller, searching problem. We have implemented a testbed that models a distributed file system and run experiments that test various configurations of the system to see if Bloom filters could provide the same kind of improvements. In a realistic system, where the chance that a randomly queried node holds the file being searched for is low, we show that filters always provide lower bandwidth /search and faster time/search, as long as the rates of change of the files stored at the nodes is not extremely high relative to the number of searches. In other words, we confirm the intuition that keeping some state about the contents of the rest of the system will aid in searching as long as acquiring this state is not overly costly and it does not expire too quickly.	user correction - Legacy Corrections
YEAR	2002	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
TECH	Research Report TR-03-02	INFERENCE
CITATIONS	21 found	ParsCit 1.0