基于蚁群的对等网路由协议的研究

综合考虑结构化协议和非结构化协议的优点,提出了一种基于蚁群的对等网路由协议.分析对等网路由协议的研究现状,对结构化路由协议和非结构化路由协议进行了介绍.对等网路由协议进行了总体设计,给出了对等网路由协议的描述和总体结构图.提出了对等网路由协议算法的数据结构,并对等网路由协议算法进行了详细设计.利用仿真实验对等网路由协议进行了验证,实验结果表明该对等网路由协议是有效的.     

基于泛洪约束的MANET按需组播路由协议

降低路由控制开销是MANET网络组播路由协议节省节点能量,提高带宽利用率的关键因素之一。本文研究了组播路径近邻节点对路由维护的作用以及链路的连通性,分别提出了一个新的泛k-洪约束算法和一个混合泛洪模式。基于泛k-洪约束算法和混合泛洪模式,提出一个新的按需组播路由协议ODMRP-CF,ODMRP-CF协议通过选择k-路由近邻节点转发泛洪分组来提高泛洪效率。ODMRP-CF协议不仅保持了ODMRP协议所具有的简单,对节点移动鲁棒性好的优点,而且有效地降低了ODMRP-CF协议的控制开销。     

MPLS网络中DiffServ组播算法

文章提出一种在多协议标签交换(MPLS)网络中边界路由器实现组播和区分服务的算法,该算法利用处于分支点的边界路由器之间的标签交换路径来传输组播数据包,同时引入了信息管理点,用于计算、管理和调整组播树,实现全域的服务质量.描述了算法的具体细节和实现原理,也评价了该算法的可行性和优越性.     

移动Ad Hoc网络组播路由协议的研究综述

移动Ad Hoc网络是一个自组织、移动节点通过无线链路组成的动态拓扑变化的网络。由于网络规模小、无基础设施构建快速等特点,从而广泛应用于灾难救助、临时会议、战场指挥等场合。这些应用都涉及到移动Ad Hoc对组播的支持,因此,随着网络应用规模的增长,移动Ad Hoc网络对组播的支持成为一个重要的研究课题。本文对目前的组播路由机制进行了分类和研究,详细描述和比较了这些移动Ad Hoc网络组播路由协议,为组播路由协议和算法进一步的研究提出了新的课题。     

NGB组播性能测试方法研究

本文研究了IP组播协议体系,包括组播地址、主机一路由器协议、路由器一路由器协议,研究组播性能测试RFC标准,分析NGB网络特点,提出NGB组播性能测试方法。     

基于遗传算法优化的QoS组播路由算法

QoS组播路由技术作为网络多媒体信息传输的一种核心技术,下一代网络中的QoS组播路由的优化算法已经成为目前研究的一个热点。针对QoS组播的网络模型,提出一种适用于下一代网络的组播路由算法能够更好的满足下一代网络的QoS组播需求显得尤为重要。本文讨论了遗传算法优化的QoS组播路由算法,最后探讨了下一代网络QoS组播路由算法的研究方向。     

SLM-一种安全分层组播协议

流媒体分发的一种典型实现方法是采用具有接收方驱动拥塞控制机制的分层组播.由于目前分层组播拥塞控制协议缺乏对用户行为的限制,接收方可违规订阅上层组播组发起自利型攻击,导致非公平的带宽利用.本文提出了一种较通用的安全分层组播协议SLM(Secure Layered Multicast).在路由器辅助拥塞控制条件下,在边界路由器采用基于Shamir秘密共享体制的拥塞状态相关访问控制(CR-AC,Congestion state Related Access Control)算法,管理用户组订阅行为,避免了用户自利型攻击,并使服务提供商可根据其与用户的协约限定不同用户的最高订阅级别.分析和仿真实验表明,该协议可实时保证网络流量安全共享带宽并具有较好的可扩展性.     

IPv4-IPv6组播过渡技术

要使IPv4主机与IPv6主机进行组播通信，必须做协议转换工作。采用多播转换网关（MTG）技术方案能较好地实现IPv4网和IPv6网之间的组播互通。方法是将MTG部署在lPv4和IPv6网络的边界，将IPv4网络和IPv6网络视为地位对等的两个异构网络。IPv6主机可以加入组播源位于IPv4网络的组播组，IPv4主机也可以加入组播源位于IPv6网络的组播组。在IPv4中，MTG作为IPv6的代理，参与IPv4的组播；同样，MTG在IPv6中则作为IPv4的代理。在MTG系统内部，两个代理之间进行协议转换。     

一种适用于Ad Hoc K重组播网络的负载均衡路由算法

Ad Hoc网络是一个多跳的无基础设施网络,本文在分析Ad Hoc网络自身特点的基础上,引入了一种多组播业务并存的K重组播网络,这种网络相对传统的组播网络具有节省系统开销,降低能量消耗的优点.文中对K重组播网络中的节点连接度的不同变化情况进行了理论上的详细研究,并在此基础上设计了一种适用于K重组播网络的负载均衡路由算法.仿真结果表明该路由算法拥塞控制性能良好,并能显著提高组播业务的稳定性.本文提出的这种K重组播网络能够广泛的应用于许多实际通信场合.     

