By Topic

MINDEC: a routing algorithm for distributed communication networks with multiservice flows

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Beaubrun, R. ; Centre de Recherche LICEF, Quebec Univ., Montreal, Que., Canada ; Pierre, Samuel

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

Published in:

Electrical and Computer Engineering, 1998. IEEE Canadian Conference on  (Volume:2 )

Date of Conference:

24-28 May 1998