期刊文献+

在线多点广播路由的动态方法探讨

A Restricted Dynamic Algorithm of on-Line Multicast Routing
下载PDF
导出
摘要 多点广播是网络支持多媒体业务的关键技术之一。在线多点广播问题是指组中的成员加入或离开后多点广播路由树的更新问题。本文以服务质量(QoS)指标中的带宽和时延为优化选路准则,提出了一种受限的动态多点广播路由算法,仿真结果证明了该算法比传统算法更简洁。 Multicast is becoming a key requirement of network supporting multimedia applications. On-line multicast routing problem is how multicast routing tree is changed when nodes join or leave the networks. In this paper, we propose a restricted dynamic algorithm of on-line multicast routing based on bandwidth and delay of multiple Quality of Service (QoS) metrics. The simulation shows that the proposed algorithm is more concise than old methods.
作者 高世强
机构地区 广州地铁总公司
出处 《广东自动化与信息工程》 2002年第2期31-33,共3页 Guangdong Automation & Information Engineering
关键词 在线多点广播路由 动态方法 服务质量 通信网 Quality of Service Multicast Routing Network Dynamic
  • 相关文献

参考文献5

  • 1[1]Waxman B M. Routing of multipoint connections. In IEEE Journal on selected areas in communications. 1988, volume 6(Number 9): p1617-1622
  • 2[2]M.Imase and B.Waxman. Dynamic Steiner tree problem. SIAM J. Discrete Math. 1991,volume 4(number 3): p369-384
  • 3[3]F. Baker, R. Coltun. OSPF version 2 management information base. RFC-1253.August 30,1991
  • 4[4]Bharath-Kumar K, Jaffe J M. Routing to multiple destinations in computer networks. IEEE Trans. on Communication. 1983,Volume Com-31(Number3):p343-351
  • 5[5]Jia X H, Wang L S. A group multicast routing algorithm by using multiple minimum Steiner tree. Computer Commun. 1997, 20: 750-758

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部