几类网络模型及路由算法研究
|
摘要
目前,随着互连网络、复杂网络等网络技术的快速发展,网络模型及其通信效率已成为各领域的研究热点,尤其是在高性能计算、网格计算等方面。网络技术的不断创新使得各种拓扑结构的网络模型应运而生,为资源传输、资源共享、资源副本等关键技术的研究奠定了基础。同时,在不同的网络结构中需要不同的通信模式以实现路由通信,如何高效的实现这些通信模式是目前学术界研究的重要课题之一。而网络中的通信效率直接依赖于不同路由算法的效率,因此在不同的网络拓扑结构下,研究如何高效的实现各种通信模式的路由算法具有十分重要的理论和现实意义。
本文即针对不同的网络应用,在构造网络模型拓扑结构的同时,分析讨论了在不同路由算法的基础上网络通信效率的问题。在对各种网络模型和路由算法研究的基础上,本文的主要研究内容及创新点如下:
首先,综述了互连网络模型的拓扑性质和路由通信算法。针对互连网络,在互连网络的发展概况基础上,介绍了互连网络的特性和性能参数,讨论了互连网络中的几种常见网络模型,分析了互连网络中的通信路由算法。
其次,讨论了P2P网络中的网络模型及经典路由机制。针对P2P网络,总结了P2P网络的发展历史和研究现状,在P2P网络与传统的C/S模式比较的基础上,分析了P2P网络的特点和优势,讨论了基于P2P网络的几种结构化网络模型的路由机制,总结了结构化P2P网络路由算法研究面临的主要问题。
再次,提出了一种规则的互连网络模型层次双环网络HDRN(k),讨论了其路由算法。基于层次环结构和双环网络的概念和性质,嵌入Petersen图构造了一类层次双环网络模型HDRN(k),讨论了HDRN(k)网络的路由性质,设计了点点路由和Broadcast路由算法,证实了HDRN(k)网络是一种具有良好拓扑结构、高效路由通信的互连网络模型。
接着,仿真模拟了层次双环网络HDRN(k)的性能和路由通信效率,利用NS2网络模拟器研究了其数据包成功接收率、端到端延时以及路由开销等问题。针对网络模型及路由算法的仿真模拟,总结了目前仿真模拟实验的基础知识,分析比较了几种网络仿真模拟工具,重点分析了NS2网络模拟器的特点、安装调试过程以及仿真步骤。
最后,在以上规则网络模型拓扑结构的研究基础上,讨论了复杂网络的演化模型,为进一步将复杂网络演化模型应用到实际网络中奠定了理论基础。针对复杂网络,综述了复杂网络的发展、应用及研究意义,阐述了复杂网络的基础知识,重点讨论了几种复杂网络的演化模型。
Nowadays, with the rapid development of the network technologies, such as interconnection network, complex network, network model and its communication efficiency have become the research focuses, especially in high-performance computing and grid computing. Due to the innovation of the network technologies, network models with different topologies are proposed, establishing a foundation for the research of key technologies, like resource transfer, resource sharing, resource copies. Meanwhile, in order to implement routing communication, different communicating models are used in different networks. So how to realize such communication modes efficiently is an important subject for research. The communication efficiency in the network depends on the efficiency of routing algorithm, so study on routing algorithms of different communication modes under different topologies has important theoretical and realistic significance.
This paper constructed different network models for different network applications, and analyzed the network communication efficiency based on different routing algorithms. A variety of network models and routing algorithms are researched in this paper and the main contents and innovations are as follows:
Firstly, the topologies and routing communication algorithms of the interconnection network are summarized. For the interconnection network, this paper summarized the development of its topologies, described its characteristics and parameters, and then focused on discussing several common network models and routing communication algorithms. Secondly, several network models and classical routing algorithms of the P2P network are discussed. For P2P network, this paper gives an overview of its research status and history, and then the advantages of the P2P network are given out based on the comparison between P2P networks and traditional C/S model. After the discussion of several routing mechanisms in P2P networks, several issues in the research of structured P2P network routing algorithms are proposed.
Thirdly, a kind of ruled interconnection network model is established and its routing algorithms are discussed. HDRN (k) is proposed on the basis of hierarchical interconnection networks. The construction and properties of HDRN (k) are investigated. Then, the routing strategies of HDRN (k) are discussed and two routing algorithms, point-to-point and broadcast, are designed. It is proved that HDRN (k) is a new kind of network, with good topological properties and high communication efficiency.
Then, the performance and routing efficiency of HDRN (k) are simulated. NS2 simulator is utilized to research its rate of successfully received data packets, end to end delay, network overhead and other issues. According to the simulation of the network models and routing algorithms, this paper summarizes the current knowledge of simulation experiments, analyzes several network simulation tools and emphasizes on the analysis of NS2 simulator’s characteristic and step.
Finally, based on the research of the above-mentioned ruled network’s topologies, complex network’s evolution model is discussed, which established the foundation for the further research. For complex network, this paper introduces its development, application and significance, sums up its basic knowledge, and then emphasizes on the discussion of several revolution model.
本文即针对不同的网络应用,在构造网络模型拓扑结构的同时,分析讨论了在不同路由算法的基础上网络通信效率的问题。在对各种网络模型和路由算法研究的基础上,本文的主要研究内容及创新点如下:
首先,综述了互连网络模型的拓扑性质和路由通信算法。针对互连网络,在互连网络的发展概况基础上,介绍了互连网络的特性和性能参数,讨论了互连网络中的几种常见网络模型,分析了互连网络中的通信路由算法。
其次,讨论了P2P网络中的网络模型及经典路由机制。针对P2P网络,总结了P2P网络的发展历史和研究现状,在P2P网络与传统的C/S模式比较的基础上,分析了P2P网络的特点和优势,讨论了基于P2P网络的几种结构化网络模型的路由机制,总结了结构化P2P网络路由算法研究面临的主要问题。
再次,提出了一种规则的互连网络模型层次双环网络HDRN(k),讨论了其路由算法。基于层次环结构和双环网络的概念和性质,嵌入Petersen图构造了一类层次双环网络模型HDRN(k),讨论了HDRN(k)网络的路由性质,设计了点点路由和Broadcast路由算法,证实了HDRN(k)网络是一种具有良好拓扑结构、高效路由通信的互连网络模型。
接着,仿真模拟了层次双环网络HDRN(k)的性能和路由通信效率,利用NS2网络模拟器研究了其数据包成功接收率、端到端延时以及路由开销等问题。针对网络模型及路由算法的仿真模拟,总结了目前仿真模拟实验的基础知识,分析比较了几种网络仿真模拟工具,重点分析了NS2网络模拟器的特点、安装调试过程以及仿真步骤。
最后,在以上规则网络模型拓扑结构的研究基础上,讨论了复杂网络的演化模型,为进一步将复杂网络演化模型应用到实际网络中奠定了理论基础。针对复杂网络,综述了复杂网络的发展、应用及研究意义,阐述了复杂网络的基础知识,重点讨论了几种复杂网络的演化模型。
Nowadays, with the rapid development of the network technologies, such as interconnection network, complex network, network model and its communication efficiency have become the research focuses, especially in high-performance computing and grid computing. Due to the innovation of the network technologies, network models with different topologies are proposed, establishing a foundation for the research of key technologies, like resource transfer, resource sharing, resource copies. Meanwhile, in order to implement routing communication, different communicating models are used in different networks. So how to realize such communication modes efficiently is an important subject for research. The communication efficiency in the network depends on the efficiency of routing algorithm, so study on routing algorithms of different communication modes under different topologies has important theoretical and realistic significance.
This paper constructed different network models for different network applications, and analyzed the network communication efficiency based on different routing algorithms. A variety of network models and routing algorithms are researched in this paper and the main contents and innovations are as follows:
Firstly, the topologies and routing communication algorithms of the interconnection network are summarized. For the interconnection network, this paper summarized the development of its topologies, described its characteristics and parameters, and then focused on discussing several common network models and routing communication algorithms. Secondly, several network models and classical routing algorithms of the P2P network are discussed. For P2P network, this paper gives an overview of its research status and history, and then the advantages of the P2P network are given out based on the comparison between P2P networks and traditional C/S model. After the discussion of several routing mechanisms in P2P networks, several issues in the research of structured P2P network routing algorithms are proposed.
Thirdly, a kind of ruled interconnection network model is established and its routing algorithms are discussed. HDRN (k) is proposed on the basis of hierarchical interconnection networks. The construction and properties of HDRN (k) are investigated. Then, the routing strategies of HDRN (k) are discussed and two routing algorithms, point-to-point and broadcast, are designed. It is proved that HDRN (k) is a new kind of network, with good topological properties and high communication efficiency.
Then, the performance and routing efficiency of HDRN (k) are simulated. NS2 simulator is utilized to research its rate of successfully received data packets, end to end delay, network overhead and other issues. According to the simulation of the network models and routing algorithms, this paper summarizes the current knowledge of simulation experiments, analyzes several network simulation tools and emphasizes on the analysis of NS2 simulator’s characteristic and step.
Finally, based on the research of the above-mentioned ruled network’s topologies, complex network’s evolution model is discussed, which established the foundation for the further research. For complex network, this paper introduces its development, application and significance, sums up its basic knowledge, and then emphasizes on the discussion of several revolution model.
引文
[1](西)JoséDuato,(美)Sudhakar Yalamanchili and Lionel Ni著;谢伦国,张民选,窦强等译,并行计算机互联网络技术:一种工程方法(Interconnection Networks-An Engineering Approach),北京,电子工业出版社,2004年4月,P1-29.
[2]I Foster,C.Kesselman,S.Tuecke. The Anatomy of the Grid:Enabling Scalable Virtual Organizations[J]. International J.Supercomputer Applications,2001,15(3):200-222.
[3]Rajkumar Buyya,Chee Shin Yeo,Srikumar Venugopal,James Broberg,and Ivona Brandic,Cloud Computing and Emerging IT Platforms: Vision,Hype,and Reality for Delivering Computing as the 5th Utility[J],Future Generation Computer Systems,2009,25(6):599-616.
[4]刘方爱.高效并行计算系统中的计算模型与通信网络[D].北京:中国科学院计算技术研究所,2001.
[5]陈亚文.互连网络及基于光互连的波长分配优化研究[D].济南:山东师范大学,2004.
[6]邢长明.基于因特网的资源共享模型及关键技术研究[D].济南:山东师范大学,2010.
[7]Stefan Saroiu, Krishna P.Gummadi, Steven D.Gribble. Measuring and analyzing the characteristics of Napster and Gnutella hosts. Springer-Verlag New York.Inc.2003:170-184P.
[8]P.Krishna Gummadi, Stefan Saroiu, Steven D.Gribble. A measurement Study of Napster and Gnutella as Examples of Peer-to-Peer File Sharing Systems. POSTER SESSION: Student posters from SIGCOMM 2001.2002:82P.
[9]Tuomas J.Lukka, Benja Fallenstein. Freenet-like GUIDs for Implementing Xanalogical Hypertext. Proceedings of the thirteenth ACM conference on Hypertext and hypermedia.2002:194-195P.
[10]Seungwon Shin, Jaeyeon Jung, Hari Balakrishnan. Malware Prevalence in the KaZaA File-sharing Network. Proceedings of the 6th ACM SIGCOMM conference on Internet measurement.2006:333-338P.
[11]Watts DJ, Strogatz SHCollective dynamics of‘small world’networks. Nature, 1998, 393(6684): 440-442.
[12]Barabasi AL,Albert R. Emergence of scaling in random networks. Seienee, 1999, 286(5439): 509-512.
[13]Wang X F. Complex networks: Topology dynamics and synchronization[J]. International Journal of Bifurcation and Chaos, 2002, 12(5):885-916.
[14]Newman M E J. The structure and function of complex networks[J].SIAM Review, 2003, 45(2):167-256.
[15]Zhao H, Chen M. Network topology inference based on delay variation[C].In: Proc.of the Int’l Conf. on Advanced Computer Control. Singapore,2009:772-776.
[16]章忠志.复杂网络的演化模型研究[D].大连:大连理工大学,2006.
[17]Ion Stoica, Robert Morris, David Liben-Nowell. Chord: a scalable peer-to-peer lookup protocol for internet applications[J].IEEE/ACM Transactions on Networking,2003,11(1):17-32.
[18]Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Schenker. A scalable content-addressable network[C]. SIGCOMM 2001: 161-172.
[19]Ben Y.Zhao, Ling Huang, Jeremy Stribling, Sean C.Rhea, Anthony D.Joseph, John Kubiatowicz. Tapestry: a resilient global-scale overlay for service deployment[J].IEEE Journal on Selected Areas in Communications.2004,22(1):41-53.
[20]李振华,陈贵海,邱彤庆.分点:无结构对等网络的拓扑关键点[J].软件学报,2008,19(9):2376-2388.
[21]冯国富,毛莺池,陆桑璐,陈道蓄.PeerRank:一种无结构P2P资源发现策略[J].软件学报,2006,17(5):1098-1106.
[22]牛继云.互连网络中的路由算法研究[D].西安:西安电子科技大学,2007.
[23]Liu Fang-Ai, Liu Zhi-Yong, Qiao Xiang-Zhen. A practical interconnection network RP(k) and its routing algorithms[J]. Science in China(Serial F),2001,44(6): 461-473.
[24]Das S.K., Baneriee A.K.. Embedding into hyper Petersen network: Yet another hypercube-like topology[J].Journal of VLSI Design, 1995, 2(4): 335-351.
[25]Yeh C H, Behrooz P. Routing and embeddings in cyclic Petersen network: an efficient extension of the Petersen graph. In: Proc of Int’l Conf on Parallel Processing, IEEE. Japan, 1999, 258-265.
[26]Saxena P.C., Gupta S., Rai J.. A delay optimal coterie on the k-dimensional folded Petersen graph[J]. Journal of Parallel Distributed Computing. 2003,63(11): 1026-1035.
[27]Liu Fang-Ai, Liu Zhi-Yong, Qiao Xiang-Zhen. A hierarchical network HRN and its routing algorithms. Chinese Journal of Computers, 2002,25(12): 1397-1404.
[28]王雷,林亚平,夏巍.双环Petersen图互联网络及路由算法.软件学报,2006,17(5):1115-1123.
[29]Han J, Watson D, Jahanian F. Topology aware overlay networks[C]. In: Makki K, Knightly E, eds. Proc. Of the IEEE INFOCOM. Piscataway: IEEE, 2005:2554-2565.
[30]Fei T, Tao S, Gao LX, Guérin R. How to select a good alternate path in large peer-to-peer systems[C].In: Domingo-Pascual J, ed.Proc.of the IEEE INFOCOM 2006. Piscataway: IEEE, 2006.1-13.
[31]王雷,林亚平,夏巍.双环Petersen图互联网络及路由算法[J].软件学报,2006,17(05):1115-1123.
[32]M.Zaharia, S.Keshav. Gossip-based search selection in hybrid peer-to-peer networks[J]. Concurrency and Computation: Practice and Experience, 2008, 20(2):139-153.
[33]Costa P, Mascolo C, Musolesi M, Picco GP. Socially-Aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks[J].IEEE Journal of Selected Areas in Communication,2008,26(5):748-760.
[34]Han H, Shakkottai S, Hollot CV, Srikant R, Towsley D. Multi-Path TCP:A joint congestion control and routing scheme to exploit path diversity in the internet[J].IEEE/ACM Trans.on Networking,2006,16(6):1260-1271.
[35]Andrew S. Tanenbaum著, Computer networks(third edition),Prentice Hall International,Inc.,熊桂喜、王小虎译,计算机网络(第三版),清华大学出版社,2001年8月,P263-302.
[36]宋莹.互连网络中通信模式及路由算法研究[D].济南:山东师范大学,2005.
[37]Andrew S. tanenbaum, Computer Networks[M],Pearson Education,2002.
[38]成培.P2P对等网络资源定位技术的研究[D].长沙:湖南大学,2008.
[39]Waldvgel M, Rinaldi R. Efficient topology-aware overlay network. ACM SIGCOMM Computer Communication Review,2003,33(1):101-106.
[40]Zhu Y, Hu Y. Efficient Proximity-aware load balancing for DHT-based P2P systems.IEEE Trans on Parallel and Distributed Systems, 2005, 16(4): 349-361.
[41]S.Ramasamy, S.Shenker, I.Stoics. Routing Algorithms for DHTs: Some Open Questions. In:Proc of the 1st international Workshop on Peer-to-Peer Systems (IPTPS'02). Massachusetts, 2002,45-52.
[42]石丽.基于Chord的层次式P2P网络模型的研究[D].大连:大连交通大学,2008.
[43]熊伟.结构化对等网络路由机制关键技术研究[D].长沙:湖南大学,2008.
[44]王雷,林亚平,陈治平.基于Petersen图互连的超立方体网络及其路由算法.系统仿真学报,2007,19(6):1339-1343.
[45]邵美晶. P2P网络关键技术研究与应用[D].哈尔滨:哈尔滨工程大学,2009.
[46]徐雷鸣,庞博,赵耀. NS与网络模拟[M],人民邮电出版社,2003.9:43-56.
[47]p2psim.http://pdos.csail.mit.edu/p2psim,2002-05-12.
[48]唐焱.对等网络开发技术研究-利用异构性构建P2P系统[D].西安:西北工业大学,2005, 34-42.
[49]吴金闪,狄增如.从统计物理学看复杂网络的研究[J].南京:物理学进展,2004,24(1): 19-46.
[50]汪小帆,李翔,陈关荣.复杂网络理论及其研究[D].北京:清华大学出版社,2005.
[51]Maslov S,Sneppen,K. Specificity and stability in topology of protein networks.Seienee,2002,296:910-913.
[52]Pastor-Satorras R, Vespignani A. Dynamical and correlation properties of the Internet.Physical Review E, 2002,65:066130.
[53]Barthelemy M. Betweenness centrality in large complex networks. The European Physical Journal B,2004,38:163-168.
[54]Girvan M,Newman MEJ. Community structure in social and biological network. Proc. Natl. Acad. Sci.USA,2002,99(12):7821-7826.
[55]Newman MEJ,Givan M. Finding and evaluating community structure in networks.Physical Review E,2004.
[56]Bollobas B,Riordan O. Mathematical results on scale-free random graphs. Berlin: Wiley-VCH,2003,1-34.
[57]Fronczak A,Fronczak P,Holyst JA.,Mean-field theory for clustering coefficients in Barabasi-Albert networks,Phys.Rev.E,2003,68:046126.
[58]Albert R,Barabasi A-L. Topology of evolving networks:Local events and university.Physical Review Letters 2000,85:5234-5237.
[59]Bianconi G,Barabasi A-L. Competition and multi-scaling in evolving networks. Europhys. Lett.2001,54:436-442.
[60]Szabo G,Alava M,Kertesz J.Structural transitions in scale-free networks. Physical Review E,2003,67:056102.
[61]Barrat A,Barthelemy M,Vespignani A. Weighted evolving networks: Coupling topology and weighted dynamics. Physical Review Letters,2004,92:228701.
[62]Zhang Zhongzhi,Rong Lili. Deterministic scale-free networks created in a recursive manner. International Conference on Communication Circuits and Systems 2006,Guilin China,2006:2683-2686.
[63]Dorogovtsev SN,Goltsev AV,Mendes JFF.Pseudofractal scale-free properties,Physical Review E,2004,65:066122.
[2]I Foster,C.Kesselman,S.Tuecke. The Anatomy of the Grid:Enabling Scalable Virtual Organizations[J]. International J.Supercomputer Applications,2001,15(3):200-222.
[3]Rajkumar Buyya,Chee Shin Yeo,Srikumar Venugopal,James Broberg,and Ivona Brandic,Cloud Computing and Emerging IT Platforms: Vision,Hype,and Reality for Delivering Computing as the 5th Utility[J],Future Generation Computer Systems,2009,25(6):599-616.
[4]刘方爱.高效并行计算系统中的计算模型与通信网络[D].北京:中国科学院计算技术研究所,2001.
[5]陈亚文.互连网络及基于光互连的波长分配优化研究[D].济南:山东师范大学,2004.
[6]邢长明.基于因特网的资源共享模型及关键技术研究[D].济南:山东师范大学,2010.
[7]Stefan Saroiu, Krishna P.Gummadi, Steven D.Gribble. Measuring and analyzing the characteristics of Napster and Gnutella hosts. Springer-Verlag New York.Inc.2003:170-184P.
[8]P.Krishna Gummadi, Stefan Saroiu, Steven D.Gribble. A measurement Study of Napster and Gnutella as Examples of Peer-to-Peer File Sharing Systems. POSTER SESSION: Student posters from SIGCOMM 2001.2002:82P.
[9]Tuomas J.Lukka, Benja Fallenstein. Freenet-like GUIDs for Implementing Xanalogical Hypertext. Proceedings of the thirteenth ACM conference on Hypertext and hypermedia.2002:194-195P.
[10]Seungwon Shin, Jaeyeon Jung, Hari Balakrishnan. Malware Prevalence in the KaZaA File-sharing Network. Proceedings of the 6th ACM SIGCOMM conference on Internet measurement.2006:333-338P.
[11]Watts DJ, Strogatz SHCollective dynamics of‘small world’networks. Nature, 1998, 393(6684): 440-442.
[12]Barabasi AL,Albert R. Emergence of scaling in random networks. Seienee, 1999, 286(5439): 509-512.
[13]Wang X F. Complex networks: Topology dynamics and synchronization[J]. International Journal of Bifurcation and Chaos, 2002, 12(5):885-916.
[14]Newman M E J. The structure and function of complex networks[J].SIAM Review, 2003, 45(2):167-256.
[15]Zhao H, Chen M. Network topology inference based on delay variation[C].In: Proc.of the Int’l Conf. on Advanced Computer Control. Singapore,2009:772-776.
[16]章忠志.复杂网络的演化模型研究[D].大连:大连理工大学,2006.
[17]Ion Stoica, Robert Morris, David Liben-Nowell. Chord: a scalable peer-to-peer lookup protocol for internet applications[J].IEEE/ACM Transactions on Networking,2003,11(1):17-32.
[18]Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Schenker. A scalable content-addressable network[C]. SIGCOMM 2001: 161-172.
[19]Ben Y.Zhao, Ling Huang, Jeremy Stribling, Sean C.Rhea, Anthony D.Joseph, John Kubiatowicz. Tapestry: a resilient global-scale overlay for service deployment[J].IEEE Journal on Selected Areas in Communications.2004,22(1):41-53.
[20]李振华,陈贵海,邱彤庆.分点:无结构对等网络的拓扑关键点[J].软件学报,2008,19(9):2376-2388.
[21]冯国富,毛莺池,陆桑璐,陈道蓄.PeerRank:一种无结构P2P资源发现策略[J].软件学报,2006,17(5):1098-1106.
[22]牛继云.互连网络中的路由算法研究[D].西安:西安电子科技大学,2007.
[23]Liu Fang-Ai, Liu Zhi-Yong, Qiao Xiang-Zhen. A practical interconnection network RP(k) and its routing algorithms[J]. Science in China(Serial F),2001,44(6): 461-473.
[24]Das S.K., Baneriee A.K.. Embedding into hyper Petersen network: Yet another hypercube-like topology[J].Journal of VLSI Design, 1995, 2(4): 335-351.
[25]Yeh C H, Behrooz P. Routing and embeddings in cyclic Petersen network: an efficient extension of the Petersen graph. In: Proc of Int’l Conf on Parallel Processing, IEEE. Japan, 1999, 258-265.
[26]Saxena P.C., Gupta S., Rai J.. A delay optimal coterie on the k-dimensional folded Petersen graph[J]. Journal of Parallel Distributed Computing. 2003,63(11): 1026-1035.
[27]Liu Fang-Ai, Liu Zhi-Yong, Qiao Xiang-Zhen. A hierarchical network HRN and its routing algorithms. Chinese Journal of Computers, 2002,25(12): 1397-1404.
[28]王雷,林亚平,夏巍.双环Petersen图互联网络及路由算法.软件学报,2006,17(5):1115-1123.
[29]Han J, Watson D, Jahanian F. Topology aware overlay networks[C]. In: Makki K, Knightly E, eds. Proc. Of the IEEE INFOCOM. Piscataway: IEEE, 2005:2554-2565.
[30]Fei T, Tao S, Gao LX, Guérin R. How to select a good alternate path in large peer-to-peer systems[C].In: Domingo-Pascual J, ed.Proc.of the IEEE INFOCOM 2006. Piscataway: IEEE, 2006.1-13.
[31]王雷,林亚平,夏巍.双环Petersen图互联网络及路由算法[J].软件学报,2006,17(05):1115-1123.
[32]M.Zaharia, S.Keshav. Gossip-based search selection in hybrid peer-to-peer networks[J]. Concurrency and Computation: Practice and Experience, 2008, 20(2):139-153.
[33]Costa P, Mascolo C, Musolesi M, Picco GP. Socially-Aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks[J].IEEE Journal of Selected Areas in Communication,2008,26(5):748-760.
[34]Han H, Shakkottai S, Hollot CV, Srikant R, Towsley D. Multi-Path TCP:A joint congestion control and routing scheme to exploit path diversity in the internet[J].IEEE/ACM Trans.on Networking,2006,16(6):1260-1271.
[35]Andrew S. Tanenbaum著, Computer networks(third edition),Prentice Hall International,Inc.,熊桂喜、王小虎译,计算机网络(第三版),清华大学出版社,2001年8月,P263-302.
[36]宋莹.互连网络中通信模式及路由算法研究[D].济南:山东师范大学,2005.
[37]Andrew S. tanenbaum, Computer Networks[M],Pearson Education,2002.
[38]成培.P2P对等网络资源定位技术的研究[D].长沙:湖南大学,2008.
[39]Waldvgel M, Rinaldi R. Efficient topology-aware overlay network. ACM SIGCOMM Computer Communication Review,2003,33(1):101-106.
[40]Zhu Y, Hu Y. Efficient Proximity-aware load balancing for DHT-based P2P systems.IEEE Trans on Parallel and Distributed Systems, 2005, 16(4): 349-361.
[41]S.Ramasamy, S.Shenker, I.Stoics. Routing Algorithms for DHTs: Some Open Questions. In:Proc of the 1st international Workshop on Peer-to-Peer Systems (IPTPS'02). Massachusetts, 2002,45-52.
[42]石丽.基于Chord的层次式P2P网络模型的研究[D].大连:大连交通大学,2008.
[43]熊伟.结构化对等网络路由机制关键技术研究[D].长沙:湖南大学,2008.
[44]王雷,林亚平,陈治平.基于Petersen图互连的超立方体网络及其路由算法.系统仿真学报,2007,19(6):1339-1343.
[45]邵美晶. P2P网络关键技术研究与应用[D].哈尔滨:哈尔滨工程大学,2009.
[46]徐雷鸣,庞博,赵耀. NS与网络模拟[M],人民邮电出版社,2003.9:43-56.
[47]p2psim.http://pdos.csail.mit.edu/p2psim,2002-05-12.
[48]唐焱.对等网络开发技术研究-利用异构性构建P2P系统[D].西安:西北工业大学,2005, 34-42.
[49]吴金闪,狄增如.从统计物理学看复杂网络的研究[J].南京:物理学进展,2004,24(1): 19-46.
[50]汪小帆,李翔,陈关荣.复杂网络理论及其研究[D].北京:清华大学出版社,2005.
[51]Maslov S,Sneppen,K. Specificity and stability in topology of protein networks.Seienee,2002,296:910-913.
[52]Pastor-Satorras R, Vespignani A. Dynamical and correlation properties of the Internet.Physical Review E, 2002,65:066130.
[53]Barthelemy M. Betweenness centrality in large complex networks. The European Physical Journal B,2004,38:163-168.
[54]Girvan M,Newman MEJ. Community structure in social and biological network. Proc. Natl. Acad. Sci.USA,2002,99(12):7821-7826.
[55]Newman MEJ,Givan M. Finding and evaluating community structure in networks.Physical Review E,2004.
[56]Bollobas B,Riordan O. Mathematical results on scale-free random graphs. Berlin: Wiley-VCH,2003,1-34.
[57]Fronczak A,Fronczak P,Holyst JA.,Mean-field theory for clustering coefficients in Barabasi-Albert networks,Phys.Rev.E,2003,68:046126.
[58]Albert R,Barabasi A-L. Topology of evolving networks:Local events and university.Physical Review Letters 2000,85:5234-5237.
[59]Bianconi G,Barabasi A-L. Competition and multi-scaling in evolving networks. Europhys. Lett.2001,54:436-442.
[60]Szabo G,Alava M,Kertesz J.Structural transitions in scale-free networks. Physical Review E,2003,67:056102.
[61]Barrat A,Barthelemy M,Vespignani A. Weighted evolving networks: Coupling topology and weighted dynamics. Physical Review Letters,2004,92:228701.
[62]Zhang Zhongzhi,Rong Lili. Deterministic scale-free networks created in a recursive manner. International Conference on Communication Circuits and Systems 2006,Guilin China,2006:2683-2686.
[63]Dorogovtsev SN,Goltsev AV,Mendes JFF.Pseudofractal scale-free properties,Physical Review E,2004,65:066122.