期刊文献+

基于非结构化P2P网络资源检索的自组织研究 被引量:1

Research on self-organization based on unstructured P2P network resource searching
下载PDF
导出
摘要 通过自组织将非结构化P2P网络过渡到半结构化网络,改变传统P2P网络资源检索的盲目性,降低检索请求的响应延迟,减少检索时网络带宽的占用.针对非结构化网络的不稳定性,设计了易于管理和重构的三层自组织结构,优化检索请求在自组织结构中的传播;当节点退出网络时,采用了平稳的过渡方法,使自组织结构在重构过程中对网络的影响较小;在重构过程中根据节点的稳定程度选择管理节点,使整个网络保持相对稳定. The authors have built half-structured network from unstructured P2P network using self-organization.Compared with traditional blind searching,it depresses response delay and reduces bandwidth use.They have also designed a three-layer structure which is easy to manage and reconstruct for searching request spreading.During reconstruction,the authors use smooth transition method to depress network impact,and choose stable management node to keep network relatively stable.
出处 《大连理工大学学报》 EI CAS CSCD 北大核心 2005年第z1期253-256,共4页 Journal of Dalian University of Technology
关键词 自组织 非结构化 P2P 检索 重构 self-organization unstructured P2P searching reconstruct
  • 相关文献

参考文献6

  • 1[1]VANA K, DIMITRIOS G, D ZEINALIPOUR-Yi. A Local Search Mechanism for Peer-to-Peer Networks[A]. Conference on Information and Knowledge Management[C] . Virginia:[s.n.], 2002.
  • 2[2]BEVERLY Y, HECTOR G. Improving Search in Peer-to-Peer Networks[A]. The 22nd International Conference on Distributed Computing Systems[C]. Rhode Island:[s.n.], 2002.
  • 3[3]QIN L, PEI C. Search and Replication in Unstructured Peer-to-Peer Networks[A]. Proceedings of the 2002 International Conference on Supercomputing[C]. NY:[s.n.], 2002.
  • 4[4]DANIEL A. Menasc'e and LAVANYA K. Probabilistic Scalable P2P Resource Location Services[A]. Sigmetrics[C]. California:[s.n.], 2002.
  • 5[5]ARTURO C, HECTOR G. Routing Indices for Peer-to-Peer Systems[A]. The 22nd International Conference on Distributed Computing Systems[C]. Rhode Island:[s.n.], 2002. .
  • 6李祖鹏,黄建华,唐辉.基于P2P计算模式的自组织网络路由模型[J].软件学报,2005,16(5):916-930. 被引量:24

二级参考文献28

  • 1Dabek F, Kaashoek MF, Karger D, Morris R, Stoica I. Wide-Area cooperative storage with CFS. In: Proc. of the 18th ACM Symp.on Operating Systems Principles (SOSP 2001). Chateau Lake Louise, 2001. 344-352.
  • 2Glewin D. Consistent hashing and random trees: Algorithms for caching in distributed networks [MS. Thesis]. Department of EECS,MIT, 1998. http://thesis.mit.edu/
  • 3Karger D, Lehman E, Leighton F, Levine M, Lewin D, Panigrahy R. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In: Proc. of the 29th Annual ACM Symp. on Theory of Computing. El Paso, 1997. 654-663.
  • 4Gupta A, Liskov B, Rodrigues R. One hop lookups for peer-to-peer overlays. In: Proc. of the 9th Workshop on Hot Topics in Operating Systems (HOTOS IX). 2003.452-458.
  • 5Ratnasamy S, Shenker S, Stoica I. Routing algorithms for dhts: Some open questions. In: Proc. of the IPTPS02. Cambridge, 2002.http://www. cs.rice.edu/Conferences/IPTPS02/
  • 6Zegura E, Calvert KL, Bhattacharjee S. How to model an internetwork. In: Sohraby K, ed. Proc. of the IEEE Infocom'96. San Francisco: IEEE Computer Society Press, 1996. 594-602.
  • 7Lv Q, Cao P, Cohen E, Li K, Shenker S. Search and replication in unstructured peer-to-peer networks. In: Proc. of the 16th ACM Int'l Conf. on Supercomputing (ICS 2002). 2002. 254-261.
  • 8Maymounkov P, Mazieres D. Kademlia: A peer-to-peer information system based on the XOR metric. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems (IPTPS 2002). 2002. 153-161.
  • 9Weatherspoon H, Kubiatowicz J. Efficient heartbeats and repair of softstate in decentralized object location and routing systems. In:Proc. of the ACM SIGOPS European Workshop 2002. 2002.231-238.
  • 10Mahajan R, Castro M, Rowston A. Controlling the cost of reliability in peer-to-peer overlays. In: Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems (IPTPS 2003). 2003. 368-374.

共引文献23

同被引文献6

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部