Research on the MP2P-based content distribution mechanism

被引：0
作者：
Li, Lu [1 ]
Zhang, Guoyin [1 ]
Yao, Aihong [1 ]
Li, Ling [1 ]
机构：
[1] Ling Li College of Computer Science and Technology, Harbin Engineering University
来源：
Journal of Convergence Information Technology | 2012年 / 7卷 / 12期
关键词：
Cluster management; Content distribution; MP2P; Network coding; Semanti similarity;
D O I：
10.4156/jcit.vol7.issue12.23
中图分类号：
学科分类号：
摘要：
Content distribution of MP2P (mobile peer-to-peer) network has become one of the research interests in academia. Because of such characteristics of nodes in MP2P networks as frequent joining/leaving, and constant movement, the network framework is unstable, which results in the inapplicability of the existing content distribution strategies. Therefore, in order to improve the efficiency of content distribution, based on the characteristics of MP2P networks, a new network framework is rebuilt in the paper. This network adopts cluster management and network coding technology to process data storage, and optimize data transmission by semantic similarity. The results of simulated research verify that data acquired through coding techniques could reduce the link number with seed node on the condition that the progress of the download is complete. Download success rate can be effectively improved with the increase of stored blocks. Meanwhile, the cache strategy by priority based on the partial network coding can protect the scare resources and is better than the random cache strategy.
引用
收藏
页码：195 / 206
页数：11
相关论文
共 10 条
  • [1] Qiang L., Wang Z., A Semantic based P2P Personal Knowledge Sharing Model, IJACT, 4, 1, pp. 33-41, (2012)
  • [2] Fernandez A., Gramoli V., Distributed Slicing in Dynamic Systems, Distributed Computing Systems of 27th International Conference, pp. 66-72, (2007)
  • [3] Rizzo L., Effective Erasure Codes for Reliable Computer Communication Protocols, Computer Communication Review, 27, 2, pp. 24-36, (1997)
  • [4] Li B., Random Network Coding in Peer-to-Peer Networks: From Theory to Practice, Proceedings of the IEEE, 99, 3, pp. 513-523, (2011)
  • [5] Deming F., Zhuqi, Research of Route Algorithm Improvement in P2P Network based on Gnutella, JDCTA, 5, 7, pp. 74-79, (2011)
  • [6] Zhao B., Kubiatowicz J., Joseph A., Tapestry: An Infrastructure For Fault-tolerant Wide-area Location and Routing, (2001)
  • [7] Rowstron A., Druschel P., Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, Lecture Notes In Computer Science, pp. 329-350, (2001)
  • [8] Ratnasamy S., Francis P., Handley M., Karp R., Shenker S., A scalable content-addressable network, Proceedings of the ACM SIGCOMM, 31, 4, pp. 161-172, (2011)
  • [9] Xiong J., Qiang Y., Liu K., Zhan X., CTL-P2P: A Cluster-based Two-layered P2P Resource Sharing Model, pp. 421-424, (2010)
  • [10] Xian X., Shi W., He H., Comparison of OMNET++ and other simulator for WSN simulation, The 3rd IEEE Conference On Industrial Electronics and Applications, Proceedings, pp. 1439-1443, (2008)
1