A fast approach to solve the Route and Spectrum Allocation problem in OFDM networks

Arijit Paul, Quazi Rahman, S. Bandyopadhyay, Y. Aneja
{"title":"A fast approach to solve the Route and Spectrum Allocation problem in OFDM networks","authors":"Arijit Paul, Quazi Rahman, S. Bandyopadhyay, Y. Aneja","doi":"10.1145/2684464.2684501","DOIUrl":null,"url":null,"abstract":"Orthogonal Frequency Division Multiplexing (OFDM) has recently emerged as a promising technology. A network using OFDM based Spectrum-sliced Elastic Optical Path (SLICE) has a higher spectrum efficiency, due to the fine granularity of subcarrier frequencies used. To minimize the utilized spectrum in SLICE networks, the routing and spectrum allocation problem (RSA) has to be efficiently solved. We have solved the RSA problem using a Mixed Integer Linear Programming (MILP) formulation and have compared our approaches with another recent formulation.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 16th International Conference on Distributed Computing and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2684464.2684501","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Orthogonal Frequency Division Multiplexing (OFDM) has recently emerged as a promising technology. A network using OFDM based Spectrum-sliced Elastic Optical Path (SLICE) has a higher spectrum efficiency, due to the fine granularity of subcarrier frequencies used. To minimize the utilized spectrum in SLICE networks, the routing and spectrum allocation problem (RSA) has to be efficiently solved. We have solved the RSA problem using a Mixed Integer Linear Programming (MILP) formulation and have compared our approaches with another recent formulation.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种快速解决OFDM网络中路由和频谱分配问题的方法
正交频分复用技术(OFDM)是近年来发展起来的一项很有前途的技术。基于OFDM的频谱切片弹性光路(SLICE)网络由于使用了细粒度的子载波频率,具有更高的频谱效率。为了使SLICE网络的频谱利用率最小化,必须有效地解决路由和频谱分配问题(RSA)。我们使用混合整数线性规划(MILP)公式解决了RSA问题,并将我们的方法与另一个最近的公式进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Distributed Computation of Sparse Cuts via Random Walks Self-Stabilizing ℓ-Exclusion Revisited Optimally Resilient Asynchronous MPC with Linear Communication Complexity OPCAM: Optimal Algorithms Implementing Causal Memories in Shared Memory Systems Solving Consensus in Opportunistic 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