We provide an example to illustrate the worst case message complexity of two of heuristics (R. Sriram, G. Manimaran, C.Siva Ram Murthy, Preferred link based delay-constrained least cost routing in wide area networks, Computer Communiations, 21(1998), 1655–1669) is exponential which was not stated by the authors.