基于覆盖网的P2P网络路由及资源搜索策略
|
摘要
目前P2P网络由于具有分散化、可扩展性、健壮性、隐私性、高性能等特点越来越受到人们的重视,但P2P网络中寻路延时较长、节点负载不均衡及网络结构不稳定等问题往往制约了其实际应用。
基于这一情况,本文设计了一种基于覆盖网的P2P体系结构,并对该体系结构的网络路由以及资源搜索策略进行了较为深入的研究,主要研究工作及取得的创新成果有以下几个主要方面:
首先,研究了一般的P2P网络的拓扑结构,以Chord模型为基础,结合覆盖网的可靠性、稳定性等优点,设计了一种基于覆盖网的P2P网络体系结构,并对该结构的各组成部分进行了阐述。
其次,研究了基于覆盖网的P2P网络的路由过程,为了减少节点恶意频繁加入/退出导致的网络拓扑不稳定的情况从而影响路由效率,而引入了节点信誉值的概念,并设计了节点的路由、加入、退出算法。
再次,为了改善已有P2P网络蚁群算法收敛性较差的缺陷,对蚁群算法搜索策略进行了改进,以此为基础,设计了一种新的基于蚁群的启发式资源搜索算法,使得资源搜索过程中节点选择的路径能实时地根据当时情况实时决策,提高了搜索的收敛性。
最后,通过仿真实验对设计的路由及资源搜索算法进行了验证,实验结果表明算法具有较高的性能和可用性。
P2P networks, with the features such as decentralization, scalability, robustness, privacy, efficiency and etc, have been attracting more and more people's attention. However, the long routing discovery delay, the lopsided node load and the instability of the network structure obstacle its actual application.
This paper designs a P2P architecture based on overlay network and has a deep research on the routing and resource search strategy. The main work and the innovations of the paper are given bellow:
Firstly, after introducing the topology of general P2P networks, a P2P architecture based on overlay network is proposed. The architecture is based on the Chord model, and has the advantages of overlay network such as reliability, stability. Each component of the architecture is described in this paper.
Secondly, we study the routing process of P2P overlays, and employ the concept of credit to prevent malicious nodes from frequently adding and quitting the network, which leads to the instability of the topology and thusly reduces the routing efficiency. We also design the algorithms of node routing, addition and revocation.
Thirdly, we propose a new heuristic resource search algorithm based on ant colony optimization, which aims at the poor convergence of existing colony optimizations for P2P networks. The algorithm improves the search strategy of ant colony optimization, and the path selection reacts quickly to the real-time circumstances, which improves the convergence of the algorithm.
Lastly, simulations validate the routing and resource search algorithms. The simulation results demonstrate that the proposed algorithms have good performance and availability..
基于这一情况,本文设计了一种基于覆盖网的P2P体系结构,并对该体系结构的网络路由以及资源搜索策略进行了较为深入的研究,主要研究工作及取得的创新成果有以下几个主要方面:
首先,研究了一般的P2P网络的拓扑结构,以Chord模型为基础,结合覆盖网的可靠性、稳定性等优点,设计了一种基于覆盖网的P2P网络体系结构,并对该结构的各组成部分进行了阐述。
其次,研究了基于覆盖网的P2P网络的路由过程,为了减少节点恶意频繁加入/退出导致的网络拓扑不稳定的情况从而影响路由效率,而引入了节点信誉值的概念,并设计了节点的路由、加入、退出算法。
再次,为了改善已有P2P网络蚁群算法收敛性较差的缺陷,对蚁群算法搜索策略进行了改进,以此为基础,设计了一种新的基于蚁群的启发式资源搜索算法,使得资源搜索过程中节点选择的路径能实时地根据当时情况实时决策,提高了搜索的收敛性。
最后,通过仿真实验对设计的路由及资源搜索算法进行了验证,实验结果表明算法具有较高的性能和可用性。
P2P networks, with the features such as decentralization, scalability, robustness, privacy, efficiency and etc, have been attracting more and more people's attention. However, the long routing discovery delay, the lopsided node load and the instability of the network structure obstacle its actual application.
This paper designs a P2P architecture based on overlay network and has a deep research on the routing and resource search strategy. The main work and the innovations of the paper are given bellow:
Firstly, after introducing the topology of general P2P networks, a P2P architecture based on overlay network is proposed. The architecture is based on the Chord model, and has the advantages of overlay network such as reliability, stability. Each component of the architecture is described in this paper.
Secondly, we study the routing process of P2P overlays, and employ the concept of credit to prevent malicious nodes from frequently adding and quitting the network, which leads to the instability of the topology and thusly reduces the routing efficiency. We also design the algorithms of node routing, addition and revocation.
Thirdly, we propose a new heuristic resource search algorithm based on ant colony optimization, which aims at the poor convergence of existing colony optimizations for P2P networks. The algorithm improves the search strategy of ant colony optimization, and the path selection reacts quickly to the real-time circumstances, which improves the convergence of the algorithm.
Lastly, simulations validate the routing and resource search algorithms. The simulation results demonstrate that the proposed algorithms have good performance and availability..
引文
[1]郑纬民,胡进锋,代亚非等.对等计算研究概论[C].技术发展年度报告.中国计算机学会.
[2]LLCLW.Limewirewebsite[EB/OL],2000 URL http:www.limewire.com.
[3]eDonkey.eDonkeyhomePage[EB/OL],2002 URL httP://www.edonkey.eom.
[4]LTDSN.KaZaAmediadesktop[EB/OL],2002 URL http:www.kazaa.eom.
[5]Sylvia Ratnasamy,Paul Francis,Mark Handely,et al.Ascalable content-addressable network[J].Proceedings of ACM SIGCOMM'01,San Diego,September 2001.
[6]S.Ratnasamy,P.Francis,MHandley,and R.M.Karp."A scalable content-addressable network"[J].In Proc.ACM SIGCOMM 2001,161-172,2001.
[7]Sylvia Ratnasamy,Scott Shenker,Ion Stoica.Routing Algorithms for DHTs:Some Open Questions[C].Proceedings for the 1~(st) International Workshop on Peer-to-Peer Systems(IPTPS'02),7-8 March 2002-Cambridge,MA,USA.
[8]S.Ratnasamy,P.Francis,M.Handley,et al.A Scalable Content-Addressable Network[J].In:Proc.ACM SIGCOMM.2001,161-172.
[9]Napster[EB/OL].http://www.napster.com
[10]Gnutella[EB/OL].http://www.gnutella.com.
[11]B Y Zhao,J D Kubiatowicz,A D Joseph.Tapestry:An Infrastructure for Fault-tolerant Wide-area Location and Routing[C].In:U.C.Berkeley.2000.
[12]A.Rowstron,P.Druschel.Pastry:Scalable,decentralized object Location and routing for large-scale peer-to-peer systems[C].In:Proc 18th IFIP/ACM International Conference on Distributed SystemsPlafforms.2001,329-350.
[13]I.Stoica,R.Morris,D.Karger,M.F.Kaashoek,et aI.Chord:A Scalable Peer-to-peer Lookup Service for Internet Applications[C].In:Proc.ACM SIGCOMM 2001.2001,149-160.
[14]KaZaA[EB/OL].http://www.kazaa.com.
[15]Clarck I,Sandberg O,Wiley B and Hong T W.Freenet:A distributed anonymous information strorage and retrieval system.Proceedings of the ICSI Workshop On Deisign Issues in Anonymity and Unobservability[J].46-66.Berkeley.CA,USA:Springer-Verlag,2000.
[16]Yang B and Garcia-Molina H.Improving search in peer-to-peer networks[J].Proceedings of the 22~(nd) International Conference on Distributed Computing Systems(ICDCS'02),5-14.Vienna,Austria:IEEE Computer Society,2002.
[17]V.Kalogeraki,D.Gnnopulos,and D.Zeinalipour-Yazti[C].A Local Search Mechanism for Peer-to-Peer Networks.In:Proc.11~(th) Int' l Conf.Information and Knowledge Management(CIKM'02),New York:ACM Press,2002,300-307.
[18]B.Yang and H.Garcia-Molina.Improving search in Peer-to-Peer Networks[J].In:Proc.22~(nd) Int'l Conf.Distributed Computing Systems(ICDCS'02),Los Alamitios,CA:IEEE Computer Society Press,2002,5-15.
[19]S.Daswani and A.Fisk.Gnutella UDP Extension for Scalable Searches(GUESS) v0.1[C].
[20]M.Stokes.Gnutella2 Specifications Part One[EB/OL]: http://www.gnutella2.com/index.php/G2_specs._part1,2006-04.
[21]Limewire LLC,Ultrapeers:Another Step Towards Gnutella Scalability[J/OL].http://www.limewire.com/developer/Ultrapeer.html,2006-04.
[22]D.Tsoumakos and N.Roussopoulos.Adaptive Probabilistic Search(APS) for Peer-to-Peer Networks[J].In:Proc.3~(rd)Int'l Conf.Peer-to-Peer Computing(P2P 2003),Los Alamitos,CA:IEEE Computer Society Perss,2003,102-110.
[23]D.Menasce and L.Kanchanapalli.Probabilistic Scalable P2P Resource Location Services[J].ACM SIGMETRICS Perfomance Evaluation Review,New York:ACM Press.2002.48-58.
[24]A.Crespo and H.Garcia-Molina.Routing Indices for Peer-to-Peer Systems[J].In:Proc.22~(nd) Int'l Conf.Distribute Computing Systems(ICDCS'02),Los Alamitos,CA:IEEE Computer Society Press,2002,23-35.
[25]F.M Cuenca-Acuna and T.D.Nguyen.Text-Based Content Searche and Retrieval in Ad Hoc P2P Communities[C].In:E.Gregori,L.Cherkasova,GCugola,F.Panzieri,GP.Picco.Int'l Workshop on Peer-to-Peer Computing,LNCS 2376,Berlin Heidelberg:Springer-Verlag,2002,220-234.
[26]Sylvia R,Scott S,Ion S.Routing Algorithms for DHTs:SOme Open Questions[C].In:1st International Workshop on Peer-to-Peer System.2002,174-175.
[27]A.Crespo and H.Garcia-Molina.Routing Indices for Peer-to-Peer Systems[J].In:Proc.22~(nd) Int'l Conf.Distribute Computing Systems(ICDCS'02),Los Alamitos,CA:IEEE Computer Society Press,2002,23-35.
[28]Christoph Schmitz.Self-organization of a Small World by Topic[C].In:llya Zaihrayeu and Matteo Bonifacio.Proc.1~(st) International Workshop on Peer-to-Peer Knowledge Management,Boston,MA,August 2004.
[29]K.Sripanidkulchai,B.Maggs,H.Zhang.Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems[J].In;Twenty-Second Annual Joint Conference of the IEEE Computer and Communications(INFOCOM'03),Los Alamitos,CA:IEEE Computer Society Press,2003,2166-2176.
[30]Lei Gun,Song Jiang,Li Xiao,and Xiaodong Zhang.Exploiting Content Localities for Efficinet Serach in P2P Systmes[C].In:Rachid Guerraoui.Proc.18~(th) International Symposium on Distributed Computing(DISC 2004),LNCS 3274,Berlin Heidelbeg:Springer-Verlag,2004,349-364.
[31]Mayank Bawa,Gurmeet Singh Manku,and Prabhakar Raghavan.SETS:Search Enhanced by Topic Segmentation[J].In:Proceeding of the 26~(th) annual international ACM SIGIR conference on Research and development in information retrieval,New York:ACM Press,2003,306-313.
[32]A.Ianmitchi,M.Ripeanu,and I.Foster.Small-Word File-Sharing Communities[J].In:Twenty-third Annual Joint Conference of the IEEE Computer and Communiction(INFOCOM 2004),Los Alamitos,CA:IEEE Computer Society Press,2004,952-963.
[33]Tsungnan Lin,Hsinping Wang and Jianming Wang.Search Performance Analysis and Robust Search Slgorithm in Unstructured Peer-to-Peer Networks[J].In:Proc.Of 2004 IEEE International Symposium on Cluster Computing and the Grid(CCGrid 2004),Piscataway,NJ:IEEE Press,2004,346-354.
[34]Zhengyun Zhuang,Yuhao Liu,Li Xiao,and Lionel M.Ni.Hybrid Periodical Flooding in Unstructured Peer-to-Peer Networks[J].In:Proceeding of the 2003 International Conference on Parallel Processing(ICPP'03),Los Alamitos,CA:IEEE Computer Society Press,2003,171-178.
[35]Xiuguo Bao,Binxing Fang,and Mingzeng Hu.Cocktail Search in Unstructured P2P Networks.In:H.Jin,Y.Pan,N.Xiao,and J.Sun.GCC 2004 Workshops,LNCS 3252,Berlin Heidelberg:Springer-Verlag,2004,286-293.
[36]Niloy Ganguly and Andreas Deutsch.Developing Efficient Search Algorithm for P2P Networks[C].Using Proliferation and Mutation In:G.Nicosia et al.ICARIS 2004,LNCS 3239,Berlin Heidelberg:Springer-Verlag,2004,357-371.
[37]Niloy Ganguly,GeoffCanright,and Andreas Deutsch.Design of a Robust Serach Algorithm for P2P Networks[C].In:L.Bouge and V.K.Prasanna.HiPC 2004,LNCS 3296,Berlin Heidelberg:Springer-Verlag,2004,222-231.
[38]Niloy Ganguly,Geoff Canright,and Andreas Deutsch.Design of an Efficient Search Algorithm for P2P Networks Using Concepts from Natural Immune Systems[C].In:X.Yao et al.PPSN VIII,LNCS 3242,Berlin Heibelberg:Springer-Verlag,2004,491-500.
[39]Ozalp Babalglu,Hein Meling,and Alberto Montresor.Anthill:A Framework for the Development of Agent-Based Peer-to-Peer Systems[J].In:Proc.Of the 22~(nd) International Conference on Distributed Computing Systems(ICDCS'02),Los Alamitos,CA:IEEE Computer Society Press,2002,15-22.
[40]Elke Michlmayr,Sabine Graf,Wolf Siberski and Wolfgang Nejdl.Query Routing with Ants[C].In:Proc.Of the Workshop on Ontologies in Peer-to-Peer Communities,European Semantic Web Conference,Heraklion,Greece,May 2005.35-46.
[41]Thmas Fuhrmanrt,"On the Topology of Overlay-Networks"[C],ICON2003,The 11~(th) IEEE International Conference,2003.9,pp.271-276
[42]S.L.Vieira,J.Liebeherr,"Topology Design for Service Overlay Networks with Bandwidth Guarantees"[C].in Proc.12~(th) IEEE International Workshop on QoS,2004.6,pp.211-220
[43]A.Young,I.Chen,Z.Ma,A.Krishnamurthy,L.Peterson,R.Y.Wang,"Oveylay Mesh Construction Using Interleaved Spanning tree"[C],in Proc,INFOCOM 2004,2004.3
[44]Y.Liu,Z.Zhuang,L.Xiao,L.M.Ni,"AOTO:Adaptive Overlay Topology Optimization in Unstructured P2P Systems"[C],in Proc of IEEE GLOBECOM 2003,San Francisco,USA,2003.13
[45]Diego Gambetta,Can We Trust? In,Trust:Making and Breaking Cooperative Relations,Gambetta,D(ed.)[R].Basil Blackwell.Oxford,199-,pp.213-237.
[46]Abdul-Rahman A,Hailes S.A distributed trust model:In Proceedings of the 1997 New security Paradigms Workshop[J],Cambrian,ACM Press,1998.
[47]A.Colorui,M.Dorigo,V.Maniezzo,"Ant system for job-shop scheduling",Belgian Jorunal of Operations Research[J],Statistics and Computer Science,1994,34(1):39-54.
[48]M.Dorigo,V.Maniezzo,A.Colorni,"The ant system:optimization by a colony of cooperation agents"[C],IEEE Transactions on Systems,Man,and Cybernetics-Part B.1996.26(1 ):28-41.
[49]S.Lin,B.W.Kemighan,"An effective heuristic algorithm for the TSP"[R],Operations Research,1973,21:498-516.
[50]A.Medina,A.Lakhina,I.Mattaf,etal.BRITE:An Approach to Universal Generation[C].in:Proceedings of the International Workshop on Modeling,Analysis and Simulation of Computer and Telecommunications System-MASCOTS'01,Cincinnati,Ohio,August 2001.
[2]LLCLW.Limewirewebsite[EB/OL],2000 URL http:www.limewire.com.
[3]eDonkey.eDonkeyhomePage[EB/OL],2002 URL httP://www.edonkey.eom.
[4]LTDSN.KaZaAmediadesktop[EB/OL],2002 URL http:www.kazaa.eom.
[5]Sylvia Ratnasamy,Paul Francis,Mark Handely,et al.Ascalable content-addressable network[J].Proceedings of ACM SIGCOMM'01,San Diego,September 2001.
[6]S.Ratnasamy,P.Francis,MHandley,and R.M.Karp."A scalable content-addressable network"[J].In Proc.ACM SIGCOMM 2001,161-172,2001.
[7]Sylvia Ratnasamy,Scott Shenker,Ion Stoica.Routing Algorithms for DHTs:Some Open Questions[C].Proceedings for the 1~(st) International Workshop on Peer-to-Peer Systems(IPTPS'02),7-8 March 2002-Cambridge,MA,USA.
[8]S.Ratnasamy,P.Francis,M.Handley,et al.A Scalable Content-Addressable Network[J].In:Proc.ACM SIGCOMM.2001,161-172.
[9]Napster[EB/OL].http://www.napster.com
[10]Gnutella[EB/OL].http://www.gnutella.com.
[11]B Y Zhao,J D Kubiatowicz,A D Joseph.Tapestry:An Infrastructure for Fault-tolerant Wide-area Location and Routing[C].In:U.C.Berkeley.2000.
[12]A.Rowstron,P.Druschel.Pastry:Scalable,decentralized object Location and routing for large-scale peer-to-peer systems[C].In:Proc 18th IFIP/ACM International Conference on Distributed SystemsPlafforms.2001,329-350.
[13]I.Stoica,R.Morris,D.Karger,M.F.Kaashoek,et aI.Chord:A Scalable Peer-to-peer Lookup Service for Internet Applications[C].In:Proc.ACM SIGCOMM 2001.2001,149-160.
[14]KaZaA[EB/OL].http://www.kazaa.com.
[15]Clarck I,Sandberg O,Wiley B and Hong T W.Freenet:A distributed anonymous information strorage and retrieval system.Proceedings of the ICSI Workshop On Deisign Issues in Anonymity and Unobservability[J].46-66.Berkeley.CA,USA:Springer-Verlag,2000.
[16]Yang B and Garcia-Molina H.Improving search in peer-to-peer networks[J].Proceedings of the 22~(nd) International Conference on Distributed Computing Systems(ICDCS'02),5-14.Vienna,Austria:IEEE Computer Society,2002.
[17]V.Kalogeraki,D.Gnnopulos,and D.Zeinalipour-Yazti[C].A Local Search Mechanism for Peer-to-Peer Networks.In:Proc.11~(th) Int' l Conf.Information and Knowledge Management(CIKM'02),New York:ACM Press,2002,300-307.
[18]B.Yang and H.Garcia-Molina.Improving search in Peer-to-Peer Networks[J].In:Proc.22~(nd) Int'l Conf.Distributed Computing Systems(ICDCS'02),Los Alamitios,CA:IEEE Computer Society Press,2002,5-15.
[19]S.Daswani and A.Fisk.Gnutella UDP Extension for Scalable Searches(GUESS) v0.1[C].
[20]M.Stokes.Gnutella2 Specifications Part One[EB/OL]: http://www.gnutella2.com/index.php/G2_specs._part1,2006-04.
[21]Limewire LLC,Ultrapeers:Another Step Towards Gnutella Scalability[J/OL].http://www.limewire.com/developer/Ultrapeer.html,2006-04.
[22]D.Tsoumakos and N.Roussopoulos.Adaptive Probabilistic Search(APS) for Peer-to-Peer Networks[J].In:Proc.3~(rd)Int'l Conf.Peer-to-Peer Computing(P2P 2003),Los Alamitos,CA:IEEE Computer Society Perss,2003,102-110.
[23]D.Menasce and L.Kanchanapalli.Probabilistic Scalable P2P Resource Location Services[J].ACM SIGMETRICS Perfomance Evaluation Review,New York:ACM Press.2002.48-58.
[24]A.Crespo and H.Garcia-Molina.Routing Indices for Peer-to-Peer Systems[J].In:Proc.22~(nd) Int'l Conf.Distribute Computing Systems(ICDCS'02),Los Alamitos,CA:IEEE Computer Society Press,2002,23-35.
[25]F.M Cuenca-Acuna and T.D.Nguyen.Text-Based Content Searche and Retrieval in Ad Hoc P2P Communities[C].In:E.Gregori,L.Cherkasova,GCugola,F.Panzieri,GP.Picco.Int'l Workshop on Peer-to-Peer Computing,LNCS 2376,Berlin Heidelberg:Springer-Verlag,2002,220-234.
[26]Sylvia R,Scott S,Ion S.Routing Algorithms for DHTs:SOme Open Questions[C].In:1st International Workshop on Peer-to-Peer System.2002,174-175.
[27]A.Crespo and H.Garcia-Molina.Routing Indices for Peer-to-Peer Systems[J].In:Proc.22~(nd) Int'l Conf.Distribute Computing Systems(ICDCS'02),Los Alamitos,CA:IEEE Computer Society Press,2002,23-35.
[28]Christoph Schmitz.Self-organization of a Small World by Topic[C].In:llya Zaihrayeu and Matteo Bonifacio.Proc.1~(st) International Workshop on Peer-to-Peer Knowledge Management,Boston,MA,August 2004.
[29]K.Sripanidkulchai,B.Maggs,H.Zhang.Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems[J].In;Twenty-Second Annual Joint Conference of the IEEE Computer and Communications(INFOCOM'03),Los Alamitos,CA:IEEE Computer Society Press,2003,2166-2176.
[30]Lei Gun,Song Jiang,Li Xiao,and Xiaodong Zhang.Exploiting Content Localities for Efficinet Serach in P2P Systmes[C].In:Rachid Guerraoui.Proc.18~(th) International Symposium on Distributed Computing(DISC 2004),LNCS 3274,Berlin Heidelbeg:Springer-Verlag,2004,349-364.
[31]Mayank Bawa,Gurmeet Singh Manku,and Prabhakar Raghavan.SETS:Search Enhanced by Topic Segmentation[J].In:Proceeding of the 26~(th) annual international ACM SIGIR conference on Research and development in information retrieval,New York:ACM Press,2003,306-313.
[32]A.Ianmitchi,M.Ripeanu,and I.Foster.Small-Word File-Sharing Communities[J].In:Twenty-third Annual Joint Conference of the IEEE Computer and Communiction(INFOCOM 2004),Los Alamitos,CA:IEEE Computer Society Press,2004,952-963.
[33]Tsungnan Lin,Hsinping Wang and Jianming Wang.Search Performance Analysis and Robust Search Slgorithm in Unstructured Peer-to-Peer Networks[J].In:Proc.Of 2004 IEEE International Symposium on Cluster Computing and the Grid(CCGrid 2004),Piscataway,NJ:IEEE Press,2004,346-354.
[34]Zhengyun Zhuang,Yuhao Liu,Li Xiao,and Lionel M.Ni.Hybrid Periodical Flooding in Unstructured Peer-to-Peer Networks[J].In:Proceeding of the 2003 International Conference on Parallel Processing(ICPP'03),Los Alamitos,CA:IEEE Computer Society Press,2003,171-178.
[35]Xiuguo Bao,Binxing Fang,and Mingzeng Hu.Cocktail Search in Unstructured P2P Networks.In:H.Jin,Y.Pan,N.Xiao,and J.Sun.GCC 2004 Workshops,LNCS 3252,Berlin Heidelberg:Springer-Verlag,2004,286-293.
[36]Niloy Ganguly and Andreas Deutsch.Developing Efficient Search Algorithm for P2P Networks[C].Using Proliferation and Mutation In:G.Nicosia et al.ICARIS 2004,LNCS 3239,Berlin Heidelberg:Springer-Verlag,2004,357-371.
[37]Niloy Ganguly,GeoffCanright,and Andreas Deutsch.Design of a Robust Serach Algorithm for P2P Networks[C].In:L.Bouge and V.K.Prasanna.HiPC 2004,LNCS 3296,Berlin Heidelberg:Springer-Verlag,2004,222-231.
[38]Niloy Ganguly,Geoff Canright,and Andreas Deutsch.Design of an Efficient Search Algorithm for P2P Networks Using Concepts from Natural Immune Systems[C].In:X.Yao et al.PPSN VIII,LNCS 3242,Berlin Heibelberg:Springer-Verlag,2004,491-500.
[39]Ozalp Babalglu,Hein Meling,and Alberto Montresor.Anthill:A Framework for the Development of Agent-Based Peer-to-Peer Systems[J].In:Proc.Of the 22~(nd) International Conference on Distributed Computing Systems(ICDCS'02),Los Alamitos,CA:IEEE Computer Society Press,2002,15-22.
[40]Elke Michlmayr,Sabine Graf,Wolf Siberski and Wolfgang Nejdl.Query Routing with Ants[C].In:Proc.Of the Workshop on Ontologies in Peer-to-Peer Communities,European Semantic Web Conference,Heraklion,Greece,May 2005.35-46.
[41]Thmas Fuhrmanrt,"On the Topology of Overlay-Networks"[C],ICON2003,The 11~(th) IEEE International Conference,2003.9,pp.271-276
[42]S.L.Vieira,J.Liebeherr,"Topology Design for Service Overlay Networks with Bandwidth Guarantees"[C].in Proc.12~(th) IEEE International Workshop on QoS,2004.6,pp.211-220
[43]A.Young,I.Chen,Z.Ma,A.Krishnamurthy,L.Peterson,R.Y.Wang,"Oveylay Mesh Construction Using Interleaved Spanning tree"[C],in Proc,INFOCOM 2004,2004.3
[44]Y.Liu,Z.Zhuang,L.Xiao,L.M.Ni,"AOTO:Adaptive Overlay Topology Optimization in Unstructured P2P Systems"[C],in Proc of IEEE GLOBECOM 2003,San Francisco,USA,2003.13
[45]Diego Gambetta,Can We Trust? In,Trust:Making and Breaking Cooperative Relations,Gambetta,D(ed.)[R].Basil Blackwell.Oxford,199-,pp.213-237.
[46]Abdul-Rahman A,Hailes S.A distributed trust model:In Proceedings of the 1997 New security Paradigms Workshop[J],Cambrian,ACM Press,1998.
[47]A.Colorui,M.Dorigo,V.Maniezzo,"Ant system for job-shop scheduling",Belgian Jorunal of Operations Research[J],Statistics and Computer Science,1994,34(1):39-54.
[48]M.Dorigo,V.Maniezzo,A.Colorni,"The ant system:optimization by a colony of cooperation agents"[C],IEEE Transactions on Systems,Man,and Cybernetics-Part B.1996.26(1 ):28-41.
[49]S.Lin,B.W.Kemighan,"An effective heuristic algorithm for the TSP"[R],Operations Research,1973,21:498-516.
[50]A.Medina,A.Lakhina,I.Mattaf,etal.BRITE:An Approach to Universal Generation[C].in:Proceedings of the International Workshop on Modeling,Analysis and Simulation of Computer and Telecommunications System-MASCOTS'01,Cincinnati,Ohio,August 2001.