On the complexity of compressing two dimensional routing tables with order (Q1702127)

From MaRDI portal
Revision as of 04:48, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of compressing two dimensional routing tables with order
scientific article

    Statements

    On the complexity of compressing two dimensional routing tables with order (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 February 2018
    0 references
    routing
    0 references
    routing tables
    0 references
    order
    0 references
    priority
    0 references
    software defined networks
    0 references
    complexity
    0 references
    approximation algorithm
    0 references
    compact tables
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references