Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,954,284 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.
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
2008
2008
Routing and wavelength assignment encompassing FWM in WDM lightpath networks
A. Marsden
,
A. Maruta
,
K. Kitayama
International Conference on Optical Network…
2008
Corpus ID: 16084075
A dynamic routing and wavelength assignment (RWA) algorithm encompassing physical impairment due to Four-Wave Mixing (FWM) is…
Expand
Highly Cited
2006
Highly Cited
2006
A Learning-based Adaptive Routing Tree for Wireless Sensor Networks
Y. Zhang
,
Qingfeng Huang
Journal of Communications
2006
Corpus ID: 15779915
One of the most common communication patterns in sensor networks is routing data to a base station, while the base station can be…
Expand
2006
2006
Adaptive tree: a learning-based meta-routing strategy for sensor networks
Ying Zhang
,
Qingfeng Huang
CCNC . 3rd IEEE Consumer Communications and…
2006
Corpus ID: 15562320
One of the most common communication patterns in sensor networks is routing data to a base station, while the base station can be…
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
2002
2002
QoS routing granularity in MPLS networks
Ying-Dar Lin
,
N. Hsu
,
Ren-Hung Hwang
IEEE Communications Magazine
2002
Corpus ID: 12786731
This study investigates how constraint-based routing decision granularity significantly affects the scalability and blocking…
Expand
2001
2001
VoIP over MPLS Networking Requirements
Jong‐Moon Chung
,
Elie Marroun
,
H. Sandhu
,
Sang-Chul Kim
Information-Centric Networking
2001
Corpus ID: 12791197
Multiprotocol label switching (MPLS) is currently emerging as the protocol of the future due to several key features that MPLS…
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