Finding a feasible path subject to multiple constraints in a network is an NP-complete problem and cannot be solved in polynomial time. Thus, many proposed source routing algorithms tackle this problem by transforming it into the shortest path problem, which is P-complete, with an integrated cost function that maps multi-constraints into a single cost. However, this approach may fail to find a ...

We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.

This paper considers a variation of the Elementary Constrained Shortest Path Problem in which nodes are separated into subsets and a feasible path through the network may visit at most one node from each subset. We refer to this problem as the Multiple Choice Elementary Constrained Shortest Path Problem (MC-ECSPP). The MC-ECSPP arises as a subproblem in branch-and-price approaches for variation...

In the resource constrained shortest path problem (RCSPP) a shortest path satisfying additional resource bounds is sought. Each arc has a length and a resource usage vector specifying the requirements from each resource of a finite set of resources. The resource bounds limit the total usage along feasible paths for each resource type. In this paper we introduce new cutting planes, separation pr...

QMNF is a QoS-aware multicast routing protocol using N-hop dominating flooding and built upon a layered routing architecture. In this architecture, QMNF invites the N-hop flooding component and the shortest path routing table from OSPF by open signaling interfaces, floods the path-probing packets, and employs a two-pass resource reservation scheme to avoid unnecessary resource reservation. The ...

In this paper, we consider the problem of finding feasible solutions to scheduling problems that are complicated by separation constraints on the execution of different operations. Following recent work in constraintposting scheduling, we formulate this problem as one of establishing ordering relations between pairs of operations requiring synchronization of resource usage. This establishes con...

We extend the traditional framework of POMDPs to model resource consumption inducing a hard constraint on the behaviour of the model. Resource levels increase and decrease with transitions, and the hard constraint requires that the level remains positive in all steps. We present an algorithm for solving POMDPs with resource levels, developing on existing POMDP solvers. Our second contribution i...

We consider partially observable Markov decision processes (POMDPs) with a set of target states and positive integer costs associated with every transition. The traditional optimization objective (stochastic shortest path) asks to minimize the expected total cost until the target set is reached. We extend the traditional framework of POMDPs to model energy consumption, which represents a hard c...

Transmission of interactive multimedia streams requires stringent Quality-of-Service (QoS) guarantees in delay, delay jitter, and bandwidth, which imposes strict resource constraints on the paths being used. While the general problem of finding a path that meets multiple QoS constraints is NP complete, we have shown that such a path can be found in polynomial time if the network service discipl...