应用层组播协议研究与算法设计

提出了一个基于应用层的能够实现大规模视频直播的单源组播协议ALSSMP.在ALSSMP中采用树拓扑优先的方法来构造组播转发树.在组播树的维护方面,利用PRL算法为转发树中每一个非叶结点预先选择一个"备用父结点"以设置冗余链路,并对该算法从时间复杂度和空间复杂度方面进行了理论分析和研究.ALSSMP协议既继承了应用层组播的优点,又在一定程度上克服了应用层组播的不稳定性的特点,使组播树的稳定性和可靠性大大提高.     

高效的基于平面的层次化应用层组播树模型

应用层组播在Internet上有着广泛的应用.本文在K-叉树结构的基础上提出了一种K-叉平面结构,同时在平面的组织上结合了分层和分簇的思想.K-叉平面结构降低了子树之间的错误关联度;分层分簇降低了组播树的深度,减少了组播管理上的复杂度;在增加一定冗余的前提下,不同平面的簇与簇之间采用小概率通信,提高了数据恢复和数据传递的效率.整体而言,组播树的健壮性得到了很好的保证.仿真实验结果证明本模型能够很好地对端用户进行管理,提高了因某些结点意外失效造成的数据恢复和应用层组播的转发效率.     

一个基于应用层的单源组播协议设计

由于IP组播在实现过程中遭遇了很多困难,所以应用层组播就成了Internet应用研究的热点。本文在简单地论述了应用层组播的优缺点后,提出了一个基于应用层的单源组播协议ALSSMP。此协议设计的目的是能够实现大规模直播视频。在ALSSMP中采用树拓扑优先的方法来构造组播转发树。在组播树的维护方面,利用为转发树中每一个结点预先选择一个"备用父结点"以设置预留链路思想的PCP算法。该协议既继承了应用层组播的优点,又在一定程度上克服了应用层组播的不稳定性的特点,使组播树的稳定性和可靠性大大提高。     

基于组播通信代价的分簇密钥管理方案

针对组播网络安全问题,提出一种基于组播成员通信代价的密钥管理方案。新方案首先根据节点间的通信距离、能量采用Kruskal算法来构造簇头间路由树,簇内普通节点与本簇簇头间为星型拓扑。之后考虑树中兄弟节点关系将路由树映射成逻辑密钥树,密钥树中叶子节点与簇头成员一一对应。最后实现组播成员的动态加入与删除。理论分析与Matlab仿真实验表明,所提出方案适用于大规模的组播通信,在减少组成员存储量的同时,降低了组成员的通信开销。     

应用层组播转发树构造技术研究

应用层组播解决了网络层组播难于部署的问题,但是效率不及网络层组播.本文针对如何构建一棵高效的应用层组播转发树的问题,基于MixCast通信模型,提出并实现了一种分布式的,采用基于最近网络拓扑节点选择策略的转发树生成算法.通过仿真实验,分析了采用这种策略构造的转发树的平均延迟、平均加入时间等主要指标,实验结果表明此种方法能更多的考虑实际网络状况,提高数据转发效率.     

基于Overlay网络的应用层组播系统的研究与实现

提出了一个基于覆盖网(Overlay Network)技术的应用层组播系统。它在Pastry构建的Overlay网络上实现，由Pastry支持完成应用层的路由和组播组的发布工作，同时利用Pastry的自组织功能来增强组播系统的鲁棒性。系统基于代理的结构，利用转发树的根节点进行集中式控制和管理组播组的创建，组成员的加入、离开、组播和失效等行为，在构建组播转发树时考虑到满足不同接收者对延时和带宽的不同要求，能够较好地支持实时的组播应用。     

聚集组播树的动态匹配算法

为了减少核心路由器的计算量,尽可能地保证组播转发状态的收敛,文中对聚集组播树的匹配算法做了改进,提出一种新的聚集组播树的动态匹配算法.该算法由聚集组播树的构造、扩展、收缩和移植操作等4部分组成,能够更好地达到组播转发状态的聚集.     

基于蚁群算法的树环结构应用层组播树构建算法

作为对IP组播技术的改进,应用层组播(ALM)技术具有不受网络架构限制、资源丰富、数据传输速率高等优势。综合考虑节点性能和端到端延迟,提出一种快速且高效的建立应用层组播树的方法：基于蚁群算法的树环结构ALM模型(ACOTRM)。目前对ALM结构的研究大部分都是仅仅粗略地给出拓扑结构,而对整个构建过程却缺乏完整且清晰的描述。鉴于此,完整地给出了一种树环结构ALM树的具体构建过程,主要包括网络节点分簇、簇内成环连接、数据转发数的建立等关键步骤。另外,为每个节点设定特有的优先级,使得整个ALM树达到最优化状态。仿真结果表明,该模型得到了较低的平均时延以及较高的平均数据传输率,在增加系统稳定性的同时也提高了其转发效率。     

