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

New restricted multicast routing algorithm in triplet-based hierarchical interconnection network

作　　者：乔保军[1] 石峰[1] 计卫星[1] 

机构地区：[1]北京理工大学计算机科学技术学院

出　　处：《计算机应用》2007年第4期801-804,共4页journal of Computer Applications

摘　　要：多播路由算法对互连网络的通信性能和多处理机系统性能的发挥起着重要作用。针对基三分层互连网络,在权衡性能、成本和实现的基础上,提出一种基于树的受限多播路由算法TRMA。该算法充分利用基三分层互连网络的层次特性和节点编码中所含的网络拓扑信息实现消息路由,算法设计简单,易于硬件实现。和其他基于树的多播路由算法相比,TRMA算法不需要源节点在发送消息前构建多播树,并将多播树的信息存放在消息中,大大降低了源节点的工作负载,提高整个系统的性能。通过仿真比较了TRMA和基于单播的多播路由算法,结果表明TRMA具有较低的网络延迟和较小的网络流量。Multicast muting algorithm is extremely important to the communication performance of interconnection network and multiprocessor systems. Taking into account the performance, cost and implementation difficulty, a new tree-based restricted multicast routing algorithm named TRMA was presented for Triplet-based Hierarchical Interconnection Network （THIN）, TRMA fully used the hierarchy of network and the topology information included in the nodes codes to decide the message muting, which can make the design of algorithm very simple and hardware implementation easy, Compared with other tree-based muhicast muting algorithms, TRMA need not to construct multicast tree in source node before transferring a multicast destination message and can improve the system performance, A simulation has been conducted that compares the performance of TRIVIA and unicast-based multicast algorithms in THIN. The results indicate that TRMA is more suitable for multicast muting in THIN with lower latency and traffic.

关 键 词：分层互连网络 基于树的多播路由 基于单播的多播路由 

分 类 号：TP393.03[自动化与计算机技术—计算机应用技术]