Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
IEEE Transactions on Computers
Computer simulation of a packet switching computer network
Computer Communications
A minimum-hop routing algorithm bases on distributed information
Computer Networks and ISDN Systems
Congestion Control of Packet Communication Networks by Input Buffer Limits A Simulation Study
IEEE Transactions on Computers
Performance evaluation of computer communications networks
IEEE Communications Magazine
Review of point-to-point network routing algorithms
IEEE Communications Magazine
| Hi-index | 0.24 |
The development of a flexible computer simulation package for packet switching computer networks that enables the evaluation of different congestion avoidance methods and routing strategies is discussed. The package is presented in terms of the factors involved, the operations required, and the simulation execution considerations. Use of the package for the evaluation of congestion avoidance methods and routing strategies is described. The congestion avoidance methods considered include isarithmic methods with static and dynamic control. In addition, static and dynamic routing strategies are taken into account. The relative differences between the various methods and strategies considered are presented. It has been found that the results obtained agree with previous results, and this confirms the suitability of the package for future investigation. The package would be useful to students and researchers in the field, especially since it uses the widely known computer language Pascal, and is run on an IBM PC(AT).