期刊文献+

服务资源动态分布的质量路由算法

QoS Routing Based on Dynamic Distributions of Service Resources
下载PDF
导出
摘要 从动态考察资源可能性分布的角度对质量路由算法进行改进,使之与用户需求与资源变化的不确定性相适应,以提高质量路由决策的效率与水平。仿真试验表明,新算法具有稳定服务水平、平衡网络负载的优点。 An approach to process dynamic states of networks service resources in QoS routing is given in this paper. By enforcing a balance of resource provision between applications and networks, and utilizing possibility distribution computation of resources, a conventional QoS routing algorithm is improved. The improved algorithm is equipped with a QoS monitor mechanism. Simulation experiments show the algorithm support to stabilize QoS and control network overload.
出处 《铁道学报》 EI CAS CSCD 北大核心 2005年第2期58-61,共4页 Journal of the China Railway Society
基金 国家自然科学基金项目(60272012)
关键词 路由 服务质量 可能性分布 quality of service routing possibility distribution
  • 相关文献

参考文献13

  • 1张中山,隆克平,程时端.MPLS业务量工程中负载均衡算法的研究[J].北京邮电大学学报,2001,24(3):46-50. 被引量:11
  • 2Chen S G, Klara Nahrstedt. Distributed qualityofservice routing in adhoc netwoek [J]. IEEE Journal on Selected Areas in Communications, 1999,17:305-317.
  • 3R Guerin ,Orda A. Qos-based routing in networks with inaccurate information: Theory and algorithms [A]. Proe.IEEE INFOCOM' 97 [C]. Japan: Los Vaqueros Press,1997. 75-83.
  • 4Sung-Eok Jeon, Randal T, John A, et al. Path selection with class distribution information in the integrated network[A]. IEEE International Conference on Communication [C]. USA: Hoes Lane Piscataway Press, 2001, 6:1841-1845.
  • 5Ma Q M, Peter Steenkiste. Supporting dynamic inter-classre source sharing: A multi-class QoS routing algorithm[A]. The Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies [C]. USA: HoesLane Piscataway Press, 1999, 2: 649-660.
  • 6Hu J C, Zheng C Y, Zhang H K, et al. The application of soft computing in QoS routing [A]. In Proc. of International Conference on Fuzzy Information Processing Theories and Applications [C]. Beijing, Tsinghua University Press & Springer. 2003, 2: 915-920.
  • 7Andrews M. Probabilistic end-to-end delay bounds for earliest qos classes [A]. The Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societes[C]. Israel: Academic Press, 2000. 2:603-612.
  • 8Liebeherr J, Patek S D, Burchard A. Statistical per-flow service bounds in a network with aggregate provisioning[A]. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies [C]. California,USA: Academic Press, 2003. 3:1680-1690.
  • 9Li X, King-Shan Liu, Wang J, Klara Nahrstedt. QoS extension to BGP [A]. Proc. of 10th IEEE International Conference on Network Protocols [C]. Paris, France: Los Alamitos Press, 2002. 100-109.
  • 10Wang G. Theory of Numeric Partition Lattices and its Applications [A]. Proceeding of International Conference on Fuzzy Information Processing Theories and Applications [C]. Beijing, Tsinghua University Press, 2003,37-43.

二级参考文献1

  • 1Xiao Xipeng,IEEE Network,2000年

共引文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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