期刊文献+

合作环境下P2P网络最大吞吐量算法研究 被引量:1

Research on Achieving Optimal Throughput of P2P in Cooperative Environment
下载PDF
导出
摘要 针对P2P数据流网络中的文件传输情形进行了分析,以最大化整个网络的吞吐量为目标,提出了一个文件传输模型,并在其上寻找一种可行的多项式时间内可求解的算法对近似最优的网络带宽利用率以及相应的流量路由分配进行计算,模拟试验表明效果明显。 This paper analyzes the circumstance of data dissemination in P2P network, aiming at the maximum throughput of the whole network and proposes a model of data dissemination. Then on this model, it develops a practical algorithm performed in polynomial time to approximately compute the optimal usage of network bandwidth and the corresponding routing strategy, and the simulation result turns out to be obviously fine.
作者 吴限 苏德富
出处 《计算机工程》 EI CAS CSCD 北大核心 2006年第18期114-116,共3页 Computer Engineering
关键词 P2P 最大吞吐量 带宽利用率 P2P Maximum throughput Bandwidth usage
  • 相关文献

参考文献8

  • 1Oram.Peer-to-peer:Harnessing the Power of Disruptive Technologies[Z].http://www.oreilly.de/catalog/peertopeer/,2001-03.
  • 2Deering S.The Pim Architecture for Wide-area Multicast Routing[J].IEEE/ACM Transactions on Networking,1996,4(2):153-162.
  • 3Byers J,Considine J,Mitzenmacher M,et al.Informed Content Delivery Across Adaptive Overlay Networks[J].IEEE/ACM Transactions on Networking,2004,12(5).
  • 4Cohen B.Incentives Build Robustness in BitTorrent[Z].http://bit conjurer.org/BitTorrent.
  • 5Kostic D,Rodriguez A,Albrecht J,et al.Bullet:High Bandwidth Data Dissemination Using an Overlay Mesh[C].Proc.of SOSP,2003-10.
  • 6Li Z,Li B,Jiang D,et al.On Achieving Optimal End to End Throughput in Data Networks:Theoretical and Empirical Studies[R].Department of Electrical and Computer Engineering,University of Toronto,2004-02.
  • 7Jain K,Mahdian M,Salavatipour M R.Packing Steiner Trees[C].Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms,2003.
  • 8Ahlswede R,Cai N,Li S R,et al.Network Information Flow[J].IEEE Transactions on Information Theory,2000,46(4):1204-1216.

同被引文献6

  • 1Kant K, Iyer R, Tewari V. A framework for classif- ying peer-to-peer technologies[C]//Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID' 02). Germany: Berlin, 2002(15): 200-222.
  • 2RaymondWYeung.信息论与网络编码[M].蔡宁,译.北京:高等教育出版社,2011:411-535.
  • 3Boschetti M, Jelasity M, Maniezzo V. A local ap- proach to membership overlay design [J].Computer Science, 2004(16) : 250-360.
  • 4Freisleben B, Merz P. Genetic local search algorithm for solving symmetric and asymmetric traveling sales- man problems [J]. IEEE Int. Conf. Evolutionary Computation, 1996(96) :616-621.
  • 5李明.详解MATLAB在最优化计算中的应用[M].北京:电子工业出版社,2012.
  • 6Liu Y, Athanasiadis G, Weale M E. A survey of genetic simulation software for population and epidemiological studies[J]. Human Genomies, 2008,3 (1) : 79-86.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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