Abstract
We propose a theoretical analysis of a novel source routing scheme called XSR. XSR uses linear encoding operation to both (1) build the path labels of unicast and multicast data transfers; (2) perform fast computational efficient routing decisions compared to standard table lookup procedure without any packet modification all along the path. XSR specifically focuses on decreasing the computational complexity of forwarding operations. This allows packet switches (e.g, link-layer switch or router) to perform only simple linear operations over a binary vector label that embeds the path. We provide analytical proofs demonstrating that XSRs efficiently compute a valid unicast or multicast path label over any finite fields \({\mathbb {F}}_{2^w}\). Furthermore, we show that this path label can be used for both the forward and return unicast paths, unlike other source routing algorithms that require recomputing a label for the return path. Compared to recent approaches based on modular arithmetic, XSR computes the smallest label possible and presents strong scalable properties, allowing it to be deployed over any kind of core vendor or datacenter networks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data Availability
Not applicable.
Notes
The value of \(\epsilon\) can be reduced by determining a static configuration of the filters (out of the scope of this paper).
References
Internet Protocol. RFC Editor. https://doi.org/10.17487/RFC0791 . https://rfc-editor.org/rfc/rfc791.txt (1981)
Previdi, S., Filsfils, C., Decraene, B., Litkowski, S., Horneffer, M., Shakir, R.: Source Packet Routing in Networking (SPRING) Problem Statement and Requirements. RFC Editor (2016). https://doi.org/10.17487/RFC7855 . https://rfc-editor.org/rfc/rfc7855.txt
Lee, T., Pappas, C., Basescu, C., Han, J., Hoefler, T., Perrig, A.: Source-based path selection: The data plane perspective. In: The 10th International Conference on Future Internet. CFI ’15, pp. 41–45. Association for Computing Machinery, New York, NY, USA (2015). https://doi.org/10.1145/2775088.2775090
Abujoda, A., Kouchaksaraei, H.R., Papadimitriou, P.: Sdn-based source routing for scalable service chaining in datacenters. In: Mamatas, L., Matta, I., Papadimitriou, P., Koucheryavy, Y. (eds.) Wired/Wireless Internet Communications, pp. 66–77. Springer, Cham (2016)
Parkes, S.M., et al.: SpaceWire: Links, Nodes, Routers and Networks. European Cooperation for Space Standardization, Standard No. ECSS- E50-12A (2003)
Hu, Y.-C., Maltz, D.A., Johnson, D.B.: The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4. RFC Editor (2007). https://doi.org/10.17487/RFC4728 . https://rfc-editor.org/rfc/rfc4728.txt
Li, S., et al.: Improving SDN scalability with protocol-oblivious source routing: a system-level study. IEEE Trans. Netw. Serv. Manag. 15(1), 275–288 (2018). https://doi.org/10.1109/TNSM.2017.2766159
Ventre, P.L., Salsano, S., Polverini, M., Cianfrani, A., Abdelsalam, A., Filsfils, C., Camarillo, P., Clad, F.: Segment routing: A comprehensive survey of research activities, standardization efforts, and implementation results. IEEE Commun. Surv. Tutor. 23(1), 182–221 (2021). https://doi.org/10.1109/COMST.2020.3036826
Guedrez, R., Dugeon, O., Lahoud, S., Texier, G.: A new method for encoding MPLS segment routing TE paths. In: 2017 8th International Conference on the Network of the Future (NOF), pp. 58–65 (2017). https://doi.org/10.1109/NOF.2017.8251221
Filsfils, C., Previdi, S., Ginsberg, L., Decraene, B., Litkowski, S., Shakir, R.: Segment Routing Architecture. RFC Editor (2018). https://doi.org/10.17487/RFC8402 . https://rfc-editor.org/rfc/rfc8402.txt
Jadin, M., Aubry, F., Schaus, P., Bonaventure, O.: CG4SR: Near optimal traffic engineering for segment routing with column generation. In: IEEE INFOCOM, pp. 1333–1341 (2019)
Giorgetti, A., Castoldi, P., Cugini, F., Nijhof, J., Lazzeri, F., Bruno, G.: Path encoding in segment routing. In: 2015 IEEE Global Communications Conference (GLOBECOM), pp. 1–6 (2015). https://doi.org/10.1109/GLOCOM.2015.7417097
Guedrez, R., Dugeon, O., Lahoud, S., Texier, G.: Label encoding algorithm for mpls segment routing. In: 2016 IEEE 15th International Symposium on Network Computing and Applications (NCA), pp. 113–117 (2016). https://doi.org/10.1109/NCA.2016.7778603
Soliman, M., Nandy, B., Lambadaris, I., Ashwood-Smith, P.: Source routed forwarding with software defined control, considerations and implications. In: Proceedings of the ACM Conference on CoNEXT Student Workshop, pp. 43–44. ACM, New York, NY, USA (2012). https://doi.org/10.1145/2413247.2413274
Hari, A., Niesen, U., Wilfong, G.: On the problem of optimal path encoding for software-defined networks. IEEE/ACM Trans. Netw. 25(1), 189–198 (2017). https://doi.org/10.1109/TNET.2016.2571300
Liberato, A., et al.: RDNA: Residue-defined networking architecture enabling ultra-reliable low-latency datacenters. IEEE Trans. Netw. Serv. Manag. 15(4), 1473–1487 (2018). https://doi.org/10.1109/TNSM.2018.2876845
Castelluccia, C., Mutaf, P.: Hash-based dynamic source routing. Networking 2004, 1012–1023 (2004)
Jia, W.: A scalable multicast source routing architecture for data center networks. IEEE J. Sel. Areas Commun. 32(1), 116–123 (2014). https://doi.org/10.1109/JSAC.2014.140111
Berlekamp, E.R.: The technology of error-correcting codes. Proc. IEEE 68(5), 564–593 (1980). https://doi.org/10.1109/PROC.1980.11696
Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13(4), 354–356 (1969). https://doi.org/10.1007/BF02165411
Lint, J.H., Wilson, R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001). https://doi.org/10.1017/CBO9780511987045
Cooper, C.: On the distribution of rank of a random matrix over a finite field. Random Struct. Algorithms 17(3–4), 197–212 (2000). https://doi.org/10.1002/1098-2418(200010/12)17:3/4<197::AID-RSA2>3.0.CO;2-K
Blömer, J., Kalfane, M., Karp, R., Karpinski, M., Luby, M., Zuckerman, D.: An XOR-Based Erasure-Resilient Coding Scheme. Technical Report TR-95-048, International Computer Science Institute (1995)
Detchart, J., Lacan, J.: Polynomial ring transforms for efficient xor-based erasure coding. In: 2017 IEEE International Symposium on Information Theory (ISIT), pp. 604–608 (2017). https://doi.org/10.1109/ISIT.2017.8006599
Lacan, J., Lochin, E.: XOR-based source routing. In: 2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR), pp. 1–7 (2020). https://doi.org/10.1109/HPSR48589.2020.9098991
Martinello, M., Ribeiro, M.R.N., de Oliveira, R.E.Z., de Angelis Vitoi, R.: Keyflow: a prototype for evolving SDN toward core network fabrics. IEEE Netw. 28(2), 12–19 (2014). https://doi.org/10.1109/MNET.2014.6786608
Funding
No funding was received for conducting this study.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors have no relevant financial or non-financial interests to disclose.
Ethical Approval
Not applicable.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Lacan, J., Lochin, E. Simplifying Forwarding Data Plane Operations with XOR-Based Source Routing. J Netw Syst Manage 32, 15 (2024). https://doi.org/10.1007/s10922-023-09791-8
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10922-023-09791-8