一种优化的PIM-SM组播转发算法的设计

简要叙述了PIM-SM中两种组播转发树特点及其相关研究,给出了一种PIM-SM组播转发树从SPT变迁到ST的设计,这一变迁是PIM-SM组播转发算法的扩展。通过这一扩展使得PIM-SM组播转发可以动态地在ST和SPT组播转发树之间进行切换,从而可以综合利用两种组播转发树的优势,来适应动态变化的网络,使得PIM-SM组播转发算法能够在扩展性和性能之间达到较好的平衡和优化。通过在实验室组播试验平台上的实际测试,证明这种协议扩展的设计能够较好地满足设计的要求。     

针对REUNITE改进的递归单播组播方案

REUNITE方案利用递归单播树算法实施组播服务,具有良好的状态可伸缩性和协议可扩展性,解决了IP组播发展的重大问题.对REUNITE方案进行分析和改进,提出一种改进的递归单播组播方案IRUM.方案能够有效的提高组播树的稳定性,提供对实时性和非对称网络的支持,同时提高组播和单播数据的转发效率.     

An application layer multicast approach based on topology-aware clustering

Application layer multicast accelerates ubiquitous deployment of the multicast communication, as well as brings unavoidable performance penalties because the group members are dynamic and lack direct knowledge about the underlying topology. A promising approach to improve the multicasting performance is to cluster the nearby nodes in groups. However, it confronts some practical challenges. A challenge is that it is difficult to assign a proximity bound to determine whether some nodes should be clustered or not. Another practical problem is how to organize the corresponding multicast structure. In this paper, we propose a new topology-aware hierarchical clustering model, which implements clustering in different grain sizes. Based on the model, we propose an application layer multicast solution named HCcast, especially for large-scale group applications. HCcast employs a topology-aware approach to choose candidate parents at different levels, and uses distributed depth first searching (DFS) approach to position a host at the same level. The clusters of HCcast are topology-based, therefore cluster split and merge operations are unnecessary, which reduces the maintenance overhead. The results of our simulation experiments show that HCcast can build multicast trees with desirable delivery performance, and the performance keep stable in different join sequences.     

无线Mesh 网络低干扰组播

不同于无线传感器网络和移动Ad Hoc网络,无线Mesh网络中的组播主要侧重于提高吞吐量,而干扰是影响吞吐量的重要因素。在构建组播拓扑时,传统的方法主要考虑最小价值或最短路径,而通过减少干扰来提高组播性能的研究较少,且它们的干扰计算方法都采用单播的思想,并不适合于组播。例如,当n个接收节点同时从一个节点接收数据时,在组播中这n个接收节点之间不存在干扰,而在单播中认为存在干扰。因此,提出了组播冲突图来计算组播干扰,给出组播树干扰的定义。可以发现,求最小干扰组播扰树是NP完全问题,然后提出基于万有引力的启发式算法构建具有较小干扰的组播树。为了适用于多信道的情况,提出了满足不同干扰范围的多跳信道分配算法。最后,仿真结果显示,与MCM相比,所提出的算法无论是在单天线单信道还是多天线多信道下,都能取得较高的吞吐量和较低的延迟。     

ACOM: Any-source Capacity-constrained Overlay Multicast in Non-DHT P2P Networks

rdquoApplication-level multicast is a promising alternative to IP multicast due to its independence from the IP routing infrastructure and its flexibility in constructing the delivery trees. The existing overlay multicast systems either support a single data source or have high maintenance overhead when multiple sources are allowed. They are inefficient for applications that require any-source multicast with varied host capacities and dynamic membership. This paper proposes ACOM, an any-source capacity-constrained overlay multicast system, consisting of three distributed multicast algorithms on top of a non-DHT overlay network with simple structures (random overlay with a non-DHT ring) that are easy to manage as nodes join and depart. The nodes have different capacities, and they can support different numbers of direct children during a multicast session. No explicit multicast trees are maintained on top of the overlay. The distributed execution of the algorithms naturally defines an implicit, roughly balanced, capacity-constrained multicast tree for each source node. We prove that the system can deliver a multicast message from any source to all nodes in expected O(log_c n) hops, which is asymptotically optimal, where c is the average node capacity and n is the number of members in a multicast group.     

结合集中式与分布式特征的多路径QoS组播路由协议

