Compressing two-dimensional routing tables with order

DOI10.1016/J.ENDM.2016.03.046zbMATH Open1351.90066OpenAlexW2243475422MaRDI QIDQ325484FDOQ325484

Authors: F. Giroire, Frédéric Havet, Joanna Moulierac 

Publication date: 18 October 2016

Full work available at URL: https://hal.inria.fr/hal-01097910/file/RR-8658.pdf

Recommendations

• On the complexity of compressing two dimensional routing tables with order
• Compressing two-dimensional routing tables
• Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
• Improved compact routing tables for planar networks via orderly spanning trees
• scientific article; zbMATH DE number 2089960
• Order compression schemes
• Order compression schemes
• scientific article; zbMATH DE number 2119663
• Improving table compression with combinatorial optimization
• Improved routing strategies with succinct tables

zbMATH Keywords

complexityapproximation algorithmsroutingcompact routing tablessoftware defined networks

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Communication networks in operations research (90B18)

Cites Work

• Title not available (Why is that?)
• Compressing two-dimensional routing tables
• Internet packet filter management and rectangle geometry

Cited In (2)

• Compressing two-dimensional routing tables
• On the complexity of compressing two dimensional routing tables with order

This page was built for publication: Compressing two-dimensional routing tables with order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q325484)