Motivated by multi-domain Service Function Chain (SFC) orchestration, we define the
Shortest-Longest Path (SLP) problem, prove its hardness, and design an efficient Fully …

Finding a path that satisfies multiple Quality-of-Service (QoS) constraints is vital to the
deployment of current emerged services. However, existing algorithms are not very efficient …

With the advent of Network Function Virtualization (NFV), Physical Network Functions
(PNFs) are gradually being replaced by Virtual Network Functions (VNFs) that are hosted on …

Finding a path that satisfies multiple Quality-of-Service (QoS) requirements is vital to the
deployment of current emerged services. However, existing QoS routing algorithms are not …

Finding a least-cost path subject to a delay constraint in a network is an NP-complete
problem and has been extensively studied. Many works reported in the literature tackle this …

We propose two new algorithms called BiLAD and ExactBiLAD for the well-known Single-
Constrained Shortest Path (SCSP) problem. It is a fundamental problem in quality-of-service …

We study the multi-constrained quality-of-service (QoS) routing problem where one seeks to
find a path from a source to a destination in the presence of K≧2 additive end-to-end QoS …

In this paper, we consider a routing problem related to the widely used Open Shortest Path
First (OSPF) protocol. We address the special version of OSPF which requires unique and …

With a growing demand for quasi-instantaneous communication services such as real-time
video streaming, cloud gaming, and industry 4.0 applications, multi-constraint Traffic …

A fundamental problem in quality-of-service (QoS) routing is to find a path between a source-
destination node pair that satisfies two or more end-to-end QoS constraints. We model this …