Construct · 1 fields · 1 citations

stable paths problem: 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

a formal model of interdomain routing in which each node ranks permitted paths, used to show when BGP policies have a stable solution or may diverge.

In computer networking, stable paths problem refers to a formal model of interdomain routing in which each node ranks permitted paths, used to show when BGP policies have a stable solution or may diverge. This meaning comes from Griffin (2002) 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 stable paths problem 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

model3 fields · 3 citationsjingle · one word, three constructs node2 fields · 4 citationsjingle · one word, two constructs routing2 fields · 2 citationsjingle · one word, two constructs

References

Griffin, T. G., Shepherd, F. B., & Wilfong, G. (2002). The stable paths problem and interdomain routing. IEEE/ACM Transactions on Networking, 10(2), 232-243. https://doi.org/10.1109/90.993304

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