一种新的QoS组播路由算法

针对现有的求解多约束QoS组播路由中存在的问题,结合BP神经网络局部搜索的优势和蚁群算法全局搜索的优势的特点,进行QoS组播路由算法的设计,提出了一种新型的NNAC算法。该算法通过BP神经网络寻找路径的更优解,改善了QoS组播路由路径寻找的方法。通过实验仿真表明,NNAC算法得到最优组播树的总延时为35,总代价费用为21,在完成150个度约束组播路由路径时,NNAC算法在进行最优组播树的寻找成功率上高于AC算法,同时该算法还克服了AC算法易陷入局部最小点的不足。     

机群系统上基于映射和抽样划分的并行聚类算法

采用映射和抽样划分方法,基于MPI消息传递编程模式,在机群系统上设计与实现一种并行聚类算法.该算法将生物基因序列映射成整数值,采用整数值取代字符串进行聚类,使得聚类过程快速,通过多次抽样一次聚类寻找初值在一定程度上避免了聚类结果陷入局部解的问题,优化了聚类质量.在PC机群系统上对基因序列进行并行聚类的实验结果表明该算法获得了较好的加速和可扩展性.     

A Study of Broadband Intelligent Network Implementing Video Conference and Multicast Routing Algorithm

A Study of Broadband Intelligent Network Implementing Video Conference and Multicast Routing Algorithm     

An ant colony optimisation algorithm for aggregated multicast based on minimum grouping model

The tree‐based delivery structure of the traditional Internet protocol multicast requires each on‐tree router to maintain a forwarding state for a group. This leads to a state scalability problem when large numbers of concurrent groups exist in a network. To address this state scalability problem, a novel scheme called aggregated multicast has recently been proposed, in which multiple groups are forced to share one delivery tree. In this paper, we define the aggregated multicast problem based on the minimum grouping model, and propose an ant colony optimisation algorithm. The relative fullness of the tree is defined according to the characteristics of the minimum grouping problem and is introduced as an important component in identifying the aggregation fitness function between two multicast groups. New pheromone update rules are designed based on the aggregation fitness function. To improve the convergence time of the algorithm, we use the changes (brought by each group) in the relative fullness of the current tree as the selection heuristic information. The impact of the relative fullness of the tree is analysed using the hypothesis test, and simulation results indicate that introducing relative fullness to the fitness function can significantly improve the optimisation performance of the algorithm. Compared with other heuristic algorithms, our algorithm has better optimisation performance and is more suitable for scenarios with larger bandwidth waste rates. Copyright © 2011 John Wiley & Sons, Ltd.     

Mapper:一种基于组播的Peer-to-Peer文件 匿名访问协议

Peer-to-Peer(P2P)文件系统的一个基本问题是如何在保护节点隐私的基础上为数据访问提供高效服务.Mapper将IP组播技术和多级代理转发技术相结合,解决了P2P文件访问的相互匿名问题.协议还通过MRFC算法将组成员筛选和缓存位置选择有机统一,在减少组播开销的同时保证了文件布局对用户访问模式的动态自适应性.实验表明,Mapper能有效缓解网络负载,提高数据的易获取性,具有良好的伸缩性和自适应性.     

Exploring Performance of Hypercube Structure for Multicast in Mobile Ad Hoc Networks

Performance of multicast routing protocol in mobile ad hoc networks is mostly characterized by underlying forwarding structure. Currently, general structures based on tree/mesh based scheme cannot handle with transmission efficiency, robustness to dynamic topology, scalability, and load balancing functionalities at the same time. To handle above key performance factors concurrently, we propose a new virtual backbone architecture for multicast, which is based on hierarchical hypercube structure. Due to the natural properties of hypercube structure, we can achieve efficiency, robustness and load balance in mobile ad hoc networks where links are frequently broken owing to nodes’ free immigration. Furthermore, scalability problem is naturally resolved by hierarchical structure. Finally, through simulation results, we have proven good scalability by demonstrating that our structure can provide higher packet delivery ratio with low control overhead and better scalability than tree/mesh based scheme without regard to the number of group members.     

Leveraging single rate schemes in multiple rate multicast congestion control design

A significant impediment to deployment of multicast services is the daunting technical complexity of developing, testing and validating congestion control protocols fit for wide-area deployment. Protocols such as pragmatic general multicast congestion control (pgmcc) and TCP-friendly multicast congestion control (TFMCC) have recently made considerable progress on the single rate case, i.e., where one dynamic reception rate is maintained for all receivers in the session. However, these protocols have limited applicability, since scaling to session sizes beyond tens of participants with heterogeneous available bandwidth necessitates the use of multiple rate protocols. Unfortunately, while existing multiple rate protocols exhibit better scalability, they are both less mature than single rate protocols and suffer from high complexity. We propose a new approach to multiple rate congestion control that leverages proven single rate congestion control methods by orchestrating an ensemble of independently controlled single rate sessions. We describe a new multiple rate congestion control algorithm for layered multicast sessions that employs a single rate multicast congestion control as the primary underlying control mechanism for each layer. Our new scheme combines the benefits of single rate congestion control with the scalability and flexibility of multiple rates to provide a sound multiple rate multicast congestion control policy.     

