MINDEC: a routing algorithm for distributed communication networks with multiservice flows
Ronald Beaubrun, Samuel Pierre · 2002
The concept of topology of distributed communication networks constitutes a most complex problem of which the solution depends largely on the routing algorithm utilised. The latter has to be robust enough for avoiding network congestion and minimising the delay of messages. This article proposes a routing algorithm called MINDEL and determines the destination of flows in conjunction with distributed networks. The implementation results of this algorithm of complex polynomials confirm its effectiveness by agreement with existing heuristics.