主动层次多目通信路由模型

许多应用需要IP多目通信.在Internet大规模应用IP Multicast时,有效的路由是关键.这样的多目路由协议必须是有效的、可伸缩的和增量可配置的.但是传统的Internet路由对性能是不敏感的,不能平衡负载和处理拥塞.现有的大多数多目通信路由协议不仅负责数据转发,还负责路由树的构造,这给路由器带来了极大的复杂性,而且协议的配置是手动的、费时费钱的工作.该文提出一个主动层次式Multicast路由的体系结构,采用主动网络技术将多目通信路由协议的数据转发和控制机制分开,根据链路的状态信息用主动报文控     

An Efficient Tree-Based Multicasting Algorithm on Wormhole-Routed Star Graph Interconnection Networks Embedded with Hamiltonian Path

Multicasting is an important issue for numerous applications in parallel and distributed computing. In multicasting, the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper, we propose an efficient and deadlock-free tree-based multi-cast routing scheme for wormhole-routed star graph networks with hamiltonian path. In our proposed routing scheme, the router is with the input-buffer-based asynchronous replication mechanism that requires extra hardware cost. Meanwhile, the router simultaneously sends incoming flits on more than one outgoing channel. We perform simulation experiments with the network latency and the network traffic. Experimental results show that the proposed scheme reduces multicast latency more efficiently than other schemes.     

MMNNN: A tree-based Multicast Mechanism for NoC-based deep Neural Network accelerators

Network-on-Chip (NoC) devices have been widely used in multiprocessor systems. In recent years, NoC-based Deep Neural Network (DNN) accelerators have been proposed to connect neural computing devices using NoCs. Such designs dramatically reduce off-chip memory accesses of these platforms. However, the large number of one-to-many packet transfers significantly degrade performance with traditional unicast channels. We propose a multicast mechanism for a NoC-based DNN accelerator called Multicast Mechanism for NoC-based Neural Network accelerator (MMNNN). To do so, we propose a tree-based multicast routing algorithm with excellent scalability and the ability to minimize the number of packets in the network. We also propose a router architecture for single-flit packets. Our proposed router transfers flits to multiple destinations in a single process and has no head-of-line blocking issue, offering higher throughput and lower latency than traditional wormhole router architectures. Simulation results show that our proposed multicast mechanism offers excellent performance in classification latency, average packet latency, and energy consumption.     

一种基于气泡流控的改进多播路由算法

多播通信在片上多核系统中占据很重要的地位,并会对多核系统上并行应用程序的性能产生很大影响。现有的多播路由算法大多存在资源利用不均衡的不足,从而导致片上缓存资源的利用率较低。提出一种新的基于气泡流控的多播路由算法,该方法充分利用了片上网络的缓存资源,并通过向网络注入气泡避免了死锁现象的产生。实验表明,该方法可以有效提高片上网络中多播通信的性能,在合成负载下,该方法相对于均衡自适应多播路由算法可以实现18.1%的网络平均时延的降低以及16.7%的网络饱和吞吐量的增加。     

Link stability based multicast routing scheme in MANET

The group-oriented services are one of the primary application classes that are addressed by Mobile Ad hoc Networks (MANETs) in recent years. To support such services, multicast routing is used. Thus, there is a need to design stable and reliable multicast routing protocols for MANETs to ensure better packet delivery ratio, lower delays and reduced overheads. In this paper, we propose a mesh based multicast routing scheme that finds stable multicast path from source to receivers. The multicast mesh is constructed by using route request and route reply packets with the help of multicast routing information cache and link stability database maintained at every node. The stable paths are found based on selection of stable forwarding nodes that have high stability of link connectivity. The link stability is computed by using the parameters such as received power, distance between neighboring nodes and the link quality that is assessed using bit errors in a packet. The proposed scheme is simulated over a large number of MANET nodes with wide range of mobility and the performance is evaluated. Performance of the proposed scheme is compared with two well known mesh-based multicast routing protocols, i.e., on-demand multicast routing protocol (ODMRP) and enhanced on-demand multicast routing protocol (EODMRP). It is observed that the proposed scheme produces better packet delivery ratio, reduced packet delay and reduced overheads (such as control, memory, computation, and message overheads).     

Deadlock-free multicast wormhole routing in 2-D mesh multicomputers