基于三维Delaunay三角网的应用层组播的设计与研究

应用层组播协议在由终端组成的逻辑叠加网中进行组播数据传输.应用层组播协议性能的优劣主要决定于应用层的叠加网与实际网络结构的吻合程度.Delaunay三角网(DT)的特殊性质使得它适于应用层组播叠加网的构建,Jorg Liebeherr和Michael Nahas据此设计了二维DT应用层组播协议.但是,二维DT应用层组播协议的维数太少,无法很好的与实际网络结构匹配,限制了所建立的应用层组播叠加网的性能.我们将逻辑空间的维数增加到三维,在三维空间中建立DT网.通过数据仿真和分析,三维DT应用层组播算法在没有降低网络层效率的前提下提高了应用层性能,而且更利于向大规模网络扩展.     

PPmcast: a novel P2P-based application-level multicast using Kamulia

The rapid growth and popularity of networked meeting environments such as video conference in recent years have spawned a series of research interests in constructing large-scale environments. For increasing scalability and decreasing the cost of management and deployment, more and more studies propose using peer-to-peer (P2P) architectures to construct large-scale application-level multicast algorithm for games, multimedia and other applications. In order to improve the applications' performance, high efficiency multicast algorithm is required. This paper focuses on developing a novel P2P application-level multicast algorithm based on Kamulia protocol. In the proposed algorithm, all nodes of P2P network are organized into structured overlay network by distributed hash table (DHT). The distance metric between two nodes is obtained by computing the exclusive or (XOR) value. The theoretical analysis indicates the proposed algorithm has better time complexity degree compared with other similar algorithms. The simulation experiments also show that the proposed algorithm has better performance on the following aspects, control expenses, loss ratio after failure, and waiting time to the first packet.     

Adaptive tree-based P2P video streaming multicast system under high peer-churn rate

This paper presents an adaptive tree-based P2P video streaming multicast system under high peer-churn rate. Because peers typically display dynamic and unstable behavior during the session, a P2P video streaming multicast tree must take into account both the link delay and peer stability in order to provide a seamless video streaming multicast service with low delay. Hence, we need to adaptively update the multicast tree according to its time-varying environments in order to obtain an effective tradeoff between the delay of the tree and the relative peer stability over multicast tree. Finally, simulation results are provided to demonstrate the performance of the proposed system.     

因特网上视频多点传输算法研究

本文研究因特网上进行视频多点传输的问题.在分析了资源预约协议和智体反馈控制机制的基础上,基于分层编码技术提出一种新的视频传输算法.文中利用ns-2网络模拟器进行了性能评价,结果表明该算法在保证视频基本服务质量的条件下,具有较好的公平性和可扩放性.     

Real-Time Streaming Relay Mechanism for P2P Conferences on Hierarchical Overlay Networks

A peer-to-peer (P2P) multimedia conferencing service is operating that users share their resources to each other on the Internet. It can solve the problem in the centralized conferencing architecture, such as the centralized loading, single point error, and expensive infrastructure. However, P2P networks have the problem that a peer has a difference between the physical location and logical location in the overlay network. In the viewpoint of P2P networks, the nearest conference resource may be far away geographically. The P2P-session initiation protocol (P2P-SIP) multimedia conference is to construct an application-based logical multicast network efficiently according to physical network information. Thus, this paper proposes a real-time streaming relay mechanism for P2P conferences on hierarchical overlay networks. The real-time streaming relay mechanism can improve the transportation efficiency of conferencing stream exchange well based on the application-layer multicast (ALM) structure and the hierarchical overlay networks.     

GPM: A generic and scalable P2P model that optimizes tree depth for multicast communications

Group communications (real‐time and non‐real‐time) refer to one‐to‐many or many‐to‐many communications. On the one hand, multicast is considered as an appropriate solution for supporting group communication‐oriented applications (we distinguish IP network multicast from application layer multicast). On the other hand, peer‐to‐peer model tends to be a good candidate for supporting today Internet applications (e.g. P2P IPTV, P2P VoIP, etc.). In this context, P2P has attracted significant interest in the recent years. This is mainly due to its properties that also make P2P well adapted to today social networks. In this paper, we propose GPM (Generic P2P Multicast): a novel generic and scalable approach, that optimizes multicast tree depth in P2P networks (structured and unstructured), and contributes to control the network overlay latency. For multicast tree construction, the approach we propose is based on a distributed algorithm using a specific data structures (adjacency and forwarding matrixes). GPM model inherits from P2P attributes such as scalability, flexibility and fault tolerance, while taking into consideration the respective characteristics of one‐to‐many and many‐to‐many type of applications. We also give a performance evaluation for validation and comparison purposes while considering some main existing application layer multicast protocols. Copyright © 2011 John Wiley & Sons, Ltd.     

Improved heuristics for multicast routing in wireless mesh networks

