P2P层次域网络模型及蚁群搜索算法的研究与实现
|
摘要
随着网络技术的发展,P2P迅速成为人们关注焦点。它打破了传统的C/S模式,网络中节点兼具了客户机与服务器的双重功能,从而避免了C/S模式集中服务带来的瓶颈问题,网络文件共享速率也得到了极大的提高。由于随机生成的拓扑结构、洪泛查询算法,使得其扩展性方面的表现不太令人满意。因此,人们对P2P的研究主要集中在两个相关方面:一是构建具有可扩展性和稳定性的网络拓扑结构;二是开发效率更高、代价更小的查询算法。二者的相关性体现在,虽然拓扑结构和查询算法表面上看起来是独立的,但是一个良好组织的拓扑结构对于查询算法性能的提高是显而易见。
本文针对上述问题进行了深入研究,提出一种基于资源信誉度P2P层次域模型的蚁群搜索算法。层次域模型根据节点的资源信誉度进行域组织,使节点信誉度相差不大的节点位于同一域内。相应地节点资源查询采用两层搜索策略,第一层的节点资源查询被限制于本域内,当本域内查询不到的资源时,采用第二层蚁群算法域间合理导向资源查询,将搜索蚂蚁引导到存在查询资源的高信誉度节点域中。此外,根据资源查询的局部性原理和幂律现象,论文还引入了资源主动声明机制进一步提高了查询的效率,同时减少了查询信令流量在网络中的带宽资源占用。
本文对所提出的P2P网络模型和搜索算法的可行性与有效性进行了仿真实验验证。仿真结果表明,与经典的K-Random网络搜索算法比较,由于域内查询的大量使用和基于蚁群算法的域间搜索合理导向,本文所提出的搜索算法具有较高的查询效率与命中率,同时带宽资源消耗少。
With the development of network technology.P2P quickly becomes the focus.It has broken the traditional C/S mode,the network node both act as client and the server's dual function.thus avoiding the C/S model the bottleneck caused by centralized services.network file-sharing rate has been greatly increased.Since randomly generated topology,the flooding search algorithms,so the performance in terms of its expansion is not satisfactory.Therefore,the people on the P2P's research focuses on two aspects:First,build scalability and stability of the network topology; the second is to develop more efficient and less costly query algorithm.Although the topology and search algorithms seemingly independent,but a well-organized topology algorithm for query performance improvement is obvious.
This paper studies these issues in depth,presents a P2P-based resource credibility level domain model of ant search algorithm.Level domain model credibility to the node resources to conduct field organization,so make nodes with little difference node-credibility in the same area.Accordingly adopt a two-node resource query search strategy,the first layer of nodes are limited resources in the region query,not when the query within the resources,the ant colony algorithm using the second level domain-oriented resources reasonably among query,the search ant resource guide to the existence of query nodes in the domain of high credibility. Moreover,according to local principles of resource queries and power-law behavior, the paper also introduces a mechanism for resource initiatives to further improve the query statement of the efficiency,while reducing signaling traffic in the network query bandwidth resources occupation.
In this paper,proposed search algorithm for P2P network model and feasibility and validity of the simulation experiment.Simulation results show that the classical K-Random Web Search algorithm comparison,due to extensive using within the query and the ant colony algorithm based on a reasonable inter-domain search-oriented search algorithm proposed in this paper has high search efficiency,hit rate,and low consumption of bandwidth resources.
本文针对上述问题进行了深入研究,提出一种基于资源信誉度P2P层次域模型的蚁群搜索算法。层次域模型根据节点的资源信誉度进行域组织,使节点信誉度相差不大的节点位于同一域内。相应地节点资源查询采用两层搜索策略,第一层的节点资源查询被限制于本域内,当本域内查询不到的资源时,采用第二层蚁群算法域间合理导向资源查询,将搜索蚂蚁引导到存在查询资源的高信誉度节点域中。此外,根据资源查询的局部性原理和幂律现象,论文还引入了资源主动声明机制进一步提高了查询的效率,同时减少了查询信令流量在网络中的带宽资源占用。
本文对所提出的P2P网络模型和搜索算法的可行性与有效性进行了仿真实验验证。仿真结果表明,与经典的K-Random网络搜索算法比较,由于域内查询的大量使用和基于蚁群算法的域间搜索合理导向,本文所提出的搜索算法具有较高的查询效率与命中率,同时带宽资源消耗少。
With the development of network technology.P2P quickly becomes the focus.It has broken the traditional C/S mode,the network node both act as client and the server's dual function.thus avoiding the C/S model the bottleneck caused by centralized services.network file-sharing rate has been greatly increased.Since randomly generated topology,the flooding search algorithms,so the performance in terms of its expansion is not satisfactory.Therefore,the people on the P2P's research focuses on two aspects:First,build scalability and stability of the network topology; the second is to develop more efficient and less costly query algorithm.Although the topology and search algorithms seemingly independent,but a well-organized topology algorithm for query performance improvement is obvious.
This paper studies these issues in depth,presents a P2P-based resource credibility level domain model of ant search algorithm.Level domain model credibility to the node resources to conduct field organization,so make nodes with little difference node-credibility in the same area.Accordingly adopt a two-node resource query search strategy,the first layer of nodes are limited resources in the region query,not when the query within the resources,the ant colony algorithm using the second level domain-oriented resources reasonably among query,the search ant resource guide to the existence of query nodes in the domain of high credibility. Moreover,according to local principles of resource queries and power-law behavior, the paper also introduces a mechanism for resource initiatives to further improve the query statement of the efficiency,while reducing signaling traffic in the network query bandwidth resources occupation.
In this paper,proposed search algorithm for P2P network model and feasibility and validity of the simulation experiment.Simulation results show that the classical K-Random Web Search algorithm comparison,due to extensive using within the query and the ant colony algorithm based on a reasonable inter-domain search-oriented search algorithm proposed in this paper has high search efficiency,hit rate,and low consumption of bandwidth resources.
引文
[1]钟经.网络经济十四定律[J].财会月刊,2000,35(21):37-38.
[2]DejanS.Milojicie,vana Kalogeraki,etal.Peer-to-PeerComPuting[R].Technical Report HPL-2002-57RI.Califomia:Hewlett-Paekard ComPany,2002.
[3]曾碧卿,陈志刚.P2P与网格的互补性研究[J].计算机工程与应用,2005,3(11):132-134
[4]Kementsietsidis,A.,Alenas,M..Miller.R.J.Mapping data in Peer-to-Peer systems:Semantics and algorithmic issues[C].In:Halevy AY,lves ZG,Doan AH,eds.Proeeedings of the 2003 ACMSIGMOD International Conference onManagement of Data.San Diego:ACM Press.2003.325-336.
[5]凌波,王晓宇,周傲英一种基于Peer-to-Peer技术的web缓存共享系统究[J].计算机学报,2005,28(2):170-178.
[6]ArturA,Xu ZC.Scalable,efficient range queries for grid nformation services[C].In:Ross LG.NahidS.eds.Proeeedings of the 2~(nd) Iniernational Conferenee Peer-to-Peer Computing (P2P2002).New YOrk:IEEE ComPuter Soeiety,2002.33-40.
[7]GuptaA,Sahin OD,Agrawal D,Abbadi AE.Meghdoot:Content-Based Publish/subscribe over P2P netwok[C].In:JaeobsenHA,eds.Proceedings of 5~(th) ACM/IFIP/USENIX International Middleware Conference LNCS 3231.Toroto:SPringer-Verlag,2004.254-273
[8]Ashwin RB,Mukesh A,Srinivasan S.Mereury:Supporting scalable multi-attribute range queries[J].Computer Communication Review,2004,34(4):353-366.
[9]Tang C,xu Z,Mahalingam M.peer-to-peer information retrieval using self-organizing semantic overlay networks[C].In:Anja F,Martina Z,Jon C,David W,eds.Proeeedings of the ACM SIGCOMM 2003.Karlsruhe:ACM Press,2003.175-186.
[10]周文莉,吴晓非.P2P技术综述[J].计算机工程与设计,2006,27(1):76-79.
[11]Napster Home Page[EB/OL].http://www.napster.com.
[12]梁达明..P2P网络资源定位模型研究[硕士学位论文].杭州:浙江大学,2006.
[13]Gnutella Home Page[EB/OL].http://www.gnutella.com.
[14]Yang B,Gareia-Molina H.Improving seareh in peer-to-peer networks[C].In:Rodrigues LET,RaynalM,Chen WSE,eds.Proeeedings of the 22~(nd) IEEE International Conference on Distributed ComPuting.Washington:IEEE ComPuterSoeiety Press,2002.5-14.
[15] Lv Q. Cao P, Cohen E, Li K, Shenker S. Search and replication in unstructured Peer-to-Peer netvvorks[C]. In: Ebeioglu K. Pingali K. Nieolau A. eds. Proceedings of the 16~(th) ACM International Conference on Supercomputing (ACM ICS'02) . New York: ACM Press, 2002.84-95.
[16] V. Kalogeraki, D.Gunopulos. D.zeinalipour-yazti. A local seareh meehanism for Peer-to-Peer networks[C].In: MeLean VA. eds. Proeeedings of the 11th ACM Conference on Information and Knowledge Management (ACM CIKM'02) .New York:ACMPress, 2002.300-307.
[17] Crespo A, Gareia-Molina H. Routing indices for Peer-to-Peer systems[C]. In: Sivilotti P, eds. Proeeedings of the 22~(nd) International Conference on Distributed ComPuting ( IEEE ICDCS' 02) . Arizona: IEEE Computer Soeiety Press, 2002.23-32.
[18] D. Tsoumakos, N.Roussopoulos. Adaptive Probabilistic Seareh (APS) for Peer-to-Peer Networks[R]. Technical RePort CS-TR-4451. Maryland: University of Maryland, 2003.171-180.
[19] ColomiA, Dorigo M, ManiezzoV. Distributed optinuzation by ant colonies.Proeeedings of the 1th European Conference on Aitificial Life, 1991,134-142.
[20] Litwin W, Neimat MA, Sehneider DA. LH-A sealable, distributed data strueture[J]. ACM Trans. On Data base Systems, 1996, 21 (4) : 480-525.
[21] Zhao Y.B., Kubiatowitez, J., JosePh A.. Tpestry: An infrastructure for fault-tolerant wide-area loeation and routing[R].Teehnieal Report UCB/CSD-01-1141. Berkeley: ComPuter Seienee Division, University of California, 2001.
[22] Rowstron A., Drusehel P..Pastry: Sealable, decentralized objeet loeation and routing for large-scale Peer-to-Peer systems[C]. In: Guerraoui R, eds. Proeeedings of the IFIP/ACM International Middleware Conference. London: SPringer-Verlag, 2001.329-350.
[23] Stoical, Morris R, Karger D, Kaashoek F, Balakrishnan H. Chord:A scalable Peer-to-Peer lookup service for Internet applications[C], In: Cruz R, Varghese G, eds.Proeeedings of the 2001 Conference on applications, Technologies, Arehitectures, and Protocols for ComPuter Communications (SigComm) . NewYork: ACM Press,2001.149-160.
[24] Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable content-addressable network[C]. In: Cruz R, Varghese G, eds. Proeeedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SigCornm) . New York: ACM Press, 2001.161-172.
[25]KaZaA File Sharing Network.KaZaA Home Page[EB/OL].http://www.kazaa.com/.
[26]孙茂松,陈群秀.语言计算与基于内容的文本处理[M].北京:清华大学出版社,2003.1-35.
[27]丁琼.基于向量空间模型的文本自动分类系统的研究与实现[硕士学位论文]上海:同济大学,2007.
[28]何缓,蒋明,肖建华-个基于机器学习的中文专题搜索引擎[J].计算机工程,2002,28(10):120-122.
[29]Buekley C.Implementation of the SMART information retrieval system[R].Technical Report TR35-686.New York:Cornell University,1985.
[30]Tran H,Hitehens M,Vradharaj V,etal.A Trust based Aecess Control Framework for P2P File-Sharing Systems[C].In:SPragne,R.H.Jr..eds.Proeeedings of the 38~(th) Hawaii International Conference on System Sciences.Washington DC,USA:IEEE Computer Soeiety Press,2005.302-311.
[31]Wang Y.Vassileva J.Trust and reputation model in peer-to-peer networks[C].In:Mariam Kamkar.NahidShahmehri,eds.Proeeedings of the 3~(rd) International Conference on Peer-to-Peer Computing.Sweden:IEEEComputer Soeiety Press,2003.150-157.
[32]A.lanmitchi,M.Rieanu,I.T.Foster.Locating data in Peer-to-Peer scientific collaborations[C].In:Druschel P,eds.Proeeedings of the International Workshop on Peer-To-Peer Systems 2002(IPTPS 2002).Berlin:Springer-Verlag,2002.232-241.
[33]谭义红,陈治平,林亚平.基于兴趣挖掘的非结构化PZP搜索机制研究与实现[J].计算机应用,2006,26(5):1164-1166.
[34]杨舰,吕智慧,钟亦平,等-种基于兴趣域的高效对等网络搜索方案[J].计算机研究与发展,2005,42(5):804-809.
[35]Cheuk Hang Ng,Ka Cheung Sia,Chi Hang Chan.Advaneed Peer clustering and firework query model in the Peer-to-Peer network[Cl.In:Yih-FamRobinChen,Laszlo Kovacs,Steve Lawrence,eds.Proceedings of 12~(th) International World Wide Web Conference(WWW2003 ).Budapest,HUNGARY:ACMPress,2003.PosterID:S130.
[36]凌波,陆志国,黄维雄,等.Peerls:基于Peer-to-peer的信息检索系统[J].软件学报,2004,15(9):1375-1384.
[37]Hai Jin,YijiaoYu.SemreX:a Semantic Peer-to-Peer Scientific Reference Sharing System[C].In:Petre Dini,PasealLorenz,DumitruRoman,Mario Freire,eds.Proeeedings of International Conference on Internet and Web Applications and Serviees/Advaneed Intemational Conference on Telecommunications(AICT-ICIW'06).Washington:DC.USA:IEEE Computer Soeiety Press,2006.19-25.
[38]Saroiu S.,Gummadi P.K.,GribbleS.D..A measurement study of Peer-to-Peer file sharing systems[C].In:Martin KienLzle,Prashant Shenoy,eds.Proceedings of the Multimedia Computing and Networking Conference.San Jose,California,USA:ACM Press,2002.156-170.
[39]Sen Shubho,Wang Jia.Analyzing P2P traffic across large networks[J].IEEE/ACM Transactions on Networking,2004,12(2):219-232.
[40]张尧学,史美林.计算机操作系统教程[M].第二版.北京清华大学出版.2004,135-137.
[41]杭小勇.网格资源的安全主动发布机制.天津:天津大学,2005.
[42]Dorigo M.Optimization,learning and natural algorithms.Ph.D.Thesis,DePartment of Eleetronies,Politeenico diMilano,Italy,1992.
[43]段海滨.蚁群算法及其在高性能电动仿真转台参数优化中的应用研究.南京:南京航空航天大学博士学位论文,2005.
[44]何靖华.面向仿生制造的蚂蚁算法分析研究及应用.武汉:华中科技大学硕士学位论文,2002.
[45]Di Caro G,Dorigo M.AntNet:Distributed Stigmergy Control for Communications Networks.Journal of Altificial Intelligence Researeh(JAIR),1998,9(10):317-365.
[46]张文,赵子铭.P2P网络技术原理与C++开发案例.北京:人民邮电出版社,2008
[47]Wang J Z,Ma Z D,Gregory M H.A distributed meebanieal system simulation platform based on a "Gluing Algorithm".Journal of Computing and Information Science in Engineering,2005,5(1):71-74.
赵耀培,张福强,董茜.Ad Hoc网络技术研究进展,信息技术与信息化,2005,3(20):158-161.
[2]DejanS.Milojicie,vana Kalogeraki,etal.Peer-to-PeerComPuting[R].Technical Report HPL-2002-57RI.Califomia:Hewlett-Paekard ComPany,2002.
[3]曾碧卿,陈志刚.P2P与网格的互补性研究[J].计算机工程与应用,2005,3(11):132-134
[4]Kementsietsidis,A.,Alenas,M..Miller.R.J.Mapping data in Peer-to-Peer systems:Semantics and algorithmic issues[C].In:Halevy AY,lves ZG,Doan AH,eds.Proeeedings of the 2003 ACMSIGMOD International Conference onManagement of Data.San Diego:ACM Press.2003.325-336.
[5]凌波,王晓宇,周傲英一种基于Peer-to-Peer技术的web缓存共享系统究[J].计算机学报,2005,28(2):170-178.
[6]ArturA,Xu ZC.Scalable,efficient range queries for grid nformation services[C].In:Ross LG.NahidS.eds.Proeeedings of the 2~(nd) Iniernational Conferenee Peer-to-Peer Computing (P2P2002).New YOrk:IEEE ComPuter Soeiety,2002.33-40.
[7]GuptaA,Sahin OD,Agrawal D,Abbadi AE.Meghdoot:Content-Based Publish/subscribe over P2P netwok[C].In:JaeobsenHA,eds.Proceedings of 5~(th) ACM/IFIP/USENIX International Middleware Conference LNCS 3231.Toroto:SPringer-Verlag,2004.254-273
[8]Ashwin RB,Mukesh A,Srinivasan S.Mereury:Supporting scalable multi-attribute range queries[J].Computer Communication Review,2004,34(4):353-366.
[9]Tang C,xu Z,Mahalingam M.peer-to-peer information retrieval using self-organizing semantic overlay networks[C].In:Anja F,Martina Z,Jon C,David W,eds.Proeeedings of the ACM SIGCOMM 2003.Karlsruhe:ACM Press,2003.175-186.
[10]周文莉,吴晓非.P2P技术综述[J].计算机工程与设计,2006,27(1):76-79.
[11]Napster Home Page[EB/OL].http://www.napster.com.
[12]梁达明..P2P网络资源定位模型研究[硕士学位论文].杭州:浙江大学,2006.
[13]Gnutella Home Page[EB/OL].http://www.gnutella.com.
[14]Yang B,Gareia-Molina H.Improving seareh in peer-to-peer networks[C].In:Rodrigues LET,RaynalM,Chen WSE,eds.Proeeedings of the 22~(nd) IEEE International Conference on Distributed ComPuting.Washington:IEEE ComPuterSoeiety Press,2002.5-14.
[15] Lv Q. Cao P, Cohen E, Li K, Shenker S. Search and replication in unstructured Peer-to-Peer netvvorks[C]. In: Ebeioglu K. Pingali K. Nieolau A. eds. Proceedings of the 16~(th) ACM International Conference on Supercomputing (ACM ICS'02) . New York: ACM Press, 2002.84-95.
[16] V. Kalogeraki, D.Gunopulos. D.zeinalipour-yazti. A local seareh meehanism for Peer-to-Peer networks[C].In: MeLean VA. eds. Proeeedings of the 11th ACM Conference on Information and Knowledge Management (ACM CIKM'02) .New York:ACMPress, 2002.300-307.
[17] Crespo A, Gareia-Molina H. Routing indices for Peer-to-Peer systems[C]. In: Sivilotti P, eds. Proeeedings of the 22~(nd) International Conference on Distributed ComPuting ( IEEE ICDCS' 02) . Arizona: IEEE Computer Soeiety Press, 2002.23-32.
[18] D. Tsoumakos, N.Roussopoulos. Adaptive Probabilistic Seareh (APS) for Peer-to-Peer Networks[R]. Technical RePort CS-TR-4451. Maryland: University of Maryland, 2003.171-180.
[19] ColomiA, Dorigo M, ManiezzoV. Distributed optinuzation by ant colonies.Proeeedings of the 1th European Conference on Aitificial Life, 1991,134-142.
[20] Litwin W, Neimat MA, Sehneider DA. LH-A sealable, distributed data strueture[J]. ACM Trans. On Data base Systems, 1996, 21 (4) : 480-525.
[21] Zhao Y.B., Kubiatowitez, J., JosePh A.. Tpestry: An infrastructure for fault-tolerant wide-area loeation and routing[R].Teehnieal Report UCB/CSD-01-1141. Berkeley: ComPuter Seienee Division, University of California, 2001.
[22] Rowstron A., Drusehel P..Pastry: Sealable, decentralized objeet loeation and routing for large-scale Peer-to-Peer systems[C]. In: Guerraoui R, eds. Proeeedings of the IFIP/ACM International Middleware Conference. London: SPringer-Verlag, 2001.329-350.
[23] Stoical, Morris R, Karger D, Kaashoek F, Balakrishnan H. Chord:A scalable Peer-to-Peer lookup service for Internet applications[C], In: Cruz R, Varghese G, eds.Proeeedings of the 2001 Conference on applications, Technologies, Arehitectures, and Protocols for ComPuter Communications (SigComm) . NewYork: ACM Press,2001.149-160.
[24] Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable content-addressable network[C]. In: Cruz R, Varghese G, eds. Proeeedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SigCornm) . New York: ACM Press, 2001.161-172.
[25]KaZaA File Sharing Network.KaZaA Home Page[EB/OL].http://www.kazaa.com/.
[26]孙茂松,陈群秀.语言计算与基于内容的文本处理[M].北京:清华大学出版社,2003.1-35.
[27]丁琼.基于向量空间模型的文本自动分类系统的研究与实现[硕士学位论文]上海:同济大学,2007.
[28]何缓,蒋明,肖建华-个基于机器学习的中文专题搜索引擎[J].计算机工程,2002,28(10):120-122.
[29]Buekley C.Implementation of the SMART information retrieval system[R].Technical Report TR35-686.New York:Cornell University,1985.
[30]Tran H,Hitehens M,Vradharaj V,etal.A Trust based Aecess Control Framework for P2P File-Sharing Systems[C].In:SPragne,R.H.Jr..eds.Proeeedings of the 38~(th) Hawaii International Conference on System Sciences.Washington DC,USA:IEEE Computer Soeiety Press,2005.302-311.
[31]Wang Y.Vassileva J.Trust and reputation model in peer-to-peer networks[C].In:Mariam Kamkar.NahidShahmehri,eds.Proeeedings of the 3~(rd) International Conference on Peer-to-Peer Computing.Sweden:IEEEComputer Soeiety Press,2003.150-157.
[32]A.lanmitchi,M.Rieanu,I.T.Foster.Locating data in Peer-to-Peer scientific collaborations[C].In:Druschel P,eds.Proeeedings of the International Workshop on Peer-To-Peer Systems 2002(IPTPS 2002).Berlin:Springer-Verlag,2002.232-241.
[33]谭义红,陈治平,林亚平.基于兴趣挖掘的非结构化PZP搜索机制研究与实现[J].计算机应用,2006,26(5):1164-1166.
[34]杨舰,吕智慧,钟亦平,等-种基于兴趣域的高效对等网络搜索方案[J].计算机研究与发展,2005,42(5):804-809.
[35]Cheuk Hang Ng,Ka Cheung Sia,Chi Hang Chan.Advaneed Peer clustering and firework query model in the Peer-to-Peer network[Cl.In:Yih-FamRobinChen,Laszlo Kovacs,Steve Lawrence,eds.Proceedings of 12~(th) International World Wide Web Conference(WWW2003 ).Budapest,HUNGARY:ACMPress,2003.PosterID:S130.
[36]凌波,陆志国,黄维雄,等.Peerls:基于Peer-to-peer的信息检索系统[J].软件学报,2004,15(9):1375-1384.
[37]Hai Jin,YijiaoYu.SemreX:a Semantic Peer-to-Peer Scientific Reference Sharing System[C].In:Petre Dini,PasealLorenz,DumitruRoman,Mario Freire,eds.Proeeedings of International Conference on Internet and Web Applications and Serviees/Advaneed Intemational Conference on Telecommunications(AICT-ICIW'06).Washington:DC.USA:IEEE Computer Soeiety Press,2006.19-25.
[38]Saroiu S.,Gummadi P.K.,GribbleS.D..A measurement study of Peer-to-Peer file sharing systems[C].In:Martin KienLzle,Prashant Shenoy,eds.Proceedings of the Multimedia Computing and Networking Conference.San Jose,California,USA:ACM Press,2002.156-170.
[39]Sen Shubho,Wang Jia.Analyzing P2P traffic across large networks[J].IEEE/ACM Transactions on Networking,2004,12(2):219-232.
[40]张尧学,史美林.计算机操作系统教程[M].第二版.北京清华大学出版.2004,135-137.
[41]杭小勇.网格资源的安全主动发布机制.天津:天津大学,2005.
[42]Dorigo M.Optimization,learning and natural algorithms.Ph.D.Thesis,DePartment of Eleetronies,Politeenico diMilano,Italy,1992.
[43]段海滨.蚁群算法及其在高性能电动仿真转台参数优化中的应用研究.南京:南京航空航天大学博士学位论文,2005.
[44]何靖华.面向仿生制造的蚂蚁算法分析研究及应用.武汉:华中科技大学硕士学位论文,2002.
[45]Di Caro G,Dorigo M.AntNet:Distributed Stigmergy Control for Communications Networks.Journal of Altificial Intelligence Researeh(JAIR),1998,9(10):317-365.
[46]张文,赵子铭.P2P网络技术原理与C++开发案例.北京:人民邮电出版社,2008
[47]Wang J Z,Ma Z D,Gregory M H.A distributed meebanieal system simulation platform based on a "Gluing Algorithm".Journal of Computing and Information Science in Engineering,2005,5(1):71-74.
赵耀培,张福强,董茜.Ad Hoc网络技术研究进展,信息技术与信息化,2005,3(20):158-161.