Title :
The mille feuilles: a routing algorithm for packet networks and circuit switched networks
Author :
Rombaut, Matthieu ; Hebuterne, Gerard ; Priem, Michel
Author_Institution :
Steria, Velizy, France
fDate :
6/24/1905 12:00:00 AM
Abstract :
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).
Keywords :
circuit switching; packet switching; telecommunication network reliability; telecommunication network routing; telecommunication traffic; centralized routing scheme; circuit switched networks; complexity; flow matrix; heuristic method; link failure; maximal link load; mille feuilles; network reliability; packet networks; Algorithm design and analysis; Bandwidth; Computational modeling; Packet switching; Protocols; Routing; Spine; Switching circuits; Telecommunication traffic; Uncertainty;
Conference_Titel :
Universal Multiservice Networks, 2002. ECUMN 2002. 2nd European Conference on
Print_ISBN :
0-7803-7422-3
DOI :
10.1109/ECUMN.2002.1002083
