期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

多加性QoS约束下的链路分离路由算法 被引量：7

Link-disjoint routing algorithm under multiple additive QoS constraints
在线阅读 下载PDF
导出
摘要 对多个加性QoS约束下的链路分离路径问题进行了研究,针对现有算法求解结果依赖于网络结构,难以保证对任意网络都可求得可行解和最优解的问题,提出了一种与网络结构无关的多约束链路分离路径路由算法(MCLPRA,multiple constrained link-disjoint path routing algorithm)。该算法基于SAMCRA,采用对解空间先分类,然后按类进行处理和搜索的方法,引入了控制搜索深度的参数,可保证对任意网络都能求得可行解。理论分析表明,MCLPRA能够在现有算法不能求解的情况下解得可行解和最优解。仿真结果显示,MCLPRA的可行解平均求解成功率明显高于现有算法且所求路径对长度也比现有算法更短。 The problem of finding link-disjoint paths under multiple additive QoS constraints was studied.Since the existing algorithms depended on network’s structure and could not guarantee to find feasible solutions for arbitrary net-works,a novel algorithm called multiple constrained link-disjoint path routing algorithm（MCLPRA） was proposed.MCLPRA was based on SAMCRA and didn’t rely on the network’s structure.By introducing the parameter to control its search depth,dividing the solution space into different classes and performing searching according to the classes respectively,MCLPRA was able to obtain the feasible solutions for arbitrary networks.Theoretic analysis shows that MCLPRA can get the feasible and optimal solutions when traditional schemes can not.Comprehensive simulations also show that MCLPRA has better performances than existing algorithms in terms of higher average successful rate of getting feasible solutions with shorter average total length of the obtained path pair.
作者 熊轲 裘正定 张煜 张宏科
机构地区 北京交通大学计算机与信息技术学院 清华大学电子工程系 北京交通大学电子信息工程学院
出处 《通信学报》 EI CSCD 北大核心 2010年第6期127-135,共9页 Journal on Communications
基金 国家重点基础研究发展计划("973"计划)基金资助项目(2007CB307101) 教育部科技创新工程重大项目培育资金项目(706005) 高等学校学科创新引智计划("111计划")基金资助项目(B08002)~~
关键词 服务质量路由 链路分离 可靠路由 多约束路由 QoS routing link-disjoint reliable routing multi-constrained routing
分类号 TP393 [自动化与计算机技术—计算机应用技术]
作者简介 熊轲（1981-），男，陕西汉中人，博士，清华大学电子工程系博士后，主要研究方向为下一代互联网络、多媒体通信和网络信息论。 裘正定（1944-），男，浙江嵊县人，北京交通大学教授、博士生导师，主要研究方向为现代信息处理与通信。 张煜（1983-），男，广西桂林人，北京交通大学博士生，主要研究方向为下一代互联网络和多媒体通信。 张宏科（1957-），男，山西大同人，北京交通大学教授、博士生导师，主要研究方向为下一代互联网络。
  • 相关文献

参考文献18

  • 1DAS A,MARTEL C,MUKHERJEE B,et al.A better approach to reliable multi-path provisioning[A].IEEE Global Communications Conferences(GLOBECOM)[C].2007.2724-2728.
  • 2SAWADA N,KANEKO K.Pairwise disjoint paths in pancake graphs[A].Eighth International Conference on Parallel and Distributed Computing,Applications and Technologies,DPCAT 07[C].2007.376-382.
  • 3CHEN S,NAHRSTEDT K.On finding multi-constrained paths[A].IEEE International Conference on Communications ICC'98[C].1998.874-879.
  • 4TAFT-PLOTKIN N,BELLUR B,OGIER R.Quality-of-service routing using maximally disjoint paths[A].The 7th International Workshop on Quality-of-Service[C].1999.119-128.
  • 5GUO L.LI L M,CAO J.et al.On finding feasible solutions with shared backup resources for surviving double-link failures in path-protected WDM mesh networks[J].Journal of Lightwave Technology,2007,25(1):287-296.
  • 6XIONG K,QIU Z D,ZHANG H K,Towards link-disjoint paths under multiple additive QoS constraints[A].The 2nd IET International Conferance on Wireless Mobile and Multimedia Networks(ICWMMN)[C].2008.119-127.
  • 7XU D H,QUAO C M,XIONG Y Z.Ultrafast potential-backup-cost (PBC)-based shared path protection schemes[J].Journal of Lightwave Technology,2007,25(8):2251-2259.
  • 8VAN MIEGHEM P,DE NEVE H,KUIPERS F.Hobby-by-hop quality of service routing[J].Computer Networks,2001,37(3/4):407-423.
  • 9XUE G L,SEN A,ZHANG W Y,et al.Finding a path subject to many additive QoS constraints[J].IEEE/ACM Transactions on Networking,2007,15(1):201-211.
  • 10VAN MIEGHEM P,KUIPERS F.Concepts of exact QoS routing algorithms[J].IEEE/ACM Transactions on Networking,2004,12(5):851-864.

二级参考文献34

  • 1Guo 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.
  • 2Kar K, Kodialam M, Lakshman T V. Routing Restorable Bandwidth Guaranteed Connections using Maximum 2Route Flows[A]. IEEE INFOCOM2002[C].New York,2002,6.
  • 3Kodialam M, Lakshman T V. Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration[A]. IEEE INFOCOM2000[C].ISREAL TELAVIV,2000,3.
  • 4Kodialam M, Lakshman T V. Restorable Dynamic Quality of Service Routing[J]. IEEE Communications Magazine, 2002,40(6): 72-81.
  • 5Lee 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.
  • 6Liang 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.
  • 7C-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).
  • 8Bhandari R. Optimal Diverse Routing in Telecommunication Fiber Networks[A]. Proc. IEEE INFOCOM'94[C].June 1994, Toronto, Ontario, Canada, Vol. 3, 14981508.
  • 9Bejerano Y, Breitbart Y, Orda A, Rastogi R, Sprintson A. Algorithms for Computing QoS Paths with Restoration[A]. Proc. of IEEE INFOCOM'03[C]. April 2003.
  • 10H De Neve, P Van Mieghem. TAMCRA: a tunable accuracy multiple constraints routing algorithm[J]. Computer Communications, 2000,23(7):667-679.

共引文献10

同被引文献71

引证文献7

二级引证文献7

通信学报
2010年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
关于我们 | 版权声明 | 联系我们 | 帮助中心| 意见反馈
主办单位：上海市教育委员会
技术支持：重庆维普资讯有限公司
渝公网安备 50019002500403号
使用帮助 返回顶部