By Topic

The mille feuilles: a routing algorithm for packet networks and circuit switched networks

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
$33 $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

3 Author(s)
M. Rombaut ; Steria, Velizy, France ; G. Hebuterne ; M. Priem

We present an heuristic method to compute a centralized routing scheme, that permits decreasing the maximal link load and improving the network reliability, when the flow matrix changes and when a link failure occurs on the network. The complexity of this algorithm can be compared to the complexity of the usual disjoint routing methods. The tests seem to show that the improvement is good whatever is the number of nodes of the network; it remains to confirm this improvement by analyzing larger graphs (1000 or 2000 nodes).

Published in:

Universal Multiservice Networks, 2002. ECUMN 2002. 2nd European Conference on

Date of Conference:

2002