期刊文献+

基于安全度的QoS选播路由算法 被引量:3

QoS Anycast Routing Algorithm Based on Safety Probability
下载PDF
导出
摘要 提出一种基于安全度的QoS选播路由算法。该算法从负载平衡的思想出发,利用非精确网络状态信息,赋予每条链路一个与全局资源相关的权值即链路安全度,寻找链路安全度较高的选播路径。实验结果表明,该算法能有效平衡网络负载和服务器负载,提高了源节点的请求接受率。 It is proposed a new QoS anycast routing algorithm based on safety probability, in which each link is given a weight related to the global resources by considering the load balance and inaccurate information of networks. The weight is the safety probability of links, so we can find out an anycast route with the relatively bigger safety probability. Experiment results show that the algorithm can balance the load of networks and servers, and can increase the accepting rate of request efficiently.
出处 《系统仿真学报》 EI CAS CSCD 北大核心 2005年第1期189-191,195,共4页 Journal of System Simulation
基金 湖南省自然科学基金(03JJY3098)
关键词 选播 QoS 负载平衡 最短路径算法 anycast QoS load balance shortest path algorithm.
  • 相关文献

参考文献11

  • 1Claudio Casetti, Renato Lo Cigno, Marco Mellia, Maurizio M.Munafb, Zoltan Zs6ka: A new class of QoS routing strategies based on network graph reduction[J]. Computer Networks, 2003, 41(4):475-487.
  • 2E.Basturk, R.Engel, R.Haas, D.Kandlur, V.Peris, D.Saha. Using Network Layer Anycast for Load Distribution in the Intemet[R].Tech..Rep., RC20938, IBM T. J.Watson Research Center,1997.
  • 3C.Partridge,T.Mendez, W.Milliken. Host Anycasting Service[C]. In RFC1546, November 1993.
  • 4R.Hinden, S.Deering. IP Version 6 Addressing Architecture[C]. In RFC 2373, July 1998.
  • 5R.Guerin, A. Orda. QoS-based Routing in Networks with Inaccurate Information[C]. In Proceedings of the IEEE INFOCOM'97. Japan,April 1997.
  • 6D.Xuan, W.jia, W.Zhao. A Routing Protocol for Anycast Messages[J].IEEE Trans. Parallel and Distributed Systems, 2000, 11(6): 571-588.
  • 7W. Jia, D. Xuan, W. Zhao. Integrated Routing Algorithms for Anycast Messages[J]. IEEE Communications Magazine. Vol. 38, No. 1, pp.48-53, 2000.
  • 8William T, Zaunmen, Srinivas Vutukury, J.J. Garcia-Luna- Aceves.Load-Balanced Anycast Routing in Computer Networks[EB/OL].http://citeseer.nj.nec.com1539008.html, 2000.
  • 9M. Jain, C. Dovrolis. End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput[C]. Proe.ACM SIGCOMM, 2002.
  • 10H. Djidjev, G Pantziou, and C. Zaroliagis. Improved algorithms for dynamic shortest paths[J]. Algorithmica, Vol.28, No. 4, pp. 367-389,2000.

同被引文献24

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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