Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Constrained Shortest Path First (CSPF) is an advanced version of shortest path algorithms used in OSPF and IS-IS route… 
Highly Cited
2004
Highly Cited
2004
We propose a new approach to constraint-based path selection for dynamic routing and wavelength allocation in optical networks… 
Highly Cited
2003
Highly Cited
2003
Novel routing paradigms based on policies, quality of service (QoS) requirements, and packet content have been proposed for the… 
Review
2002
Review
2002
Traffic engineering broadly relates to optimization of the operational performance of a network. This survey discusses techniques… 
Review
2000
Review
2000
This article discusses traffic engineering with multiprotocol label switching (MPLS) in an Internet service provider's network… 
Review
2000
Review
2000
This paper presents an o v ervie w of Internet QoS, co v ering motiv ation and considerations for adding QoS to Internet, the… 
Highly Cited
1999
Highly Cited
1999
In this paper we present a framework for the emerging Internet Quality of Service (QoS). All the important components of this… 
Highly Cited
1999
Highly Cited
1999
This document presents a set of requirements for Traffic Engineering over Multiprotocol Label Switching (MPLS). It identifies the… 
Highly Cited
1999
Highly Cited
1999
Internet service providers face a daunting challenge in provisioning network resources, due to the rapid growth of the Internet… 
Highly Cited
1994
Highly Cited
1994
This paper describes a new packet filter mechanism that efficiently dispatches incoming network packets to one of multiple…