Compressing two-dimensional routing tables

DOI10.1007/s00453-002-1000-7zbMath1045.68060OpenAlexW1986399639MaRDI QIDQ1402210

Subhash Suri, Tuomas W. 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)

Related Items (4)

Compressing two-dimensional routing tables with order ⋮ Faster compression of patterns to rectangle rule lists ⋮ On the complexity of compressing two dimensional routing tables with order ⋮ Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie

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