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.
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
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
Highly Cited
2007
Highly Cited
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
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
Highly Cited
2004
Highly Cited
2004
Path selection methods with multiple constraints in service-guaranteed WDM networks
We propose a new approach to constraint-based path selection for dynamic routing and wavelength allocation in optical networks… Expand
  • figure 1
  • table I
  • figure 2
  • figure 3
  • table II
Highly Cited
2003
Highly Cited
2003
Constraint-based routing in the internet: Basic principles and recent research
Novel routing paradigms based on policies, quality of service (QoS) requirements, and packet content have been proposed for the… Expand
  • figure 1
  • table I
  • figure 3
  • figure 2
  • table II
Highly Cited
1999
Highly Cited
1999
Internet QoS: a big picture
In this paper we present a framework for the emerging Internet Quality of Service (QoS). All the important components of this… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1999
Highly Cited
1999
Requirements for Traffic Engineering Over MPLS
This document presents a set of requirements for Traffic Engineering over Multiprotocol Label Switching (MPLS). It identifies the… Expand
  • figure 1
Highly Cited
1999
Highly Cited
1999
Load-sensitive routing of long-lived IP flows
Internet service providers face a daunting challenge in provisioning network resources, due to the rapid growth of the Internet… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
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
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