基于MP2P网络的内容分发机制研究

doi:10.3969/j.issn.1000-436x.2013.05.019

摘要/Abstract

摘要：

摘要：针对目前MP2P网络因节点频繁移动带来的扰动性，及节点有限的计算、存储能力等限制因素，提出分区管理的灵活策略，将节点按标准进行功能划分，每个子网由超级节点管理。采用部分网络编码技术处理数据，加快数据传输及更替效率。并提出跨子网查询算法加强子网间信息的交互及资源定位。实验结果表明，该策略可以有效地提高资源下载成功率与命中率，减少资源传输延时，改善了MP2P网络的内容分发效率，同时也增强了系统的顽健性。

关键词: MP2P, 内容分发, 机会路由, 节点选择, 网络拓扑, 部分网络编码

Abstract:

In consideration of the current MP2P network disturbance from frequent location changes of the mobile nodes,the limited computing power and storage capacity,a flexible strategy of partition management by assigning different functions to nodes according to some standards,regarding a subnet as a unit and using super-nodes to manage subnets were proposed.In order to speed up the data transmission and replacement efficiency,data was processed with partial network coding technology.Additionally,a trans-subnet query algorithm was proposed to link subnets,conduct informa-tion exchange between subnets and resource location.Results of the experiment manifested that this strategy can effi-ciently increase the resource download success rate and hit rate,reduce the average delay,improve the content distribu-tion efficiency of MP2P networks,and simultaneously enhance system robustness.

Key words: MP2P, content distribution, opportunistic routing, node choice, network topology, partial network coding

张国印,李璐,孙建国,王向辉. 基于MP2P网络的内容分发机制研究[J]. 通信学报, 2013, 34(5): 168-175.

Guo-yin ZHANG,Lu LI,Jian-guo SUN,Xiang-hui WANG. Research on content distribution mechanism of MP2P networks[J]. Journal on Communications, 2013, 34(5): 168-175.

图/表 10

图1

图2

图3

图4

表1

表2

图5

图6

图7

图8

参考文献 15

[1]	LI Z Y , WANG R C , Secure topology protocol for mobile peer-to-peer networks[J]. Journal on Communications, 2010,31(10):146-157.
[2]	LI Z Y , XIE G G , LI Z C , Efficient and scalable consistency mainte-nance for heterogeneous peer-to-peer systems[J]. IEEE Transactions on Parallel and Distributed Systems, 2008,19(12):1695-1708.
[3]	KURT D , MILOS M . Extended virtual spring mesh(EVSM): the distributed self-organizing mobile ad hoc network for area explora-tion[J]. IEEE Transactions on Industrial Electronics, 2011,58(12):424-5437.
[4]	LI H , BOK K S , YOO J S . An efficient clustering method for unstruc-tured mobile peer-to-peer networks[A]. RACS '11: Proceedings of the 2011 ACM Symposium on Research in Applied Computationy[C]. 2011. 124-129
[5]	YU J , LU L M , XIAO P . Monitoring,analyzing and characterizing lookup traffic in a large-scale DHT[J]. Computer Communications, 2011,34(13):622-1629.
[6]	LI B C , RANDOM N D . Network coding in peer-to-peer networks: from theory to practice[J]. Proceedings of the IEEE, 2011,99(3):513-523.
[7]	TSAI F S , HAN W C , XU J W . Design and development of a mobile peer-to-peer social networking application[J]. Expert Systems with Applications, 2009,36(8):11077-11087.
[8]	ZOU D Y . GAN Y , QU H T . Research of structure consistency be-tween overlay and network layer based on mobile P2P[A]. 2nd IEEE International Conference on Computer Science and Information Technology[C]. 2009(2):254-258
[9]	LIU H I . A distributed intelligent broadcasting protocol for mobile ad hoc networks[J]. Mobile Networks and Applications, 2009,14(5):638-648.
[10]	HUANG D M , HU Z . Research of replication mechanism in P2P network[J]. World Scientific and Engineering Academy and Society, 2009,8(12):845-1854.
[11]	XIAO X , WANG W P , YANG L M , YANG L M,Wireless broadcasting retrans-mission approach based on network coding[J]. Journal on Communi-cations, 2009,30(9):69-75.
[12]	LEI Y C , CHENG S , WU C . P2P content distribution with network coding[J]. Journal of Computer Research and Development, 2009,46(1):108-109.
[13]	LIU L G , CHEN Z X . Data forwarding in opportunistic networks[J]. Asian Network for Scientific Information, 2010,9(2):215-223.
[14]	ANH N H , SILVIA G . Routing in opportunistic Networks[J]. Ambi-ent Computing and Intelligence. 2009,1(3):19-38.
[15]	ANGGADJAJA E . Point-to-point OMNeT++ based simulation of reliable transmission using realistic segmentation and reassembly with error control[A].Advances in Computing,Control and Telecommuni-cation Technologies (ACT), 2010 Second International Conference on[C]. 2010. 125-128.

硬件环境	软件环境
CPU P4 3.0GB	OverSim2010
内存1GB硬盘160GB	OMNeT++ 4.0Inet2010、Linux Fedora 10

仿真参数	参数值
网络范围	3 000m×3 000m
节点数量	400个
节点V_max	20m/s
节点V_min	0m/s
带宽	250kbit/s
数据块容量	512kbit
TTL	6