Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,891,751 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.
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
2007
2007
Impairment-Constraint-Based Routing in Ultralong-Haul Optical Networks With 2R Regeneration
G. Markidis
,
S. Sygletos
,
A. Tzanakaki
,
Ioannis Tomkos
IEEE Photonics Technology Letters
2007
Corpus ID: 38307450
This letter presents a novel impairment-constraint-based routing scheme in a network with 2R regeneration. A wide variety of…
Expand
2007
2007
An On-Line Multi-CBR Agent Dispatching Algorithm
Yan Li
,
Xizhao Wang
,
Minghu Ha
Soft Computing - A Fusion of Foundations…
2007
Corpus ID: 37715802
Case-based reasoning (CBR) is an effective and fast problem-solving methodology, which solves new problems by remembering and…
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
2004
2004
Scalable multicast MPLS protocol for next generation broadband service convergence network
S. Yasukawa
,
Koji Sugisono
,
I. Inoue
,
S. Urushidani
IEEE International Conference on Communications
2004
Corpus ID: 28592553
With explosive dissemination of broadband IP access services, like xDSL and FTTH, many service providers seek a chance for…
Expand
2004
2004
Impairment aware routing in metropolitan area optical networks
C. Mas
,
D. Vogiatzis
,
Ioannis Tomkos
Proceedings of 6th International Conference on…
2004
Corpus ID: 14866405
Impairment aware routing is considered to be a necessary precondition for the migration from opaque to all-optical networks. In…
Expand
2002
2002
Multicast routing with quality of service and traffic engineering requirements in the Internet, based on genetic algorithm
P. T. Araújo
,
G. Oliveira
VII Brazilian Symposium on Neural Networks…
2002
Corpus ID: 15034411
In order to deal with the high computational power required by the QoS routing, the use of genetic algorithm (GA) as a method to…
Expand
2002
2002
QoS and Traffic Engineering : MPLS , DiffServ and Constraint Based Routing
Amardeep Singh
,
G. Mittal
2002
Corpus ID: 2033608
Providing Quality of Service (QoS) and Traffic Engineering capabilities in the Internet is very essential to support the…
Expand