Compact policy routing

DOI10.1007/s00446-012-0181-9zbMath1284.68044OpenAlexW2005478132MaRDI QIDQ5920297

József Bíró, András Gulyás, Zalán Heszberger, Gábor Rétvári, Márton Csernai

Publication date: 28 March 2014

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-012-0181-9

zbMATH Keywords

compact routingpolicy routingrouting algebras

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Distributed systems (68M14)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Designing networks with compact routing tables
• Graphs, dioids and semirings. New models and algorithms.
• Memory requirement for routing in distributed networks
• Memory requirement for universal routing schemes
• Compact policy routing

This page was built for publication: Compact policy routing