Routing Algorithmen in Datennetzen - eine vergleichende Simulationsstudie. (Routing algorithms in data networks - a comparing simulation study)
Many techniques to solve the routing problem for packet switching networks can be found in the literature. A simulation model has been built to compare their behaviour under various conditions. Adaptive algorithms show better performance measures than their fixed counterparts in high load situations and in case of link failures. Delays can be lowered by making routing decisions dependent on packet length and by creating very few update packets when links go down. In case of multi messages there is also no advantage for fixed routing strategies. On the contrary, the adaptive algorithm we propose shows better performance and allows less restrictive flow control procedures.
scientific article; zbMATH DE number 4016567