On the algebraic theory of loop free routing

DOI10.1007/978-3-030-66471-8_14zbMath1490.68040OpenAlexW3118706230MaRDI QIDQ832107

Hussein Khayou, Leonid I. Abrosimov, Margarita A. Rudenkova

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-66471-8_14

zbMATH Keywords

semiringsloop-free routingBellman-Forddiffusing computationrouting algebra

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)

Cites Work

• Unnamed Item
• Termination detection for diffusing computations
• Graphs, dioids and semirings. New models and algorithms.
• Path Problems in Networks
• Increasing Bisemigroups and Algebraic Routing
• A Responsive Distributed Routing Algorithm for Computer Networks

This page was built for publication: On the algebraic theory of loop free routing