Routing in large ATM networks

This thesis describes research on the use of routing algorithms in large ATM networks. The criteria for evaluating the algorithms is presented, then various existing algorithms are evaluated. An algorithm using an investigative routing protocol is described in detail. The research shows that the protocol is suitable for local area networks. The LAN protocol is guaranteed to create connections along optimal paths, does not require the transmission of link state information around the network, is reliable and robust when faced with rapidly changing topology and link state, and requires no time for convergence. This protocol has been implemented and tested using a network simulator. Adding a hierarchical component to the network architecture provides a scalable routing mechanism which exhibits the features of the LAN protocol, but with reduced optimality, sacrificed for the sake of scalability. Both algorithms are presented in this document.