A Novel FlexE-Based Slicing Business Hosting Equipment Empowering Energy Internet

Song, Jiang; Yong, Dai; Cai, Hao; Jia, Ping; Li, Pei; Bai, Yang

doi:10.1109/icpics55264.2022.9873629

Cited by 2 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…J. Song et al designed a service hosting device based on the FlexE with 10 Mbps granularity slicing for the service requirements of the energy Internet and the problems in networking [27]. In order to satisfy the demand for new power communication services, Z. Ding et al presented a FlexE slicing network architecture and proposed a network bearer scheme for typical power grid application scenarios [28].…”

Section: Related Workmentioning

confidence: 99%

Routing and Timeslot Scheduling for SPN Fine-Granularity Slices

Yang

Zhang

et al. 2023

Photonics

View full text Add to dashboard Cite

The integration of 5G and vertical industries promotes the development of the energy Ethernet while putting forward fine granularity, flexibility, high reliability, and deterministic low-latency service requirements for the smart grid and the ubiquitous power Internet of Things (UPIoT). As the bearer architecture supporting the next-generation optical transmission network, the Slicing Packet Network (SPN) slice granularity decreases from 5 Gbps to 10 Mbps fine granularity and the frame period of 5 Gbps large-granularity slices is short, so the non-deterministic delay caused by timeslot conflicts has a negligible impact on the end-to-end delay, and the timeslot scheduling is unnecessary. However, due to the reduction in timeslot granularity and the change in frame structure in 10 Mbps slices, the scheduling of conflicting timeslots and the complex device computing management problems need to be solved urgently. In this paper, we establish a model of routing embedded timeslot scheduling for the routing of fine-granularity slices and timeslot scheduling problems in SPN-based FlexE interfaces, for which we propose a deterministic timeslot allocation mechanism supporting end-to-end low-latency transmission. According to the timeslot symmetry, the mechanism can reduce the space of feasible solutions through ant colony optimization and unidirectional neighborhood search (ACO-UNS), so as to efficiently solve the scheduling of conflicting timeslots and provide end-to-end delay guarantee for delay-sensitive services. Finally, we make a comparison between the ACO-UNS algorithm and the timeslot random dispatching algorithm (ACO-RD); the results show that, relative to the ACO-RD, the reduction in the proposed ACO-UNS is 98.721% for the end-to-end delay of fine-granularity slices.

show abstract

Section: Related Workmentioning

confidence: 99%