期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

超节点结构P2P中负载均衡的信息索引机制 被引量：2

The Information Index Mechanism for Load Balancing in P2P Based on Super-Nodes
在线阅读 下载PDF
导出
摘要 本文首先介绍超节点结构P2P网络的原理,指出其存在负载失衡问题。针对其存在的问题引入信息索引机制IIM,把资源的信息索引分布到多个超节点。通过仿真实验表明,IIM能够在相对不降低搜索效率的前提下,使得各超节点的资源信息相对均衡,有效地解决了超节点结构P2P网络中超节点负载不均衡的问题。 The paper firstly introduces the principle of the P2P network based on super-nodes and points out that there are problems such as load unbalance. This paper proposes an information index mechanism called IIM to solve this problem, which makes the resource index information be distributed to multi-super nodes. The simulations indicate that IIM makes the resource index information in super-nodes balancing while the search efficiency is not affected. So IIM effectively solves the load unbalance problem in the P2P network based on super-nodes.
作者 汪永琳
机构地区 湖南文理学院计算机学院
出处 《计算机工程与科学》 CSCD 北大核心 2009年第8期107-109,139,共4页 Computer Engineering & Science
关键词 P2P 超节点 信息索引 负载均衡 P2P super-node information index load balancing
分类号 TP391 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献6

  • 1Yang B, Garcia-Molina H. Designing a Super-Peer Network [C]//Proc of the 19 th Int' l Conf on Data Engineering, 2003 49-60.
  • 2Jan S, Jim D, Raymond C, et al. Using Aggregation for Adaptive Super-Peer Discovery on the Gradient Topology[C] //Proc of SelfMan'06,2006 : 77-90.
  • 3Yang B, Gareia-Molina H. Designing a Super-Peer Network [C]//Proc of Int'l Conf on Data Engineering, 2003:49-60.
  • 4http://it. hexun. com/2009-05-15/117721363. html, 2009.
  • 5Zegura E W, Calvert K L, Bhattacharjee. How to Model an Intemetwork[C]//Proc of the IEEE INFOCOM' 96, 1996: 594-602.
  • 6邱彤庆,陈贵海.一种令P2P覆盖网络拓扑相关的通用方法[J].软件学报,2007,18(2):381-390. 被引量：41

二级参考文献18

  • 1Ratnasamy S,Francis P,Handley M,Karp R,Shenker S.A scalable content-addressable network.In:Govindan R,ed.Proc.of the ACM SIGCOMM.New York:ACM Press,2001.161-172.
  • 2Stoica I,Morris R,Karger D,Kaashoek MF,Balakrishnan H.Chord:A scalable peer-to-peer lookup protocol for Internet applications.In:Govindan R,ed.Proc.of the ACM SIGCOMM.New York:ACM Press,2001.149-160.
  • 3Rowstron A,Druschel P.Pastry:Scalable,decentralized object location and routing for large-scale peer-to-peer systems.In:Guerraoui R,ed.Proc.of the 18th IFIP/ACM Int'l Conf.on Distributed Systems Platforms (Middleware 2001).Heidelberg:Springer-Verlag,2001.329-350.
  • 4Zhao BY,Huang L,Stribling J,Rhea SC,Joseph AD,Kubiatowicz J.Tapestry:A resilient global-scale overlay for service deployment.IEEE Journal on Selected Areas in Communications,2004,22(1):41-53.
  • 5Malkhi D,Maor M,Ratajczak D.Viceroy:A scalable and dynamic emulation of butterfly.In:Ricciardi A,ed.Proc.of the 21st Annual Symp.on Principles of Distributed Computing.New York:ACM Press,2002.182-192.
  • 6Shen HY,Xu CZ,Ghen G.Cycloid:A constant-degree and lookup-efficient P2P overlay network.In:Panda DK,Duato J,Stunkel C,eds.Proc.of the 18th Int'l Parallel and Distributed Processing Symp.(IPDPS 2004).New York:IEEE Press,2004.26-30.
  • 7Xu Z,Tang C,Zhang Z.Building topology-aware overlays using global soft-state.In:Panda DK,Duato J,Stunkel C,eds.Proc.of the 23rd Int'l Conf.on Distributed Computing Systems (ICDCS 2003).New York:IEEE Press,2003.500-508.
  • 8Ratnasamy S,Handley M,Karp R,Shenker S.Topologically-Aware overlay construction and server selection.In:Proc.of the IEEE INFOCOM.New York:IEEE Press,2002.1190-1199.
  • 9Winter R,Zahn T,Schiller J.Random land-marking in mobile,topology-aware peer-to-peer networks.In:Proc.of the 10th IEEE Int'l Workshop on Future Trends of Distributed Computing Systems (FTDCS 2004).New York:IEEE Press,2004.319-324.
  • 10Ratnasamy S,Shenker S,Stoica I.Routing algorithms for DHTs:some open questions.In:Druschel P,ed.Proc.of the 1st Int'l Workshop on P2P Systems (IPTPS 2002).Berlin:Springer-Verlag,2002.45-52.

共引文献40

同被引文献17

  • 1余敏,李战怀,张龙波.基于super-peer的连续查询策略[J].计算机工程与应用,2006,42(1):9-12. 被引量：4
  • 2邱彤庆,陈贵海.一种令P2P覆盖网络拓扑相关的通用方法[J].软件学报,2007,18(2):381-390. 被引量：41
  • 3Thomas HC,Charies EL,Ronald LR,等.算法导论[M].潘金贵,顾铁成,李成法,等译.北京:机械工业出版社,2006:344-380.
  • 4严蔚敏 吴伟民.数据结构[M].北京：清华大学出版社,1997..
  • 5Saroiu S, Gummadi P K, Gribble S D. A measurement study of peer-to-peer file sharing systems [C]// Proceedings of the Multi- media Computing and Networking. San Jose, USA: IEEE Com- puter Society Press, 2002: 156-170.
  • 6Krishnamurthy S, EI-Ansary S, Aurell E, et al. An analytical study of a structured overlay in the presence of dynamic member- ship [J]. IEEE Transactions on Networking, 2008, 16(4): 814-825.
  • 7Joung Y J, Wang J C. Chord2: A two-layer chord for reducing maintenance overhead via heterogeneity [J]. Computer Networks, 2007, 51(3): 712-731.
  • 8Stoica I, Morris R, Karger D, et al. Chord: A scalable peer-to- peer lookup service for interact applications [C]// Proceedings of the ACM SIGCOMM. San Diego, USA: IEEE Computer Soci- ety Press, 2001: 149-160.
  • 9Zoels S, Despotovic Z, Kellerer W. Load balancing in a hierar- chical DHT-based P2P system [C] // Proceedings of the Interna- tional Conference on Collaborative Computing: Networking, Ap- plications and Worksharing. New York, USA: IEEE Computer Society Press, 2007: 353-361.
  • 10Li Yajun, Yang Yuhang, Ma Maode, et al. A hybridload balancing strategy of sequential tasks for compu- tational grids [-J:. Future Generation Computer Sys- tems, 2009,25 (8) : 819-828.

引证文献2

二级引证文献5

计算机工程与科学
2009年 第8期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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