A linear-based trunk reservation routing algorithm for ATM networks

In this paper an efficient heuristic routing algorithm is proposed that increases the network throughput irrespective of the network traffic load. Its effectiveness is based on an efficient cost metric, which achieves a successful trade-off between the use of the minimum-hop routes and the load balancing. Moreover, it employs the known trunk reservation concept according to probability that increases linearly as the traffic load increases. This results in an effective compromise of the performance of the algorithm between light and heavy loads. Finally its simplicity and its suitability for a real-time application render it as an efficient routing algorithm for ATM networks