Computer Communication Networks: Approaches, Objectives, and Performance Considerations
ACM Computing Surveys (CSUR)
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
| Hi-index | 0.00 |
The simulation program described in this paper was devised as a vehicle for the study of communication network routing procedures. It was designed to model the behavior of a wide range of network topologies and routing disciplines. An event driven simulation approach was chosen to minimize program development time and complexity. GASP-IV was selected as the simulation language. The determining factor in choosing the language was the clean interface it presents to FORTRAN. The use of GASP-IV permits utilizing the full power of FORTRAN in describing complex routing algorithms while simultaneously relieving the programmer of the responsibility for such essential housekeeping functions as enqueuing and dequeuing messages, file manipulation and event sequencing. As an application of this simulator, a loop-free distributed adaptive routing algorithm is proposed and analyzed. Simulation results are presented and the effect of the algorithm on overall network performance is examined. In addition to a loop-free property, the algorithm is shown to provide a partial solution to the single path routing problem. Furthermore, a modification to the algorithm is given which precludes message loss, and is shown to be superior in performance to current update algorithms (PUA).