Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,079,159 papers from all fields of science
Search
Sign In
Create Free Account
Constrained Shortest Path First
Known as:
Constrain Shortest Path First
, CSPF
, CBR
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
K shortest path routing
Multiprotocol Label Switching
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Traffic Engineering
Mahesh Kumar Porwal
Encyclopedia of Wireless Networks
2020
Corpus ID: 202766332
Traffic engineering and fast reroute are the two major applications of constraint based routing Traffic engineering is the…
Expand
2012
2012
Comparative Performance Study of Zone Routing Protocol over AODV and DSR Routing Protocols on Constant Bit Rate (CBR)
Suresh Kumar
,
Jogendra Kumar
2012
Corpus ID: 4659554
wireless network is a collection of mobile nodes that can move independently any direction without any infrastructure, access…
Expand
2010
2010
Constrained Shortest Path First
Manayya Kb
2010
Corpus ID: 199011429
Constrained Shortest Path First (CSPF) is an advanced version of shortest path algorithms used in OSPF and IS-IS route…
Expand
2008
2008
Real-time traffic routing over a multilayered satellite architecture
A. Durresi
International Journal of Wireless and Mobile…
2008
Corpus ID: 3384600
In this paper, we present a constraint-based routing strategy for real-time traffic over a multilayered hierarchical satellite…
Expand
2007
2007
A real-time energy-aware routing strategy for Wireless Sensor Networks
Z. Khalid
,
G. Ahmed
,
N. Khan
Asia-Pacific Conference on Communications
2007
Corpus ID: 30728526
Recent advances in wireless technology have enabled the rapid development of Wireless Sensor Networks (WSN). It consists of ten…
Expand
2005
2005
Using CBR to Select Solution Strategies in Constraint Programming
C. Gebruers
,
Brahim Hnich
,
D. Bridge
,
Eugene C. Freuder
International Conference on Case-Based Reasoning
2005
Corpus ID: 10189860
Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good…
Expand
Review
2002
Review
2002
A Review of Constraint-Based Routing Algorithms
F. Kuipers
,
M. Krunz
,
P. Mieghem
2002
Corpus ID: 16523545
Constraint-based routing is an invaluable part of a full-sedged Quality of Service (QoS) architecture. Unfortunately, routing…
Expand
2001
2001
Constrained shortest path first algorithm for lambda-switched mesh optical networks with logical overlay OCh/SP rings
F. Poppe
,
H. de Neve
,
G. Petit
IEEE Workshop on High Performance Switching and…
2001
Corpus ID: 61208391
We describe a constrained shortest path first (CSPF) routing algorithm for lambda-switched optical networks with logical overlay…
Expand
2000
2000
Analysis of MPLS traffic engineering
Jong‐Moon Chung
Proceedings of the 43rd IEEE Midwest Symposium on…
2000
Corpus ID: 61569204
The upper limit of transmittable bandwidth doubles and sometimes quadruples every nine to twelve months. Already transmission of…
Expand
Highly Cited
1999
Highly Cited
1999
Intradomain QoS routing in IP networks: a feasibility and cost/benefit analysis
G. Apostolopoulos
,
R. Guérin
,
S. Kamat
,
A. Orda
,
S. Tripathi
IEEE Network
1999
Corpus ID: 62179902
Constraint-based routing gradually becomes an essential enabling mechanism for a variety of emerging network services such as…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE