非结构化p2p网络拓扑自恢复机制研究

《非结构化p2p网络拓扑自恢复机制研究》由会员上传分享，免费在线阅读，更多相关内容在学术论文-天天文库。

1、分类号TP391学号11050001ＵＤＣ000密级公开工学硕士学位论文非结构化P2P网络拓扑自恢复机制研究硕士生姓名别致学科专业管理科学与工程研究方向指挥信息系统指导教师肖卫东教授国防科学技术大学研究生院二〇一三年十二月万方数据ResearchonAlgorithmforUnstructuredPeer-to-PeerOverlayNetworkTopologyAutomatic-RestorationCandidate：BieZhiAdvisor：XiaoWeidongAdissertationSubmittedinpartialfulfillmento

2、ftherequirementsforthedegreeofMasterofEngineeringinScienceandEngineeringofManagementGraduateSchoolofNationalUniversityofDefenseTechnologyChangsha，Hunan，P.R.ChinaDecember，2013万方数据万方数据国防科学技术大学研究生院硕士学位论文目录摘要..............................................................................

3、...................................iABSTRACT.........................................................................................................ii第一章概述..................................................................................................11.1课题背景和意义.................

4、..............................................................................11.2P2P网络的发展..............................................................................................21.3国内外研究现状.......................................................................................

5、........41.4论文创新点........................................................................................................61.5论文研究内容与结构........................................................................................7第二章基于流言机制的自适应周期网络拓扑异常探测算法................................82

6、.1问题描述...........................................................................................................82.2相关工作...........................................................................................................82.3基于流言机制的自适应网络拓扑异常探测算法..............................

7、..............92.3.1算法的基本思路.....................................................................................92.3.2数据结构..............................................................................................142.3.3算法的设计......................................................

8、..........................