The algorithms are (1) the CODEX algorithm, (2) Gallager'sdistributed algorithm (1977), and (3) the well-known ARPANET algorithm.The essential characteristics and critical issues in these algorithmsare identified through experimentation under a variety of traffic andnetwork operating conditions. The sensitivity of the mean delayperformance of the algorithms to operating parameters, such as therouting update period and the traffic adjustment parameters, areexamined. The comparison of mean delay behavior indicates that understationary traffic conditions, gradient-based algorithms, such asGallager's algorithm, outperform the other algorithms, whereas the CODEXalgorithm, which is a shortest-path-based virtual circuit routingalgorithm, does better in quasistatic traffic conditions. The ARPANETalgorithm performs poorly, compared to the above two algorithms undermoderate to heavy loading conditions. Some of the factors which could becontributing to the poor performance of the ARPANET algorithm areexamined
展开▼
