5G分组前传容量规划

H. Halabian, P. Ashwood-Smith
{"title":"5G分组前传容量规划","authors":"H. Halabian, P. Ashwood-Smith","doi":"10.1109/WCNC.2018.8377215","DOIUrl":null,"url":null,"abstract":"Packet switched transport technologies have been suggested to be used in 5G front-haul networks. Front-haul bandwidth and packet latency are two major challenges to be addressed in these networks. This paper focuses on capacity planning for packet-based front-haul technologies considering the latency requirements of the 5G front-haul flows. More specifically, we answer three main questions for Constant Bit Rate (CBR) and Variable Bit Rate (VBR) packet front-haul networks: First, is statistical multiplexing gain always achievable in packet front-haul networks? Second, what is the minimum bandwidth required to accommodate a set of front-haul flows on a front-haul link? Third, what is the proper bandwidth allocation and the scheduling algorithm among the packets of different antennas to guarantee the latency requirements of the flows? It is shown that for CBR traffic no statistical multiplexing gain is achievable and the Earliest Deadline First (EDF) is the optimal packet scheduler. For VBR traffic, statistical multiplexing gain is achievable only when the latency requirement of at least one flow is greater than the packet inter-arrival time. The optimal bandwidth allocation is also determined for a Weighted Fair Queueing (WFQ) scheduler. Finally, simulation is used to validate the theoretical results for both CBR and VBR front-haul traffic.","PeriodicalId":360054,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Capacity planning for 5G packet-based front-haul\",\"authors\":\"H. Halabian, P. Ashwood-Smith\",\"doi\":\"10.1109/WCNC.2018.8377215\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Packet switched transport technologies have been suggested to be used in 5G front-haul networks. Front-haul bandwidth and packet latency are two major challenges to be addressed in these networks. This paper focuses on capacity planning for packet-based front-haul technologies considering the latency requirements of the 5G front-haul flows. More specifically, we answer three main questions for Constant Bit Rate (CBR) and Variable Bit Rate (VBR) packet front-haul networks: First, is statistical multiplexing gain always achievable in packet front-haul networks? Second, what is the minimum bandwidth required to accommodate a set of front-haul flows on a front-haul link? Third, what is the proper bandwidth allocation and the scheduling algorithm among the packets of different antennas to guarantee the latency requirements of the flows? It is shown that for CBR traffic no statistical multiplexing gain is achievable and the Earliest Deadline First (EDF) is the optimal packet scheduler. For VBR traffic, statistical multiplexing gain is achievable only when the latency requirement of at least one flow is greater than the packet inter-arrival time. The optimal bandwidth allocation is also determined for a Weighted Fair Queueing (WFQ) scheduler. Finally, simulation is used to validate the theoretical results for both CBR and VBR front-haul traffic.\",\"PeriodicalId\":360054,\"journal\":{\"name\":\"2018 IEEE Wireless Communications and Networking Conference (WCNC)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Wireless Communications and Networking Conference (WCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNC.2018.8377215\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2018.8377215","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

分组交换传输技术已被建议用于5G前传网络。前传带宽和分组延迟是这些网络中需要解决的两个主要挑战。考虑5G前传流的时延要求,重点研究基于分组的前传技术的容量规划。更具体地说,我们回答了恒定比特率(CBR)和可变比特率(VBR)分组前传网络的三个主要问题:首先,在分组前传网络中是否总是可以实现统计多路复用增益?其次,在前传链路上容纳一组前传流所需的最小带宽是多少?第三,如何在不同天线的数据包之间进行合理的带宽分配和调度算法,以保证流的延迟需求?结果表明,对于CBR业务,统计复用增益是不可实现的,最早截止时间优先(EDF)是最优的分组调度方法。对于VBR流量,只有当至少一个流的时延要求大于报文的到达间隔时间时,才能实现统计复用增益。加权公平排队(Weighted Fair queuing, WFQ)调度器也可以确定最佳带宽分配。最后,通过仿真对CBR和VBR前传业务的理论结果进行了验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Capacity planning for 5G packet-based front-haul
Packet switched transport technologies have been suggested to be used in 5G front-haul networks. Front-haul bandwidth and packet latency are two major challenges to be addressed in these networks. This paper focuses on capacity planning for packet-based front-haul technologies considering the latency requirements of the 5G front-haul flows. More specifically, we answer three main questions for Constant Bit Rate (CBR) and Variable Bit Rate (VBR) packet front-haul networks: First, is statistical multiplexing gain always achievable in packet front-haul networks? Second, what is the minimum bandwidth required to accommodate a set of front-haul flows on a front-haul link? Third, what is the proper bandwidth allocation and the scheduling algorithm among the packets of different antennas to guarantee the latency requirements of the flows? It is shown that for CBR traffic no statistical multiplexing gain is achievable and the Earliest Deadline First (EDF) is the optimal packet scheduler. For VBR traffic, statistical multiplexing gain is achievable only when the latency requirement of at least one flow is greater than the packet inter-arrival time. The optimal bandwidth allocation is also determined for a Weighted Fair Queueing (WFQ) scheduler. Finally, simulation is used to validate the theoretical results for both CBR and VBR front-haul traffic.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信