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

Liu, Yue; Zhou, Yiqing; Yuan, Jinhong; Liu, Ling

doi:10.1109/tcomm.2020.2976062

Cited by 10 publications

(5 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Update Slot ( 5) ELSE ( 6) Frame_number←get_Frame_number(S); // Determine the number of frames to be scheduled according to the number of waiting frames in S (7) (8) FOR (i = 1; i++; i < Frame_number) (9) Calculate the Slot set that can transmit the all frame; (10) END FOR (11) FOR (i = 1; i++; i < Frame_number) (12) Slot M ← get_feasible_slot(Slot) //Select the largest data frame to be scheduled, and select the transmissible slot with the most matching length (13) Update Slot (14) According Slot M to get W.start // W.start of each frame can be calculated (15) END FOR // The above is to select the timeslot and get W.start. Next, determine the incoming queue Qm (16) FOR (i = 1; i++; i <Q_number) // The secondary queue contains four queues.…”

Section: Experimental Results and Analysismentioning

confidence: 99%

“…Q k .status = 1; // The queue status is 1, and forwarding is performed (10) IF (t_now > = Q k .end) (11) Q k .status = 0; (12) break; (13) END IF (14) Update Q.start (15) END WHILE ALGORITHM 2: Outbound algorithm based on queue status.…”

Section: Experimental Results and Analysismentioning

confidence: 99%

“…The TSN scheduling mechanisms are roughly divided into two categories, namely, synchronous traffic scheduling and asynchronous traffic scheduling [6][7][8][9][10][11][12][13][14][15][16]. At present, synchronous traffic scheduling mainly focuses on gate control lists (GCLs) and TAS-based joint routing.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Hierarchical Cross Traffic Scheduling Based on Time-Aware Shapers for Mobile Time-Sensitive Fronthaul Network

Liu,

Hong,

Wang

et al. 2024

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

To solve the problem of jitter and low network throughput caused by the impact of background flows on IQ traffic in mobile fronthaul network, this paper proposed a new scheduling model for background flows, named hierarchical crossover traffic scheduling mechanism based on time-aware shaper (HC-TAS) by improving the traditional counterpart. Then, in this new model, we designed an inbound scheduling algorithm based on frame length matching and an outbound scheduling algorithm based on queue status, making sure that smaller data frames will not be blocked by large data frames. This greatly improves the utilization of timeslots in the scheduling process and reduces the jitter impact of background flows. To verify its performance, we conducted experiments in a simulated fronthaul network conforming to IEEE 802.1CM. The experimental results show that, under the condition that the jitter is guaranteed to be zero, compared with two mainstream scheduling schemes, Comb-FITting and TAS + Preemption, our proposed scheme can achieve lower maximum end-to-end delay and higher link utilization. The proposed HC-TAS meets the requirements of low jitter and high bandwidth utilization in 5G fronthaul network, and the research results provide a technical basis for the application and development of general time-sensitive networks as well.

show abstract

Section: Experimental Results and Analysismentioning

confidence: 99%

Section: Experimental Results and Analysismentioning

confidence: 99%

See 1 more Smart Citation

Hierarchical Cross Traffic Scheduling Based on Time-Aware Shapers for Mobile Time-Sensitive Fronthaul Network

Liu,

Hong,

Wang

et al. 2024

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…Although Ethernetbased fronthaul could be cost-effective but unable to meet the strict fronthaul traffic demands due to limited capacity, high end-to-end latency, and jitter [14] [15]. Various techniques, such as deep reinforcement learning (RL), time division multiplexing, and multiple description coding, have been proposed for congestion control and resource allocation to enhance latency and jitter in Ethernet-based fronthaul networks [16]- [18]. IEEE 1914.3 [19] and IEEE P802.1CM [20] propose the mechanism and standards to carry the multiple timesensitive traffic streams over the Ethernet fronthaul networks.…”

Section: Introductionmentioning

confidence: 99%

Performance Improvement of Time-Sensitive Fronthaul Networks in 5G Cloud-RANs Using Reinforcement Learning-Based Scheduling Scheme

Waqar,

Mustafa,

Jabeen

et al. 2024

IEEE Access

View full text Add to dashboard Cite

The rapid surge in internet-driven smart devices and bandwidth-hungry multimedia applications demands high-capacity internet services and low latencies during connectivity. Cloud radio access networks (CRANs) are considered the prominent solution to meet the stringent requirements of fifth generation (5G) and beyond networks by deploying the fronthaul transport links between baseband units (BBUs) and remote radio units (RRHS). High-capacity optical links could be conventional mainstream technology for deploying the fronthaul in CRANs. But densification of optical links significantly increases the cost and imposes several design challenges on fronthaul architecture which makes them impractical. Contrary, Ethernet-based fronthaul links can be lucrative solutions for connecting the BBUs and RRHs but are inadequate to meet the rigorous end-to-end delays, jitter, and bandwidth requirements of fronthaul networks. This is because of the inefficient resource allocation and congestion control schemes for the capacity constraint Ethernet-based fronthaul links. In this research, a novel reinforcement learning-based optimal resource allocation scheme has been proposed which eradicates the congestion and improves the latencies to make the capacity-constraints low-cost Ethernet a suitable solution for the fronthaul networks. The experiment results verified a notable 50% improvement in reducing delay and jitter as compared to the existing schemes. Furthermore, the proposed scheme demonstrated a significant enhancement of up to 70% in addressing conflicting time slots and minimizing packet loss ratios. Hence, the proposed scheme outperforms the existing state-of-the-art resource allocation techniques to satisfy the stringent performance demands of fronthaul networks.

show abstract

“…TSN application areas range from static small scale networks such as automotive networks [4], [5] to more dynamic large scale networks such as Industry 4.0 and crosshaul network for 5G ultra reliable low latency communications (URLLC) [6]- [8]. In dynamic TSN application environments, a large number of TT flows are expected to be served and frequent rescheduling of flows could arise.…”

Section: Introductionmentioning

confidence: 99%

Incremental Routing and Scheduling Using Multipath and Nonzero Jitter Bound for IEEE 802.1 Qbv Time Aware Shaper

Lee

2023

IEEE Access

View full text Add to dashboard Cite

IEEE 802.1 Qbv time-aware shaper (TAS) has been developed for delivery of time-critical periodic frames of time-triggered (TT) flows over Ethernet under strict end-to-end latency and jitter bounds. Efficient routing and flow scheduling are critical for successful deployments of TAS systems. Although many routing and flow scheduling schemes have been proposed so far, most of them are restricted to single path routing and zero jitter delivery. Although multipath routing and nonzero jitter bound could provide more flexibility in scheduling thus increase scheduling success, they have been rarely studied in TAS scheduling. In this work, online incremental routing and scheduling schemes utilizing multipath routing and nonzero jitter bound are proposed based on no-wait packet switching mechanism for TAS. Two schemes are proposed, i.e., incremental single path routing and scheduling (ISPRS) and incremental multipath routing and scheduling (IMPRS), each with nonzero jitter bound. The proposed schemes are based on resource-centric scheduling approach in which information on feasible free time-slices in the paths for a TT flow is updated according to flow scheduling result and used for scheduling of next flow. Numerical results show that scheduling with nonzero jitter bound or multipath routing could improve schedule failure rates compared with single path scheduling with zero jitter bound. Scheduling with nonzero jitter bound could improve schedule failure rates in most of considered cases, while the cases of multipath routing more favorable are relatively limited.INDEX TERMS Jitter, multipath routing, QoS, real-time Ethernet, scheduling, time-aware shaper, timesensitive network. 802.1Qbv.

show abstract

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

Cited by 10 publications

References 35 publications

Hierarchical Cross Traffic Scheduling Based on Time-Aware Shapers for Mobile Time-Sensitive Fronthaul Network

Hierarchical Cross Traffic Scheduling Based on Time-Aware Shapers for Mobile Time-Sensitive Fronthaul Network

Performance Improvement of Time-Sensitive Fronthaul Networks in 5G Cloud-RANs Using Reinforcement Learning-Based Scheduling Scheme

Incremental Routing and Scheduling Using Multipath and Nonzero Jitter Bound for IEEE 802.1 Qbv Time Aware Shaper

Contact Info

Product

Resources

About