Introduction to algorithms
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Hop-by-hop quality of service routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computing shortest paths for any number of hops
IEEE/ACM Transactions on Networking (TON)
Bandwidth-delay constrained path selection under inaccurate state information
IEEE/ACM Transactions on Networking (TON)
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing with topology aggregation in delay-bandwidth sensitive networks
IEEE/ACM Transactions on Networking (TON)
An efficient algorithm for finding a path subject to two additive constraints
Computer Communications
A simple efficient approximation scheme for the restricted shortest path problem
Operations Research Letters
Multicast routing in mobile ad hoc networks by using a multiagent system
Information Sciences: an International Journal
Hi-index | 0.00 |
We consider the problem of precomputing constrained widest paths and multicast trees in a communication network. Precomputing and storing of the relevant information minimizes the computational overhead required to determine an optimal path when a new connection request arrives. We evaluate algorithms that precompute paths with maximal bandwidth (widest paths), which in addition satisfy given end-to-end delay constraints. We analyze and compare both the worst case and average case performance of the algorithms. We also show how the precomputed paths can be used to provide computationally efficient solutions to the constrained widest multicast tree problem. In this problem, a multicast tree with maximal bandwidth (widest multicast tree) is sought, which in addition satisfies given end-to-end delay constraints for each path on the tree from the source to a multicast destination.