提出了一个结合集中式算法与分布式算法优点的多路径启发式QoS组播路由算法和协议,它以单播路由协议OSPF传播链路的代价信息为基础,运用最小代价Dijkstra算法计算端节点到当前在树节点的最小代价路径,然后启动一个分布式计算过程得到一个可选路径集,加入节点通过一个综合性启发式选择其中的最佳路径连接到组播树．算法能够有效地支持延时和带宽受限的代价优化组播树构造,具有无环选路、呼叫接收成功率高、呼叫建立时间短、伸缩性好等特点．     

一个新的基于度约束的组播路由算法

论文根据网络节点在通信中复制信息的能力,研究了节点的度约束以及费用最小的组播树问题,并提出了一种新的算法,当动态加入节点时,不用完全重新计算就可以得到新的组播树,以适用于某些特殊的场合。通过实验表明,算法的费用接近于以往算法,但是建立初始路由的时间要少得多,实验表明该算法具有较强的实用性。     

Lateral error recovery for media streaming in application-level multicast

We consider media streaming using application-level multicast (ALM) where packet loss has to be recovered via retransmission in a timely manner. Since packets may be lost due to congestion, node failures, and join and leave dynamics, traditional "vertical" recovery approach where upstream nodes retransmit the lost packets is no longer effective. We therefore propose lateral error recovery (LER). In LER, hosts are divided into a number of planes, each of which forms an independent ALM tree. Since error correlation across planes is low, a node effectively recovers its error by "laterally" requesting retransmission from nearby nodes in other planes. We present analysis on the complexity and recovery delay on LER. Using Internet-like topologies, we show via simulations that LER is an effective error recovery mechanism. It achieves low overhead in terms of delivery delay (i.e., relative delay penalty) and physical link stress. As compared with traditional recovery schemes, LER attains much lower residual loss rate (i.e., loss rate after retransmission) under a certain deadline constraint. The performance can be substantially improved in the presence of some reliable proxies.     

基于邻居信息交换的组播快速切换算法

切换延迟和丢包率是决定移动组播算法是否能够满足实时性组播应用要求的重要指标.提出了一种基于邻居信息交换的组播快速切换算法M-FMIPv6/NIE.在二层触发器事件发生之前,通过邻居接入路由器之间定时的信息交换,可以提前进行新转交地址的配置和请求加入组播树等操作.性能分析和仿真结果表明,M-FMIPv6/NIE的组播服务中断时间小于现有的组播快速切换算法,并且在缓存数量和丢包率等方面也具有较佳的性能.     

6LoWPAN网络组播通信方案的研究与设计

随着无线传感器网络(WSN)对新应用的需求不断增加,基于IEEE 802.15.4实现IPv6通信的低速无线个人局域网标准6LoWPAN是将WSN接入Internet实现全IP通信的理想解决方案.在此提出了一种基于6LoWPAN网络的组播通信方案,通过自组建M AC地址的方式,对现有的6LoWPAN网络增加了对组播通信的支持,设计完成了6LoWPAN网络组播通信方案,降低了组播通信下组内节点接收网关数据的时延,以及组外节点对无关数据的处理消耗.结果分析表明,该组播通信方案下的节点通信时延是单播通信下节点通信时延的15.13％,组外节点数据处理效率比广播通信下的组外节点提高了39.02％.该通信方案能够获得预期功能和性能,6LoWPAN节点能够动态加入和退出组播组,接收组播组内信息.     

Threshold-based multicast for continuous media delivery

In this paper, we propose and evaluate the performance of a continuous media delivery technique, called threshold-based multicast. Similar to patching, threshold-based multicast allows two clients that request the same video to share a channel without having to delay the earlier request. It ensures sharing by permitting the client with the later arrival time to join an ongoing multicast session initiated for the earlier request. However, threshold-based multicast does not allow a later arriving client to always join an ongoing multicast session. If it has been some time since the ongoing multicast session was started, a new multicast session is initiated. That is, a threshold is used to control the frequency at which new multicast sessions are started. We derive the optimal threshold that minimizes the server bandwidth required. Our analytical result shows that threshold-based multicast significantly reduces the server bandwidth requirement. Furthermore, we perform a simulation study demonstrating the performance gain of continuous media delivery by threshold-based multicast     

组播网络性能优化的研究

IP组播在网络中的活动组很多时候会造成网络性能的下降以及实际效率低下的问题.本文提出了一种改善组播网络性能的方法,即聚合组播,并对聚合组播的生成算法进行了研究,在贪心算法的基础上给出了伪动态算法,最后通过实验对两种算法进行了分析论证并给出了结论.