期刊文献+

一种有效的时延约束组播路由算法

An efficient delay constrained multicast routing algorithm
在线阅读 下载PDF
导出
摘要 在多媒体通信网络中 ,组播问题提出了新的要求 ,除了最小化组播通信的代价 ,同时要求保证每一个目的的节点在固定的延时之内接收信息。在这篇论文中 ,我们提出了一个链路选择函数用于解决时延约束组播问题。 In multimedia communication networks,the problem of multicasting assumes a new dimension.Apart from minimizing the cost of multicast communication,it is also necessary to ensure that each of the destination nodes receives the message within a bounded delay.In this paper,we present an edge selection function for solving the delay bounded multicast problem.Our experimental results revelal that the algorithm provides fast and superior quality solutions to the delay bounded multicast problem.
作者 黄勇
出处 《电脑与信息技术》 2002年第6期16-18,共3页 Computer and Information Technology
关键词 时延约束 组播路由算法 服务质量 多媒体通信网络 链路选择函数 Multicast Routing Delay bounded edge selection function
  • 相关文献

参考文献5

  • 1Wang Z,CrowcrOft J. Quality of service for supporting multimedia applications[J]. IEEE Journal on Selected Areas in Communications,1996.14(7):1228 -1234.
  • 2Kompella V P,Pasquale J C,Polyzos G C. Multicast routing for muhimedia communication. IEEE/ACM Trans Networking, 1993,1(3) : 286 - 292.
  • 3Waxman B M, Routing of multiple connections [J].IEEE Journal on Selected Areas in Communications,1988,6(9):1617 - 1622.
  • 4Dijkstra E W. A note on two problems in connection with graphs. Numerisehe Mathemtik, vol. 1. 269 -271,1959.
  • 5Takahashi Hsolution for, Mastuyama A . An approximate the steiner tree problem ingraphs. Mathematica Japonica. vol, 24. no. 6,573 -577.1980.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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