Heuristic-Based Cost-Efficient C-RAN Fronthaul Deployment Over TWDM-PON

Md Shahbaz Akhtar, Jitendra Gupta, Pramit Biswas, Aneek Adhya, S. Majhi
{"title":"Heuristic-Based Cost-Efficient C-RAN Fronthaul Deployment Over TWDM-PON","authors":"Md Shahbaz Akhtar, Jitendra Gupta, Pramit Biswas, Aneek Adhya, S. Majhi","doi":"10.1109/ICRAIE51050.2020.9358350","DOIUrl":null,"url":null,"abstract":"In recent times, fiber-based time and wavelength division multiplexed passive optical networks (TWDM-PONs) are identified as the most cost-efficient transport network technology for Centralized Radio Access Network (C-RAN) fronthaul design. In this paper, we propose a heuristic-based two-phase optimized recursive clustering and cardinality re-organization algorithm (RCCRA) for cost-efficient C-RAN fronthaul design using TWDM-PON. In the first optimization phase, the proposed RCCRA scheme addresses the location-allocation problem of different ONUslRRHs located at dispersed locations by forming clusters. In the second optimization phase, the algorithm reorganizes the cardinality of each formed clusters. RCCRA explores the optimal number and size of each ONU/RRH cluster, the most suitable location for placing passive devices, and the best fiber route from the BBU pool to the given ONUsIRRHs. We primarily focus on decreasing the total deployment cost by reducing the total length of deployed fibers and the number of reuuired nassive devices in the remote nodes.","PeriodicalId":149717,"journal":{"name":"2020 5th IEEE International Conference on Recent Advances and Innovations in Engineering (ICRAIE)","volume":"409 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 5th IEEE International Conference on Recent Advances and Innovations in Engineering (ICRAIE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRAIE51050.2020.9358350","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In recent times, fiber-based time and wavelength division multiplexed passive optical networks (TWDM-PONs) are identified as the most cost-efficient transport network technology for Centralized Radio Access Network (C-RAN) fronthaul design. In this paper, we propose a heuristic-based two-phase optimized recursive clustering and cardinality re-organization algorithm (RCCRA) for cost-efficient C-RAN fronthaul design using TWDM-PON. In the first optimization phase, the proposed RCCRA scheme addresses the location-allocation problem of different ONUslRRHs located at dispersed locations by forming clusters. In the second optimization phase, the algorithm reorganizes the cardinality of each formed clusters. RCCRA explores the optimal number and size of each ONU/RRH cluster, the most suitable location for placing passive devices, and the best fiber route from the BBU pool to the given ONUsIRRHs. We primarily focus on decreasing the total deployment cost by reducing the total length of deployed fibers and the number of reuuired nassive devices in the remote nodes.
TWDM-PON上基于启发式的成本高效C-RAN前传部署
近年来,基于光纤的时波分多路无源光网络(twdm - pon)被认为是集中式无线接入网(C-RAN)前传设计中最具成本效益的传输网络技术。本文提出了一种基于启发式的两阶段优化递归聚类和基数重组算法(rcra),用于基于TWDM-PON的高效C-RAN前传设计。在第一个优化阶段,提出的RCCRA方案通过形成集群来解决分布在分散位置的不同ONUslRRHs的位置分配问题。在第二个优化阶段,算法对每个形成的聚类的基数进行重新组织。RCCRA探索每个ONU/RRH集群的最佳数量和大小,放置无源设备的最合适位置,以及从BBU池到给定onusirrh的最佳光纤路由。我们主要关注通过减少已部署光纤的总长度和远程节点中所需大型设备的数量来降低总部署成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信