Abstract:
Traditionally, path selection within routing is formulated as the shortest path optimization problem. In this paper, multi-criteria
routing based on a mixed weight is considered. It is shown how this approach can be used to develop two heuristic algorithms
for searching the optimal path with minimum delay, minimum delay variation, providing the given bandwidth, minimum loss
probability and minimum cost of information transmission.
Keywords:multi-criteria routing, mixed weight, delay, delay variation, loss probability, bandwidth, shortest path, Dijkstra's Algorithm, cost of information transmission.
Fulltext:
PDF file (565 kB)