一种新的光网络资源共享恢复机制

Yaping Zhou, Yuefeng Ji
{"title":"一种新的光网络资源共享恢复机制","authors":"Yaping Zhou, Yuefeng Ji","doi":"10.1109/ICCT.2003.1209165","DOIUrl":null,"url":null,"abstract":"A two-step resource precalculated and shared restoration mechanism is put forward in this paper. This mechanism separates calculation of link resource to reserve for newly created lightpath from restore path routing. The target of resource reservation is to minimize the resources for restoration under the condition that a restore path had been routed, and the restore path routing is base on various strategies. A different algorithm with minimal resource reservation can be seen as a different resource shared restoration scheme, which aims at a different objective for networking. Meanwhile a second shortest path and resource shared restoration scheme is given as an example.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new resource shared restoration mechanism for optical network\",\"authors\":\"Yaping Zhou, Yuefeng Ji\",\"doi\":\"10.1109/ICCT.2003.1209165\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A two-step resource precalculated and shared restoration mechanism is put forward in this paper. This mechanism separates calculation of link resource to reserve for newly created lightpath from restore path routing. The target of resource reservation is to minimize the resources for restoration under the condition that a restore path had been routed, and the restore path routing is base on various strategies. A different algorithm with minimal resource reservation can be seen as a different resource shared restoration scheme, which aims at a different objective for networking. Meanwhile a second shortest path and resource shared restoration scheme is given as an example.\",\"PeriodicalId\":237858,\"journal\":{\"name\":\"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-04-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCT.2003.1209165\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCT.2003.1209165","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种两步资源预计算共享恢复机制。这种机制将为新创建的光路预留链路资源的计算与恢复路径路由分离开来。资源预留的目标是在已经路由了恢复路径的情况下,使用于恢复的资源最小化,恢复路径的路由基于多种策略。一种不同的最小化资源预留算法可以看作是一种不同的资源共享恢复方案,它针对的是不同的网络目标。同时给出了第二最短路径和资源共享恢复方案的实例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A new resource shared restoration mechanism for optical network
A two-step resource precalculated and shared restoration mechanism is put forward in this paper. This mechanism separates calculation of link resource to reserve for newly created lightpath from restore path routing. The target of resource reservation is to minimize the resources for restoration under the condition that a restore path had been routed, and the restore path routing is base on various strategies. A different algorithm with minimal resource reservation can be seen as a different resource shared restoration scheme, which aims at a different objective for networking. Meanwhile a second shortest path and resource shared restoration scheme is given as an example.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A multicast congestion control scheme for heterogeneous receivers A novel automated fault identification approach in computer networks based on graph theory Blind channel estimation algorithm of uplink for MC-CDMA system A new approach for carrier frequency offset estimation in OFDM communication system Proactive earliest due-date scheduling in wireless packet networks
×
引用
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