Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,231,770 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
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
Highly Cited
2004
Highly Cited
2004
Path selection methods with multiple constraints in service-guaranteed WDM networks
A. Jukan
,
G. Franzl
IEEE/ACM Transactions on Networking
2004
Corpus ID: 14429372
We propose a new approach to constraint-based path selection for dynamic routing and wavelength allocation in optical networks…
Expand
Highly Cited
2003
Highly Cited
2003
Constraint-based routing in the internet: Basic principles and recent research
O. Younis
,
S. Fahmy
IEEE Communications Surveys & Tutorials
2003
Corpus ID: 1915174
Novel routing paradigms based on policies, quality of service (QoS) requirements, and packet content have been proposed for the…
Expand
Review
2002
Review
2002
A survey of multipath routing for traffic engineering
G. Lee
,
J. Choi
,
jin gmlee
2002
Corpus ID: 6018523
Traffic engineering broadly relates to optimization of the operational performance of a network. This survey discusses techniques…
Expand
Review
2000
Review
2000
Traffic engineering with MPLS in the Internet
X. Xiao
,
A. Hannan
,
B. Bailey
,
L. Ni
IEEE Netw.
2000
Corpus ID: 16096829
This article discusses traffic engineering with multiprotocol label switching (MPLS) in an Internet service provider's network…
Expand
Review
2000
Review
2000
Internet Quality of Service: An Overview
Weibin Zhao
,
D. Olshefski
,
H. Schulzrinne
2000
Corpus ID: 5115195
This paper presents an o v ervie w of Internet QoS, co v ering motiv ation and considerations for adding QoS to Internet, the…
Expand
Highly Cited
1999
Highly Cited
1999
Internet QoS: a big picture
X. Xiao
,
L. Ni
IEEE Netw.
1999
Corpus ID: 10110794
In this paper we present a framework for the emerging Internet Quality of Service (QoS). All the important components of this…
Expand
Highly Cited
1999
Highly Cited
1999
Requirements for Traffic Engineering Over MPLS
D. Awduche
,
J. Malcolm
,
Johnson Agogbua
,
Michael D. O'Dell
,
Jim McManus
RFC
1999
Corpus ID: 45553765
This document presents a set of requirements for Traffic Engineering over Multiprotocol Label Switching (MPLS). It identifies the…
Expand
Highly Cited
1999
Highly Cited
1999
Load-sensitive routing of long-lived IP flows
A. Shaikh
,
J. Rexford
,
K. Shin
SIGCOMM '99
1999
Corpus ID: 1833838
Internet service providers face a daunting challenge in provisioning network resources, due to the rapid growth of the Internet…
Expand
Highly Cited
1994
Highly Cited
1994
Efficient Packet Demultiplexing for Multiple Endpoints and Large Messages
M. Yuhara
,
B. Bershad
,
C. Maeda
,
J. Moss
USENIX Winter
1994
Corpus ID: 15038890
This paper describes a new packet filter mechanism that efficiently dispatches incoming network packets to one of multiple…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE