Graded Channel Reservation with Path Switching in Ultra High Capacity Networks

R. Cohen, N. Fazlollahi, D. Starobinski
{"title":"Graded Channel Reservation with Path Switching in Ultra High Capacity Networks","authors":"R. Cohen, N. Fazlollahi, D. Starobinski","doi":"10.1109/BROADNETS.2006.4374422","DOIUrl":null,"url":null,"abstract":"We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify minimum bandwidth and duration requirements for their connections. GCR returns the highest graded path, selected according to a general, multi-criteria optimization objective. In particular, if the optimization criterion is delay, we prove that GCR returns the earliest time available to establish the connection. The computational complexity is polynomial in the size of the graph and the number of pending requests. We introduce a number of variants to GCR, including one that that provides the capability to switch between different paths during a connection. We present practical methods for minimizing or limiting the number of path switches. Through extensive simulations, we evaluate the performance of GCR and its variants under various topological settings and applications workload. Our results show that, for certain traffic parameters, optimized path selection combined with path switching can reduce the average delay of requests by an order of magnitude and increase the saturation throughput by as much as 50%. I.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 3rd International Conference on Broadband Communications, Networks and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BROADNETS.2006.4374422","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

Abstract

We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify minimum bandwidth and duration requirements for their connections. GCR returns the highest graded path, selected according to a general, multi-criteria optimization objective. In particular, if the optimization criterion is delay, we prove that GCR returns the earliest time available to establish the connection. The computational complexity is polynomial in the size of the graph and the number of pending requests. We introduce a number of variants to GCR, including one that that provides the capability to switch between different paths during a connection. We present practical methods for minimizing or limiting the number of path switches. Through extensive simulations, we evaluate the performance of GCR and its variants under various topological settings and applications workload. Our results show that, for certain traffic parameters, optimized path selection combined with path switching can reduce the average delay of requests by an order of magnitude and increase the saturation throughput by as much as 50%. I.
超高容量网络中具有路径交换的分级信道保留
我们提出了一种新的超高速网络高级信道保留算法框架,称为分级信道保留(GCR)。GCR允许用户为其连接指定最小带宽和持续时间要求。GCR返回根据一般的多准则优化目标选择的最高级路径。特别地,当优化准则为延迟时,我们证明了GCR返回最早的可用时间来建立连接。计算复杂度与图的大小和待处理请求的数量成多项式关系。我们为GCR引入了许多变体,其中一个变体提供了在连接期间在不同路径之间切换的功能。我们提出了实用的方法来最小化或限制路径开关的数量。通过大量的仿真,我们评估了GCR及其变体在各种拓扑设置和应用工作负载下的性能。我们的研究结果表明,对于某些流量参数,优化路径选择与路径交换相结合可以将请求的平均延迟降低一个数量级,并将饱和吞吐量提高多达50%。我。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信