Download now Free registration required
Graphs are often used to model interconnected topological objects with different connection properties. Path finding in a weighted graph belongs to the classical problems of graph theory. Whereas the addition of the edges' weights as an aggregation and the interpretation of a smaller resulting sum as the preferable path works very well in applications like path computations, e.g., for road maps, it is not always applicable to those connections in computer networks that need to fulfill multiple independent Quality of Service (QoS) criteria simultaneously. Until now, special solutions are implemented - often manually - for each new service and for each QoS parameter separately.
- Format: PDF
- Size: 912.24 KB