Abstract:
Computer communication networks involve marrying two large but dissimilar industries. Networks may be subdivided into two parts, the terminals and the message delivery service. There are three kinds of message delivery services, 1) circuit switched, 2) message switched, and 3) packet switched. We have modelled an already existing circuit switched network and a hypothetical packet switched network. Both simulations feature flexible topology and many variable inputs. They simulate dynamic situations such as node and Iink failures, and congested networks. Results given show the reasonableness of the models used. It is demonstrated how to use the programs in further research to improve the routing strategies and network design. In the packet switched simulation an incremental delay algorithm has been implemented to aid the development of better routing algorithms.
