Stigmergic techniques for solving multi-constraint routing for packet networks

Abstract

In this paper we describe how stigmergic techniques can be used in packet networks that offer soft QoS services. The problem we are interested is the on-line version of computing routes to be established over a packet network, and the number of constraints imposed by the service is more that one. We investigate the scheme of the algorithm, the issues around the characteristics of the constraints and we give some simulation evidence of the working algorithm.