Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Constrained Shortest Path First

Known as: Constrain Shortest Path First, CSPF, CBR 
Constrained Shortest Path First (CSPF) is an extension of shortest path algorithms. The path computed using CSPF is a shortest path fulfilling a set… Expand
Wikipedia

Related topics

Related topics

2 relations
K shortest path routingMultiprotocol Label Switching

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Comparative Performance Study of Zone Routing Protocol over AODV and DSR Routing Protocols on Constant Bit Rate (CBR)
wireless network is a collection of mobile nodes that can move independently any direction without any infrastructure, access… Expand
  • table 1
  • figure 1
  • figure 3
  • table 2
  • figure 4
Is this relevant?
2010
2010
Constrained Shortest Path First
Constrained Shortest Path First (CSPF) is an advanced version of shortest path algorithms used in OSPF and IS-IS route… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Assessment of a constraint-based routing algorithm for translucent 10Gbits/s DWDM networks considering fiber nonlinearities
We present a constraint-based routing (CBR) approach for real-time operation considering both linear as well as nonlinear signal… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Impairment Constraint Based Routing in Mesh Optical Networks
We present a framework for the alleviation of the main problems induced due to optical transparency based on the use of advanced… Expand
  • figure 3
Is this relevant?
2005
2005
Fast analytical assessment of the signal quality in transparent optical networks
Constraint-based routing (CBR) requires a fast and accurate assessment of the different physical degradation effects in optical… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2004
2004
Hybrid traffic engineering: the least path interference algorithm
The traffic engineering mechanisms currently deployed in IP networks are based on routing metrics (cost metrics) which optimize… Expand
  • figure 1
  • figure 2
  • table I
  • table II
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A Koala-Based Approach for Modelling and Deploying Configurable Software Product Families
An approach for modelling configurable software product families (CSPFs) and for automated configuring of product individuals… Expand
  • figure 1
  • figure 3
Is this relevant?
2002
2002
Applicability Statement for CR-LDP
This document discusses the applicability of Constraint-Based LSP Setup using LDP. It discusses possible network applications… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Intradomain QoS routing in IP networks: a feasibility and cost/benefit analysis
Constraint-based routing gradually becomes an essential enabling mechanism for a variety of emerging network services such as… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Efficient Packet Demultiplexing for Multiple Endpoints and Large Messages
This paper describes a new packet filter mechanism that efficiently dispatches incoming network packets to one of multiple… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE