A note on practical construction of maximum bandwidth paths

Authors:
Navneet Malpani;Jianer Chen
Affiliations:
Intel Corporation, 505 E. Huntland Dr., Suite 550, Austin, TX;Department of Computer Science, Texas A&M University, College Station, TX
Venue:
Information Processing Letters
Year:
2002

Citing 9
Cited 2

Data structures and network algorithms

Data structures and network algorithms
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Introduction to algorithms

Introduction to algorithms
QoS routing in networks with inaccurate information: theory and algorithms

IEEE/ACM Transactions on Networking (TON)
Routing with end-to-end QoS guarantees in broadband networks

IEEE/ACM Transactions on Networking (TON)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking

Wireless sensor networks scheduling for full angle coverage

Multidimensional Systems and Signal Processing
Topology switching for data center networks

Hot-ICE'11 Proceedings of the 11th USENIX conference on Hot topics in management of internet, cloud, and enterprise networks and services

Quantified Score

Hi-index	0.89

Visualization

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.