期刊文献+

链路分离路径算法研究 被引量:2

Study of the Algorithms for Link Disjoint Paths
在线阅读 下载PDF
导出
摘要 传统的QoS路由算法只在源节点和目的节点之间提供一条QoS路径,这一做法已不能满足在网络连接出现故障时保持业务持续不间断地进行这一要求。分离路径算法试图在源节点和目的节点之间寻找满足一定QoS约束的分离路径(链路分离或节点分离),一条主用路径,另一条备用路径。当主用路径出现故障时,将其承载的业务流转换到备用路径上,从而实现快速的业务恢复。因此,分离路径算法研究有很重要的实用价值。 It has only one QoS path between source node and destination node in the tradional QoS routing algorithms, but now those techniques can not satisfy the requirement that many services must go sostenuto when some connections are in failure. The algorithms for disjoint paths try to find two link or node disjoint paths with some QoS constraints between source node and the destination node, then, one of the paths is used as primary path, another as backup path. A service flow will be redirected to the backup path if the primary path fails. Therefore, the research on algotithms for disjoint paths is very valuable and usable.
作者 刘静 赵晶
机构地区 [
出处 《舰船电子工程》 2014年第4期57-59,167,共4页 Ship Electronic Engineering
关键词 服务质量 链路分离 节点分离 quality of service, link disjoint, node disjoint
  • 相关文献

参考文献15

  • 1Craely E,Nair R,Rajagopalan B,et al.A Framework for QoS-based Routing in the Internet[J] .IETF RFC2386,1998(8):233-237:22-23.
  • 2Chen Shigang,Klara Nahrstedt.An overview of Quality of service routing for next generation high-speed networks:Problems and Solutions[J] .IEEE Network,1998,12(6):64-79.
  • 3汪泽焱,顾红芳.一种求解QoS路由算法的数学模型研究[J].计算机工程与应用,2003,39(8):157-159. 被引量:8
  • 4冯径,马小骏,顾冠群.适应QoS路由机制的网络模型研究[J].计算机学报,2000,23(8):799-805. 被引量:30
  • 5Supreeth K S.Multi-constrained node-disjoint multi-path QoS routing algorithms for status dissemination networks[D] .Washington:Washington State University,2004:16-21.
  • 6Suubralle J W,TARJAN R E.A quick method for finding shortest pairs of disjoint paths[J] .Networks,1984,14(2):325-336.
  • 7Yuchun Guo,Kuipers F,Mieghem P V.A link-disjoint paths algorithm for reliable QoS routing[J] .International Journal of Communication Systems,2003,16(9):779-798.
  • 8郭宇春,Fernando Kuipers,PietVan Mighem,陈常嘉.多约束分离路径算法[J].铁道学报,2005,27(2):49-57. 被引量:3
  • 9Suubralle J W.Disjoint paths in a network[J] .Networks,1974,4(2):125-145.
  • 10Bhandari R.Optimal diverse routing in telecommunication fiber networks[C] //Proc IEEE NFOCOM 94.Toronto,1994:1498-1508.

二级参考文献41

  • 1马振华,现代应用数学手册.运筹学与最优化理论卷,1998年
  • 2Wang Zheng,IEEE J Selected Areas Commun,1996年,14卷,9期,1228页
  • 3Zhang Hui,IEEE Proc,1995年,10卷,83期,1374页
  • 4Guo Y, Kuipers F A, Van Mieghem P. A Link disjoint paths algorithm for reliable QoS routing[J]. International Journal of Communication Systems, 2003, 16(9):779-798.
  • 5Kar K, Kodialam M, Lakshman T V. Routing Restorable Bandwidth Guaranteed Connections using Maximum 2Route Flows[A]. IEEE INFOCOM2002[C].New York,2002,6.
  • 6Kodialam M, Lakshman T V. Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration[A]. IEEE INFOCOM2000[C].ISREAL TELAVIV,2000,3.
  • 7Kodialam M, Lakshman T V. Restorable Dynamic Quality of Service Routing[J]. IEEE Communications Magazine, 2002,40(6): 72-81.
  • 8Lee S W, Wu C S. A kbest paths algorithm for highly reliable communication networks[J]. IEICE Trans. on Commun. 1999, E82B,(4):586-580.
  • 9Liang W. Robust routing in widearea WDM networks[A]. Proc. of 15th Int'l Parallel and Distributed Processing Symp[C]. San Francisco: April, IEEE Computer Society, 2001.
  • 10C-C Lo and B-W Chuang. A Novel Approach of Backup Path Reservation for Survivable HighSpeed Networks[J]. IEEE Communications Magazine. 2003,41(3).

共引文献44

同被引文献26

引证文献2

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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