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 (opens in a new tab)

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.
2014
2014
Impact of CBR Traffic on Routing Protocols in MANETs
Mobile ad hoc network is a collection of mobile nodes which are dynamically and arbitrarily located in such a manner that the… 
2012
2012
Comparative Performance Study of Zone Routing Protocol over AODV and DSR Routing Protocols on Constant Bit Rate (CBR)
wireless network is a collection of mobile nodes that can move independently any direction without any infrastructure, access… 
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… 
2008
2008
Real-time traffic routing over a multilayered satellite architecture
In this paper, we present a constraint-based routing strategy for real-time traffic over a multilayered hierarchical satellite… 
2008
2008
Traffic engineering with constraint based routing in MPLS networks
In todaypsilas service provider networks MPLS traffic engineering (MPLS TE) is one of the fastest growing implementation. MPLS… 
2007
2007
A real-time energy-aware routing strategy for Wireless Sensor Networks
Recent advances in wireless technology have enabled the rapid development of Wireless Sensor Networks (WSN). It consists of ten… 
2006
2006
Adaptive tree: a learning-based meta-routing strategy for sensor networks
One of the most common communication patterns in sensor networks is routing data to a base station, while the base station can be… 
2005
2005
Using CBR to Select Solution Strategies in Constraint Programming
Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good… 
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… 
Highly Cited
1999
Highly Cited
1999
Intradomain QoS routing in IP networks: a feasibility and cost/benefit analysis
Constraint-based routing gradually becomes an essential enabling mechanism for a variety of emerging network services such as… 
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)