Recent results of Denardo and Park regarding sequential routing can be applied to the problem of determining the number of sequential routes that calls should be allowed to attempt in a network. In particular, the derivation of such a criterion for DIG, the dynamic sequential routing scheme based on 5-minute updates of stateinformation, is the subject of this paper Call-by-call simulations show, however, that while the critenon is helpful for DR5 in a small (10-node) network, it is ineffective for DR5 in a 52-node network. One concludes that the approximations made in adapting the criterion for DR5 are untenable in networks with a large number of routes for traffic flow. Thus, a suitable criterion remains to be developed for determining the number of sequential routes in DR5.