Evolutionary routing-path selection in congested communication networks
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
A heuristic approach to fair routing path selection
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part III
| Hi-index | 0.00 |
This paper presents an evolutionary approach to the finding of maxmin-fair solutions of the general network resource allocation problem. From the definition of maxmin-fairness, a general relation among real points is derived that can be used to replace the role of the Pareto-dominance relation in Evolutionary Multi-Objective Search algorithms. The approach has been demonstrated by modifying the SPEA2 algorithm in this manner and testing it on some problems with known fairness points. In all the studied cases, the algorithm could achieve the correct fairness points, and the search effort scaled moderately with increasing problem dimension. Since maxmin-fair points also belong to the Pareto-front, the approach is also of interest for multi-objective optimization in general.