基于灰狼算法的无线网络组播路由优化

针对无线网络中资源受限的组播路由问题,考虑网络节点的节点度限制和网络链路的带宽约束,以最小化组播路由开销为目标,提出了一种二进制编码方式的基于灰狼优化算法的组播路由策略.在给定的网络拓扑下,基于灰狼优化算法的组播路由策略可以迅速找到一棵包含源和目的节点的最小开销组播树.仿真结果表明,相比于遗传算法,所提出的基于灰狼优化算法的组播路由策略可以得到一棵开销更小的组播树,并且在相同的时间复杂下具有更强的算法稳定性.     

基于ACK和NAK的可靠组播传输协议的性能分析和比较

本文在目前各种可靠组播传输协议的基础上,归纳构建了两类基本的可靠组播传输协议—基于确认(ACK)的和基于否定确认(NAK)的可靠组播传输协议.在典型的组播网络系统模型基础上,对这两类协议以及一种主要的改进协议在占用网络带宽和可扩展性方面的性能特点进行了定性的分析和比较.性能分析结果表明,基于否定确认且采用否定确认压缩策略(NAK Compression)的可靠组播传输协议成功传输组播数据包所需要的带宽较小,具备良好的可扩展性.     

基于多条件约束的ASON动态组播路由算法

在将自动交换光网络(ASON)建模成着色多重图的基础上采用综合成本策略,设计了一种新的最小综合成本路径计算算法,并结合组播成员的动态变化特性提出一种满足多条件约束的动态组播路由(DMRMC)算法,使组播路由和波长分配在同一过程内完成,且尽可能使组播树的综合总成本最小,同时局部优化波长转换次数、分光次数和不同波长的使用数量。仿真实验表明,本文算法有效可行,与采用单成本策略的组播算法相比,其取得了更低的综合成本和更好的连接阻塞性能。     

基于布尔集线器的线速多播自路由交换结构

现有的组播交换结构均是从单播交换结构发展而来,而目前的各种单播交换结构都存在各自的技术瓶颈,当被应用于组播交换时,既不能突破原交换结构的技术局限,又限制了组播交换的性能,因此现有的组播交换结构基本都不具备大规模可扩展的能力。本文提出基于分配格理论的线速组播交换结构,它不仅能满足大规模可扩展和线速组播要求,而且具有低时延、无抖动,不需要排队缓存等性能优势。本文分析并证明了该组播交换结构既能实现最优化的组播,又支持具有优先级的组播,从而在时延上保证了组播QoS(quality of service)。     

量子进化组播路由算法

近年来,时延受限的代价最小组播树问题备受关注。作为全局优化算法,遗传算法（GA）越来越多的用于解决组播路由问题。GA拥有比经典算法更强的搜索能力,但是它容易陷入＂早熟＂,很难得到最优组播树。基于量子计算的机理和特性并结合进化计算,提出了一种新颖的量子进化组播路由算法（QEA）,有效地解决了遗传组播路由算法中的＂早熟＂问题,并且在每代个体更新中采用量子旋转门策略加速了算法的收敛速度。算法实现简单,控制灵活。仿真结果表明QEA算法性能优于改进的进化算法即克隆多播路由算法（CS）和传统的遗传算法（GA）。     

Scalable location guide overlay multicast in mobile ad hoc networks using tree partition scheme

Nodes mobility brings flinty challenges to multicast in Mobile ad hoc Networks (MANETs). To track nodes mobility, flooding messages are widely used for data delivery structure construction and maintenance in many multicast protocols. These periodic flooding messages significantly consume network resources, such as energy and bandwidth, and result in network collisions. To release data delivery structure maintenance onus, profited from GPS location service, a number of stateless location based multicast protocol were proposed, where a destination list is encapsulated into each data packet for data packet orientation. However, due to data packet capability limitation, the way of encapsulating a destination list in each data packet header restricts the protocol scalability. To solve the scalability issue of multicast protocols, we propose a Scalable Location Guide Overlay Multicast (SLGOM) for MANETs. Analysis and simulation results show that SLGOM achieves high performance in large multicast group and significantly improves the scalability of stateless multicast with respect to group size. Copyright © 2010 John Wiley & Sons, Ltd.     

Power aware scalable multicast routing protocol for MANETs

