Online Resource Allocation in Dynamic Optical Networks

R. Reyes, T. Bauschert
{"title":"Online Resource Allocation in Dynamic Optical Networks","authors":"R. Reyes, T. Bauschert","doi":"10.1109/ITC30.2018.00025","DOIUrl":null,"url":null,"abstract":"This paper presents a synopsis of ongoing research in the field of resource allocation in dynamic optical networks. This type of networks are envisioned to serve connections with random arrival and holding times and with fast connection setup requirements. Based on this, we model resource allocation as a mechanism that includes network control functions for routing and spectrum assignment (RSA), connection admission control (CAC) and grade of service (GoS) control. The goal is to efficiently assign spectrum resources to connections so as to attain optimum performance. For that, the network is modelled as a stochastic loss system subject to spectrum continuity and contiguity constraints. The theory of Markov decision processes (MDP) is then applied to formulate an algorithm that performs fast, adaptive and state-dependent RSA, CAC and GoS control. The proposed algorithm can easily be integrated with existing protocols for fast connection setup. Moreover, we discuss the cost efficiency of selected network implementations which are based on basic, colorless and colorless and directionless optical nodes.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 30th International Teletraffic Congress (ITC 30)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITC30.2018.00025","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper presents a synopsis of ongoing research in the field of resource allocation in dynamic optical networks. This type of networks are envisioned to serve connections with random arrival and holding times and with fast connection setup requirements. Based on this, we model resource allocation as a mechanism that includes network control functions for routing and spectrum assignment (RSA), connection admission control (CAC) and grade of service (GoS) control. The goal is to efficiently assign spectrum resources to connections so as to attain optimum performance. For that, the network is modelled as a stochastic loss system subject to spectrum continuity and contiguity constraints. The theory of Markov decision processes (MDP) is then applied to formulate an algorithm that performs fast, adaptive and state-dependent RSA, CAC and GoS control. The proposed algorithm can easily be integrated with existing protocols for fast connection setup. Moreover, we discuss the cost efficiency of selected network implementations which are based on basic, colorless and colorless and directionless optical nodes.
动态光网络中的在线资源分配
本文综述了动态光网络中资源分配的研究进展。这种类型的网络被设想为服务具有随机到达和保持时间以及快速连接设置要求的连接。基于此,我们将资源分配建模为一种包括路由和频谱分配(RSA)、连接允许控制(CAC)和服务等级(GoS)控制的网络控制功能的机制。目标是有效地将频谱资源分配给连接,以获得最佳性能。为此,将网络建模为受频谱连续性和连续性约束的随机损失系统。然后应用马尔可夫决策过程(MDP)理论制定了一种算法,该算法执行快速,自适应和状态依赖的RSA, CAC和GoS控制。该算法可以很容易地与现有协议集成,以快速建立连接。此外,我们还讨论了选择基于基本、无色和无色无方向光节点的网络实现的成本效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信