Cited By
View all- Pan Q(1986)A routing algorithm with candidate shortest pathJournal of Computer Science and Technology10.1007/BF029794611:3(33-52)Online publication date: Sep-1986
A new probabilistic routing algorithm for packet-switched computer networks
Authors: 
Chi-Yuan Chin, Kai HwangAuthors Info & Claims
Chi-Yuan Chin, Kai HwangAuthors Info & ClaimsPages 705 - 719
Abstract
A probabilistic method is proposed for message routing in packet-switched computer networks with distributed control. The routing table associated with each node consists of path entries, instead of branch entries as found in most routing schemes. Packets are assigned with different paths on a probabilistic basis. The path selection is entirely processed at the source node. The routing table is updated dynamically with change of packet-generating rates at all nodes. We introduce a new quantitative measure, path capacity, to model each path as an M/M/1 queue. With the path capacities, routing tables are updated frequently to achieve balanced minimum delays among all paths. The update overhead is a constant, independent of the size of the network. Both analytical and simulation results are presented and compared with the new ARPANET routing method under various traffic conditions. This probabilistic, path-directed routing algorithm performs significantly better than the new ARPANET routing method under moderate and heavy traffic conditions. Under very light traffic conditions, the two methods have almost equal performance. This method can be applied to improve packet routing in any computer communications networks with distributed control.
References
[1]
Boorstyn, R. R., and A. Livne. "A Technique for Adaptive Routing in Networks." IEEE Transactions on Communications, Com-29 (1981), pp. 474--480.
[2]
Brandt, G. J., and G. J. Chretien. "Methods to Control and Operate a Message-Switching Network." Proceedings of the Symposium on Computer-Communications Networks and Teletraffic, Polytechnic Institute of Brooklyn, 1972, p. 263.
[3]
Cantor, D. G., and M. Gerla. "Optimal Routing in a Packet-Switched Computer Network." IEEE Transactions on Computers, C-23 (1974), pp. 1062--1069.
[4]
Davis, D. W., and D. L. Barber. Computer Networks and Their Protocols. New York: John Wiley & Sons, 1979, pp. 89--107.
[5]
Frank, H., R. E. Kahn, and L. Klenrock. "Computer Communication Network Design---Experience with Theory and Practice." Proceedings of the Spring Joint Computer Conference, 1972, p. 225.
[6]
Fultz, G. L. "Adaptive Routing Techniques for Message Switching Computer Communication Networks." Report, UCLA-ENG-7352, University of California, Los Angeles, July 1972.
[7]
Gallager, R. G. "A Minimum Delay Routing Algorithm Using Distributed Computation." IEEE Transactions on Communications, Com-25 (1977), pp. 73--85.
[8]
Hwang, K., W. J. Croft, G. H. Goble, B. W. Wah, F. A. Briggs, W. R. Simons, and C. L. Coates. "A Unix-Based Local Computer Network with Load Balancing." Computer Magazine, April 1982, pp. 55--66.
[9]
Kleinrock, L. Communication Networks: Stochastic Message Flow and Delay. New York: McGraw-Hill, 1964.
[10]
McQuillan, J. M., I. Richer, and E. C. Rosen. "The New Routing Algorithm for the ARPANET." IEEE Transactions on Communications, Com-28 (1980), pp. 711--719.
[11]
Naylor, W. E. "A Loop-Free Adaptive Routing Algorithm for Packet Switched Networks." Proceedings of the 4th ACM/IEEE Data Communications Symposium. Piscataway, N.J.: IEEE, 1975.
[12]
Ni, L. M., and K. Hwang. "Optimal Load Balancing Strategies for a Multiple Processor System." Proceedings of the Tenth International Conference on Parallel Processing, Belaire, Michigan, August 1981, pp. 352--357.
[13]
Price, W. L. "Adaptive Routing in Store-and-Forward Networks and the Importance of Load Splitting." Proceedings of the IPIP Congress 77, 1977, p. 309.
[14]
Rosen, E. C. "The Updating Protocol of ARPANET's New Routing Algorithm." Computer Networks, 4 (1980), pp. 11--19.
[15]
Schwartz, M., and C. K. Cheung. "The Gradient Projection Algorithm for Multiple Routing in Message-Switched Networks." IEEE Transactions on Communications, Com-24 (1976), pp. 449--456.
[16]
Schwartz, M., and T. E. Stern. "Routing Techniques Used in Computer Communication Networks." IEEE Transactions on Communications, Com-28 (1980), pp. 539--552.
[17]
Shier, D. R. "Iterative Methods for Determining the k Shortest Paths in a Network." Networks, 6 (1976), pp. 205--229.
[18]
Tanenbaum, A. S. Computer Networks. Englewood Cliffs, N.J.: Prentice-Hall, 1981, pp. 196--211.
- A new probabilistic routing algorithm for packet-switched computer networks
Recommendations
A Hierarchical Routing and Flow Control Policy (HRFC) for Packet Switched Networks
A new policy that can effectively handle message routing and flow control simultaneously in a packet switched computer network is presented. In such a policy, a traffic threshold level is assigned for each channel in the network. If all the channels ...
Re-Routing in Circuit Switched Networks
INFOCOM '97: Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information RevolutionDynamic routing has been adopted in many circuit switched networks in many parts of the world. A number of dynamic routing schemes have been designed and studied with the aim of maximizing the network throughput. The Least Loaded Routing (LLR) is simple ...
Comments
Information & Contributors
Information
Published In
May 1983
808 pages
ISBN:0882830392
DOI:10.1145/1500676
Copyright © 1983 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- AFIPS: American Federation of Information Processing Societies
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 16 May 1983
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 112Total Downloads
- Downloads (Last 12 months)21
- Downloads (Last 6 weeks)9
Reflects downloads up to 07 Mar 2025
Other Metrics
Citations
Cited By
View all- Pan Q(1986)A routing algorithm with candidate shortest pathJournal of Computer Science and Technology10.1007/BF029794611:3(33-52)Online publication date: Sep-1986
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in