End-to-end service provisioning based on extended segment routing in multi-domain optical networks of F5G

Abstract

As the most important fabric of fixed networks, the optical network plays an important role in expanding network capacity and providing long distance communication. At present, the fixed network has entered a key era, i.e., the fifth-generation fixed network (F5G). As one of the main features of F5G, the full-fiber connection requires a tenfold to hundredfold increase in the number of connections, which means F5G will have tens of thousands of nodes and millions of connections. Large-scale networks are composed of multiple network domains connected to each other. The whole network can be subdivided according to network functional domain. To meet different service requirements, how to provision fast end-to-end service in a multi-domain scenario has become a key issue. In optical networks, lightpath establishment must precede service transmission. The latency of lightpath establishment includes lightpath establishment signaling latency and optical interleaving device configuration latency. The latter depends on equipment performance. Therefore, how to provision fast lightpath establishment signaling is a key problem. To reduce end-to-end service provisioning latency, we propose an extended-segment-routing-based fast service provisioning scheme for the first time, to our knowledge, which consists of two steps: signaling path acquisition and signaling provisioning. For the signaling path acquisition step, we propose an adaptive segment routing (ASR) algorithm that first performs service path calculation based on service requirements, then performs a label compression algorithm to obtain the signaling path represented by the minimum number of labels according to the service path. For the signaling provisioning step, we propose a fast-signaling provisioning (FSP) process that can realize fast signaling provisioning in both single-domain and multi-domain scenarios. The simulation results show that, (1) compared to the Dijkstra algorithm, the ASR algorithm achieves a lower blocking probability for service and a better label compression effect for reducing the number of labels representing the signaling path, and, (2) compared to the traditional distributed signaling provisioning process and centralized signaling provisioning process, the FSP process achieves lower end-to-end latency.