Multicast communication services, in which the same message is delivered from a source node to an arbitrary number of destination nodes, are being provided in new-generation multicomputers. Broadcast is a special case of multicast in which a message is delivered to all nodes in the network. The nCUBE-2, a wormhole-routed hypercube multicomputer, provides hardware support for broadcast and a restricted form of multicast in which the destinations form a subcube. However, the broadcast routing algorithm adopted in the nCUBE-2 is not deadlock-free. In this paper, four multicast wormhole routing strategies for 2-D mesh multicomputers are proposed and studied. All of the algorithms are shown to be deadlock-free. These are the first deadlock-free multicast wormhole routing algorithms ever proposed. A simulation study has been conducted that compares the performance of these multicast algorithms under dynamic network traffic conditions in a 2-D mesh. The results indicate that a dual-path routing algorithm offers performance advantages over tree-based, multipath, and fixed-path algorithms     

基三分层网络中的受限多播路由算法

多播路由算法对互连网络的通信性能和多处理机系统性能的发挥起着重要作用。针对基三分层互连网络,在权衡性能、成本和实现的基础上,提出一种基于树的受限多播路由算法TRMA。该算法充分利用基三分层互连网络的层次特性和节点编码中所含的网络拓扑信息实现消息路由,算法设计简单,易于硬件实现。和其他基于树的多播路由算法相比,TRMA算法不需要源节点在发送消息前构建多播树,并将多播树的信息存放在消息中,大大降低了源节点的工作负载,提高整个系统的性能。通过仿真比较了TRMA和基于单播的多播路由算法,结果表明TRMA具有较低的网络延迟和较小的网络流量。     

QMRPRNS: Design of QoS multicast routing protocol using reliable node selection scheme for MANETs

A mobile Ad-Hoc networks (MANETs) is a continuously self-configuring, infrastructure-less network of wireless mobile devices. In which multicast is one of the efficient way of communication. Currently, several research have been conducted to design multicast routing protocols for wireless mobile ad-hoc networks (MANETs). Multicasting is a technique that allow to send the same message to a group of destinations simultaneously. However, it faces several challenges against its implementation in ad-hoc network due to its dynamic nature, lack of bandwidth, short battery lifetime of the mobile devices. The multicast routing protocol MAODV have several constraints as mentioned above. Hence to address these constraints a reliable neighbour nodes selection scheme has been integrated over MAODV. This paper attempt a Quality of Service (QoS) based multicast routing protocol using reliable neighbour nodes selection scheme (QMRPRNS) for same. The simulation has been conducted to compare the performance of the proposed scheme against some existing multicast routing protocols which shows significant improvement over EMAODV and MAODV.     

基于接口格式的稀疏组播转发状态压缩方案

组播转发状态随组播组个数线性增长导致组播路由协议的扩展性较差．分析了已有的用于稀疏模式组播的转发状态组内压缩方案存在的问题,提出了一个新的压缩方案．该方案根据组播树上分支路由器的位置和个数,动态调整组播转发表项中各个接口的格式,进一步减少了转发状态占用的存储空间．     

Multipath-Based Multicasting Strategies for Wormhole-Routed Star Graph Interconnection Networks

The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper, we present a multipath-based multicast routing model for wormholerouted star graph networks, propose two efficient multipath routing schemes, and contrast the performance of the proposed schemes with the performance of the scheme presented in our previous work. Both of the two proposed schemes have been proven to be deadlock-free. The first scheme, simple multipath routing, uses multiple independent paths for concurrent multicasting. The second scheme, two-phase multipath routing, includes two phases: source-to-relay and relay-to-destination. For each phase, multicasting is carried out using simple multipath routing. Experimental results show that, for short and medium messages with small message startup latencies, the proposed schemes reduce multicast latency more efficiently than other schemes.     

Efficient fault-tolerant multicast scheme for hypercubemulticomputers

This paper presents a fault-tolerant multicast scheme for hypercube multicomputers. The method is based on the routing capability information that is stored in each node. In comparison with the previous schemes, this information is able to capture the fault status more precisely. Two multicast algorithms are presented in the paper. These algorithms multicast messages in an attempt to minimize derouting so that time optimality can be achieved. Moreover, the routing capability information is used to guide derouting in an efficient manner when such needs arise. The amount of traffic incurred is addressed in the paper. The hardware design for the algorithms is also discussed. Extensive simulation has been conducted to evaluate the performance of the scheme. The results show the effectiveness of the proposed algorithms     

