Previous |  Up |  Next

Article

Title: Adaptive bifurcation routing algorithms for computer-communication networks (English)
Author: Venetsanopoulos, A. N.
Author: Waung, W.
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 21
Issue: 3
Year: 1985
Pages: 178-196
.
Category: math
.
MSC: 68M10
.
Date available: 2009-09-24T17:47:09Z
Last updated: 2012-06-05
Stable URL: http://hdl.handle.net/10338.dmlcz/125539
.
Reference: [1] L. G. Roberts: The evolution of packet switching.Proceedings of the IEEE 66 (1978), 1307-1313.
Reference: [2] R. G. Gallager: A minimum delay routing algorithm using distributed computation.IEEE Trans. Coram. COM-25 (1977), 73-85. Zbl 0361.68086, MR 0489790
Reference: [3] A. Segall: The modeling of adaptive routing in data-communication networks.IEEE Trans. Comm. COM-25 (1977), 85-95. Zbl 0362.68100
Reference: [4] T. E. Stern: A class of decentralized routing algorithms using relaxation.IEEE Trans. Comm. COM-25 (1977), 1092-1102. Zbl 0402.94047
Reference: [5] J. M. McQuillan: Routing algorithms for computer networks.In: Proceedings of the 1977 National Telecommunications Conference, 1977.
Reference: [6] W. L. Price: Adaptive routing in store-and-forward networks and the importance of load spliting.In: Information Processing 77, IFIP, North Holland, Amsterdam 1977.
Reference: [7] H. Rudin: On routing and delta routing : a taxonomy and performance comparison of techniques for packet-switched networks.IEEE Trans. Comm. COM-24 (1976), 43 - 59.
Reference: [8] L. Kleinrock: Queueing Systems, Volume II: Computer Applications.J. Wiley and Sons, New York 1976.
Reference: [9] J. M. McQuillan G. Falk, I. Richer: A review of the development and performance of the ARPANET routing algorithm.IEEE Trans. Comm. COM-26 (1978), 1802-1811.
.

Files

Files Size Format View
Kybernetika_21-1985-3_2.pdf 1.353Mb application/pdf View/Open
Back to standard record
Partner of
EuDML logo