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

一种解决P2P网络路由热点问题的策略 被引量：4

Strategy for problem of rooting hotspot in P2P network
下载PDF
导出
摘要 提出了一种新的解决P2P网络路由热点问题的方法,它包括复制点选取策略和副本使用策略。复制点选取策略以节点的邻居节点为复制点选取对象,按照迭代算法,选取邻居节点中在线时间长、带宽大、网络延迟小的点作为放置副本复制点;副本使用策略提出一种重定向算法对热点进行流控,使得节点不会过载,副本被高效使用。实验采用Java语言模拟整个策略,实验结果表明该方法具有高效性,可靠性,值得在目前的P2P网络中加以推广。 This paper proposed a new method to solve the problem of rooting hotspot.It includes the duplication selection strategy and the duplicate-using strategy.The duplication selection strategy takes the neighbor node as the duplication selection object and caculates the node performance appraisal functional value according to the node performance appraisal functional,then selects the nodes that with long on-line time,spacious belt,short network delay from the neighbor node according to the iterfftion algorithm. The duplicate-using strategy proposes a redirection algorithm to control the flow so as that the point will not over loading and the duplication be effectively used.The experiment uses the Java language to simulation the entire strategy.The experimental result indicated this method is effective,reliable,and is worth to promote in the present P2P network.
作者 刘柯萍 危韧勇 谷科
机构地区 中南大学信息科学与工程学院
出处 《计算机工程与应用》 CSCD 北大核心 2007年第6期108-111,164,共5页 Computer Engineering and Applications
基金 国家自然科学基金(the National Natural Science Foundation of China under Grant No.50405034) 湖南省自然科学基金(the NaturalScience Foundation of Hunan Province of China under Grant No.03JJY3111)。
关键词 路由热点 复制 重定向 P2P rooting hotspot replicate redirection P2P
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献5

  • 1Ratnasamy S,Shenker S,Stoica I.Routing algorithms for DHTs:some open questions[C]//Proceedings for the 1st International Workshop on Peer-to-Peer Systems (IPTPS'02),Cambridge,MA,USA,2002.
  • 2Zheng J,Wang Y J,Lu X C,et al.A dynamic adaptive replica allocation algorithm in mobile ad hoc networks[C]//Proc of the IEEE Int'l Conf on Pervasive Computing and Communications (PerCom2004).California:IEEE Computer Society Press,2004:65-70.
  • 3Hare T.Effective replica allocation in Ad hoc networks for improving data accessibility[C]//Proc of the IEEE INFOCOM2001.California:IEEE Computer Society Press,2001:1568-1576.
  • 4Medina A,Lakhina A,Mattaf I,et al.BRITE:an approach to universal generation[C]//Proceedings of the International Workshop on Modeling,Analysis and Simulation of Computer and Telecommunications System-MASCOTS'01,Cincinnati,Ohio,August 2001.
  • 5凌波,王晓宇,周傲英,Ng Wee-Siong.一种基于Peer-to-Peer技术的Web缓存共享系统研究[J].计算机学报,2005,28(2):170-178. 被引量：19

二级参考文献12

  • 1Ng WS, Ooi BC, Tan KL. BestPeer: A self-configurable peer-to-peer system. In: Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, 2002, 272.
  • 2Bowman C.M., Danzig P.B., Hardy D.R., Manber U., Schwartz M.F. The harvest information discovery and access system. Computer Networks and ISDN Systems,1995,28(1～2): 119～125.
  • 3Wolman A., Voelker G.M., Sharma N., Cardwell N., Karlin A.R., Levy H.M. On the scale and performance of cooperative Web proxy caching. Operating Systems Review, 1999, 34(5): 16～31.
  • 4Ratnasamy S., Francis P., Handley M., Karp R., Shenker S. A scalable content-addressable network. In: Proceedings of ACM SIGCOMM, San Diego, CA, 2001, 161～172.
  • 5Rowstron A., Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science 2218, 2001, 329～350.
  • 6Stoica I., Morris R., Karger D., Kaashoek M.F., Balakrishnan H. Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proceedings of the ACM SIGCOMM, San Diego, 2001, 149～160.
  • 7Wang J. A survey of Web caching schemes for the Internet. ACM Computer Communication Review, 1999, 29(5): 36～46.
  • 8Kurcewicz M., Sylwestrzak W., Wierzbicki A. A distributed WWW cache. Computer Networks and ISDN Systems, 2001, 30(22～23): 2261～2267.
  • 9Druschel P., Rowstron A. PAST: A large-scale persistent peer-to-peer storage utility. In: Proceedings of the 8th Workshop on Hot Topics in Operating Systems (HotOS-VIII). Schoss Elmau, Germany, 2001, 65～70.
  • 10Rowstron A., Druschel P. Storage management and caching in PAST, A large-scale persistent peer-to-peer storage utility. In: Proceedings of the 18th ACM SOSP'01, Banff, Canada, 2001, 188～201.

共引文献18

同被引文献31

  • 1汪锦岭,金蓓弘,李京.结构化P2P网络上可靠的基于内容路由协议[J].软件学报,2006,17(5):1107-1114. 被引量：8
  • 2李振宇,谢高岗.基于DHT的P2P系统的负载均衡算法[J].计算机研究与发展,2006,43(9):1579-1585. 被引量：26
  • 3李江涛,雷振明.P2P网络性能测度及监测系统模型[J].北京邮电大学学报,2006,29(3):17-21. 被引量：8
  • 4Handurukande S B, Kermarrec A M, le Fessant F, et al. Peer Sharing Behavior in the eDonkey Network, and Implications for the Design of Server-less File Sharing Systems[C]//Proc. of EuroSys'06. [S. 1.]: ACM Press, 2006.
  • 5Pullen J M. The Network Workbench: Network Simulation Soft- ware for Academic Investigation of Internet Concepts[J]. Com- puter Nerworks, 2000, 32(3): 365-378.
  • 6Cai Min, Chervenak A, Frank M. A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table[C]//Proc. of ACM/ IEEE Conference on Supercomputing. Washington D. C., USA: IEEE Computer Society, 2004.
  • 7Xia Ye, Chen Shigang, Korgaonkar V. Load Balancing with Mul- tiple Hash Functions in Peer-to-Peer Networks[C]//Proc. of the 12th International Conf. on ParaUeland Distributed Systems. Washington D. C., USA: IEEE Press, 2006.
  • 8Klemm A, Lindemann C, Mary K, et al. Characterizing the Query Behavior in P2P file Sharing Systems[C]//Proc. of the 4th ACM SIGCOMM Conference on Internet Measurement. New York, USA: ACM Press, 2004.
  • 9Xia Ye, Chen Shigang, Korgaonkar V. Load balancing with multiple hash functions in peer-to-peer networks L C]. Proc. of the 12th International Conf. on Paralle- land Distributed Systems. Washington D. C., USA: IEEE Press ,2006.
  • 10Byers J, Considine J, Mitzenmacher M. Simple load balancing for distributed hash tables[ C ]. In : Kaashock MF, Stoica I, ads. LNCS. Berlin: Springer-Verlag, 2003:80 - 87.

引证文献4

二级引证文献9

计算机工程与应用
2007年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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