Solving multi-metric network problems: An interplay between idempotent semiring rules

We motivate computations in a multifunctional networked system as instances of algebraic path problems on labeled graphs. We illustrate, using examples, that composition operators used in many function computations in a networked system follow semiring axioms. We present an abstract framework, using...

Full description

Saved in:
Bibliographic Details
Published inLinear algebra and its applications Vol. 435; no. 7; pp. 1494 - 1512
Main Authors Somasundaram, Kiran K., Baras, John S.
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.10.2011
Subjects
Idempotent semirings
Lexicographic optimality
Max-order optimality
Pareto efficiency
Partial orders
Trusted routing
Partial orders
Idempotent semirings
16Y60
Lexicographic optimality
16
90C29
Max-order optimality
Trusted routing
Pareto efficiency
Online AccessGet full text

Cover

More Information
Summary:We motivate computations in a multifunctional networked system as instances of algebraic path problems on labeled graphs. We illustrate, using examples, that composition operators used in many function computations in a networked system follow semiring axioms. We present an abstract framework, using a special idempotent semiring algebraic path problem, to handle multiple metrics for composition. We show that using different vector order relations in this abstract framework, we can obtain different rules of compositions such as Pareto, lexicographic and max-order efficiency. Under this framework, we identify a class of tractable composition rules that can be solved in different multi-criteria settings at affordable computational cost. We demonstrate using an example of trusted routing in which logical security rules of admission control can be combined with delay performance metrics in the multi-criteria optimization framework.
ISSN:0024-3795
DOI:10.1016/j.laa.2011.02.055