arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2201.07363cs.NI
收藏

基于性能保证的在线凸优化PON切片的动态带宽分配

Dynamic Bandwidth Allocation for PON Slicing with Performance-Guaranteed Online Convex Optimization

Genya Ishigaki, Siddartha Devic, Riti Gour, Jason P. Jue

摘要:

多样化网络应用的出现要求网络的资源分配更加灵活和响应迅速。网络切片是一种关键的使能技术,它为每个网络服务提供一组定制的网络资源,以满足特定的服务需求。本文研究的重点是无源光网络(PON)实现接入网的网络切片。提出了一种基于学习的PON接入网动态带宽分配算法,综合考虑了切片感知、需求响应和分配公平性。我们基于凸优化的在线算法学习隐式流量随时间的变化趋势,并确定最稳健的窗口分配,以减少平均延迟。我们的仿真结果表明,该算法通过优先考虑延迟敏感和重负载的ONU,同时保证最小的窗口分配给所有ONU的平均延迟降低。

英文摘要:

The emergence of diverse network applications demands more flexible and responsive resource allocation for networks. Network slicing is a key enabling technology that provides each network service with a tailored set of network resources to satisfy specific service requirements. The focus of this paper is the network slicing of access networks realized by Passive Optical Networks (PONs). This paper proposes a learning-based Dynamic Bandwidth Allocation (DBA) algorithm for PON access networks, considering slice-awareness, demand-responsiveness, and allocation fairness. Our online convex optimization-based algorithm learns the implicit traffic trend over time and determines the most robust window allocation that reduces the average latency. Our simulation results indicate that the proposed algorithm reduces the average latency by prioritizing delay-sensitive and heavily-loaded ONUs while guaranteeing a minimal window allocation to all ONUs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