A proposal algorithm to solve delay constraint least cost optimization problem

Abstract EN

Traditionally, path selection within routing is formulated as a shortest path optimization problem.

The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc.

The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to distribute the network.

So an iterative algorithm is proposed in this paper to solve this problem.

It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).