期刊文献+

一种新的基于Dijkstra算法的QoS组播树启发式算法 被引量:1

A new QoS multicast tree heuristic algorithm based on Dijkstra algorithm
下载PDF
导出
摘要 基于Dijkstra算法和MCP_IA算法,提出了一种耗费受限的最短时延路径算法(CCLDA),并将其应用于时延和时延差异受限的算法(DDVCA),并给出了算法实现的伪代码,不仅满足了时延和时延差异限制,而且降低了最终所得的组播树的耗费,更能满足现实需要。 This paper puts forward the CCLDA (Cost Constrained Least Delay Algorithm) based on Dijkstra Algorithm and MCP_IA, and then applies it to the DDVCA (Delay and Delay variation Constrained Algorithm) and gives code about the algorithm which is more situble for applications) so as not only to satisfy the delay and delay variation constraint but also to reduce the multicast tree cost.
作者 李秉智 李智
机构地区 重庆邮电学院
出处 《重庆邮电学院学报(自然科学版)》 2006年第1期115-118,共4页 Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition)
关键词 端到端时延 时延差异 组播树 end to end delay delay variation multicast tree
  • 相关文献

参考文献8

  • 1张登银,李军.多速率多播拥塞控制研究[J].重庆邮电学院学报(自然科学版),2005,17(2):215-220. 被引量:2
  • 2周卫华,倪县乐,丁炜.基于端到端时延保证的紧急分组优先算法[J].重庆邮电学院学报(自然科学版),2004,16(1):10-14. 被引量:3
  • 3ZHAODong-ping ZHANGDe-yun ZHANGJun ANZhi-ping.A Cooperative QoS Management Scheme Based on DiffServ Network for Real-Time Service[J].The Journal of China Universities of Posts and Telecommunications,2004,11(4):54-59. 被引量:3
  • 4FENG G,DOULIGERIS C.An efficient approximate algorithm for finding paths with two additive constraints[J].IEICE Transactions on Communications,2002,E85B (6):1143-1151.
  • 5SHEU P R,CHEN S T.A fast and efficient heuristic algorithm for the delay-and delay variation-bounded multicast tree problem[J].Computer Communications,2002,25 (8):825.
  • 6BALLARDIE A.RFC 2201.A Ballardie.Core based tree (CBT) multicast routing architecture[ EB/OL].(1997-09-28) [2005-06-16] http://rfc.arogo.net/rfc2201.html.
  • 7KIJKSTRA E W.A note on two problems in connection with graphs[J].Numerical Mathematics,1959,1:269-271.
  • 8KADABA Barath-Kumar,JEFFREY M J.Routing to multiple destinations in computer networks[J].IEEE Transactions on Communications,1983,31(3):343-351.

二级参考文献40

  • 1[1]BRADEN R, SHENKER D C S. Integrated services in the Internet architecture: an overview[S]. RFC 1633. 1994.
  • 2[2]BLAKE S, CARLON D B M, DAVIES E, et al. An architecture for differentiated services[S]. RFC 2475. 1998.
  • 3[3]NICHOLS K, BLAKE S, BAKER F, et al. Definition of the differentiated services field (DS field) in the IPv4 and IPv6 headers[S]. RFC 2474. 1998.
  • 4[4]NICHOLS K, JACOBSON V, ZHANG L. A two-bit differentiated services architecture for the Intemet [S]. RFC 2638. 1999.
  • 5[5]FERRARI T. End-to-end performance analysis with traffic aggregation[J]. Computer Networks, 2000, 34(6): 905-914
  • 6[6]TERZIS A, OGAWA J, TSUI S, et al. A prototype implementation of the two-tier architecture for differentiated services[A]. Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium [ C ]. Vancouver (Canada): 1999.
  • 7[7]Shaleeza Sohail, Sanjay Jha. The survey of bandwidth broker[R]. Technical Report, UNSW CSE TR 0206. Sydney (Australia): The University of New South Wales, 2002.
  • 8[8]ZHANG Z, DUAN Z, HOU Y. On scalable design of bandwidth brokers [J ]. IEICE Transaction on Communication,2001, E84-B(8): 2011 - 2025.
  • 9[9]STOICA I, ZHANG H. Providing guaranteed services without per-flow management [A]. Proceedings of ACM SIGCOMM'99[C]. BOSTON, 1999. 81-94.
  • 10[10]BAKIRAS S, Li V O K. Efficient resource management for end-to-end QoS guarantees in DiffServ networks[A].Proceedings of ICC 2002, Vol 2[C]. New York: IEEE,2002. 1220- 1224.

共引文献5

同被引文献8

  • 1杨春德,杨孝田.DVBMT问题的一种改进算法[J].计算机应用研究,2009,26(3):1059-1062. 被引量:3
  • 2Hua Wang, Zhao Shi. Multicast routing for delay variation bound using a modified ant colony algorithm[ J]. Journal of network and computer applications,2009,32 : 258 - 272.
  • 3FENG G, DOULIGERIS C. An efficient approximate algorithm for finding paths with two additive constraints[ J]. IEICE transactions on communications, 2002, E85 B (6) : 1143 - 1151.
  • 4Mohamed Aissa, Abdelfettah Belghith. An efficient core selection algorithm for delay and delay -variation constrained multicast tree design[ C ]//Proceedings of the IEEE. [ S. l. ] :IEEE press,2009:201 -207.
  • 5Cheng Hui, Cao Jiannong. Constructing delay -bounded muhicast tree with optimal delay variation [ C ]//IEEE international comference on communications ( ICC 06). [ S. l. ] : IEEE press, 2006 : 800 - 805.
  • 6Manas Ranjan Kabat, Manoj Kumar Patel. A heuristic algorithm for delay delay - variation bounded least cost multicast routing [ C ]//IEEE Advance computing conference( IACC), [ s. l. ] : IEEE press,2010:261 - 266.
  • 7Rouskas G N, Baldine I. Multicast routing with end- to- end delay and delay variation constraints [ J ]. IEEE journal on selected areas in communications, 1997, 15(3) : 346-356.
  • 8曹裕华,赵玉普,武晓鹏.空天信息系统发展现状与趋势研究[J].装备指挥技术学院学报,2009,20(2):50-53. 被引量:4

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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