Multicasting is an effective way to provide group communication. In mobile ad hoc networks (MANETs), multicasting can support a wide variety of applications that are characterized by a close degree of collaboration. Since MANETs exhibit severe resource constraints such as battery power, limited bandwidth, dynamic network topology and lack of centralized administration, multicasting in MANETs become complex. The existing multicast routing protocols concentrate more on quality of service parameters like end‐to‐end delay, jitter, bandwidth and power. They do not stress on the scalability factor of the multicast. In this paper, we address the problem of multicast scalability and propose an efficient scalable multicast routing protocol called ‘Power Aware Scalable Multicast Routing Protocol (PASMRP)’ for MANETs. PASMRP uses the concept of class of service with three priority levels and local re‐routing to provide scalability. The protocol also ensures fair utilization of the resources among the nodes through re‐routing and hence the lifetime of the network is increased. The protocol has been simulated and the results show that PASMRP has better scalability and enhanced lifetime than the existing multicast routing protocols. Copyright © 2005 John Wiley & Sons, Ltd.     

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.     

Delay analysis of feedback-synchronization signaling for multicast flow control

Feedback signaling plays a key role in flow control because the traffic source relies on the signaling information to make correct and timely flow-control decisions. Design of an efficient signaling algorithm is a challenging task since the signaling messages can tolerate neither error nor latency. Multicast flow-control signaling imposes two additional challenges: scalability and feedback synchronization. Previous research on multicast feedback-synchronization signaling has mainly focused on algorithm design and implementation. However, the delay properties of these algorithms are, despite their vital importance, neither well understood nor thoroughly studied. We develop both deterministic and statistical binary-tree models to study the delay performance of the multicast signaling algorithms. The deterministic model is used to derive the expressions of each path's feedback roundtrip time in a multicast tree, while the statistical model is employed to derive the general probability distributions of each path becoming the multicast-tree bottleneck. Using these models, we analyze and contrast the signaling delay scalability of two representative multicast signaling protocols - the soft-synchronization protocol (SSP) and the hop-by-hop (HBH) scheme - by deriving the first and second moments of multicast signaling delays. Also derived is the optimal flow-control update interval for SSP to minimize the multicast signaling delay.     

Scalable Multicast Provisioning in DiffServ with MPLS Labeling

The phenomenal growth of multimedia applications imposes scalable and efficient network support. The DiffServ and MPLS architectures were developed to provide QoS. The combination of both architectures presents a very attractive strategy to backbone network providers. However, integrating native IP multicasting with MPLS supports DiffServ is a quite comple issue. Major problems are: the lack of labels in MPLS networks, the core routers simplicity in DiffServ and the multicast state scalability problems, since it requires routers to keep a forwarding state for every multicast tree passing through it. In addition, the number of states grows with the number of groups. Under such circumstance, we propose an hybrid label aggregation algorithm in order to solve multicast scalability problem and provide a solution for multicast in MPLS support DiffServ. In the proposed scheme, one label is assigned per multicast groups (logical aggregation) and different multicast groups sharing the same output interface in a router are aggregated locally (physical aggregation). Also, in order to support the proposed algorithm, we propose a separate treatment and labels space (prime numbers range) for multicast traffic. The proposed solution allows consuming fewer labels, reducing the forwarding table and consequently the total packet processing delay.     

A QoS-aware multicast routing protocol

The future Internet is expected to support multicast applications with quality of service (QoS) requirements. To facilitate this, QoS multicast routing protocols are pivotal in enabling new receivers to join a multicast group. However, current routing protocols are either too restrictive in their search for a feasible path between a new receiver and the multicast tree, or burden the network with excessive overhead. We propose QMRP, a new QoS-aware multicast routing protocol. QMRP achieves scalability by significantly reducing the communication overhead of constructing a multicast tree, yet it retains a high chance of success. This is achieved by switching between single-path routing and multiple-path routing according to the current network conditions. The high level design of QMRP makes it operable on top of any unicast routing algorithm in both intradomain and interdomain. Its responsiveness is improved by using a termination mechanism which detects the failure as well as the success of routing without the use of timeout. In addition, QMRP always constructs loop-free multicast trees     

一种可重构流媒体调度算法

针对现有流媒体算法在异构环境下性能恶化的问题,论文提出一种支持用户异构性的可重构流媒体调度算法RSMS算法。该算法引入了追赶流的概念,能重构追赶流的速率来服务于具有不同接收带宽的异构用户,并最终通过流合并达到资源共享的目的。分析了RSMS算法的最佳组播调度间隔、所需的平均服务器带宽和服务器带宽需求分布。仿真实验表明该算法简单高效,可扩展性好。     

一种基于混合策略的动态组播密钥管理方案

组播密钥管理是当前组播安全研究的热点问题。在分析现有方案的基础上，考虑一种混合策略：将基于组的层次结构机制Iolus与基于密钥层次结构机制LKH的优点结合起来，提出了一种适合大型动态组播的可扩展的分层分组方式的密钥管理方案。该方案有效地降低了密钥更新的代价，具有较高的效率与较好的可扩展性．适合于解决大型动态组播的密钥管理问题。