InFaRR: Um algoritmo para reroteamento rápido em planos de dados programáveis

• Gustavo V. Luz UFSCar
• André L. B. Rocha UFSCar
• Leandro C. de Almeida UFSCar
• Fábio L. Verdi UFSCar

DOI: https://doi.org/10.5753/sbrc.2022.221980

Abstract

InFaRR (In-network Fast ReRouting) is an algorithm for fast rerouting Implemented in P4, it has four features not jointly found in other recovery mechanisms: loop prevention, pushback, learning and return to the main route. Tests in a Fat-Tree topology with failures in different scenarios showed positive results when compared to state-of-the-art algorithms in the literature. In scenarios with one failure, InFaRR presented less time variation in packet delay when pushback was used, resulting in fewer hops when bypassing the failure. In scenarios with multiple failures, InFaRR successfully rerouted where the others algorithms looped. The unique mechanism for returning to the main route innovated because of the possibility of verifying remote links in a topology without using signaling or announcements about the state of the network.

References

Bosshart, P., Daly, D., Gibb, G., Izzard, M., McKeown, N., Rexford, J., Schlesinger, C., Talayco, D., Vahdat, A., Varghese, G., and Walker, D. (2014). P4: Programming protocol-independent packet processors. SIGCOMM Comput. Commun. Rev., 44(3):87–95.

Chiesa, M., Kamisínski, A., Rak, J., Retvari, G., and Schmid, S. (2020). Fast Recovery Mechanisms in the Data Plane. Ieee Cmst, pages 1–46.

Chiesa, M., Sedar, R., Antichi, G., Borokhovich, M., Kamisínski, A., Nikolaidis, G., and Schmid, S. (2019). Purr: A primitive for reconfigurable fast reroute: Hope for the best and program for the worst. In Proceedings of the 15th International Conference on Emerging Networking Experiments And Technologies, CoNEXT ’19, page 1–14, New York, NY, USA. Association for Computing Machinery.

Chodorek, R. (2002). Qos measurement and evaluation of telecommunications quality of service [book review]. Communications Magazine, IEEE, 40:30–32.

Cholda, P., Mykkeltveit, A., Helvik, B. E., Wittner, O. J., and Jajszczyk, A. (2007). A IEEE survey of resilience differentiation frameworks in communication networks. Communications Surveys and Tutorials, 9(4):32–55.

ITU-T (2002). Recommendation Y.1541: network performance objectives for IP-based services. ITU-T, pages 7–9.

Kiranmai, L., Research Scholar, M., Professor, A., and Kumar, D. (2014). IP Fast Rerouting framework with Backup Topology. International Journal of Computer Engineering In Research Trends, 1(2):96–103.

Leiserson, C. E. (1985). Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing. IEEE Transactions on Computers, C-34(10):892–901.

Liu, V., Halperin, D., Krishnamurthy, A., and Anderson, T. (2013). F10: A fault-tolerant engineered network. In Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation, nsdi’13, page 399–412, USA. USENIX Association.

Nikolaevskiy, I. (2016). Scalability and Resiliency of Static Routing. Doctoral thesis, School of Science.

ONF (2013). OpenFlow Switch Specification 1.4.0. Current, 0:1–3205.

Sedar, R., Borokhovich, M., Chiesa, M., Antichi, G., and Schmid, S. (2018). Supporting emerging applications with low-latency failover in P4. NEAT 2018 - Proceedings of the 2018 Workshop on Networking for Emerging Applications and Technologies, Part of SIGCOMM 2018, pages 52–57.

Sgambelluri, A., Giorgetti, A., Cugini, F., Paolucci, F., and Castoldi, P. (2013). OpenFlow-based segment protection in Ethernet networks. Journal of Optical Communications and Networking, 5(9):1066–1075.

Stankiewicz, R., Cholda, P., and Jajszczyk, A. (2011). QoX: What is it really? IEEE Communications Magazine, 49(4):148–158.