Compressing two-dimensional routing tables

DOI10.1007/S00453-002-1000-7MaRDI QIDQ1402210zbMATH OpenOpenAlexFDO

Authors Subhash Suri, Tuomas Sandholm, Priyank Warkhede

Publication date 19 August 2003

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-002-1000-7

zbMATH Keywords

internet addressing scheme

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Compressing two-dimensional routing tables with order
• scientific article; zbMATH DE number 3940741
• On the complexity of compressing two dimensional routing tables with order
• The compactness of adaptive routing tables
• Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method

Cited in

(6)

• Competitive FIB aggregation for independent prefixes: online ski rental on the trie
• On the complexity of compressing two dimensional routing tables with order
• Compressing two-dimensional routing tables with order
• Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares
• Compressing rectilinear pictures and minimizing access control lists
• Faster compression of patterns to rectangle rule lists

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

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