Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/Constrained_Shortest_Path_First> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Constrained_Shortest_Path_First abstract "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 c onstraints. A constraint could be minimum bandwidth required per link (also known as bandwidth guaranteed constraint), 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 as Constraint Based Routing (CBR).The path computed using CSPF could be exactly same as that of computed from OSPF and IS-IS, or it could be completely different depending on the set of constraints to be met.".
- Constrained_Shortest_Path_First thumbnail CSPF-Network.svg?width=300.
- Constrained_Shortest_Path_First wikiPageExternalLink 987067745.
- Constrained_Shortest_Path_First wikiPageID "4956681".
- Constrained_Shortest_Path_First wikiPageRevisionID "640486129".
- Constrained_Shortest_Path_First hasPhotoCollection Constrained_Shortest_Path_First.
- Constrained_Shortest_Path_First subject Category:Internet_protocols.
- Constrained_Shortest_Path_First subject Category:MPLS_networking.
- Constrained_Shortest_Path_First subject Category:Network_protocols.
- Constrained_Shortest_Path_First subject Category:Routing_protocols.
- Constrained_Shortest_Path_First type Abstraction100002137.
- Constrained_Shortest_Path_First type Communication100033020.
- Constrained_Shortest_Path_First type Direction106786629.
- Constrained_Shortest_Path_First type InternetProtocols.
- Constrained_Shortest_Path_First type Message106598915.
- Constrained_Shortest_Path_First type NetworkProtocols.
- Constrained_Shortest_Path_First type Protocol106665108.
- Constrained_Shortest_Path_First type RoutingProtocols.
- Constrained_Shortest_Path_First type Rule106652242.
- Constrained_Shortest_Path_First comment "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 c onstraints. A constraint could be minimum bandwidth required per link (also known as bandwidth guaranteed constraint), end-to-end delay, maximum number of links traversed, include/exclude nodes.".
- Constrained_Shortest_Path_First label "Constrained Shortest Path First".
- Constrained_Shortest_Path_First label "Constrained Shortest Path First".
- Constrained_Shortest_Path_First label "Constrained Shortest Path First".
- Constrained_Shortest_Path_First sameAs Constrained_Shortest_Path_First.
- Constrained_Shortest_Path_First sameAs Constrained_Shortest_Path_First.
- Constrained_Shortest_Path_First sameAs m.0cx00m.
- Constrained_Shortest_Path_First sameAs Q1128278.
- Constrained_Shortest_Path_First sameAs Q1128278.
- Constrained_Shortest_Path_First sameAs Constrained_Shortest_Path_First.
- Constrained_Shortest_Path_First wasDerivedFrom Constrained_Shortest_Path_First?oldid=640486129.
- Constrained_Shortest_Path_First depiction CSPF-Network.svg.
- Constrained_Shortest_Path_First isPrimaryTopicOf Constrained_Shortest_Path_First.
