Overlook: scalable name service on an overlay network
Tóm tắt
This paper indicates that a scalable fault-tolerant name service can be provided utilizing an overlay network and that such a name service can scale along a number of dimensions: it can be sized to support a large number of clients, it can allow large numbers of concurrent lookups on the same name or sets of names, and it can provide name lookup latencies measured in seconds. Furthermore, it can enable updates to be made pervasively visible in times typically measured in seconds for update rates of up to hundreds per second. We explain how many of these scaling properties for the name service are obtained by reusing some of the same mechanisms that allowed the underlying overlay network to scale. Finally, we observe that the overlay network is sensitive to bandwidth and CPU limitations.
Từ khóa
#Peer to peer computing #Routing #Web and internet services #Scalability #Adaptive systems #Fault tolerant systems #Delay #Size measurement #Mechanical factors #BandwidthTài liệu tham khảo
10.1145/505202.505223
10.1145/378993.379239
10.1145/10590.10591
10.17487/rfc0882
10.17487/rfc0883
10.1145/383059.383072
ratnasamy, 2001, Application-level Multicast using Content-Addressable Networks, Proc Third Int l Workshop Networked Group Comm, 10.1007/3-540-45546-9_2
10.1145/502034.502053
rowstron, 2001, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, Proceedings of IFIP/ACM Middleware 2001, 10.1007/3-540-45518-3_18
rowstron, 2001, Scribe: The design of a large-scale event notification infrastructure, Proc Third Int l Workshop Networked Group Comm, 10.1007/3-540-45546-9_3
castro, 2001, Scribe: A large-scale and decentralized publish-subscribe infrastructure, submitted for publication
10.1109/HOTOS.2001.990066
clarke, 2001, Freenet: A Distributed Anonymous Information Storage and Retrieval System, Designing Privacy Enhancing Technologies International Workshop on Design Issues in Anonymity and Unobservability LNCS 2009
yang-hua, 2000, A Case for End System Multicast, Proceedings of ACM SIGMET-RICS, 1
2000, The Inktomi Overlay Solution for Streaming Media Broad-casts Technical Report
frank, 2001, Wide-area cooperative storage with CFS., Proceedings of the 18th ACM symposium on Operating systems principles
10.1145/2080.2081
john, 2000, Overcast: Reliable Multicasting with an Overlay Network, Proceedings of the Fourth Symposium on Operating Systems Design and Implementation, 197
stefan, 2002, A Measurement Study of Peer-to-Peer File Sharing Systems, Proceedings of Multimedia Computing and Networking 2002
10.1145/383059.383071
savetz, 1996, MBone Multicasting Tomorrow s Internet
zhao, 2001, Tapestry An infrastructure for fault-tolerant wide-area location and routing
zegura, 1996, and Samrat Bhat-tacharjee. How to Model an Internetwork, Proceedings of IEEE INFOCOM '96, 10.1109/INFCOM.1996.493353
10.1145/378344.378347