A note on practical construction of maximum bandwidth paths

abstract

• Constructing maximum bandwidth paths has been a basic operation in the study of network routing, in particular in the recent study of network QoS routing. In the literature, it has been proposed that a maximum bandwidth path be constructed by a modified Dijkstra's algorithm or by a modified Bellman-Ford algorithm. In this short note, we show that maximum bandwidth paths can be constructed by a modified Kruskal's algorithm. We demonstrate that this approach is simpler, easier in implementation, more flexible, and faster than the previously proposed algorithms. 2001 Elsevier Science B.V. All rights reserved.

authors

• Chen, Jianer

published proceedings

• Information Processing Letters

altmetric score

• 3

author list (cited authors)

• Malpani, N., & Chen, J.

citation count

• 16

complete list of authors

• Malpani, Navneet||Chen, Jianer

publication date

• August 2002

publisher

• Elsevier  Publisher

published in

• Information Processing Letters  Journal

Digital Object Identifier (DOI)

• 10.1016/s0020-0190(01)00323-4

start page

• 175

end page

• 180

volume

• 83

issue

• 3

URL

• http://dx.doi.org/10.1016/s0020-0190(01)00323-4