Probabilistic location and routing
Proceedings - IEEE INFOCOM - Tập 3 - Trang 1248-1257 vol.3
Tóm tắt
We propose probabilistic location to enhance the performance of existing peer-to-peer location mechanisms in the case where a replica for the queried data item exists close to the query source. We introduce the attenuated Bloom filter, a lossy distributed index data structure. We describe how to use these data structures for document location and how to maintain them despite document motion. We include a detailed performance study which indicates that our algorithm performs as desired, both finding closer replicas and finding them faster than deterministic algorithms alone.
Từ khóa
#Routing #Network servers #Filters #Availability #Peer to peer computing #Data structures #Bandwidth #Proposals #Scalability #Query processingTài liệu tham khảo
dahlin, 0, Cooperative caching: Using remote client memory to improve file system performance, Proc of USENIX Symp on OSDI Nov 1994
10.1016/S0169-7552(98)00251-7
barford, 0, Generating representative web work-loads for network and server performance evaluation, Proc of Sigmetrics 1988
10.1145/313451.313462
10.1145/170035.170081
10.1093/comjnl/41.5.297
plaxton, 0, Accessing nearby copies of replicated objects in a distributed environment, Proc of ACM SPAA June 1997
zegura, 0, How to model an internet-work, Proc of INFOCOMM 1996
10.1145/52324.52338
10.1109/71.205652
10.1145/362686.362692
fan, 0, Summary cache: A scalable wide-area web cache sharing protocol, Proc of ACM SIGCOMM Conf Sept 1998, 254
10.1109/ICDE.1998.655801
10.1145/313238.313249
mackert, 0, R* optimizer validation and performance evaluation for distributed queries, Proc of Intl Conf on VLDB August 1986
clark, 0, Freenet: A distributed anonymous information storage and retrieval system, Proc of the Workshop on Design Issues in Anonymity and Unobservability Berkeley CA July 2000, 311
10.1145/339331.339345
zhao, 2001, Tapestry: An infrastructure for fault-tolerant wide-area location and routing
10.1145/383059.383072
10.1109/HOTOS.2001.990064
10.1145/502051.502054
10.1145/378993.379239
druschel, 0, Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility, Proc of ACM SOSP 2001
stoica, 0, Chord: A scalable peer-to-peer lookup service for internet applications, Proceedings of SIGCOMM ACM August 2001