Multicast is a communication technique that allows a source to transmit data to a set of recipients in an efficient manner. Therefore, the primary objective of a multicast routing protocol would be to minimize number of transmissions to conserve bandwidth. The problem of computing multicast trees with minimal bandwidth consumption is similar to Steiner tree problem and has shown to be NP-complete. So, heuristic based algorithms are suitable to approximate such bandwidth optimal trees. This paper proposes a multicast routing protocol based on minimum number of transmission trees using an heuristic approach. The simulation results show that the proposed algorithm offers better performance over existing protocols, even in the worst-case scenario when the set of multicast receivers are sparsely distributed across the network.     

Bandwidth-satisfied multicast trees in large-scale ad-hoc networks

The purpose of this paper is to construct bandwidth-satisfied multicast trees for QoS applications in large-scale ad-hoc networks (MANETs). Recent routing protocols and multicast protocols in large-scale MANETs adopt two-tier infrastructures to avoid the inefficiency of the flooding. Hosts with a maximal number of neighbors are often chosen as backbone hosts (BHs) to forward packets. Most likely, these BHs will be traffic concentrations/bottlenecks of the network. In addition, since host mobility is not taken into consideration in BH selection, these two-tier schemes will suffer from more lost packets if highly mobile hosts are selected as BHs. In this paper, a new multicast protocol is proposed for partitioning large-scale MANET into two-tier infrastructures. In the proposed two-tier multicast protocol, hosts with fewer hops and longer remaining connection time to the other hosts will be selected as BHs. The objective is not only to obtain short and stable multicast routes, but also to construct a stable two-tier infrastructure with fewer lost packets. Further, previous MANET quality-of-service (QoS) routing/multicasting protocols determined bandwidth-satisfied routes for QoS applications. Some are implemented as a probing scheme, but the scheme is inefficient due to high overhead and slow response. On the contrary, the others are implemented by taking advantage of routing and link information to reduce the inefficiency. However, the latter scheme suffers from two bandwidth-violation problems. In this paper, a novel algorithm is proposed to avoid the two problems, and it is integrated with the proposed two-tier multicast protocol to construct bandwidth-satisfied multicast trees for QoS applications in large-scale MANETs. The proposed algorithm aims to achieve better network performance by minimizing the number of forwarders in a tree.     

A reliable overlay video transport protocol for multicast agents in wireless mesh networks

A new video transport protocol for multicast agents in wireless mesh networks (WMNs) is proposed in this paper. The proposed protocol enables a significant reduction in the transmission overhead, while providing reliable communication for its use in multicast applications. This proposed reliable protocol provides a practical approach for an overlay peer‐to‐peer multicast facility supported within the application layer. This obviates the need to give upgraded routers capable of handling multicast broadcasting or modify the existing protocol stack. The protocol tolerates partial losses in multimedia transmissions, while supporting control of the delay sensitivity of such transmissions in WMNs. The key issue in this protocol is the ability to detect packet loss, anticipate retransmission requests, and use the anticipated retransmission requests to transmit the lost packets prior to requests from other receiving agents. The proposed protocol allows for the receiver to determine if retransmission of lost packets is required, ensuring the greatest flexibility needed for a reliable multicast protocol. Copyright © 2009 John Wiley & Sons, Ltd.     

Distributed Storage-Assisted Data-Driven Overlay Network for P2P VoD Services

Providing VCR-like operations in Peer-to-Peer (P2P) environments is a significant challenge. This paper proposes a distributed Storage-assisted Data-driven overlay Network (SDNet) to support P2P Video-on-Demand (VoD) services. It integrates two networks: a Data-driven Overlay Network (DONet) and a multi-way tree. DONet is enhanced and used for the routine video distribution based on the buffer overlapping mechanism and gossip protocol. A novel algorithm which uses a multi-way tree structure and extra pre-fetching buffers at the nodes is proposed to support efficient VoD operations. Videos are divided into uniform segments, pre-fetched and stored in a distributed manner along the tree topology. The cooperation between DONet-based video delivery and the tree-located multimedia components enable multimedia streaming interactive commands to be performed efficiently. This paper presents and discusses the structure of SDNet and the distributed storage scheme and details the cooperation procedure. Simulation-based testing results show how the proposed SDNet is an efficient interactive streaming solution in a P2P environment.      

曙光5000高性能计算机多播网络的设计

 本文介绍了曙光5000高性能计算机多播网络设计的关键技术.减少多播与单播/多播与多播间的网络竞争是降低多播延迟的主要途径之一,而无死锁则是保障多播操作正确完成的前提.为了解决死锁问题,本文提出了一种基于全局资源公告的死锁避免方法;为了获得较低的多播延迟,本文充分利用胖树拓扑特点,提出了一种基于重载交换机去除的多播路径选择策略.测试结果表明,在网络重载情况下,相比于已有多播路径选择算法,本文的路径选择策略可以获得近三倍的性能提升.对于many-to-many多播通信,曙光5000多播网络可以获得90%以上的多播吞吐率.