Zusammenfassung
Das Routing-Problem stellt sich mit besonderer Schaerfe bei paketvermittelten Datennetzen. Die weitestverbreiteten Routing-Verfahren werden einem simulativen Vergleichstest unterzogen, der sowohl unterschiedliche Verkehrsstrukturen als auch Stoerungsfaelle umfaßt. Adaptive Verfahren dominieren vor allem in kritischen Situationen; dabei lassen sich durch paketlaengenabhaengige Routing-Entscheidungen sowie gezielten Informationsaustausch im Fehlerfall zusaetzliche Verbesserungen erreichen. Auch beim Message-Switching kann fixes Routing keine Vorteile verbuchen. Vielmehr erlaubt das vorgeschlagene adaptive Verfahren bessere Performance in Verbindung mit einer permissiveren Flow-Control.
Summary
Many techniques to solve the routing problem for packet-switching networks can be found in 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-packet messages there is no advantage for fixed routing strategies, either. On the contrary, the adaptive algorithm we propose shows better performance and allows more permissive flow control procedures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literaturverzeichnis
Chou/Powell/Bragg 1979 Chou, W.; Powell, J.D.; Bragg, A.W.: Comparative Evaluation of Deterministic and Adaptive Routing, in: Grange, J.-L.; Gien, M. (Eds.): Flow Control in Computer Networks, S. 257–285; Amsterdam 1979
Fultz 1972 Fultz, G.L.: Adaptive Routing Techniques for Message Switching Communication Networks, UCLA Engineering Report UCLAENG-7252, School of Engineering ~nd Applied Sciences; Los Angeles 1972
Liebl 1985 Liebl, F.: Der simulative Test verschiedener Routing-Algorithmen in Datennetzen, Diplomarbeit am Seminar fuer Systemforschung der Universitaet Muenchen; Muenchen 1985
Livne/Boorstyn 1979 Livne, A.; Boorstyn, R.R.: A Model for Efficient Routing in S/F Computer Communications Networks, in: Samet, P.A. (Ed.): EURO IFIP’ 79, S. 343–350; Amsterdam 1979
Price 1977 Price, W.L.: Adaptive Routing in Store-and-Forward Networks and the Importance of Load Splitting, in: Gilchrist, B. (Ed.): Information Processing 77 — Proceedings of the 1977 IFIP Congress, S. 309–313; New York 1977
Rudin/Mueller 1979 Rudin, H.; Mueller, H.: On Routing and Flow Control, in: Grange, J.-L.; Gien, M. (Eds.): Flow Control in Computer Networks, S. 241–255; Amsterdam 1979
Yum/Schwartz 1978 Yum, T.; Schwartz, M.: Comparison of Adaptive Routing Algorithms for Computer Communication Networks, in: IEEE (Ed.): National Telecommunications Conference 1978; S. 4.1.1–4.1.5; New York 1978
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liebl, F. (1986). Der Simulative Test Verschiedener Routing-Algorithmen in Datennetzen. In: Streitferdt, L., Hauptmann, H., Marusev, A.W., Ohse, D., Pape, U. (eds) DGOR. Operations Research Proceedings 1985, vol 1985. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-71161-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-71161-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-71162-6
Online ISBN: 978-3-642-71161-9
eBook Packages: Springer Book Archive