Home // International Journal On Advances in Networks and Services, volume 4, numbers 3 and 4, 2011 // View article
Authors:
Mark Yampolskiy
Wolfgang Hommel
David Schmitz
Michael Schiffers
Keywords: graph theory; multi-weighted graphs; QoS; QoS aggregation; QoS comparison
Abstract:
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. As the development of novel customer-tailored network services often relies on different connection properties and their combinations, a generic treatment of QoS parameters becomes a critical factor for rapid development and network service rollout. In this article, we present a generic function schema for treating multiple independent QoS parameters in a similarly fashioned way. Our work fosters efficient routing algorithms that are considering multiple connection properties and corresponding constraints at the same time, as they are required, for example, in Future Internet infrastructures with end-to-end QoS guarantees and in dynamic survivability-aware environments.
Pages: 302 to 312
Copyright: Copyright (c) to authors, 2011. Used with permission.
Publication date: April 30, 2012
Published in: journal
ISSN: 1942-2644