Constrained Shortest Path First
id:
constrained-shortest-path-first-256-42038
title:
Constrained Shortest Path First
text:
Constrained Shortest Path First (CSPF) is an extension of shortest path algorithms. The path computed using CSPF is a shortest path fulfilling a set of constraints. It simply means that it runs shortest path algorithm after pruning those links that violate a given set of constraints. A constraint could be minimum bandwidth required per link, end-to-end delay, maximum number of links traversed, include/exclude nodes. CSPF is widely used in MPLS Traffic Engineering. The routing using CSPF is known
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Constrained_Shortest_Path_First
date created:
date modified:
2022-12-30T21:26:37Z
main entity:
{"identifier":"Q1128278","url":"https://www.wikidata.org/entity/Q1128278"}
image:
fields total:
13
integrity:
13