Rank-Based Low-Latency Scheduling for Maximum Fronthaul Accommodation in Bridged Network

Fronthaul bridged networks have attracted attention to transport time-sensitive fronthaul streams in the centralized radio access network (C-RAN) architecture. When the functional split is changed and time-division duplex (TDD) is employed in the C-RAN architecture, the data rate in fronthaul become...

Full description

Bibliographic Details
Main Authors: Yu Nakayama, Daisuke Hisano
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8565839/
id doaj-9725ba0cacad48b08af440c03abc511b
record_format Article
spelling doaj-9725ba0cacad48b08af440c03abc511b2021-03-29T21:25:04ZengIEEEIEEE Access2169-35362018-01-016788297883810.1109/ACCESS.2018.28853468565839Rank-Based Low-Latency Scheduling for Maximum Fronthaul Accommodation in Bridged NetworkYu Nakayama0https://orcid.org/0000-0002-6945-7055Daisuke Hisano1Department of Integrated Information Technology, Aoyama Gakuin University, Sagamihara, JapanGraduate School of Engineering, Osaka University, Osaka, JapanFronthaul bridged networks have attracted attention to transport time-sensitive fronthaul streams in the centralized radio access network (C-RAN) architecture. When the functional split is changed and time-division duplex (TDD) is employed in the C-RAN architecture, the data rate in fronthaul becomes variable and the global synchronization of fronthaul streams will occur. In this case, it is critical to reduce the queuing delay among fronthaul streams to efficiently accommodate a number of radio equipments in a bridged network. In this paper, we propose a novel rank-based queue scheduling method for achieving low-latency in a fronthaul bridged network. The proposed scheme considers the frame-level queuing delay caused by global synchronization with the TDD. The worst-case delay of fronthaul flows is minimized, and the number of accommodated fronthaul streams is maximized. We confirmed with computer simulations that the proposed scheme can minimize the worst case delay and increase the number of accommodated fronthaul streams.https://ieeexplore.ieee.org/document/8565839/Networksnetwork topologyoptical communications
collection DOAJ
language English
format Article
sources DOAJ
author Yu Nakayama
Daisuke Hisano
spellingShingle Yu Nakayama
Daisuke Hisano
Rank-Based Low-Latency Scheduling for Maximum Fronthaul Accommodation in Bridged Network
IEEE Access
Networks
network topology
optical communications
author_facet Yu Nakayama
Daisuke Hisano
author_sort Yu Nakayama
title Rank-Based Low-Latency Scheduling for Maximum Fronthaul Accommodation in Bridged Network
title_short Rank-Based Low-Latency Scheduling for Maximum Fronthaul Accommodation in Bridged Network
title_full Rank-Based Low-Latency Scheduling for Maximum Fronthaul Accommodation in Bridged Network
title_fullStr Rank-Based Low-Latency Scheduling for Maximum Fronthaul Accommodation in Bridged Network
title_full_unstemmed Rank-Based Low-Latency Scheduling for Maximum Fronthaul Accommodation in Bridged Network
title_sort rank-based low-latency scheduling for maximum fronthaul accommodation in bridged network
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2018-01-01
description Fronthaul bridged networks have attracted attention to transport time-sensitive fronthaul streams in the centralized radio access network (C-RAN) architecture. When the functional split is changed and time-division duplex (TDD) is employed in the C-RAN architecture, the data rate in fronthaul becomes variable and the global synchronization of fronthaul streams will occur. In this case, it is critical to reduce the queuing delay among fronthaul streams to efficiently accommodate a number of radio equipments in a bridged network. In this paper, we propose a novel rank-based queue scheduling method for achieving low-latency in a fronthaul bridged network. The proposed scheme considers the frame-level queuing delay caused by global synchronization with the TDD. The worst-case delay of fronthaul flows is minimized, and the number of accommodated fronthaul streams is maximized. We confirmed with computer simulations that the proposed scheme can minimize the worst case delay and increase the number of accommodated fronthaul streams.
topic Networks
network topology
optical communications
url https://ieeexplore.ieee.org/document/8565839/
work_keys_str_mv AT yunakayama rankbasedlowlatencyschedulingformaximumfronthaulaccommodationinbridgednetwork
AT daisukehisano rankbasedlowlatencyschedulingformaximumfronthaulaccommodationinbridgednetwork
_version_ 1724193016253513728