主备共享光网络中的可用性感知路由

Yonggang Li, Qun Qiu, Longjiang Li
{"title":"主备共享光网络中的可用性感知路由","authors":"Yonggang Li, Qun Qiu, Longjiang Li","doi":"10.1109/HSPR.2008.4734425","DOIUrl":null,"url":null,"abstract":"This paper creates a novel availability model for backup resources, based on which we propose a novel availability-aware routing algorithm while the backup resources are allowed to be shared by the incoming requests after computing the availability of the backup resources. For primary-backup sharing, we introduces a comparison of the requested availabilities of every connection being covered by the backup link and the incoming request, based on which we evaluate the availability of the backup link and apply it to computing availability-aware routing. The novelty compared with the previous research cases is that the backup resource availability correlates with the requested availability of incoming connections. Through simulation, our algorithm can get more profitability on availability and better blocking performance.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Availability-aware routing in optical networks with primary-backup sharing\",\"authors\":\"Yonggang Li, Qun Qiu, Longjiang Li\",\"doi\":\"10.1109/HSPR.2008.4734425\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper creates a novel availability model for backup resources, based on which we propose a novel availability-aware routing algorithm while the backup resources are allowed to be shared by the incoming requests after computing the availability of the backup resources. For primary-backup sharing, we introduces a comparison of the requested availabilities of every connection being covered by the backup link and the incoming request, based on which we evaluate the availability of the backup link and apply it to computing availability-aware routing. The novelty compared with the previous research cases is that the backup resource availability correlates with the requested availability of incoming connections. Through simulation, our algorithm can get more profitability on availability and better blocking performance.\",\"PeriodicalId\":130484,\"journal\":{\"name\":\"2008 International Conference on High Performance Switching and Routing\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on High Performance Switching and Routing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HSPR.2008.4734425\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on High Performance Switching and Routing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HSPR.2008.4734425","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

本文建立了一种新的备份资源可用性模型,在此基础上提出了一种新的可用性感知路由算法,在计算备份资源的可用性后,允许传入请求共享备份资源。对于主备份共享,我们将对备份链路覆盖的每个连接的请求可用性和传入请求进行比较,在此基础上评估备份链路的可用性,并将其应用于计算可用性感知路由。与以前的研究案例相比,新颖之处在于备份资源可用性与传入连接的请求可用性相关。仿真结果表明,该算法具有较高的可用性和较好的阻塞性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Availability-aware routing in optical networks with primary-backup sharing
This paper creates a novel availability model for backup resources, based on which we propose a novel availability-aware routing algorithm while the backup resources are allowed to be shared by the incoming requests after computing the availability of the backup resources. For primary-backup sharing, we introduces a comparison of the requested availabilities of every connection being covered by the backup link and the incoming request, based on which we evaluate the availability of the backup link and apply it to computing availability-aware routing. The novelty compared with the previous research cases is that the backup resource availability correlates with the requested availability of incoming connections. Through simulation, our algorithm can get more profitability on availability and better blocking performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic workload profiling and task allocation in packet processing systems A distributed and scalable MPLS architecture for next generation routers Distributed PC based routers: Bottleneck analysis and architecture proposal Efficient broadcasting in interface switching wireless networks Quick-Start and XCP on a network processor: Implementation issues and performance evaluation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1