About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Dynamic Routing and Flow Control
Abstract
This is an expanded version of an earlier report, adding, new results. The first part introduces a simple analytic model showing that dynamic routing may increase network throughput or lower delay when trunks are moderately loaded, but will reduce throughput or increase delay at heavy trunk loads. The second part of the paper presents simulation results characterizing: 1) the operation of a network “protected” by end-to-end flow control, 2) the operation of an “unprotected” network, 3) the transition between these two modes, 4) the effect of changing the update interval for the routing algorithms, 5) the effect of slow local loops, and 6) the effect of increasing the number or alternate paths available for dynamic routing. Overall, the results show that dynamic routing improves network performance only over a small parameter range, and should dynamic routing be used at all it must be implemented with great care. Copyright © 1980 by The Institute of Electrical and Electronics Engineers, Inc.