Journal ArticleDOI
Dynamic Routing and Flow Control
Harry Rudin,H. Mueller +1 more
Reads0
Chats0
TLDR
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.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 of 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.read more
Citations
More filters
Journal ArticleDOI
Optimal control of admission to a queueing system
TL;DR: The main emphases are on the difference between socially optimal and individually optimal (equilibrium) controls and on the use of dynamic-programming inductive analysis to show that an optimal control is monotonic or characterized by one or more "critical numbers".
Proceedings ArticleDOI
Dynamic multi-path routing and how it compares with other dynamic routing algorithms for high speed wide area network
Saewoong Bahk,Magda El Zarki +1 more
TL;DR: A dynamic multi-path routing scheme that has been considered for connection oriented homogeneous high speed networks to bridge the gap between routing and congestion control as the network becomes congested is described.
Journal ArticleDOI
Delay Related Issues in Integrated Voice and Data Networks
TL;DR: The results indicate that a desirable length of talkspurt "hangover" of about 200 ms will accomplish this without unduly affecting speech activity, and that, under these circumstances, the perceptable threshold of variable talkpurt delay can be as high as about 200ms average.
Journal ArticleDOI
A k shortest path algorithm for adaptive routing in communications networks
TL;DR: An efficient and flexible algorithm is presented for finding a k shortest loopless path with distinct initial links from one node to each other node, showing it to offer a substantial improvement over applying known algorithms to the problem.
References
More filters
Journal ArticleDOI
The ARPA network design decisions
TL;DR: A number of key decisions made in the design of the ARPA network over a five-year period serve as the context for an analysis of the fundamental properties and requirements of packet-switching networks and formulation of thefundamental criteria for evaluating network performance.
Journal ArticleDOI
Free buffer allocation — An investigation by simulation
TL;DR: Results of simulation studies performed during 1975/1976 at the Institute for Teleprocessing of the GMD are presented, which refer to packet networks applying dynamic deadlock-free resource allocation nased on so-called buffer classes.
Journal ArticleDOI
Congestion Control of Store-and-Forward Networks by Input Buffer Limits--An Analysis
Simon S. Lam,M. Reiser +1 more
TL;DR: Results indicate that input buffer limits which satisfy the capacity law are a simple and effective means of network congestion control.
Journal ArticleDOI
Congestion Control in Store and Forward Tandem Links
M. Pennotti,M. Schwartz +1 more
TL;DR: Analytical results are presented which describe the behavior of the simple network using the two control schemes, and which should be useful in the design of more general networks as well.
Journal ArticleDOI
On Routing and "Delta Routing": A Taxonomy and Performance Comparison of Techniques for Packet-Switched Networks
TL;DR: In this paper, a taxonomy of routing strategies is presented and delta routing, random, proportional, shortest path, and shortest path fixed-for-session duration are selected for comparison and their mechanisms described.