基于流言机制的自组织Overlay组播拓扑优化方法研究
|
摘要
军事环境下大规模的组播数据分发对于未来信息化战争具有重要的作用。现代军事通信环境具有规模大、动态性强、异构、服务质量要求高的特点,尤其是特殊的战场环境造成了军事通信网络强烈的动态性,极大地超越了传统网络技术所能管理的极限。在应用层实现的overlay组播数据分发技术可以更好地完成军事环境下的大规模数据分发任务。通过在物理网络之上构建特定的overlay网络,可以在网络的可靠性、抗毁性、灵活性方面提供更多的支持,实现更复杂地协同通信。
同时反观生物网络等自然网络系统,虽然其规模巨大,但是面对诸多突发事故具有灵活的处理能力。通过引入自然网络系统中的适应性特征来改进军事通信网络,可以使网络面对复杂环境具有强自组织、自适应能力。本文采用从流行病传播理论发展而来的流言(Gossip)机制作为overlay拓扑组织和管理的主要手段,对overlay组播拓扑进行优化,增强其面对复杂环境的适应能力。通过分析,非结构化overlay网络和网络编码相结合的方法更适合于完成军事环境下overlay组播数据分发任务,本文对该方法中涉及的拓扑优化问题进行了阐述,选择军事应用背景下亟待解决的几个关键环节进行了优化研究。
(1)基于自适应gossip机制的快速overlay拓扑收敛机制的研究。
采用gossip机制维护的非结构化overlay拓扑能够随着网络状况的变化及时调整拓扑结构,根据不同的网络状况收敛到不同的状态。Overlay网络拓扑的收敛速度的快慢反映出overlay网络面对动态环境的适应程度,收敛速度越快,适应程度越好。本文通过分析overlay拓扑收敛过程中结点的行为特征,分析了固定周期gossip报文交换的弊端,提出了一种自适应周期的gossip报文交换机制代替固定周期方式。该机制减少了报文交换中的盲目性,节省了网络资源和提高了数据交换的效率,从而允许部分结点在局部加快数据交换的频率,最终提高overlay拓扑的收敛速度。
(2)自组织overlay拓扑演化中的连通性保证研究。
保证网络的连通性是overlay拓扑管理的一项重要任务。非结构化的overlay拓扑在网络状况发生变化时,通过改变邻居列表,达成与物理网络拓扑匹配的目的,使得overlay网络本身具有良好的灵活性。本文分析了基于gossip机制的overlay拓扑管理方法中overlay拓扑的演化过程,发现真实网络所具有的地域特征和非结构化overlay拓扑的邻居择优策略,可能在overlay拓扑的演化过程中导致拓扑的连通性遭到破坏。通过分析网络连通性被破坏的主要机理,本文提出了一种能够在拓扑演化的同时保证连通性的连接置换算法。而且,通过将各种单一的拓扑管理方法相结合,提出了多邻居列表的非结构化网络成员管理方法,并基于连接置换算法,建立了一个多邻居列表成员管理方法的实例C-MLMM,该方法能够在保证网络拓扑演化速度的同时,保证网络拓扑的连通性。
(3)基于gossip机制的分布式网络编码拓扑构建方法研究。
网络编码组播方法能够在动态环境中提供较多的结点容错性支持。传统的大多数网络编码构造方法要么需要全局的拓扑知识,要么需要使用较多结点参与编码,对结点的计算能力消耗巨大。军事通信网络环境要求一种资源利用更为有效的分布式网络编码构造方法。本文通过将网络编码方案分解为几个基本的数据“请求—响应”过程,总结出各种类型结点在构成网络编码方案中所进行的典型行为,利用gossip机制的局部信息获取能力,提出了一种以自组织方式构造网络编码方案的分布式方法。该方法相对于随机编码方式,资源利用率更高。通过仿真,在取得相似网络吞吐量的前提下,该方法只使用了约10%的结点参与编码。
(4)编码超级结点的动态选择和维护策略的研究。
网络编码组播中的编码结点需要付出额外的计算能力,通过动态地在网络中维护一定数量能力较强的超级结点,优先作为候选的编码结点,可以避免编码结点能力不足负载过量造成网络故障。本文通过研究用于编码的超级结点存在的特殊性,使用gossip机制作为基本手段,提出了一种适用于网络编码组播的动态超级结点选择和维护策略。
(5)多个网络编码组播组资源共享和竞争的相关问题分析。
军事通信网络应用中包括了多种不同的网络服务,服务的共存导致了一部分资源共享和竞争的问题。本文分析了在网络编码组播这种特定的应用模式下,overlay层次多服务共存的特殊性。为了共享不同组播组之间的资源,提出了基于服务无关性的统一overlay成员管理方法;对不同共享模式下的资源竞争,进行了博弈分析,分析发现:为了更好地促进资源的共享,有必要引入一定的网络信任机制。
总的说来,本文以复杂军事环境下的大规模数据分发为应用背景,采用gossip机制作为网络拓扑组织和管理的基本手段,对军事环境下overlay组播拓扑优化中亟待解决的几个关键问题进行了研究,为增强军事通信网络的数据获取和分发能力奠定了良好的基础。
Large-scale multicast data distribution under military circumstances plays an important role in future information warfare. Modern military communication is featured with large scale, drastic dynamics, heterogeneity and high QoS demand. In particular, the combat environment brings about drastic dynamics in military network, which far overruns the limit of conventional network management. Employing overlay multicast data distribution on application layer can better complete the large-scale data distribuition task in military evironment. By employing the overlay networks built on top of physical network, we can get more support in aspects of robustness and flexibility, thus providing the communication networks with better adaptability in complex and dynamic environment.
In contrast, some natural networks like the biological network, though giant in size, have strong adaptation to cope with various emergencies. Introducing the adaptation of natural network into military communication network can equip the latter with better adaptation. The thesis applies gossip mechanism developed from theory of epidemic spread as the major approach to construct and manage overlay topology, and optimizes the multicast overlay topology. The thesis takes the combination of unstructured overlay network and network coding as the main method to realize overlay multicast data distribution in military environment, elaborates on the topology optimization involved in this method, studies several unsolved yet urgent key issues in military application and proposes effective solutions.
(1) Study of the quick overlay topology convergent mechanism based on self-adaptive gossip
Gossip-based unstructured overlay topology can adjust itself with the network environment change, enabling the overlay topology to converge to different structures. The topology convergent speed reflects the adaptability of overlay network in dynamic environment. The faster the convergence is, the better the adaptablility is. This paper analyzed the node behavior characteristics in the convergence process and found the flaw of fixed cycle gossip. Then the paper proposed an adaptive cycle mechanism to control the exchange of gossip packets. This mechanism can improve the data exchange efficiency and save the network resource so that some nodes can accelerate the data exchange locally and therefore the convergence speed of overlay topology is increased.
(2) Study of connectedness in self-organizing overlay network evolving
Guaranteeing the connectedness of network is an important task in overlaytopology management. The unstructured overlay topology management changes the nodes neighbor lists to match the change of underlying physical network. This paper analyzed the overlay topology evolving process in overlay topology management methods based on gossip mechanism and found the local-area characteristics of actual network and neighbor selection strategy of nodes in unstructured topology may break network connectedness of overlay topology. After analyzing the key factor of breaking connectedness, the paper proposed a simple yet convenient links replacement algorithm based on local connected domain optimization. Furthermore, by combining different simplex topology management mechanisms, the paper presented Multiple Lists Membership Management (MLMM) and gave an example based on MLMM, C-MLMM, which showed the efficiency of MLMM in assuring topology convergence speed and network connectedness as well.
(3) Study of distributed network coding construction based on gossip
Previous centralized approaches on network coding construction need global topology knowledge and are difficult to be practically used in large-scale or dynamic network. And the randomized network coding approach is a practical distributed network coding approach, but it employs all nodes to code and consumes enormous computing power. However, the data distribution in military communication network demands a more effective distributed network coding construction approach. Hence this paper decomposed the network coding solution into several basic "request-respond" processes, summarized the typical behavior of different kinds of nodes in the network coding scheme. Then applying gossip mechanism that can obtain the adjacent node information quickly, the paper proposed a distributed network coding construction approach with much fewer coding nodes. Simulation showed that this approach has excellent performance, which achieves the approximate throughput compared with distributed Randomized Network Coding, but only employing about 10% of nodes to code.
(4) Study on dynamic selection and maintenance of coding supernode
In the network coding multicast solution, coding nodes need consume extra computing power. Nodes with stronger abilities may be chosen as candidates for coding, called Supernodes. The prior usage of supernodes in network coding can avoid overload or breakdown caused by the inability of coding nodes. This paper analyzed the characteristics of the supernodes for network coding and presented a dynamic supernode selection and maintenance policy applying gossip mechanism. The policy is proved to suit for network coding multicast.
(5) Study of resource sharing and competition among multiple sessions in network coding multicast
There are different network services in military communication application and the problem of resource sharing and competition is inevasible. This paper analyzed the specific characteristics of resource sharing and competition in network coding multicast. To share resources among multiple sessions efficiently, a general integrated membership management approach was presented. Then games theory was used to study resource competition behavior in different sharing models and the paper found the necessity of introducing certain trust mechanism to improve resource sharing.
In a word, the thesis studied large-scale data distribution in the complex and highly dynamic military environment, proposed a data distribution multicast scheme combing gossip-based unstructured overlay topology and network coding suitable for military application, and thus laid sound foundation for the capability improvement on data acquisition and distribution in military communication network.
同时反观生物网络等自然网络系统,虽然其规模巨大,但是面对诸多突发事故具有灵活的处理能力。通过引入自然网络系统中的适应性特征来改进军事通信网络,可以使网络面对复杂环境具有强自组织、自适应能力。本文采用从流行病传播理论发展而来的流言(Gossip)机制作为overlay拓扑组织和管理的主要手段,对overlay组播拓扑进行优化,增强其面对复杂环境的适应能力。通过分析,非结构化overlay网络和网络编码相结合的方法更适合于完成军事环境下overlay组播数据分发任务,本文对该方法中涉及的拓扑优化问题进行了阐述,选择军事应用背景下亟待解决的几个关键环节进行了优化研究。
(1)基于自适应gossip机制的快速overlay拓扑收敛机制的研究。
采用gossip机制维护的非结构化overlay拓扑能够随着网络状况的变化及时调整拓扑结构,根据不同的网络状况收敛到不同的状态。Overlay网络拓扑的收敛速度的快慢反映出overlay网络面对动态环境的适应程度,收敛速度越快,适应程度越好。本文通过分析overlay拓扑收敛过程中结点的行为特征,分析了固定周期gossip报文交换的弊端,提出了一种自适应周期的gossip报文交换机制代替固定周期方式。该机制减少了报文交换中的盲目性,节省了网络资源和提高了数据交换的效率,从而允许部分结点在局部加快数据交换的频率,最终提高overlay拓扑的收敛速度。
(2)自组织overlay拓扑演化中的连通性保证研究。
保证网络的连通性是overlay拓扑管理的一项重要任务。非结构化的overlay拓扑在网络状况发生变化时,通过改变邻居列表,达成与物理网络拓扑匹配的目的,使得overlay网络本身具有良好的灵活性。本文分析了基于gossip机制的overlay拓扑管理方法中overlay拓扑的演化过程,发现真实网络所具有的地域特征和非结构化overlay拓扑的邻居择优策略,可能在overlay拓扑的演化过程中导致拓扑的连通性遭到破坏。通过分析网络连通性被破坏的主要机理,本文提出了一种能够在拓扑演化的同时保证连通性的连接置换算法。而且,通过将各种单一的拓扑管理方法相结合,提出了多邻居列表的非结构化网络成员管理方法,并基于连接置换算法,建立了一个多邻居列表成员管理方法的实例C-MLMM,该方法能够在保证网络拓扑演化速度的同时,保证网络拓扑的连通性。
(3)基于gossip机制的分布式网络编码拓扑构建方法研究。
网络编码组播方法能够在动态环境中提供较多的结点容错性支持。传统的大多数网络编码构造方法要么需要全局的拓扑知识,要么需要使用较多结点参与编码,对结点的计算能力消耗巨大。军事通信网络环境要求一种资源利用更为有效的分布式网络编码构造方法。本文通过将网络编码方案分解为几个基本的数据“请求—响应”过程,总结出各种类型结点在构成网络编码方案中所进行的典型行为,利用gossip机制的局部信息获取能力,提出了一种以自组织方式构造网络编码方案的分布式方法。该方法相对于随机编码方式,资源利用率更高。通过仿真,在取得相似网络吞吐量的前提下,该方法只使用了约10%的结点参与编码。
(4)编码超级结点的动态选择和维护策略的研究。
网络编码组播中的编码结点需要付出额外的计算能力,通过动态地在网络中维护一定数量能力较强的超级结点,优先作为候选的编码结点,可以避免编码结点能力不足负载过量造成网络故障。本文通过研究用于编码的超级结点存在的特殊性,使用gossip机制作为基本手段,提出了一种适用于网络编码组播的动态超级结点选择和维护策略。
(5)多个网络编码组播组资源共享和竞争的相关问题分析。
军事通信网络应用中包括了多种不同的网络服务,服务的共存导致了一部分资源共享和竞争的问题。本文分析了在网络编码组播这种特定的应用模式下,overlay层次多服务共存的特殊性。为了共享不同组播组之间的资源,提出了基于服务无关性的统一overlay成员管理方法;对不同共享模式下的资源竞争,进行了博弈分析,分析发现:为了更好地促进资源的共享,有必要引入一定的网络信任机制。
总的说来,本文以复杂军事环境下的大规模数据分发为应用背景,采用gossip机制作为网络拓扑组织和管理的基本手段,对军事环境下overlay组播拓扑优化中亟待解决的几个关键问题进行了研究,为增强军事通信网络的数据获取和分发能力奠定了良好的基础。
Large-scale multicast data distribution under military circumstances plays an important role in future information warfare. Modern military communication is featured with large scale, drastic dynamics, heterogeneity and high QoS demand. In particular, the combat environment brings about drastic dynamics in military network, which far overruns the limit of conventional network management. Employing overlay multicast data distribution on application layer can better complete the large-scale data distribuition task in military evironment. By employing the overlay networks built on top of physical network, we can get more support in aspects of robustness and flexibility, thus providing the communication networks with better adaptability in complex and dynamic environment.
In contrast, some natural networks like the biological network, though giant in size, have strong adaptation to cope with various emergencies. Introducing the adaptation of natural network into military communication network can equip the latter with better adaptation. The thesis applies gossip mechanism developed from theory of epidemic spread as the major approach to construct and manage overlay topology, and optimizes the multicast overlay topology. The thesis takes the combination of unstructured overlay network and network coding as the main method to realize overlay multicast data distribution in military environment, elaborates on the topology optimization involved in this method, studies several unsolved yet urgent key issues in military application and proposes effective solutions.
(1) Study of the quick overlay topology convergent mechanism based on self-adaptive gossip
Gossip-based unstructured overlay topology can adjust itself with the network environment change, enabling the overlay topology to converge to different structures. The topology convergent speed reflects the adaptability of overlay network in dynamic environment. The faster the convergence is, the better the adaptablility is. This paper analyzed the node behavior characteristics in the convergence process and found the flaw of fixed cycle gossip. Then the paper proposed an adaptive cycle mechanism to control the exchange of gossip packets. This mechanism can improve the data exchange efficiency and save the network resource so that some nodes can accelerate the data exchange locally and therefore the convergence speed of overlay topology is increased.
(2) Study of connectedness in self-organizing overlay network evolving
Guaranteeing the connectedness of network is an important task in overlaytopology management. The unstructured overlay topology management changes the nodes neighbor lists to match the change of underlying physical network. This paper analyzed the overlay topology evolving process in overlay topology management methods based on gossip mechanism and found the local-area characteristics of actual network and neighbor selection strategy of nodes in unstructured topology may break network connectedness of overlay topology. After analyzing the key factor of breaking connectedness, the paper proposed a simple yet convenient links replacement algorithm based on local connected domain optimization. Furthermore, by combining different simplex topology management mechanisms, the paper presented Multiple Lists Membership Management (MLMM) and gave an example based on MLMM, C-MLMM, which showed the efficiency of MLMM in assuring topology convergence speed and network connectedness as well.
(3) Study of distributed network coding construction based on gossip
Previous centralized approaches on network coding construction need global topology knowledge and are difficult to be practically used in large-scale or dynamic network. And the randomized network coding approach is a practical distributed network coding approach, but it employs all nodes to code and consumes enormous computing power. However, the data distribution in military communication network demands a more effective distributed network coding construction approach. Hence this paper decomposed the network coding solution into several basic "request-respond" processes, summarized the typical behavior of different kinds of nodes in the network coding scheme. Then applying gossip mechanism that can obtain the adjacent node information quickly, the paper proposed a distributed network coding construction approach with much fewer coding nodes. Simulation showed that this approach has excellent performance, which achieves the approximate throughput compared with distributed Randomized Network Coding, but only employing about 10% of nodes to code.
(4) Study on dynamic selection and maintenance of coding supernode
In the network coding multicast solution, coding nodes need consume extra computing power. Nodes with stronger abilities may be chosen as candidates for coding, called Supernodes. The prior usage of supernodes in network coding can avoid overload or breakdown caused by the inability of coding nodes. This paper analyzed the characteristics of the supernodes for network coding and presented a dynamic supernode selection and maintenance policy applying gossip mechanism. The policy is proved to suit for network coding multicast.
(5) Study of resource sharing and competition among multiple sessions in network coding multicast
There are different network services in military communication application and the problem of resource sharing and competition is inevasible. This paper analyzed the specific characteristics of resource sharing and competition in network coding multicast. To share resources among multiple sessions efficiently, a general integrated membership management approach was presented. Then games theory was used to study resource competition behavior in different sharing models and the paper found the necessity of introducing certain trust mechanism to improve resource sharing.
In a word, the thesis studied large-scale data distribution in the complex and highly dynamic military environment, proposed a data distribution multicast scheme combing gossip-based unstructured overlay topology and network coding suitable for military application, and thus laid sound foundation for the capability improvement on data acquisition and distribution in military communication network.
引文
[1]David S.Alberts,James Moffat等著,郁军,贲可荣等译.网络中心战与复杂性理论.北京:电子工业出版社.2004.
[2]S.E.Deering and D.R.Cheriton.Multicast routing in datagram internetworks and extended LANs.ACM Trans.on Computer Systems,1990,885-110.
[3]Yang-hua Chu,S.G.Rao,S.Seshan and Hui Zhang.A case for end system multicast.IEEE Journal on Selected Areas in Communications,2002,20(8):1456-1471.
[4]Mohamed Hefeeda,Ahsan Habib,Boyan Botev,Dongyan Xu and Bharat Bhargava.PROMISE:Peer-To-Peer Media Streaming Using Collectcast.ACM Multimedia(MM'03),Berkeley,California,USA,2003.
[5]De-Kai Liu and Ren-Hung Hwang.A P2P hierarchical clustering live video streaming system.2003,115-120.
[6]Zhi Li and Yongjoo Shin.Survey of Overlay Multicast Technology.UCD Technical Report,http://networks.cs.ucdavis.edu/～lizhi/papers/ECS289.pdf.2002.
[7]C.K.Yeo,B.S.Leea and M.H.Er.A survey of application level multicast techniques.Computer Communications,2004,27(15):1547-1568.
[8]Cristina Abad,William Yurcik and Roy H.Campbell.A Survey and Comparison of End-System Overlay Multicast Solutions Suitable for Network Centric Warfare.Proceedings of SPIE-The International Society for Optical Engineering,Battlespace Digitization and Network-Centric Systems Ⅳ,2004,215-226.
[9]Geoffrey Canright Ozalp Babaoglu,Andreas Deutsch,Gianni Di Caro,Frederick Ducatelle,Luca Gambardella,Niloy Ganguly,Mark Jelasity,Roberto Montemanni,and Alberto Montresor.Design Patterns from Biology for Distributed Computing.ACM Transactions on Autonomous and Adaptive Systems(TAAS),2006,1(1):26-66.
[10]BISON.http://www.cs.unibo.it/bison/.
[11]Geoffrey Canright Ozalp Babaoglu,Andreas Deutsch,Gianni Di Caro,Frederick Ducatelle,Luca Gambardella,Niloy Ganguly,Mark Jelasity,Roberto Montemanni,and Alberto Montresor.Design Patterns from Biology for Distributed Computing.Proceedings of the European Conference on Complex Systems,2005.
[12]Mark Jelasity,Raehid Guerraoui,Anne-Marie Kermarree and Maarten van Steen.The peer sampling service:Experimental evaluation of unstructured gossip-based implementations.Proceedings of the 5th International Middleware Conference,Toronto,Canada,2004.
[13]Spyros Voulgaris,Mark Jelasity and Maarten van Steen.A robust and scalable peer-to-peer gossiping protocol.Proceedings of the 2nd International Workshop on Agents and Peer-to-Peer Computing(AP2PC03),Melbourne,Australia,2003.
[14]Alberto Montresor.A robust protocol for building superpeer overlay topologies.Proceedings of the 4th International Conference on Peer-to-Peer Computing(P2P 2004) IEEE,Zurich,Switzerland,2004.
[15]Mark Jelasity and Ozalp Babaoglu.T-Man:Gossip-based overlay topology management.Proceedings of Engineering Self-Organising Applications (ESOA'05),Utrecht,Netherlands,2005.
[16]Alberto Montresor,Mark Jelasity and Ozalp Babaoglu.Chord on demand.Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing(P2P 2005),Konstanz,Germany,2005,87-94.
[17]Andrea Ceccanti and Gian Paolo Jesi.Building latency-aware overlay topologies with QuickPeer.In Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services(ICAS/ICNS 2005),2005.
[18]Mark Jelasity,Alberto Montresor and Ozalp Babaoglu.A modular paradigm for building self-organizing peer-to-peer applications.Giovanna Di Marzo Serugendo,Anthony Karageorgos,Omer F.Rana,and Franeo Zambonelli,editors,Engineering Self-Organising Systems:Nature-Inspired Approaches to Software Engineering,number 2977 in Lecture Notes in Artificial Intelligence,2004,265-282.
[19]Mark Jelasity and Alberto Montresor.Epidemic-style proactive aggregation in large overlay networks.Proceedings of the 24th International Conference on Distributed Computing Systems(ICDCS'04) IEEE Computer Society,2004,102-109.
[20]Niloy Ganguly,Geoff Canright and Andreas Deutsch.Design of a robust search algorithm for p2p networks.Proceedings of the 11th International Conference on High Performance Computing,Bangalore,India,2004.
[21]Niloy Ganguly,Lutz Brusch and Andreas Deutseh.Design and analysis of a bio-inspired search algorithm for peer-to-peer networks(Self-Star Properties in Complex Information Systems,volume 3460 of Lecture Notes in Computer Science.2005.
[22]AntHill.http://www.cs.unibo.it/projects/anthill/.
[23]Cosin.http://www.cosin.org/.
[24]DELLS.http://delis.upb.de/index.html.
[25]Exystence.http://www.complexityscience.org/index.php.
[26]Ion Stoica.Overlay Networks.In Lecture of UC Berkeley.
[27]David G.Andersen.Overlay Networks:Networking on Top of the Network.http://www.reviews.com/hottopic/,2004.
[28]Eng Keong Lua,Jon Crowcroft,Marcelo Pias,Ravi Sharma and Steven Lim.A survey and comparison of peer-to-peer overlay network schemes.Journal of IEEE Communications Surveys and Tutorials,2005,72-93.
[29]Mojtaba Hosseini,Dewan Tanvir Ahmed,Shervin Shirmohammadi and Nicolas D.Georganas.A Survey of Application-Layer Multicast Protocols.IEEE Communications Surveys & Tutorials,2007,9(3):58-74.
[30]Suman Banerjee and Bobby Bhattacharjee.A Comparative Study of Application Layer Multicast Protocols.Univ.Maryland,College Park,Tech.Rep.2002.
[31]J.Jannotti,D.K.Gifford and K.L.Johnson.Overcast:Reliable Multicasting with an Overlay Network.Oper.Syst.Des.Implement.(OSDI 2002),2000,197-212.
[32]C.K.Yeo,B.S.Lee and M.H.Er.A peering architecture for ubiquitous IP multicast streaming.ACM SIGOPS Oper.Syst.Rev.,2002,36(3):82-95.
[33]C.K.Yeo,B.S.Lee and M.H.Er.An overlay for ubiquitous streaming over Internet.the Second International IFIP-TC6 Networking Conference,2002,1239-1244.
[34]C.K.Yeo,B.S.Lee and M.H.Er.A framework for multicast video streaming over IP networks.J.Networks Comput.Applic.,2003,26(3):273-289.
[35]B.Zhang,S.Jamin and L.Zhang.Host multicast:a framework for delivering multicast to end users.INFOCOM 2002,2002.
[36]D.A.Helder and S.Jamin.Banana tree protocol,an end-host multicast protocol.Technical Report,University of Michigan,CSE-TR-429-00.2000.
[37]Miguel Castro,Peter Druschel,Anne-Marie Kermarrec and Animesh Nandi.SplitStream:High-bandwidth content distribution in cooperative environments.ACM SOSP,2003.
[38]Antony Rowstron and Peter Druschel.Pastry:Scalable,Decentralized Object Location,and Routing for Large-Scale Peer-to-Peer Systems.the 18th IFIP/ACM International Conference on Distributed Systems Platforms(Middleware 2001),2001,329-350.
[39]B.Y.Zhao,J.Kubiatowicz and A.D.Joseph.Tapestry:An Infrastructure for Fault-tolerant Wide-area Location and Routing.Technical Report CSD-01-1141,Computer Science Division,University of California,Berkeley,2001.
[40]S.Ratnasamy,M.Handley,R.Karp and S.Shenkar.Application-level multicast using content addressable networks,the Third International Workshop on Networked Group Communication(NGC),,2001,14-29.
[41]Sylvia Ratnasamy,Paul Francis,Mark Handley,Richard Karp and Scott Shenker.A Scalable Content-Addressable Network.SIGCOMM'01,2001.
[42]Y.Chu,S.G.Rao and H.Zhang.A case for end system multicast.ACM SIGMETRICS,2002,1-12.
[43]Y.D.Chawathe.Scattercast:an architecture for Internet broadcast distribution as an infrastructure service.PhD thesis,Stanford University.2000.
[44]D.Pendarakis,S.Shi,D.Verma and M.Waldvogel.ALMI:an Application Level Multicast Infrastructure.the Third Usenix Symposium on Internet Technologies and Systems(USITS),2001.
[45]Xinyan Zhang,Lin Jiang-chuan,Li Bo,Tak-Shing and P.Yum.Coolstreaming/DONet:a data-driven overlay network for peer-to-peer live media streaming.INFOCOM 2005.24th Annual Joint Conference of the IEEE Computer and Communications Societies.Proceedings IEEE,2005.
[46]A.Ganesh,A.-M.Kermarrec and L.Massoulie.Scamp:Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication.the Third International Workshop on Networked Group Communication,London,UK,2001,44-55.
[47]A.J.Ganesh,A.-M.Kermarrec and L.Massoulie.Peer-to-peer membership management for gossip-based protocols,52(2).IEEE Transactions on Computers(TC),2003,52(2).
[48]S.Banerjee,Kommareddy C,K.Kar,B.Bhattacharjee and S.Khulle.Construction of an efficient overlay multicast infrastructure for real-time applications.INFOCOM 2003,2003.
[49]P.Francis,Y.Pryadkin,P.Radoslavov,R.Govindan and B.Lindell.YOID:Your Own Internet Distribution.
[50]Venkata N.Padmanabhan,Helen J.Wang,Philip A.Chou and Kunwadee Sripanidkulchai.Distributing Streaming Media Content Using Cooperative Networking.ACM NOSSDAV'02,Miami,Florida,USA,2002.
[51]Shelley Q.Zhuang,Ben Y.Zhao,Anthony D.Joseph,Randy H.Katz and John D. Kubiatowicz.Bayeux:An Architecture for Scalable and Faulttolerant Widearea Data Dissemination.the Eleventh International Workshop on Network and Operating Systems Support for Digital Audio and Video(ACM/IEEE NOSSDAV),New York,2001.
[52]A.Rowstron,A.M.Kermarrec,M.Castro and P.Druschel.SCRIBE:the design of a large-scale event modification infrastructure the Third International Workshop on Networked Group Communication(NGC),2001.
[53]M.Castro,P.Druschel,A.-M.Kermarrec and A.Rowstron.SCRIBE:A large-scale and decentralized application-level multicast infrastructure.IEEE Jrnl.on Selected Areas in Communications(J-SAC),Sp.Issue on Network Support for Group Communication,2002.
[54]S.Jain,R.Mahajan,D.Wetherall,G.Borriello and S.D.Gribble.Scalable Self-Organizing Overlays.Technical report UW-CSE 02-02-02,University of Washington.2002.
[55]S.Banerjee,B.Bhattacharjee and C.Kommareddy.Scaleable application layer multicast.ACM SIGCOMM 2002,2002.
[56]徐恪,熊勇强,吴建平.对等网络研究综述.2002.
[57]罗杰文.Peer to Peer(P2P)综述.中科院计算技术研究所.2005.
[58]Napster Home Page.http://www.napster.com/.
[59]Scalable Distribute Data Structures.http://www.usenix.org/events/osdi2000/full_papers/gribble/gribble_html/dds.html.
[60]I.Stoica,R.Morris,D.Liben-Nowell,D.R.Karger,M.F.Kaashoek,F.Dabek and H Balakrishnan.Chord:a scalable peer-to-peer lookup protocol for Internet applications.IEEE/ACM Transactions on Networking(TON),2003,11(1):17-32.
[61]FIPS180-1.Secure Hash Standard.U.S.Department of Commerce/NIST,National Technical Information Service,Springfield,VA,1995.
[62]P.Maymounkov and D.Mazi'eres.Kademlia:A peer-to-peer information system based on the xor metric.Processings of the IPTPS 2002,Cambridge,MA,USA,2002,53-65.
[63]D.Malkhi,M.Naor and D.Ratajczak.Viceroy:a scalable and dynamic emulation of the butterfly.ACM PODC'02,Monterey,CA,USA,2002,183-192.
[64]Gnutella.http://gnutella.wego.com.
[65]P.Ganesan,Q.Sun and H.Garcia-Molina.Yappers:A peer-to-peer lookup service over arbitrary topology,the IEEE Infocom 2003,San Francisco,USA,2003.
[66]Q.Lv,S.Ratnasamy and S.Shenker.Can heterogeneity make gnutella scalable?the 1st International Workshop on Peerto-Peer Systems(IPTPS),Cambridge,MA,USA,2002.
[67]Yatin Chawathe,Sylvia Ratnasamy,Lee Breslau,Nick Lanham and Scott Shenker.Making gnutella-like p2p systems scalable.ACM SIGCOMM 2003,Karlsruhe,Germany,2003,407-418.
[68]A.Fisk.Gnutella ultrapeer query protocol v0.1.http://groups.yahoo.com/group /the_gdf/files/Proposals/Working Proposals/search/Ultrapeer QRP/ultrapeer_qrp.html,2003.
[69]I.Clarke,B.Wiley,O.Sanberg and T.Hong.Freenet:A Distributed Anonymous Information Storage and Retrieval System.Proceedings of International Workshop on Design Issues in Anonymity and Unobservability,2001.
[70]Fasttrack peer-to-peer technology company.http://www.fasttrack.nu/.
[71]Kazaa media desktop,http://www.kazaa.com/.
[72]The overnet file-sharing network,http://www.overnet.com.
[73]Overnet/edonkey2000.http://www.edonkey2000.com/.
[74]Kermaek,W.O.and A.G.Mckendrick.A Contribution to the Mathematical Theory of Epidemics.the Royal Society of London.A,Mathematical and Physical Sciences,1927.
[75]A.Demers.Epidemic algorithms for replicated database maintenance,the sixth annual ACM Symposium on Principles of distributed computing,Vancouver,British Columbia,Canada 1987.
[76]R.van Renesse,Y.Minsky and M.Hayden.A Gossip-Style Failure Detection Service.Middleware 98,New York,1998,55-70.
[77]R.van Renesse,K.P.Birman and W.Vogels.Astrolabe:A Robust and Scalable Technology for Distributed System Monitoring,Management,and Data Mining.ACM Transactions on Computer Systems,2003,21(2):164-206.
[78]JoAnne Holliday,Robert Steinke,Divyakant Agrawal and Amr El Abbadi.Epidemic Algorithms for Replicated Databases.IEEE Transactions on Knowledge and Data Engineering,2003,15(5):1218-1238.
[79]P.T.Eugster and R Guerraoui.Probabilistic multieast.Dependable Systems and Networks,2002.Proceedings.International Conference on,2002.
[80]P.Eugster,R.Guerraoui,S.Handurukande,A.-M.Kermarrec and P.Kouznetsov.Lightweight Probabilistie Broadcast.ACM Trans.on Computer Systems,2003,21(4):341-374.
[81]D.Pendarakis,S.Shi,D.Verma and M.Waldvogel.ALMI:An application level multieast infrastructure,the 3rd Usenix Symp on Internet Technologies and Sys(USITS 2001),2001.
[82]YOID:Your Own Internet Distribution.http://www.icir.org/yoid/.
[83]S.Banerjee,B.Bhattacharjee and C.Kommareddy.Scalable application layer multicast,the ACM SIGCOMM 2002,2002.
[84]J.Jannotti,D.K.Gifford,K.L.Johnson,M.F.Kaashoek and J.W.O'Toole.Overcast:Reliable multicasting with an overlay network,the 4th Usenix Symp.on Operating Sys.Design and Implementation(OSDI 2000),2000.
[85]Z.Li and P.Mohapatra.Hostcast:A new overlay multicasting protocol.IEEE 2003 Intl.Conf.on Communications(ICC 2003),2003.
[86]Goyal.Multiple description coding:compression meets the network.Signal Processing Magazine,IEEE,2001,18(5):74-93.
[87]Yao Wang,Michael T.Orchard and Vinay Vaishampayan.Multiple description coding using pairwise correlating transforms.IEEE Transactions on Image Processing,2001,10(3):351-366.
[88]Weatherspoon H and Kubiatowiez J.Erasure coding vs.replication:A quantitative comparison,the 1st Int'l Workshop on Peer-to-Peer Systems,2002,328-337.
[89]Gridmedia Project Website.http://www.gridmedia.com.cn/.
[90]M.Zhou and J.Liu.A hybrid overlay network for video-on-demand.IEEE International Conference on Communications(ICC'05),Seoul,Korea,2005.
[91]M.Zhou and J.Liu.Tree-assisted gossiping for overlay video distribution.Kluwer Multimedia Tools and Applications,2005.
[92]R.K.Ahujia,T.L.Magnanti and J.B.Orlin.Network Flows:Theory,Algorithms and Applications:Prentice-Hall.1993.
[93]Rudolf Ahlswede,Ning Cai,Shuo-Yen Robert Li and Raymond W.Yeung.Network Information Flow.IEEE Transaction on Information Theory,2000,461204-1216.
[94]Zongpeng Li,Baochun Li,Dan Jiang and Lap Chi Lau.On Achieving Optimal Throughput with Network Coding.IEEE INFOCOM 2005,Miami,Florida,USA,2005.
[95]Ralf Koetter and Muriel Medard.Beyond routing:an algebraic approach to network coding.INFOCOM 2002,2002,122_130.
[96]Ralf Koetter and Muriel Medard.An algebraic approach to network coding.IEEE/ACM Transactions on Networking,2003,782-795.
[97]Shuo-Yen Robert Li,Raymond W.Yeung and Ning Cai.Linear Network Coding.IEEE Trans.Information Theory,2003,49371-381.
[98]Peter Sanders,Sebastian Egner and Ludo Tolhuizen.Polynomial Time Algorithms for Network Information Flow.the 15th ACM Synposium on Parallel Algorithms and Architechtures(SPAA),San Diego,California,USA,2003,296-294.
[99]Sidharth Jaggi,Peter Sanders,Philip A.Chou,Michelle Effros,Sebastian Egner,Kamal Jain and Ludo M.G.M.Tolhuizen.Polynomial Time Algorithms for Multicast Network Code Construction.IEEE Transactions on Information Theory,2005,511973-1982.
[100]Tracey Ho,Ralf Koetter,Muriel Medard,David R.Karger and Michelle Effros.The Benefits of Coding over Routing in a Randomized Setting.Information Theory,2003.Proceedings.IEEE International Symposium on,Yokohamma,Japan,2003.
[101]Raymond W.Yeung,Shuo-Yen Robert Li,Ning Cai and Zhen Zhang.Network Coding Theory.In Foundation and Trends in Communications and Information Theory.241-381.
[102]Philip A.Chou,Yunnan Wu and Kamal Jain.Practical network coding,the 41st Allerton Conf.Communication,Control and Computing,,2003.
[103]Zongpeng Li and Baochun Li.Efficient and Distributed Computation of Maximum Multicast Rates.IEEE INFOCOM 2005,Miami,Florida,2005.
[104]Ying Zhu,Baochun Li and Jiang Guo.Multicast with Network Coding in Application-Layer Overlay Networks.IEEE Journal on Selected Areas in Communications,Special Issue on Recent Advances in Service Overlay Networks,2004,22107-120.
[105]Ying Zhu,Jiang Guo and Baochun Li.oEvolve:Towards Evolutionary Overlay Topologies for High Bandwidth Data Dissemination.IEEE Journal on Selected Areas in Communications,Special Issue on Quality of Service Delivery in Variable Topology Networks,Third Quarter,2004.
[106]Jiang Guo,Ying Zhu and Baochun Li.CodedStream:Live Media Streaming with Overlay Coded Multieast.the SPIE/ACM Conference on Multimedia Computing and Networking(MMCN 2004),Santa Clara,California,2004,28-39.
[107]Zongpeng Li,Baochun Li and Lap Chi Lau.On Achieving Maximum Multicast Throughput in Undirected Networks.Joint Special Issue on Networking and Information Theory,IEEE Transactions on Information Theory and IEEE/ACM Transactions on Networking,2006,522467-2485.
[108]Sachin Katti,Hariharan Rahul,Wenjun Hu,Dina Katabi,Muriel M'edard and Jon Crowcroft.XORs in The Air:Practical Wireless Network Coding. Sigcomm2006,Pisa,Italy,2006,243-254.
[109]Tracey Ho,Muriel Medard and Ralf Koetter.A coding view of network recovery and management.IEEE International Symposium on Information Theory,Lausanne,Switzerland,2002.
[110]Tracey Ho,Muriel Medard and Ralf Koetter.An information theoretic view of network management.Infocom 2003,2003,1456-1466
[111]Ning Cai and Raymond W.Yeung.Secure network coding.IEEE International Symposium on Information Theory,Lausanne,Switzerland,2002.
[112]Jianlong Tan and Muriel Medard.Secure Network Coding with a Cost Criterion.2006 4th International Symposium on Modeling and Optimization in Mobile,Ad Hoc and Wireless Networks,2006,1-6.
[113]Chuan Wu and Baochun Li.Echelon:Peer-to-Peer Network Diagnosis with Network Coding.the Fourteenth IEEE International Workshop on Quality of Service(IWQoS 2006),Yale University,New Haven,Connecticut,2006,20-29.
[114]Tracey Ho,Ben Leong,Ralf Koetter,Muriel Medard,Michelle Effros and David R.Karger.Byzantine modification detection in multicast networks using randomized network coding.International Symposium on Information Theory(ISIT 2004),Chicago,USA,2004.
[115]孙义明,杨丽萍.信息化战争中的战术数据链.北京:北京邮电大学出版社.2005.
[116]M Ripeanu.Peer-to-peer architecture case study:Gnutella network.Peer-to-Peer Computing,2001.Proceedings.First International Conference on,2001.
[117]P.Ney K.B.Athreya Branching Processes.Springer-Verlag1972.
[118]N.T.J.Bailey.The Mathematical Theory of Infectious Diseases and Its Applications,2nd ed:Hafner Press.1975.
[119]Paul Erd(o丨¨)s and Alfred Rényi.Publ.Math.Debrecen1960.
[120]B.Bollobás.Random Graphs:Cambridge Univ.Press.2001.
[121]Boris Pittel.On Spreading a Rumor.SIAM J.Applied Mathematics,1987,47(1):213-223.
[122]Patrick T.Eugster,Rachid Guerraoui,Anne-Marie Kermarrec and Laurent Massoulie.Epidemic information dissemination in distributed systems.IEEE Computer,2004,37(55):60-67.
[123]K.P.Birman.Bimodal Multicast.ACM Trans.Computer Systems,1999.
[124]冯国富,张金城,姜玉泉,顾庆,陆桑璐,陈道蓄.无结构P2P覆盖网络的拓扑优化.软件学报,2007,18(11):2819-2829.
[125]Yunhao Liu,Zhenyun Zhuang,Li Xiao and Lionel M.Ni.A Distributed Approach to Solving Overlay Mismatching Problem.the 24th International Conference on Distributed Computing Systems(ICDCS'04),Tokyo,Japan,2004,132-139.
[126]V.N.Padmanabhan and L.Subramanian.An Investigation of Geographic Mapping Techniques for Internet Hosts.ACM SIGCOMM 2001,2001.
[127]Yunhao Liu,Zhenyun Zhuang,Li Xiao and Lionel M.Ni.AOTO:Adaptive Overlay Topology Optimization in Unstructured P2P Systems.IEEE GLOBECOM 2003,2003,4186-4190.
[128]Yunhao Liu,Li Xiao,Xiaomei Liu,Lionel M Ni and Xiaodong Zhang.Location Awareness in Unstructured Peer-to-Peer Systems.IEEE Transactions on Parallel and Distributed Systems(TPDS),2005,16163-174.
[129]Yunhao Liu,Xiaomei Liu,Li Xiao,Lionel M Ni and Xiaodong Zhang. Location-Aware Topology Matching in P2P Systems.IEEE INFOCOM2004,Hong Kong,China,2004.
[130]Hui Zhang,Ashish Goel and Ramesh Govindan.Using the small-world model to improve freenet performance.Computer Networks Journal,2004,46(4):555-574.
[131]郭方方,杨永田.一种非结构化P2P系统搜索算法的研究.哈尔滨工程大学学报,2006,27(1):99-106.
[132]李仁发,乐光学,周祖德.P2P网络环境下的一种高效搜索算法:Multilayer Ligllt-Gossip.计算机研究与发展,2006,43(6):1008-1018.
[133]Derek Leonard,Zhongmei Yao,Xiaoming Wang and Dmitri Loguinov.On Static and Dynamic Partitioning Behavior of Large-Scale Networks.13th IEEE International Conference on Network Protocols(ICNP 2005) Boston,MA,2005,345-357.
[134]E.P.Markatos.Tracing A Large-Scale Peer-to-Peer System:An Hour in the Life of Gnutella.The Second IEEE/ACM Int'l Symp.Cluster Computing and the Grid,2002.
[135]Kunwadee Sripanidkulchai,Bruce Maggs and Hui Zhang.Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems.INFOCOM 2003.,2003.
[136]Lei Guo,Song Jiang,Li Xiao and Xiaodong Zhang.Exploiting content localities for efficient search in P2P systems,the 18th International Symposium on Distributed Computing(DISC),Amsterdam,Netherlands,2004.
[137]K.Sripanidkulchai.The Popularity of Gnutella Queries and Its Implications on Scalability.http://www.cs.cmu.edu/kunwadee/researeh/p2p/gnutella.html,2001.
[138]S.Daswani and A.Fisk.Gnutella udp extension for sealable searches(guess)v0.1.http://groups.yahoo.com/group/the_gdf/files/Proposals/Pending Proposals /GUESS/guess_01.html,2002.
[139]E.Cohen,A.Fiat and H.Kaplan.A Case for Associative Peer-to-peer Overlays.Workshop on Hot Topics in Networks,2002.
[140]Jian Yang,Yiping Zhong and Shiyong Zhang.An Efficient Interest-Group Based Search Mechanism in Unstructured Peer-to-Peer Networks.the 2003International Conference on Computer Networks and Mobile Computing (ICCNMC),2003.
[141]Xiaole Bai,Shuping Liu,Peng Zhang and Raimo Kantola.ICN:Interest-based Clustering Network.Fourth International Conference on Peer-to-Peer Computing(P2P),2004.
[142]SAROIU,Gummadi S.,P.K.,And Gribble and S.D.A.Measurement Study of Peer-to-Peer File Sharing Systems.Multimedia Computing and Networking (MMCN),San Jose,CA,2002.
[143]Anurag Singla and Christopher Rohrs.Ultrapeers:Another step towards gnutella scalability,http://groups.yahoo.com/group/the_gdf/files/Proposals/Working Proposals/Ultrapeer/Ultrapeers.html,2001.
[144]Matei Ripeanu,Ian Foster,Adriana Iamnitchi and Anne Rogers.UMM:A dynamically adaptive,unstructured multicast overlay.IEEE Infocom 2005,2004.
[145]R.Braden,D.Clark and S.Shenker.Integrated Services in the Internet Architecture:an Overview.Internet RFC 1633,1994.
[146]J.Crowcroft and P.Oechslin.Differentiated End-to-end Internet Services Using a Weighted Proportional Fair Sharing TCP.ACM Computer Communication Review,1998,28(3).
[147]S.Blake,D.Black,M.Carlson,E.Davies,Z.Wang and W.Weiss.An Architecture for Differentiated Services.RFC 2475,1998.
[148]Chuan Wu and Baochun Li.Diverse:Application-Layer Service Differentiation in Peer-to-Peer Communications.IEEE Journal on Selected Areas in Communications,Special Issue on Peer-to-Peer Communications and Applications,First Ouarter,2007.
[149]谭跃进,陈英武,易进先.系统工程原理.长沙:国防科技大学出版社.1999.
[150]Russ Cox Frank Dabek,Frans Kaashoek,Robert Morris.Vivaldi:A Decentralized Network Coordinate System.ACM SIGCOMM 2004 Portland,Oregon,USA,2004,15-26.
[151]Stefan Saroiu,P.Krishna Gummadi and Steven D.Gribble.Measuring and analyzing the characteristics of Napster and Gnutella hosts.Multimedia Systems Journal,2003,9(2):170-184.
[152]Guanrong Chen,Zhengping Fan and Xiang Li.Modelling the Complex Internet Topology.automation.sjtu.edu.en 2005.
[153]PeerSim.http://peersim.sourceforge.net/.
[154]BRITE.http://www.cs.bu.edu/brite/.
[155]Xiao Fan Wang and Guanrong Chen.Complex networks:small-world,scale-free and beyond.IEEE Circuits and Systems Magazine,2003.
[156]Tracey Ho,David R.Karger,Muriel Medard and Ralf Koetter.Network Coding from a Network Flow Perspective.ISIT 2003,Yokohama,Japan,2003.
[157]Desmond S.Lun,Muriel Medard,Tracey Ho and Ralf Koetter.Network Coding with a Cost Criterion.MIT LIDS TECHNICAL REPORT P-2584.2004.
[158]Desmond S.Lun,Niranjan Ratnakar,Ralf Koetter,Muriel Medard,Ebad Ahmed and Hyunjoo Lee.Achieving minimum-cost multieast:a decentralized approach based on network coding.IEEE Infocom 2005,2005,1607-1617.
[159]Desmond S.Lun,Niranjan Ratnakar,Muriel Médard,Ralf Koetter,David R.Karger,Traeey Ho and Fang Zhao.Minimum-Cost Multieast Over Coded Packet Networks.IEEE Transactions on Information Theory,2006,522608-2623.
[160]Dimitri P.Bertsekas and John N.Tsitsiklis.Parallel and Distributed Computation:Numerical Methods:Englewood Cliffs,NJ:Prentice Hall.1989.
[161]S.Ramanathan.Multicast tree generation in networks with asymmetric links.IEEE/ACM Transactions on Networking,1996,558_568.
[162]Michael Langberg,Alexander Sprintson and Jehoshua Bruck.The Encoding Complexity of Network Coding.IEEE Trans.Information Theory,2006,522386-2397.
[163]Christina Fragouli and Emina Soljanin.Information Flow Decomposition for Network Coding.Information Theory,IEEE Transactions on,2006,52829-848.
[164]Kapil Bhattad,Niranjan Ratnakar,Ralf Koetter and Kdshna R.Narayanan.Minimal Network Coding for Multicast.IEEE ISIT 2005 2005.
[165]Minkyu Kim,Chang Wook Ahn,Muriel Médard and Michelle Effros.On Minimizing Network Coding Resources:An Evolutionary Approach.the 2nd Workshop on Network Coding,Theory,and Applications(NetCod 2006),Boston,MA,2006.
[166]Minkyu Kim,Muriel Medard,Varun Aggarwal,Una-May O'Reilly,Wonsik Kim,Chang Wook Ahn and Michelle Effros.Evolutionary Approaches To Minimizing Network Coding Resources.the 26th Annual IEEE Conference on Computer Communications(INFOCOM 2007),Anchorage,AK,2007.
[167]The Last Mile Bottleneck.http://www.research.ibm.com/wdm/motive/reason.html.
[168]J.Edmonds.Minimum partition of a matroid into independent sets.J.Res.Nat.Bur.Stand.Sect.,1965,86967-72.
[169]Li Xiao,Yunhao Liu and Lionel M Ni.Improving Unstructured Peer-to-Peer Systems by Adaptive Connection Establishment.IEEE Transactions on Computers(TC),2005,541078-1091.
[170]Roger Zimmermann and Leslie S.Liu.ACTIVE:Adaptive Low-latency Peer-to-Peer Streaming.the Twelfth Annual Multimedia Computing and Networking(MMCN '05),San Jose,California,2005.
[171]D.S.Milojicic et al.Peer-to-Peer Computing.Technical Report HPL-2002-57,HP Labs.2002.
[172]B.Yang and H.Garcia-Molina.Designing a Super-Peer Network.19th Int'l Conf.Data Eng,2003.
[173]Gnutella development forum,the gnutella v0.6 protocol,http://groups.yahoo.com/group/the gdf/files/.
[174]Gnucleus,the gnutella web caching system.Available:http://www.gnuclens.net/gwebcache/.
[175]Skype.http://www.skype.com.
[176]An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol.New York:Columbia University Technical Report CUCS-039-04.2004.
[177]Li Xiao,Zhenyun Zhuang and Yunhao Liu.Dynamic Layer Management in Superpeer Architectures.IEEE Transactions on Parallel and Distributed Systems (TPDS),2005,161078-1091.
[178]B.Yang and H.Garcia-Molina.Efficient Search in Peer-to-Peer Networks.Int'l Conf.Distributed Computing Systems,2002.
[179]Michael Kleis,Eng Keong Lua and Xiaoming Zhou.Hierarchical Peer-to-Peer Networks using Lightweight SuperPeer Topologies.10th IEEE Symposium on Computers and Communications(ISCC 2005),2005.
[180]E.K.Lua,J.Crowcroft and M.Pias.Highways:Proximity Clustering for Scalable Peer-to-peer Network.the IEEE Fourth International Conference on Peerto-Peer Computing(P2P'04),2004,266-267.
[181]J.B.MacQueen.Some methods for classication and analysis of multivariate observations.5th Berkeley Symposium on Mathematical Statistics and Probability,1967,281-297.
[182]A.C.-C.Yao.On constructing minimum spanning trees in k-dimensional space and related problems.SIAM Journal on Computing,1982,11.
[183]Young June Pyun and Douglas S.Reeves.Constructing a Balanced,(log(N)/loglog(N))-Diameter Super-Peer Topology for Scalable P2P Systems.the Fourth International Conference on Peer-to-Peer Computing(P2P'04),2004.
[184]Chuan Wu and Baochun Li.Strategies of Conflict in Coexisting Streaming Overlays.IEEE INFOCOM 2007,Anchorage,Alaska 2007.
[185]Christos H.Papadimitriou.Algorithms,Games,and the Internet.the 33rd Annual ACM Symposium on the Theory of Computing(STOC' 01),Hersonissos,Crete,Greece.,2001.
[186]J.Feigenbaum and S.Shenker.Distributed Algorithmic Mechanism Design:Recent Results and Future Directions.the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 2002.
[187] A. Fabrikant, A. Luthra, E. Maneva, C. Papadimitriou and S. Shenker. On a Network Creation Game. ACM PODC 2003,2003.
[188] Byung-Gon Chun, Rodrigo Fonseca, Ion Stoica and John Kubiatowicz.Characterizing Selfishly Constructed Overlay Routing Networks. InfoCom 2004,2004.
[189] D.K.A. Arrowsmith, R.J. Mondrdgon-C, J.M. Pitts and M Woolf. Internet Packet Traffic Congestion. Circuits and Systems, 2003. ISC AS '03. Proceedings of the 2003 International Symposium on, 2003.
[2]S.E.Deering and D.R.Cheriton.Multicast routing in datagram internetworks and extended LANs.ACM Trans.on Computer Systems,1990,885-110.
[3]Yang-hua Chu,S.G.Rao,S.Seshan and Hui Zhang.A case for end system multicast.IEEE Journal on Selected Areas in Communications,2002,20(8):1456-1471.
[4]Mohamed Hefeeda,Ahsan Habib,Boyan Botev,Dongyan Xu and Bharat Bhargava.PROMISE:Peer-To-Peer Media Streaming Using Collectcast.ACM Multimedia(MM'03),Berkeley,California,USA,2003.
[5]De-Kai Liu and Ren-Hung Hwang.A P2P hierarchical clustering live video streaming system.2003,115-120.
[6]Zhi Li and Yongjoo Shin.Survey of Overlay Multicast Technology.UCD Technical Report,http://networks.cs.ucdavis.edu/～lizhi/papers/ECS289.pdf.2002.
[7]C.K.Yeo,B.S.Leea and M.H.Er.A survey of application level multicast techniques.Computer Communications,2004,27(15):1547-1568.
[8]Cristina Abad,William Yurcik and Roy H.Campbell.A Survey and Comparison of End-System Overlay Multicast Solutions Suitable for Network Centric Warfare.Proceedings of SPIE-The International Society for Optical Engineering,Battlespace Digitization and Network-Centric Systems Ⅳ,2004,215-226.
[9]Geoffrey Canright Ozalp Babaoglu,Andreas Deutsch,Gianni Di Caro,Frederick Ducatelle,Luca Gambardella,Niloy Ganguly,Mark Jelasity,Roberto Montemanni,and Alberto Montresor.Design Patterns from Biology for Distributed Computing.ACM Transactions on Autonomous and Adaptive Systems(TAAS),2006,1(1):26-66.
[10]BISON.http://www.cs.unibo.it/bison/.
[11]Geoffrey Canright Ozalp Babaoglu,Andreas Deutsch,Gianni Di Caro,Frederick Ducatelle,Luca Gambardella,Niloy Ganguly,Mark Jelasity,Roberto Montemanni,and Alberto Montresor.Design Patterns from Biology for Distributed Computing.Proceedings of the European Conference on Complex Systems,2005.
[12]Mark Jelasity,Raehid Guerraoui,Anne-Marie Kermarree and Maarten van Steen.The peer sampling service:Experimental evaluation of unstructured gossip-based implementations.Proceedings of the 5th International Middleware Conference,Toronto,Canada,2004.
[13]Spyros Voulgaris,Mark Jelasity and Maarten van Steen.A robust and scalable peer-to-peer gossiping protocol.Proceedings of the 2nd International Workshop on Agents and Peer-to-Peer Computing(AP2PC03),Melbourne,Australia,2003.
[14]Alberto Montresor.A robust protocol for building superpeer overlay topologies.Proceedings of the 4th International Conference on Peer-to-Peer Computing(P2P 2004) IEEE,Zurich,Switzerland,2004.
[15]Mark Jelasity and Ozalp Babaoglu.T-Man:Gossip-based overlay topology management.Proceedings of Engineering Self-Organising Applications (ESOA'05),Utrecht,Netherlands,2005.
[16]Alberto Montresor,Mark Jelasity and Ozalp Babaoglu.Chord on demand.Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing(P2P 2005),Konstanz,Germany,2005,87-94.
[17]Andrea Ceccanti and Gian Paolo Jesi.Building latency-aware overlay topologies with QuickPeer.In Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services(ICAS/ICNS 2005),2005.
[18]Mark Jelasity,Alberto Montresor and Ozalp Babaoglu.A modular paradigm for building self-organizing peer-to-peer applications.Giovanna Di Marzo Serugendo,Anthony Karageorgos,Omer F.Rana,and Franeo Zambonelli,editors,Engineering Self-Organising Systems:Nature-Inspired Approaches to Software Engineering,number 2977 in Lecture Notes in Artificial Intelligence,2004,265-282.
[19]Mark Jelasity and Alberto Montresor.Epidemic-style proactive aggregation in large overlay networks.Proceedings of the 24th International Conference on Distributed Computing Systems(ICDCS'04) IEEE Computer Society,2004,102-109.
[20]Niloy Ganguly,Geoff Canright and Andreas Deutsch.Design of a robust search algorithm for p2p networks.Proceedings of the 11th International Conference on High Performance Computing,Bangalore,India,2004.
[21]Niloy Ganguly,Lutz Brusch and Andreas Deutseh.Design and analysis of a bio-inspired search algorithm for peer-to-peer networks(Self-Star Properties in Complex Information Systems,volume 3460 of Lecture Notes in Computer Science.2005.
[22]AntHill.http://www.cs.unibo.it/projects/anthill/.
[23]Cosin.http://www.cosin.org/.
[24]DELLS.http://delis.upb.de/index.html.
[25]Exystence.http://www.complexityscience.org/index.php.
[26]Ion Stoica.Overlay Networks.In Lecture of UC Berkeley.
[27]David G.Andersen.Overlay Networks:Networking on Top of the Network.http://www.reviews.com/hottopic/,2004.
[28]Eng Keong Lua,Jon Crowcroft,Marcelo Pias,Ravi Sharma and Steven Lim.A survey and comparison of peer-to-peer overlay network schemes.Journal of IEEE Communications Surveys and Tutorials,2005,72-93.
[29]Mojtaba Hosseini,Dewan Tanvir Ahmed,Shervin Shirmohammadi and Nicolas D.Georganas.A Survey of Application-Layer Multicast Protocols.IEEE Communications Surveys & Tutorials,2007,9(3):58-74.
[30]Suman Banerjee and Bobby Bhattacharjee.A Comparative Study of Application Layer Multicast Protocols.Univ.Maryland,College Park,Tech.Rep.2002.
[31]J.Jannotti,D.K.Gifford and K.L.Johnson.Overcast:Reliable Multicasting with an Overlay Network.Oper.Syst.Des.Implement.(OSDI 2002),2000,197-212.
[32]C.K.Yeo,B.S.Lee and M.H.Er.A peering architecture for ubiquitous IP multicast streaming.ACM SIGOPS Oper.Syst.Rev.,2002,36(3):82-95.
[33]C.K.Yeo,B.S.Lee and M.H.Er.An overlay for ubiquitous streaming over Internet.the Second International IFIP-TC6 Networking Conference,2002,1239-1244.
[34]C.K.Yeo,B.S.Lee and M.H.Er.A framework for multicast video streaming over IP networks.J.Networks Comput.Applic.,2003,26(3):273-289.
[35]B.Zhang,S.Jamin and L.Zhang.Host multicast:a framework for delivering multicast to end users.INFOCOM 2002,2002.
[36]D.A.Helder and S.Jamin.Banana tree protocol,an end-host multicast protocol.Technical Report,University of Michigan,CSE-TR-429-00.2000.
[37]Miguel Castro,Peter Druschel,Anne-Marie Kermarrec and Animesh Nandi.SplitStream:High-bandwidth content distribution in cooperative environments.ACM SOSP,2003.
[38]Antony Rowstron and Peter Druschel.Pastry:Scalable,Decentralized Object Location,and Routing for Large-Scale Peer-to-Peer Systems.the 18th IFIP/ACM International Conference on Distributed Systems Platforms(Middleware 2001),2001,329-350.
[39]B.Y.Zhao,J.Kubiatowicz and A.D.Joseph.Tapestry:An Infrastructure for Fault-tolerant Wide-area Location and Routing.Technical Report CSD-01-1141,Computer Science Division,University of California,Berkeley,2001.
[40]S.Ratnasamy,M.Handley,R.Karp and S.Shenkar.Application-level multicast using content addressable networks,the Third International Workshop on Networked Group Communication(NGC),,2001,14-29.
[41]Sylvia Ratnasamy,Paul Francis,Mark Handley,Richard Karp and Scott Shenker.A Scalable Content-Addressable Network.SIGCOMM'01,2001.
[42]Y.Chu,S.G.Rao and H.Zhang.A case for end system multicast.ACM SIGMETRICS,2002,1-12.
[43]Y.D.Chawathe.Scattercast:an architecture for Internet broadcast distribution as an infrastructure service.PhD thesis,Stanford University.2000.
[44]D.Pendarakis,S.Shi,D.Verma and M.Waldvogel.ALMI:an Application Level Multicast Infrastructure.the Third Usenix Symposium on Internet Technologies and Systems(USITS),2001.
[45]Xinyan Zhang,Lin Jiang-chuan,Li Bo,Tak-Shing and P.Yum.Coolstreaming/DONet:a data-driven overlay network for peer-to-peer live media streaming.INFOCOM 2005.24th Annual Joint Conference of the IEEE Computer and Communications Societies.Proceedings IEEE,2005.
[46]A.Ganesh,A.-M.Kermarrec and L.Massoulie.Scamp:Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication.the Third International Workshop on Networked Group Communication,London,UK,2001,44-55.
[47]A.J.Ganesh,A.-M.Kermarrec and L.Massoulie.Peer-to-peer membership management for gossip-based protocols,52(2).IEEE Transactions on Computers(TC),2003,52(2).
[48]S.Banerjee,Kommareddy C,K.Kar,B.Bhattacharjee and S.Khulle.Construction of an efficient overlay multicast infrastructure for real-time applications.INFOCOM 2003,2003.
[49]P.Francis,Y.Pryadkin,P.Radoslavov,R.Govindan and B.Lindell.YOID:Your Own Internet Distribution.
[50]Venkata N.Padmanabhan,Helen J.Wang,Philip A.Chou and Kunwadee Sripanidkulchai.Distributing Streaming Media Content Using Cooperative Networking.ACM NOSSDAV'02,Miami,Florida,USA,2002.
[51]Shelley Q.Zhuang,Ben Y.Zhao,Anthony D.Joseph,Randy H.Katz and John D. Kubiatowicz.Bayeux:An Architecture for Scalable and Faulttolerant Widearea Data Dissemination.the Eleventh International Workshop on Network and Operating Systems Support for Digital Audio and Video(ACM/IEEE NOSSDAV),New York,2001.
[52]A.Rowstron,A.M.Kermarrec,M.Castro and P.Druschel.SCRIBE:the design of a large-scale event modification infrastructure the Third International Workshop on Networked Group Communication(NGC),2001.
[53]M.Castro,P.Druschel,A.-M.Kermarrec and A.Rowstron.SCRIBE:A large-scale and decentralized application-level multicast infrastructure.IEEE Jrnl.on Selected Areas in Communications(J-SAC),Sp.Issue on Network Support for Group Communication,2002.
[54]S.Jain,R.Mahajan,D.Wetherall,G.Borriello and S.D.Gribble.Scalable Self-Organizing Overlays.Technical report UW-CSE 02-02-02,University of Washington.2002.
[55]S.Banerjee,B.Bhattacharjee and C.Kommareddy.Scaleable application layer multicast.ACM SIGCOMM 2002,2002.
[56]徐恪,熊勇强,吴建平.对等网络研究综述.2002.
[57]罗杰文.Peer to Peer(P2P)综述.中科院计算技术研究所.2005.
[58]Napster Home Page.http://www.napster.com/.
[59]Scalable Distribute Data Structures.http://www.usenix.org/events/osdi2000/full_papers/gribble/gribble_html/dds.html.
[60]I.Stoica,R.Morris,D.Liben-Nowell,D.R.Karger,M.F.Kaashoek,F.Dabek and H Balakrishnan.Chord:a scalable peer-to-peer lookup protocol for Internet applications.IEEE/ACM Transactions on Networking(TON),2003,11(1):17-32.
[61]FIPS180-1.Secure Hash Standard.U.S.Department of Commerce/NIST,National Technical Information Service,Springfield,VA,1995.
[62]P.Maymounkov and D.Mazi'eres.Kademlia:A peer-to-peer information system based on the xor metric.Processings of the IPTPS 2002,Cambridge,MA,USA,2002,53-65.
[63]D.Malkhi,M.Naor and D.Ratajczak.Viceroy:a scalable and dynamic emulation of the butterfly.ACM PODC'02,Monterey,CA,USA,2002,183-192.
[64]Gnutella.http://gnutella.wego.com.
[65]P.Ganesan,Q.Sun and H.Garcia-Molina.Yappers:A peer-to-peer lookup service over arbitrary topology,the IEEE Infocom 2003,San Francisco,USA,2003.
[66]Q.Lv,S.Ratnasamy and S.Shenker.Can heterogeneity make gnutella scalable?the 1st International Workshop on Peerto-Peer Systems(IPTPS),Cambridge,MA,USA,2002.
[67]Yatin Chawathe,Sylvia Ratnasamy,Lee Breslau,Nick Lanham and Scott Shenker.Making gnutella-like p2p systems scalable.ACM SIGCOMM 2003,Karlsruhe,Germany,2003,407-418.
[68]A.Fisk.Gnutella ultrapeer query protocol v0.1.http://groups.yahoo.com/group /the_gdf/files/Proposals/Working Proposals/search/Ultrapeer QRP/ultrapeer_qrp.html,2003.
[69]I.Clarke,B.Wiley,O.Sanberg and T.Hong.Freenet:A Distributed Anonymous Information Storage and Retrieval System.Proceedings of International Workshop on Design Issues in Anonymity and Unobservability,2001.
[70]Fasttrack peer-to-peer technology company.http://www.fasttrack.nu/.
[71]Kazaa media desktop,http://www.kazaa.com/.
[72]The overnet file-sharing network,http://www.overnet.com.
[73]Overnet/edonkey2000.http://www.edonkey2000.com/.
[74]Kermaek,W.O.and A.G.Mckendrick.A Contribution to the Mathematical Theory of Epidemics.the Royal Society of London.A,Mathematical and Physical Sciences,1927.
[75]A.Demers.Epidemic algorithms for replicated database maintenance,the sixth annual ACM Symposium on Principles of distributed computing,Vancouver,British Columbia,Canada 1987.
[76]R.van Renesse,Y.Minsky and M.Hayden.A Gossip-Style Failure Detection Service.Middleware 98,New York,1998,55-70.
[77]R.van Renesse,K.P.Birman and W.Vogels.Astrolabe:A Robust and Scalable Technology for Distributed System Monitoring,Management,and Data Mining.ACM Transactions on Computer Systems,2003,21(2):164-206.
[78]JoAnne Holliday,Robert Steinke,Divyakant Agrawal and Amr El Abbadi.Epidemic Algorithms for Replicated Databases.IEEE Transactions on Knowledge and Data Engineering,2003,15(5):1218-1238.
[79]P.T.Eugster and R Guerraoui.Probabilistic multieast.Dependable Systems and Networks,2002.Proceedings.International Conference on,2002.
[80]P.Eugster,R.Guerraoui,S.Handurukande,A.-M.Kermarrec and P.Kouznetsov.Lightweight Probabilistie Broadcast.ACM Trans.on Computer Systems,2003,21(4):341-374.
[81]D.Pendarakis,S.Shi,D.Verma and M.Waldvogel.ALMI:An application level multieast infrastructure,the 3rd Usenix Symp on Internet Technologies and Sys(USITS 2001),2001.
[82]YOID:Your Own Internet Distribution.http://www.icir.org/yoid/.
[83]S.Banerjee,B.Bhattacharjee and C.Kommareddy.Scalable application layer multicast,the ACM SIGCOMM 2002,2002.
[84]J.Jannotti,D.K.Gifford,K.L.Johnson,M.F.Kaashoek and J.W.O'Toole.Overcast:Reliable multicasting with an overlay network,the 4th Usenix Symp.on Operating Sys.Design and Implementation(OSDI 2000),2000.
[85]Z.Li and P.Mohapatra.Hostcast:A new overlay multicasting protocol.IEEE 2003 Intl.Conf.on Communications(ICC 2003),2003.
[86]Goyal.Multiple description coding:compression meets the network.Signal Processing Magazine,IEEE,2001,18(5):74-93.
[87]Yao Wang,Michael T.Orchard and Vinay Vaishampayan.Multiple description coding using pairwise correlating transforms.IEEE Transactions on Image Processing,2001,10(3):351-366.
[88]Weatherspoon H and Kubiatowiez J.Erasure coding vs.replication:A quantitative comparison,the 1st Int'l Workshop on Peer-to-Peer Systems,2002,328-337.
[89]Gridmedia Project Website.http://www.gridmedia.com.cn/.
[90]M.Zhou and J.Liu.A hybrid overlay network for video-on-demand.IEEE International Conference on Communications(ICC'05),Seoul,Korea,2005.
[91]M.Zhou and J.Liu.Tree-assisted gossiping for overlay video distribution.Kluwer Multimedia Tools and Applications,2005.
[92]R.K.Ahujia,T.L.Magnanti and J.B.Orlin.Network Flows:Theory,Algorithms and Applications:Prentice-Hall.1993.
[93]Rudolf Ahlswede,Ning Cai,Shuo-Yen Robert Li and Raymond W.Yeung.Network Information Flow.IEEE Transaction on Information Theory,2000,461204-1216.
[94]Zongpeng Li,Baochun Li,Dan Jiang and Lap Chi Lau.On Achieving Optimal Throughput with Network Coding.IEEE INFOCOM 2005,Miami,Florida,USA,2005.
[95]Ralf Koetter and Muriel Medard.Beyond routing:an algebraic approach to network coding.INFOCOM 2002,2002,122_130.
[96]Ralf Koetter and Muriel Medard.An algebraic approach to network coding.IEEE/ACM Transactions on Networking,2003,782-795.
[97]Shuo-Yen Robert Li,Raymond W.Yeung and Ning Cai.Linear Network Coding.IEEE Trans.Information Theory,2003,49371-381.
[98]Peter Sanders,Sebastian Egner and Ludo Tolhuizen.Polynomial Time Algorithms for Network Information Flow.the 15th ACM Synposium on Parallel Algorithms and Architechtures(SPAA),San Diego,California,USA,2003,296-294.
[99]Sidharth Jaggi,Peter Sanders,Philip A.Chou,Michelle Effros,Sebastian Egner,Kamal Jain and Ludo M.G.M.Tolhuizen.Polynomial Time Algorithms for Multicast Network Code Construction.IEEE Transactions on Information Theory,2005,511973-1982.
[100]Tracey Ho,Ralf Koetter,Muriel Medard,David R.Karger and Michelle Effros.The Benefits of Coding over Routing in a Randomized Setting.Information Theory,2003.Proceedings.IEEE International Symposium on,Yokohamma,Japan,2003.
[101]Raymond W.Yeung,Shuo-Yen Robert Li,Ning Cai and Zhen Zhang.Network Coding Theory.In Foundation and Trends in Communications and Information Theory.241-381.
[102]Philip A.Chou,Yunnan Wu and Kamal Jain.Practical network coding,the 41st Allerton Conf.Communication,Control and Computing,,2003.
[103]Zongpeng Li and Baochun Li.Efficient and Distributed Computation of Maximum Multicast Rates.IEEE INFOCOM 2005,Miami,Florida,2005.
[104]Ying Zhu,Baochun Li and Jiang Guo.Multicast with Network Coding in Application-Layer Overlay Networks.IEEE Journal on Selected Areas in Communications,Special Issue on Recent Advances in Service Overlay Networks,2004,22107-120.
[105]Ying Zhu,Jiang Guo and Baochun Li.oEvolve:Towards Evolutionary Overlay Topologies for High Bandwidth Data Dissemination.IEEE Journal on Selected Areas in Communications,Special Issue on Quality of Service Delivery in Variable Topology Networks,Third Quarter,2004.
[106]Jiang Guo,Ying Zhu and Baochun Li.CodedStream:Live Media Streaming with Overlay Coded Multieast.the SPIE/ACM Conference on Multimedia Computing and Networking(MMCN 2004),Santa Clara,California,2004,28-39.
[107]Zongpeng Li,Baochun Li and Lap Chi Lau.On Achieving Maximum Multicast Throughput in Undirected Networks.Joint Special Issue on Networking and Information Theory,IEEE Transactions on Information Theory and IEEE/ACM Transactions on Networking,2006,522467-2485.
[108]Sachin Katti,Hariharan Rahul,Wenjun Hu,Dina Katabi,Muriel M'edard and Jon Crowcroft.XORs in The Air:Practical Wireless Network Coding. Sigcomm2006,Pisa,Italy,2006,243-254.
[109]Tracey Ho,Muriel Medard and Ralf Koetter.A coding view of network recovery and management.IEEE International Symposium on Information Theory,Lausanne,Switzerland,2002.
[110]Tracey Ho,Muriel Medard and Ralf Koetter.An information theoretic view of network management.Infocom 2003,2003,1456-1466
[111]Ning Cai and Raymond W.Yeung.Secure network coding.IEEE International Symposium on Information Theory,Lausanne,Switzerland,2002.
[112]Jianlong Tan and Muriel Medard.Secure Network Coding with a Cost Criterion.2006 4th International Symposium on Modeling and Optimization in Mobile,Ad Hoc and Wireless Networks,2006,1-6.
[113]Chuan Wu and Baochun Li.Echelon:Peer-to-Peer Network Diagnosis with Network Coding.the Fourteenth IEEE International Workshop on Quality of Service(IWQoS 2006),Yale University,New Haven,Connecticut,2006,20-29.
[114]Tracey Ho,Ben Leong,Ralf Koetter,Muriel Medard,Michelle Effros and David R.Karger.Byzantine modification detection in multicast networks using randomized network coding.International Symposium on Information Theory(ISIT 2004),Chicago,USA,2004.
[115]孙义明,杨丽萍.信息化战争中的战术数据链.北京:北京邮电大学出版社.2005.
[116]M Ripeanu.Peer-to-peer architecture case study:Gnutella network.Peer-to-Peer Computing,2001.Proceedings.First International Conference on,2001.
[117]P.Ney K.B.Athreya Branching Processes.Springer-Verlag1972.
[118]N.T.J.Bailey.The Mathematical Theory of Infectious Diseases and Its Applications,2nd ed:Hafner Press.1975.
[119]Paul Erd(o丨¨)s and Alfred Rényi.Publ.Math.Debrecen1960.
[120]B.Bollobás.Random Graphs:Cambridge Univ.Press.2001.
[121]Boris Pittel.On Spreading a Rumor.SIAM J.Applied Mathematics,1987,47(1):213-223.
[122]Patrick T.Eugster,Rachid Guerraoui,Anne-Marie Kermarrec and Laurent Massoulie.Epidemic information dissemination in distributed systems.IEEE Computer,2004,37(55):60-67.
[123]K.P.Birman.Bimodal Multicast.ACM Trans.Computer Systems,1999.
[124]冯国富,张金城,姜玉泉,顾庆,陆桑璐,陈道蓄.无结构P2P覆盖网络的拓扑优化.软件学报,2007,18(11):2819-2829.
[125]Yunhao Liu,Zhenyun Zhuang,Li Xiao and Lionel M.Ni.A Distributed Approach to Solving Overlay Mismatching Problem.the 24th International Conference on Distributed Computing Systems(ICDCS'04),Tokyo,Japan,2004,132-139.
[126]V.N.Padmanabhan and L.Subramanian.An Investigation of Geographic Mapping Techniques for Internet Hosts.ACM SIGCOMM 2001,2001.
[127]Yunhao Liu,Zhenyun Zhuang,Li Xiao and Lionel M.Ni.AOTO:Adaptive Overlay Topology Optimization in Unstructured P2P Systems.IEEE GLOBECOM 2003,2003,4186-4190.
[128]Yunhao Liu,Li Xiao,Xiaomei Liu,Lionel M Ni and Xiaodong Zhang.Location Awareness in Unstructured Peer-to-Peer Systems.IEEE Transactions on Parallel and Distributed Systems(TPDS),2005,16163-174.
[129]Yunhao Liu,Xiaomei Liu,Li Xiao,Lionel M Ni and Xiaodong Zhang. Location-Aware Topology Matching in P2P Systems.IEEE INFOCOM2004,Hong Kong,China,2004.
[130]Hui Zhang,Ashish Goel and Ramesh Govindan.Using the small-world model to improve freenet performance.Computer Networks Journal,2004,46(4):555-574.
[131]郭方方,杨永田.一种非结构化P2P系统搜索算法的研究.哈尔滨工程大学学报,2006,27(1):99-106.
[132]李仁发,乐光学,周祖德.P2P网络环境下的一种高效搜索算法:Multilayer Ligllt-Gossip.计算机研究与发展,2006,43(6):1008-1018.
[133]Derek Leonard,Zhongmei Yao,Xiaoming Wang and Dmitri Loguinov.On Static and Dynamic Partitioning Behavior of Large-Scale Networks.13th IEEE International Conference on Network Protocols(ICNP 2005) Boston,MA,2005,345-357.
[134]E.P.Markatos.Tracing A Large-Scale Peer-to-Peer System:An Hour in the Life of Gnutella.The Second IEEE/ACM Int'l Symp.Cluster Computing and the Grid,2002.
[135]Kunwadee Sripanidkulchai,Bruce Maggs and Hui Zhang.Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems.INFOCOM 2003.,2003.
[136]Lei Guo,Song Jiang,Li Xiao and Xiaodong Zhang.Exploiting content localities for efficient search in P2P systems,the 18th International Symposium on Distributed Computing(DISC),Amsterdam,Netherlands,2004.
[137]K.Sripanidkulchai.The Popularity of Gnutella Queries and Its Implications on Scalability.http://www.cs.cmu.edu/kunwadee/researeh/p2p/gnutella.html,2001.
[138]S.Daswani and A.Fisk.Gnutella udp extension for sealable searches(guess)v0.1.http://groups.yahoo.com/group/the_gdf/files/Proposals/Pending Proposals /GUESS/guess_01.html,2002.
[139]E.Cohen,A.Fiat and H.Kaplan.A Case for Associative Peer-to-peer Overlays.Workshop on Hot Topics in Networks,2002.
[140]Jian Yang,Yiping Zhong and Shiyong Zhang.An Efficient Interest-Group Based Search Mechanism in Unstructured Peer-to-Peer Networks.the 2003International Conference on Computer Networks and Mobile Computing (ICCNMC),2003.
[141]Xiaole Bai,Shuping Liu,Peng Zhang and Raimo Kantola.ICN:Interest-based Clustering Network.Fourth International Conference on Peer-to-Peer Computing(P2P),2004.
[142]SAROIU,Gummadi S.,P.K.,And Gribble and S.D.A.Measurement Study of Peer-to-Peer File Sharing Systems.Multimedia Computing and Networking (MMCN),San Jose,CA,2002.
[143]Anurag Singla and Christopher Rohrs.Ultrapeers:Another step towards gnutella scalability,http://groups.yahoo.com/group/the_gdf/files/Proposals/Working Proposals/Ultrapeer/Ultrapeers.html,2001.
[144]Matei Ripeanu,Ian Foster,Adriana Iamnitchi and Anne Rogers.UMM:A dynamically adaptive,unstructured multicast overlay.IEEE Infocom 2005,2004.
[145]R.Braden,D.Clark and S.Shenker.Integrated Services in the Internet Architecture:an Overview.Internet RFC 1633,1994.
[146]J.Crowcroft and P.Oechslin.Differentiated End-to-end Internet Services Using a Weighted Proportional Fair Sharing TCP.ACM Computer Communication Review,1998,28(3).
[147]S.Blake,D.Black,M.Carlson,E.Davies,Z.Wang and W.Weiss.An Architecture for Differentiated Services.RFC 2475,1998.
[148]Chuan Wu and Baochun Li.Diverse:Application-Layer Service Differentiation in Peer-to-Peer Communications.IEEE Journal on Selected Areas in Communications,Special Issue on Peer-to-Peer Communications and Applications,First Ouarter,2007.
[149]谭跃进,陈英武,易进先.系统工程原理.长沙:国防科技大学出版社.1999.
[150]Russ Cox Frank Dabek,Frans Kaashoek,Robert Morris.Vivaldi:A Decentralized Network Coordinate System.ACM SIGCOMM 2004 Portland,Oregon,USA,2004,15-26.
[151]Stefan Saroiu,P.Krishna Gummadi and Steven D.Gribble.Measuring and analyzing the characteristics of Napster and Gnutella hosts.Multimedia Systems Journal,2003,9(2):170-184.
[152]Guanrong Chen,Zhengping Fan and Xiang Li.Modelling the Complex Internet Topology.automation.sjtu.edu.en 2005.
[153]PeerSim.http://peersim.sourceforge.net/.
[154]BRITE.http://www.cs.bu.edu/brite/.
[155]Xiao Fan Wang and Guanrong Chen.Complex networks:small-world,scale-free and beyond.IEEE Circuits and Systems Magazine,2003.
[156]Tracey Ho,David R.Karger,Muriel Medard and Ralf Koetter.Network Coding from a Network Flow Perspective.ISIT 2003,Yokohama,Japan,2003.
[157]Desmond S.Lun,Muriel Medard,Tracey Ho and Ralf Koetter.Network Coding with a Cost Criterion.MIT LIDS TECHNICAL REPORT P-2584.2004.
[158]Desmond S.Lun,Niranjan Ratnakar,Ralf Koetter,Muriel Medard,Ebad Ahmed and Hyunjoo Lee.Achieving minimum-cost multieast:a decentralized approach based on network coding.IEEE Infocom 2005,2005,1607-1617.
[159]Desmond S.Lun,Niranjan Ratnakar,Muriel Médard,Ralf Koetter,David R.Karger,Traeey Ho and Fang Zhao.Minimum-Cost Multieast Over Coded Packet Networks.IEEE Transactions on Information Theory,2006,522608-2623.
[160]Dimitri P.Bertsekas and John N.Tsitsiklis.Parallel and Distributed Computation:Numerical Methods:Englewood Cliffs,NJ:Prentice Hall.1989.
[161]S.Ramanathan.Multicast tree generation in networks with asymmetric links.IEEE/ACM Transactions on Networking,1996,558_568.
[162]Michael Langberg,Alexander Sprintson and Jehoshua Bruck.The Encoding Complexity of Network Coding.IEEE Trans.Information Theory,2006,522386-2397.
[163]Christina Fragouli and Emina Soljanin.Information Flow Decomposition for Network Coding.Information Theory,IEEE Transactions on,2006,52829-848.
[164]Kapil Bhattad,Niranjan Ratnakar,Ralf Koetter and Kdshna R.Narayanan.Minimal Network Coding for Multicast.IEEE ISIT 2005 2005.
[165]Minkyu Kim,Chang Wook Ahn,Muriel Médard and Michelle Effros.On Minimizing Network Coding Resources:An Evolutionary Approach.the 2nd Workshop on Network Coding,Theory,and Applications(NetCod 2006),Boston,MA,2006.
[166]Minkyu Kim,Muriel Medard,Varun Aggarwal,Una-May O'Reilly,Wonsik Kim,Chang Wook Ahn and Michelle Effros.Evolutionary Approaches To Minimizing Network Coding Resources.the 26th Annual IEEE Conference on Computer Communications(INFOCOM 2007),Anchorage,AK,2007.
[167]The Last Mile Bottleneck.http://www.research.ibm.com/wdm/motive/reason.html.
[168]J.Edmonds.Minimum partition of a matroid into independent sets.J.Res.Nat.Bur.Stand.Sect.,1965,86967-72.
[169]Li Xiao,Yunhao Liu and Lionel M Ni.Improving Unstructured Peer-to-Peer Systems by Adaptive Connection Establishment.IEEE Transactions on Computers(TC),2005,541078-1091.
[170]Roger Zimmermann and Leslie S.Liu.ACTIVE:Adaptive Low-latency Peer-to-Peer Streaming.the Twelfth Annual Multimedia Computing and Networking(MMCN '05),San Jose,California,2005.
[171]D.S.Milojicic et al.Peer-to-Peer Computing.Technical Report HPL-2002-57,HP Labs.2002.
[172]B.Yang and H.Garcia-Molina.Designing a Super-Peer Network.19th Int'l Conf.Data Eng,2003.
[173]Gnutella development forum,the gnutella v0.6 protocol,http://groups.yahoo.com/group/the gdf/files/.
[174]Gnucleus,the gnutella web caching system.Available:http://www.gnuclens.net/gwebcache/.
[175]Skype.http://www.skype.com.
[176]An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol.New York:Columbia University Technical Report CUCS-039-04.2004.
[177]Li Xiao,Zhenyun Zhuang and Yunhao Liu.Dynamic Layer Management in Superpeer Architectures.IEEE Transactions on Parallel and Distributed Systems (TPDS),2005,161078-1091.
[178]B.Yang and H.Garcia-Molina.Efficient Search in Peer-to-Peer Networks.Int'l Conf.Distributed Computing Systems,2002.
[179]Michael Kleis,Eng Keong Lua and Xiaoming Zhou.Hierarchical Peer-to-Peer Networks using Lightweight SuperPeer Topologies.10th IEEE Symposium on Computers and Communications(ISCC 2005),2005.
[180]E.K.Lua,J.Crowcroft and M.Pias.Highways:Proximity Clustering for Scalable Peer-to-peer Network.the IEEE Fourth International Conference on Peerto-Peer Computing(P2P'04),2004,266-267.
[181]J.B.MacQueen.Some methods for classication and analysis of multivariate observations.5th Berkeley Symposium on Mathematical Statistics and Probability,1967,281-297.
[182]A.C.-C.Yao.On constructing minimum spanning trees in k-dimensional space and related problems.SIAM Journal on Computing,1982,11.
[183]Young June Pyun and Douglas S.Reeves.Constructing a Balanced,(log(N)/loglog(N))-Diameter Super-Peer Topology for Scalable P2P Systems.the Fourth International Conference on Peer-to-Peer Computing(P2P'04),2004.
[184]Chuan Wu and Baochun Li.Strategies of Conflict in Coexisting Streaming Overlays.IEEE INFOCOM 2007,Anchorage,Alaska 2007.
[185]Christos H.Papadimitriou.Algorithms,Games,and the Internet.the 33rd Annual ACM Symposium on the Theory of Computing(STOC' 01),Hersonissos,Crete,Greece.,2001.
[186]J.Feigenbaum and S.Shenker.Distributed Algorithmic Mechanism Design:Recent Results and Future Directions.the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 2002.
[187] A. Fabrikant, A. Luthra, E. Maneva, C. Papadimitriou and S. Shenker. On a Network Creation Game. ACM PODC 2003,2003.
[188] Byung-Gon Chun, Rodrigo Fonseca, Ion Stoica and John Kubiatowicz.Characterizing Selfishly Constructed Overlay Routing Networks. InfoCom 2004,2004.
[189] D.K.A. Arrowsmith, R.J. Mondrdgon-C, J.M. Pitts and M Woolf. Internet Packet Traffic Congestion. Circuits and Systems, 2003. ISC AS '03. Proceedings of the 2003 International Symposium on, 2003.