[1] Stoica I, Morris R, Liben-Nowell D, et al. A Scalable Peer-to-Peer Lookup Protocol for Internet Applications[J]. IEEE/ACM Trans. on Networking, 2003, 11(1): 17-32.
[2] Ratnasamy S, Francis P, Handley M, et al. A Scalable Content- addressable Network[J]. Computer Communication Review, 2001, 31(4): 161-172.
[3] Maymounkov P, Mazi`eres D. Kademlia: A Peer-to-Peer Infor- mation System Based on the XOR Metric[C]//Proc. of IPTPS’02. Cambridge, MA, USA: [s. n.], 2002.
[4] Rowstron A, Druschel P. Pastry: Scalable, Decentralized Object Location and Routing for Large-scale Peer-to-peer Systems[C]// Proc. of the 18th IFIP/ACM International Conf. on Distributed Systems Platforms. Heidelberg, Germany: Springer-Verlag, 2001.
[5] Zhao Ben Y, Kubiatowicz J, Joseph A. Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing[R]. Berkeley, CA, USA: University of California, Berkeley, Tech. Rep.: UCB/ CSD-01-1141, 2001.
[6] Malkhi D, Maor M, Ratajczak D. Viceroy: A Scalable and Dyna- mic Emulation of Butterfly[C]//Proc. of the 21st Annual Symp. on Principles of Distributed Computing. New York, USA: ACM Press, 2002.
[7] Shen Haiying, Xu Chengzhong, Chen Guihai. Cycloid: A Cons- tant-degree and Lookup-efficient P2P Overlay Network[C]// Proc. of IPDPS’04. New York, USA: IEEE Press, 2004.
[8] Ratnasamy S, Shenker S, Stoica I. Routing Algorithms for DHTs: Some Open Questions[C]//Proc. of IPTPS’02. Cambridge, USA: [s. n.], 2002.
[9] Castro M, Druschel P, Hu Y C, et al. Exploiting Network Proxi- mity in Distributed Hash Tables[C]//Proc. of International Workshop on Future Directions in Distributed Computing. Bologna, Italy: [s. n.], 2002.
[10] Ng T S E. Zhang Hui. Towards Global Network Posi- tioning[C]//Proc. of ACM SIGCOMM Internet Measurement Workshop. San Francisco, USA: [s. n.], 2001.
[11] Ratnasamy S, Handley M, Karp R, et al. Topologically-aware Overlay Construction and Server Selection[C]//Proc. of IEEE INFOCOM’02. New York, USA: IEEE Press, 2002.
[12] Ren Shansi, Guo Lei, Jiang Song, et al. SAT-Match: A Self-adaptive Topology Matching Method to Achieve Low Lookup Latency in Structured P2P Overlay Networks[C]//Proceedings of IPDPS’04. New York, USA: IEEE Press, 2004.
[13] 邱彤庆, 陈贵海. 一种令P2P覆盖网络拓扑相关的通用方法[J]. 软件学报, 2007, 18(2): 381-390.
[14] 肖卓程, 荆金华. 层次式Chord: 物理拓扑感知的结构化对等 网[J]. 计算机科学, 2006, 33(7): 7-8.
[15] 梁礼斌, 张 军, 罗喜伶. 一种基于位置信息的P2P路由算 法[J]. 计算机工程与设计, 2005, 26(9): 2308-2311.
[16] 陈春华. 结构化P2P 系统中覆盖图拓扑匹配的研究[J]. 计算机工程, 2006, 32(21): 121-123.
[17] 李振宇, 谢高岗, 闵应骅, 等. 一种结构化P2P 系统的拓扑匹配算法[J]. 系统仿真学报, 2006, 18(5): 1181-1185.
[18] 王文方, 马文辉, 刘 璟. 基于分组随机广播的单跳DHT算 法[J]. 计算机工程, 2008, 34(13): 4-6. |