Abstract
In this paper, we study the performance of a routing algorithm for datagram networks. The routing algorithm is threshold-based in the sense that routing table updates are triggered when certain buffer thresholds are crossed. This feature makes the algorithm different from traditional routing algorithms in which the updates are carried out periodically. The study has been carried out by a simulation. We have studied aspects such as loss probability, stability, sojourn-time, hop-count and frequency of updates against a periodic update scheme. Our study indicates that the threshold-based scheme performs much better than the periodic update scheme in most performance measures.