Construct · 1 fields · 1 citations

compact routing: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
compactrouting1 CONSTRUCTCompact routingTHORUP · COMPUTER NETWORKING

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computer networking

routing with small per-node tables at the price of bounded stretch, where routes may be longer than shortest paths by a fixed factor.

In computer networking, compact routing refers to routing with small per-node tables at the price of bounded stretch, where routes may be longer than shortest paths by a fixed factor. This meaning comes from Thorup (2001) in Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how compact routing sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

factor3 fields · 4 citationsjingle · one word, three constructsparallel1 fields · 1 citationsanchor · a standalone constructrouting2 fields · 2 citationsjingle · one word, two constructs

References

  1. Thorup, M., & Zwick, U. (2001). Compact routing schemes. Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures. https://doi.org/10.1145/378580.378581

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct