Delay Aware Flow Scheduling for Time Sensitive Fronthaul Networks in Centralized Radio Access Network

Abstract

Packet-based fronthaul (FH) transport networks are promising for future centralized radio access networks (C-RANs), which support statistical multiplexing via flow scheduling. With stringent requirements on FH delay, the FH network is time sensitive. Targeting to minimize the maximum FH delay of all packets, this paper investigates the optimized flow scheduling in the packet-based FH network. Due to the high complexity of optimal solutions, a heuristic higher rate flow scheduled later (HRSL) scheme is proposed to achieve good performance with a low complexity. The main idea is to schedule the higher-rated flow with a lower priority, because packets in the higher-rated flow have a larger solution space to be scheduled with a smaller delay. It is proved that using HRSL, each packet must have a transmission position and no packet will be discarded during scheduling. Moreover, the asymptotic delay of HRSL is derived when the number of flows is sufficiently large. We show that the delay performance of HRSL approaches to the optimal one and yields a reduction of up to 92.6% compared to existing schemes. The properties of HRSL are also verified via simulations. If the required delay is larger than the asymptotic delay performance, the FH network with HRSL can always deliver packets in time, no matter how many flows are scheduled and what the rates of flows are.