基于流量预测的移动Ad hoc网联合组播路由协议

组播是移动Ad hoc网络一项重要应用技术,而路由协议的研究一直是组播技术研究的重点。相关研究已经表明在MANET中传统的分层方法对提高网络性能并不有效。该文在流量预测的基础上,联合PHY层、MAC层、LL层、网络层的相关基本信息提出了一种联合路由标准,并给出了基于ODMRP和跨层设计方法的一种联合组播路由协议方案。该方案既保证网络层次的独立性,又能方便各网络分层间的信息交换,避免了跨层设计所带来的复杂性。模拟结果显示联合路由协议的综合性能比ODMRP要好。     

Design and implementation of light-weight mobile multicast for fast MIPv6

Mobile multicast is a research hotspot and can provide many applications. Some mobile multicast schemes have been proposed, but most of them introduce new entities and study construction algorithms of the dynamic multicast delivery structure which is heavyweight for wireless devices. In this paper, we propose a light-weight mobile multicast (LMM) scheme for Fast Mobile IPv6 which reduces the redundant operational overhead by simplifying multicast listener discovery (MLD) proxying. The LMM scheme implements simplified MLD proxying function on home agent to reduce the complicated multicast routing protocol and modifies MLD host part function on mobile node to reduce the multicast membership messages interaction. In order to solve the tunnel convergence problem, LMM also introduces a multicast tunnel combination and reconstruction algorithm. We set up a test-bed to evaluate the performance of LMM, and compare it with other mobile multicast schemes. The experimental results show that LMM reduces the multicast disruption time at handover. Based on the experimental results, we analyze the cost of LMM, and the results show that it has lower protocol cost than other schemes.     

An encounter-based multicast scheme for disruption tolerant networks

Some ad hoc network scenarios are characterized by frequent partitions and intermittent connectivity. Hence, existing ad hoc routing schemes that assume that an end-to-end path exists from a source to a destination do not work in such challenging environment. A store-and-forward network architecture known as the disruption tolerant network (DTN) has been designed for such challenging network environments. Several unicast and multicast routing schemes have been designed for DTNs. However, the existing multicast routing schemes assume a route discovery process that is similar to the existing ad hoc network routing approach. Thus, in this paper, we design an encounter-based multicast routing (EBMR) scheme for DTNs which uses fewer hops for message delivery. We first describe how the EBMR scheme works and then present an analytical framework to estimate the delivery performance of the EBMR scheme. Next, we present some comparisons of the analytical and simulation results to show that our analytical framework provides delivery performance estimates that match closely the observed simulation results. Last but not least, we present simulation results to study the delivery performance of EBMR in different scenarios, e.g. different mobility models, different multicast group size, different number of multicast groups and different node speed. We also compare the performance of the EBMR scheme with other DTN multicast strategies. Our simulation results indicate that the EBMR scheme can achieve higher delivery ratio while maintaining high data transmission efficiency compared to other multicast strategies.     

MTCP: scalable TCP-like congestion control for reliable multicast

We present MTCP, a congestion control scheme for large-scale reliable multicast. Congestion control for reliable multicast is important, because of its wide applications in multimedia and collaborative computing, yet non-trivial, because of the potentially large number of receivers involved. Many schemes have been proposed to handle the recovery of lost packets in a scalable manner, but there is little work on the design and implementation of congestion control schemes for reliable multicast. We propose new techniques that can effectively handle instances of congestion occurring simultaneously at various parts of a multicast tree.Our protocol incorporates several novel features: (1) hierarchical congestion status reports that distribute the load of processing feedback from all receivers across the multicast group, (2) the relative time delay concept which overcomes the difficulty of estimating round-trip times in tree-based multicast environments, (3) window-based control that prevents the sender from transmitting faster than packets leave the bottleneck link on the multicast path through which the sender's traffic flows, (4) a retransmission window that regulates the flow of repair packets to prevent local recovery from causing congestion, and (5) a selective acknowledgment scheme that prevents independent (i.e., non-congestion-related) packet loss from reducing the sender's transmission rate. We have implemented MTCP both on UDP in SunOS 5.6 and on the simulator ns, and we have conducted extensive Internet experiments and simulation to test the scalability and inter-fairness properties of the protocol. The encouraging results we have obtained support our confidence that TCP-like congestion control for large-scale reliable multicast is within our grasp.     

