Interpolative Boolean Algebra Based Multicriteria Routing Algorithm

Marina Jeremić, Aleksandar Rakićević, Ivana Dragović

In order to improve quality-of-service of distributed applications, we propose a multi-criteria algorithm based on interpolative Boolean algebra for routing in an overlay network. We use a mesh topology because its implementation is easy and it quite simple addresses the cores during routing. In this paper, we consider four criteria: buffer usage, distance between peers, bandwidth, and remaining battery power. The proposed routing algorithm determines the path by using interpolative Boolean algebra, which satisfies quality-of-service requirements. The decision is made at each node, based on the ranking of available options and considering multiple constraints. The simulation shows that the proposed approach provides better results than the standard shortest path routing algorithm.