出典: フリー百科事典『ウィキペディア(Wikipedia)』 (2020/01/20 14:18 UTC 版)
関連項目
参考文献
- Sylvia Ratnasamy; Paul Francis, Mark Handley, Richard Karp, Scott Schenker (2001). “A scalable content-addressable network”. Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications (New York, NY, USA: ACM Press): 161 - 172. doi:10.1145/383059.383072.
- Ion Stoica; Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan (2001). “Chord: A scalable peer-to-peer lookup service for internet applications”. ACM SIGCOMM Computer Communication Review (New York, NY, USA: ACM Press) 31 (4): 149 - 160. doi:10.1145/964723.383071.
- Antony Rowstron; Peter Druschel (2001). Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science. 2218/2001. Springer Berlin. pp. 329. http://cmt.research.microsoft.com/~antr/PAST/pastry.pdf.
- Ben Y. Zhao; John D. Kubiatowicz, Anthony D. Joseph (2001). “Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing”. Technical Report: CSD-01-1141 (Berkeley, CA, USA: University of California at Berkeley).
外部リンク