汇聚组播:新型MPLS服务质量组播体系结构

为支持新兴网络应用,IP组播(multicast)和MPLS(multi-protocol label switching)技术分别从不同方向扩展了当前的IP路由和交换模式.MPLS和IP组播的结合是当前研究的一个热点,MPLS网络中的服务质量组播面临着标签资源匮乏、组播路由状态的可扩展性以及具体实现上的困难.针对这些问题,提出了基于汇聚方法的新型MPLS服务质量组播体系结构,提出在现有的路由控制平面上叠加一层面向IP组播服务的控制平面,取代组播路由协议并支持组播聚集,形成2层控制平面结构.定义了两平面之间的协作和交互方式,并通过扩展RSVP-TE(resource reservation protocol-traffic engineering) P2MP(point to multi-point)协议,在新的体系结构中融合了服务质量控制能力.另外,还探讨了汇聚组播中基于距离约束选择汇聚路由器的算法,实现了基于Linux的MPLS组播路由器和IP组播服务控制系统,并组建了实验平台.实验和模拟结果表明,基于汇聚组播的双平面网络控制结构能够适应组播用户和网络拓扑的动态变化,能够有效节省MPLS标签资源,平衡网络中组播流量的分布.     

Architectural support for efficient multicasting in irregularnetworks

Parallel computing on networks of workstations is fast becoming a cost-effective high-performance computing alternative to MPPs. Such a computing environment typically consists of processing nodes interconnected through a switch-based irregular network. Many of the problems that were solved for regular networks have to be solved anew for these systems. One such problem is that of efficient multicast communication. In this paper, we propose two broad categories of schemes for efficient multicasting in such irregular networks: network interface-based (NI-based) and switch-based. The NI-based multicasting schemes use the network interface of intermediate destinations for absorbing and retransmitting messages to other destinations in the multicast tree. In contrast, the switch-based multicasting schemes use hardware support for packet replication at the switches of the network and a concept known as multidestination routing to convey a multicast message from one source to multiple destinations. We first present alternative schemes for efficient multipacket forwarding at the NI and derive an optimal k-binomial multicast tree for multipacket NI-based multicast. We then propose two switch-based multicasting schemes that differ in the power of the encoding scheme and the complexity of the decoding logic at the switches. These multicasting schemes use path-based multidestination worms that can cover all nodes connected to switches along a valid unicast path and tree-based multidestination worms that can cover entire destination sets in a single phase using one worm, respectively. For each scheme, we describe the associated header encoding and decoding operation, the method for deriving multidestination worms that cover arbitrary multicast destination sets, and the multicasting scheme using the derived multidestination worms     

Efficient multicast schemes for 3-D Networks-on-Chip

3-D Networks-on-Chip (NoCs) have been proposed as a potent solution to address both the interconnection and design complexity problems facing future System-on-Chip (SoC) designs. In this paper, two topology-aware multicast routing algorithms, Multicasting XYZ (MXYZ) and Alternative XYZ (AL + XYZ) algorithms in supporting of 3-D NoC are proposed. In essence, MXYZ is a simple dimension order multicast routing algorithm that targets 3-D NoC systems built upon regular topologies. To support multicast routing in irregular regions, AL + XYZ can be applied, where an alternative output channel is sought to forward/replicate the packets whenever the output channel determined by MXYZ is not available. To evaluate the performance of MXYZ and AL + XYZ, extensive experiments have been conducted by comparing MXYZ and AL + XYZ against a path-based multicast routing algorithm and an irregular region oriented multiple unicast routing algorithm, respectively. The experimental results confirm that the proposed MXYZ and AL + XYZ schemes, respectively, have lower latency and power consumption than the other two routing algorithms, meriting the two proposed algorithms to be more suitable for supporting multicasting in 3-D NoC systems. In addition, the hardware implementation cost of AL + XYZ is shown to be quite modest.     

AdHoc网络多播路由协议研究进展分析

基于AdHoc网络的特殊性,固定网络中已有的多播路由协议已经难以有较好的适应度,怎样在移动无线自组织网络中实现效率较高的多播路由已成为一个极具挑战性的问题。分析了移动无线自组织网络中多播路由协议所具有的问题以及相应的设计要求;详细阐述了现有的移动无线自组织网络多播路由协议,并对该网络中不同多播路由的方法进行了分析和比较;对移动无线自组织网络中的多播路由协议的使用进行了总结。