Constraint-based path selection aims at identifying a path that satisfies a set of quality of
service (QoS) constraints. In general, this problem is known to be NP-complete, leading to …

Quality of Service Routing is at present an active and remarkable research area, since most
emerging network services require specialized Quality of Service (QoS) functionalities that …

The underlying concepts of an exact QoS routing algorithm are explained. We show that
these four concepts, namely 1) nonlinear definition of the path length; 2) a/spl kappa …

A wide range of services has been developed for vehicular ad hoc networks (VANETs),
ranging from safety to infotainment applications. An essential requirement for such services …

The constrained shortest‐path problem (CSPP) generalizes the standard shortest‐path
problem by adding one or more path‐weight side constraints. We present a new algorithm …

Based on the self-adaptive multiple constraints routing algorithm (SAMCRA), an improved
and exact version of our QoS routing algorithm, the tunable accuracy multiple constraints …

The problem of finding link/node‐disjoint paths between a pair of nodes in a network has
received much attention in the past. This problem is fairly well understood when the links in …

Vehicular ad hoc networks (VANETs) present an intriguing platform for several applications
on eg, intelligent transportation system (ITS) and infotainment applications aspire to be the …

Finding a path in a network based on multiple constraints (the MCP problem) is often
considered an integral part of quality of service (QoS) routing. QoS routing with constraints …

Constraint-based path selection is an invaluable part of a full-fledged quality of service
(QoS) architecture. Internet service providers want to be able to select paths for QoS flows …