Construct · 1 fields · 1 citations

valley-free routing: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed

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

Computer networking

the property that an Internet path climbs through customer-to-provider links, crosses at most one peer link, then only descends, used to infer AS relationships.

In computer networking, valley-free routing refers to the property that an Internet path climbs through customer-to-provider links, crosses at most one peer link, then only descends, used to infer AS relationships. This meaning comes from Gao (2001) in IEEE/ACM Transactions on Networking.[1]

Unit
Recovery means
Measured by

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

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

Open in Collider Export BibTeX Report this entry

Nearby constructs

link3 fields · 5 citationsjingle · one word, three constructs path3 fields · 3 citationsjingle · one word, three constructs peer1 fields · 2 citationsanchor · a standalone construct

References

Gao, L. (2001). On inferring autonomous system relationships in the Internet. IEEE/ACM Transactions on Networking, 9(6), 733-745. https://doi.org/10.1109/90.974527

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