Heterogeneity-aware shortest path routing: flow holding time, user demand and network state

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI:10.1109/HPSR.2001.923648

S. Yang, Xun Su, Gustavo De Veciana

{"title":"Heterogeneity-aware shortest path routing: flow holding time, user demand and network state","authors":"S. Yang, Xun Su, Gustavo De Veciana","doi":"10.1109/HPSR.2001.923648","DOIUrl":null,"url":null,"abstract":"We investigate possible performance improvements by exploring heterogeneity of traffic characteristics when designing a shortest path routing scheme. First we focus on the effect of the maintenance of the link metrics for connections with different holding times. We found that by using a differentiated routing scheme with respect to connection holding times, one can enhance network performance for a range of traffic loads. Second we propose a selective routing control scheme which determines whether to accept a shortest path routing decision based on user demands in the (source, destination, bandwidth request) tuple. Simulations were conducted to exhibit the effectiveness of such a routing algorithm. Finally, realizing the difference in routing \"local\" versus \"transit\" traffic, we present a novel approach to aggregate network state by drawing on an analogy to circuit theory. The proposed \"effective capacity\" abstraction is not only efficient in terms of the signaling savings, but also maintains a compatible routing metric to represent aggregated and local states.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2001.923648","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

Abstract

We investigate possible performance improvements by exploring heterogeneity of traffic characteristics when designing a shortest path routing scheme. First we focus on the effect of the maintenance of the link metrics for connections with different holding times. We found that by using a differentiated routing scheme with respect to connection holding times, one can enhance network performance for a range of traffic loads. Second we propose a selective routing control scheme which determines whether to accept a shortest path routing decision based on user demands in the (source, destination, bandwidth request) tuple. Simulations were conducted to exhibit the effectiveness of such a routing algorithm. Finally, realizing the difference in routing "local" versus "transit" traffic, we present a novel approach to aggregate network state by drawing on an analogy to circuit theory. The proposed "effective capacity" abstraction is not only efficient in terms of the signaling savings, but also maintains a compatible routing metric to represent aggregated and local states.

查看原文本刊更多论文

异构感知最短路径路由:流量保持时间、用户需求和网络状态

在设计最短路径路由方案时，我们通过探索流量特征的异质性来研究可能的性能改进。首先，我们关注具有不同保持时间的连接的链路度量维护的影响。我们发现，通过使用与连接保持时间相关的差异化路由方案，可以在一系列流量负载下提高网络性能。其次，我们提出了一种选择性路由控制方案，该方案根据用户在(源、目的地、带宽请求)元组中的需求来决定是否接受最短路径路由决策。仿真结果表明了该路由算法的有效性。最后，认识到路由“本地”与“中转”流量的区别，我们提出了一种通过类比电路理论来聚合网络状态的新方法。提出的“有效容量”抽象不仅在节省信令方面是有效的，而且还维护了一个兼容的路由度量来表示聚合状态和本地状态。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)

自引率

0.00%

发文量