Addendum: On the complexity of “Preferred link based delay-constrained least cost routing in wide area networks”

  • Authors:

  • Baoxian Zhang;Changiia Chen

  • Affiliations:

  • Department of communication and information engineering, Northern Jiaotong, University, Beijing 100044, P. R. China;Department of communication and information engineering, Northern Jiaotong, University, Beijing 100044, P. R. China

  • Venue:
  • Computer Communications
  • Year:
  • 2003

Quantified Score

Hi-index 0.24

Visualization

Abstract

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.