在光网络上协调qos专用K最短路径的多层路由设计

H. Tode, Masashi Takada, Y. Tanigawa
{"title":"在光网络上协调qos专用K最短路径的多层路由设计","authors":"H. Tode, Masashi Takada, Y. Tanigawa","doi":"10.1109/ICCW.2015.7247393","DOIUrl":null,"url":null,"abstract":"In the Wavelength Division Multiplexing (WDM) based optical circuit switching network, it takes longer time to set up the intermediate optical cross-connecting devices on the route. Thus, pre-computed routing approaches are desirable to instantly set up the connection. Most of their research works are based on the K Shortest Path (KSP) algorithm or it's variants considering route disjointness, because of load balancing effect in network, its simplicity, and quick response caused by heuristic approach. However, it essentially remains some issues to be solved, especially on the capability for various QoS support and fairer load balancing. In particular, the set of K shortest paths independently selected between any two nodes is insufficient for entire network load balancing. Specifically, sequential selection of the K routes for each source-destination (S-D) pair causes the unfairness and unbalance in network load among all S-D pairs. In the paper, to tackle the above problems, we propose multi-tiers route design method, which provides more enhanced load balancing by selecting QoS specific multiple routes for each node pair, coordinating with the routes for other node pairs. The proposed method is not the improvement of the KSP algorithm and it's variants themselves, but the framework to find a limited number (K') of adequate paths from the K (K' ≤ K) routes pre-computed by KSP based algorithms for each S-D pair and each QoS level, taking spatial relationship between routes into account. Thus, the proposed method has complementary relationship with the KSP based algorithms themselves.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"18 1","pages":"1509-1514"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-tiers route design coordinating QoS-specific K shortest paths over optical network\",\"authors\":\"H. Tode, Masashi Takada, Y. Tanigawa\",\"doi\":\"10.1109/ICCW.2015.7247393\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the Wavelength Division Multiplexing (WDM) based optical circuit switching network, it takes longer time to set up the intermediate optical cross-connecting devices on the route. Thus, pre-computed routing approaches are desirable to instantly set up the connection. Most of their research works are based on the K Shortest Path (KSP) algorithm or it's variants considering route disjointness, because of load balancing effect in network, its simplicity, and quick response caused by heuristic approach. However, it essentially remains some issues to be solved, especially on the capability for various QoS support and fairer load balancing. In particular, the set of K shortest paths independently selected between any two nodes is insufficient for entire network load balancing. Specifically, sequential selection of the K routes for each source-destination (S-D) pair causes the unfairness and unbalance in network load among all S-D pairs. In the paper, to tackle the above problems, we propose multi-tiers route design method, which provides more enhanced load balancing by selecting QoS specific multiple routes for each node pair, coordinating with the routes for other node pairs. The proposed method is not the improvement of the KSP algorithm and it's variants themselves, but the framework to find a limited number (K') of adequate paths from the K (K' ≤ K) routes pre-computed by KSP based algorithms for each S-D pair and each QoS level, taking spatial relationship between routes into account. Thus, the proposed method has complementary relationship with the KSP based algorithms themselves.\",\"PeriodicalId\":6464,\"journal\":{\"name\":\"2015 IEEE International Conference on Communication Workshop (ICCW)\",\"volume\":\"18 1\",\"pages\":\"1509-1514\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Conference on Communication Workshop (ICCW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCW.2015.7247393\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Communication Workshop (ICCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2015.7247393","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在基于波分复用(Wavelength Division Multiplexing, WDM)的光电路交换网络中,在路由上建立中间光交叉连接设备所花费的时间较长。因此,需要预先计算的路由方法来立即建立连接。由于网络中的负载均衡效应、其简单性以及启发式方法的快速响应,他们的研究工作大多基于K最短路径(KSP)算法或考虑路由不连性的K最短路径算法的变体。然而,它本质上仍然有一些问题需要解决,特别是在各种QoS支持和更公平的负载平衡方面的能力。特别是,任意两个节点之间独立选择的K条最短路径的集合不足以实现整个网络的负载均衡。具体来说,每个源-目的对K条路由的顺序选择会导致所有源-目的对之间网络负载的不公平和不平衡。针对上述问题,本文提出了多层路由设计方法,通过为每个节点对选择特定于QoS的多条路由,并与其他节点对的路由进行协调,提供更强的负载均衡。提出的方法不是对KSP算法及其变体本身的改进,而是在考虑路由之间的空间关系的情况下,从基于KSP算法预先计算的每个S-D对和每个QoS级别的K (K’≤K)条路由中找到有限数量(K’)条适当路径的框架。因此,所提出的方法与基于KSP的算法本身具有互补关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-tiers route design coordinating QoS-specific K shortest paths over optical network
In the Wavelength Division Multiplexing (WDM) based optical circuit switching network, it takes longer time to set up the intermediate optical cross-connecting devices on the route. Thus, pre-computed routing approaches are desirable to instantly set up the connection. Most of their research works are based on the K Shortest Path (KSP) algorithm or it's variants considering route disjointness, because of load balancing effect in network, its simplicity, and quick response caused by heuristic approach. However, it essentially remains some issues to be solved, especially on the capability for various QoS support and fairer load balancing. In particular, the set of K shortest paths independently selected between any two nodes is insufficient for entire network load balancing. Specifically, sequential selection of the K routes for each source-destination (S-D) pair causes the unfairness and unbalance in network load among all S-D pairs. In the paper, to tackle the above problems, we propose multi-tiers route design method, which provides more enhanced load balancing by selecting QoS specific multiple routes for each node pair, coordinating with the routes for other node pairs. The proposed method is not the improvement of the KSP algorithm and it's variants themselves, but the framework to find a limited number (K') of adequate paths from the K (K' ≤ K) routes pre-computed by KSP based algorithms for each S-D pair and each QoS level, taking spatial relationship between routes into account. Thus, the proposed method has complementary relationship with the KSP based algorithms themselves.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信