• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2006, Vol. 28 ›› Issue (1): 16-18.

• 论文 • 上一篇    下一篇

一种带时延约束的选播路由算法

陈燕[1] 宋玲[1] 李陶深[1,2]   

  • 出版日期:2006-01-01 发布日期:2010-05-20

  • Online:2006-01-01 Published:2010-05-20

摘要:

选播是一种新型的网络服务,它使用户通过一个选播地址就能访问到该地址所表示的一组服务器中对用户来说“最近”的一个。在实时性要求较高的业务传输过程中,保证信息传榆时延尽可能小是非常重要的。本文研究时延受限的选播路由问题,提出一种时延受限的选播路由(DCAR)算法,生成一棵以时延为度量且代价最小的选播生成树。仿真实验结果表明了该算法的正确性和高效性。 [

关键词: 选播服务 时延约束 路由

Abstract:

Anycast is a new network service. With the anycast service, a client can reach the most appropriate one of the servers that accept datagram for the anycast address. In most applications that require real-time transmission, it is very important to guarantee end-to-end performance. A delay-constrained a nycast routing(DCAR) algorithm is proposed in this paper, and the algorithm can find the low-cost anycasting tree with delay constraints. Simulation  results show that the algorithm has better performance.

Key words: anycast service, delay constraint, routing