Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (3): 115-115.

• 网络、通信与安全 • Previous Articles     Next Articles

A Effective Real-time Anycast Flow Connection Algorithm

  

  • Received:2006-05-25 Revised:1900-01-01 Online:2007-01-21 Published:2007-01-21

一种有效的实时选播流连接建立算法

陈燕 宋玲 李陶深   

  1. 广西大学计算机与电子信息学院
  • 通讯作者: 陈燕

Abstract: Define anycast services as a group of replicated servers that may provide similar or identical services. Using anycast services can significantly simplify some applications, such as to seek appropriate servers to provide quality of service and to achieve the load balance and fault-tolerance for service availability. This paper studies a set of efficient distributed connection setup algorithms for real-time anycast flows.Our algorithms can effectively seek multiple destination connections in parallel thus the best path which satisfies the requirements of the anycast flow is chosen.

Key words: admission, multi-path routing, build connections, anycast

摘要: 选播服务被定义为一组复制服务器所提供的相同或类似的服务。使用选播服务能大大简化某些应用,例如查找合适的服务器来获得QoS服务、实现网络负载平衡和容错性服务等。本文为选播流建立连接提出了一种有效的分布式算法。对于有时延约束和最小带宽要求的一个选播流,我们的算法能有效地并行查找多个目标以建立连接、并确保满足选播请求的最好路径得到选择。

关键词: 接纳许可控制, 多路路由, 连接建立, 选播