Abstract
The choice of an objective function for the routing strategy in packet switching is one of the more important parts in the construction and evalutation of the network performance.
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.
References
McQuillan, J.M. “Adaptive Routing Algorithms for Distributed Computer Networks,” Bolt, Beranek and Newman, 197 4.
Frank, H. and Chuo, W. “Routing in Computer Networks,” Networks, Vol. No. 2, 1971.
Butrimenko, A. “Routing Technique for Message Switching Networks with Message Outdating,” Symposium on Computer Communications Networks and Teletraffic, Brooklyn, 1972.
Butrimenko, A. “Adaptive Routing Technique and Simulation of Communication Networks,” 1970.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Butrimenko, A., Sichra, U. (1976). Priorities and Pay Function Routing for a Packet Switching Network. In: Haupt, D., Petersen, H. (eds) Rechnernetze und Datenfernverarbeitung. Informatik-Fachberichte, vol 3. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-66344-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-66344-4_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07672-8
Online ISBN: 978-3-642-66344-4
eBook Packages: Springer Book Archive