Abstract
Deterministic Networking (DetNet) provides guaranteed packet transport services of ultra-low packet loss and bounded delay for the critical traffic in real-time applications such as the industrial control and the power grid. DetNet guarantees reliable packet transmissions by forwarding replicated packets on redundant paths in parallel. This service protection mechanism of DetNet is Packet Replication Elimination and Ordering Functions (PREOF). However, how to obtain the redundant paths and implement the packet replication and elimination functions of the PREOF remains to be a great challenge. This paper proposes an improved PREOF mechanism based on Segment Routing (SR-PREOF). It designs an edge-disjoint path-pair routing algorithm based on the improved Link Pruning method (LP-EDJPP). The proposed SR-PREOF implements the scheme with the SR technology. Network simulation results show that the proposed SR-PREOF effectively improves the packet reception rate and reduces the end-to-end worst-case latency bound while achieving the comparable path reliability performance compared with the traditional PREOF. The packet reception rate of the SR-PREOF increases by 5.6% and the end-to-end worst-case latency bound decreases by 10.89% compared to the PREOF when the offered load is 0.7.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Grossman, E.: Deterministic Networking Use Cases. RFC 8578 (2019). https://www.rfc-editor.org/rfc/pdfrfc/rfc8578.txt.pdf
Finn, N., et al.: Deterministic Networking Architecture. RFC 8655 (2019). https://www.rfc-editor.org/rfc/pdfrfc/rfc8655.txt.pdf
Sprecher, N., Farrel, A.: MPLS Transport Profile (MPLS-TP) Survivability Framework. RFC 6372 (2011). https://www.rfc-editor.org/info/rfc6372
Koetter, R., Medard, M.: An algebraic approach to network coding. IEEE/ACM Trans. Netw. 11(5), 782–795 (2001)
Varga, B., Farkas, J., Berger, L., et al.: Deterministic Networking Data Plane: MPLS. RFC 8964 (2021). https://www.rfc-editor.org/rfc/rfc8964.pdf
Filsfils, C., Previdi, S., Ginsberg, B., et al.: Segment Routing Architecture. RFC 8402 (2018). https://www.rfc-editor.org/pdfrfc/rfc8402.txt.pdf
Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol Label Switching Architecture. RFC 3031 (2001). https://www.rfc-editor.org/pdfrfc/rfc3031.txt.pdf
Yuchun, G., Fernando, K., Mieghem, P.: Link-disjoint paths for reliable QoS routing. Int. J. Commun. Syst. 16, 779–798 (2003)
Huong, T.T., Khoa, N.D.D., Dung, N.X., Thanh, N.H.: A global multipath load-balanced routing algorithm based on reinforcement learning in SDN. In: 2019 International Conference on Information and Communication Technology Convergence (ICTC), pp. 1336–1341 (2019)
Weiner, J., Ernst, A.T., Li, X., et al.: Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid. Eur. J. Oper. Res. 293, 847–862 (2021)
Atallah, A.A., Hamad, G.B., Mohamed, O.A.: Routing and scheduling of time-triggered traffic in time-sensitive networks. IEEE Trans. Ind. Inf. 16(7), 4525–4534 (2020)
Krolikowski, J., Martin, S., Medagliani, P., et al.: Joint routing and scheduling for large-scale deterministic IP networks. Comput. Commun. 165, 33–42 (2021)
Aubry, F., Vissicchio, S., Bonaventure, O., Deville, Y.: Robustly disjoint paths with segment routing. In: CoNEXT 2018, 4–7 December 2018, Heraklion, Greece (2018)
Aubry, F., Lebrun, D., Deville, Y., Bonaventure, O.: Traffic duplication through segmentable disjoint paths. In: 2015 IFIP Networking Conference, pp. 1–9 (2015)
Qi, G.: Research on Two Disjoint Paths (In Chinese). Fudan University (2006)
Risald, Mirino, A.E., Suyoto: Best routes selection using Dijkstra and Floyd-Warshall algorithm. In: 2017 11th International Conference on Information & Communication Technology and System (ICTS), pp. 155–158 (2017)
Vasseur, J.P., Le Roux, J.L.: Path Computation Element Communication Protocol. RFC 5440 (2009). https://www.rfc-editor.org/pdfrfc/rfc5440.txt.pdf
Filsfils, C., Camarillo, P., Leddy, J., et al.: Segment Routing over IPv6 Network Programming. RFC 8986 (2021). https://www.rfc-editor.org/rfc/rfc8986.pdf
Gross, P.: Choosing a Common IGP for the IP Internet. RFC 1371 (1992). https://www.rfc-editor.org/pdfrfc/rfc1371.txt.pdf
Cisco policies and processes. Cisco Guide to Harden Cisco IOS XR Devices. https://tools.cisco.com/security/center/resources/increase_security_ios_xr_devices.html
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Li, T., Cai, Y. (2022). A Service Protection Mechanism of Deterministic Networking Based on Segment Routing. In: Fang, F., Shu, F. (eds) Game Theory for Networks. GameNets 2022. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 457. Springer, Cham. https://doi.org/10.1007/978-3-031-23141-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-031-23141-4_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-23140-7
Online ISBN: 978-3-031-23141-4
eBook Packages: Computer ScienceComputer Science (R0)