A note on practical construction of maximum bandwidth paths. (Q1853065)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1856406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on practical construction of maximum bandwidth paths. |
scientific article; zbMATH DE number 1856406 |
Statements
A note on practical construction of maximum bandwidth paths. (English)
0 references
21 January 2003
0 references
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.
0 references
Network routing
0 references
Dijkstra's algorithm
0 references
Kruskal's algorithm
0 references
0 references
0.7355301976203918
0 references
0.7087929248809814
0 references
0.7066692113876343
0 references
0.7058780789375305
0 references
