摘要
群组通信为计算机协同工作(CSCW,Computer Supported Cooperative Work)系统提供重要的通信支持,多目标路由算法是群组通信研究中的关键技术之一。本文在分析群组通信的特征和已有多目标路由算法的基础上,提出了一种多目标路由算法——具有层次结构且规模可扩展的多目标路由算法(HMR,Hierarchical Multicast Routing)。该算法把网络划分成具有层次结构的网络区域,以压缩网络拓扑结构信息和接收群组成员分布信息,具有良好的规模可扩展性;同时通过保留简要的网络拓扑结构信息,可保证得到较理想的最短路径分发树。
Group communication provides communication support for CSCW (Computer Supported
Cooperative Work)systems. Multicast routing is a key technique in the subject of group communi
cation. Considering the current multicast routing algorithms.this paper analyzed the characteristics
of group communication and proposed a new multicast routing algorithm, hierarchical multicast
routing (HMR) algorithm. This algorithm divided the whole computer network into multiple hier
archical areas in order to compress the network topology and group membership information and
provide scalability. According to the summary of network topology information.we can gain a very
nice result in the calculation of shortest-path multicast delivery tree.
出处
《通信学报》
EI
CSCD
北大核心
1999年第S1期134-142,共9页
Journal on Communications
基金
国家自然科学基金(登记号69773029)
