Introduction to algorithms
Finding the hidden path: time bounds for all-pairs shortest paths
SIAM Journal on Computing
IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping
IEEE/ACM Transactions on Networking (TON)
Quality of service based routing: a performance perspective
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
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)
IEEE Network: The Magazine of Global Internetworking
ICCC '02 Proceedings of the 15th international conference on Computer communication
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
A scalable approach to the partition of QoS requirements in unicast and multicast
IEEE/ACM Transactions on Networking (TON)
Algorithms for precomputing constrained widest paths and multicast trees
IEEE/ACM Transactions on Networking (TON)
An integrated end-to-end QoS anycast routing on DiffServ networks
Computer Communications
IEEE Transactions on Mobile Computing
Minimal broadcasting schemas for the mesh structures
International Journal of High Performance Computing and Networking
Integration of explicit effective-bandwidth-based QoS routing with best-effort routing
IEEE/ACM Transactions on Networking (TON)
Research challenges in QoS routing
Computer Communications
Inter-domain QoS routing on Diffserv networks: a region-based approach
Computer Communications
Approximation algorithms for 2-source minimum routing cost k-tree problems
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Relay Positioning for Unmanned Aerial Vehicle Surveillance*
International Journal of Robotics Research
Multiple path selection algorithm for DiffServ-aware MPLS traffic engineering
Computer Communications
Optimal placement of UV-based communications relay nodes
Journal of Global Optimization
Journal of Parallel and Distributed Computing
A distributed algorithm for min-max tree and max-min cut problems in communication networks
IEEE/ACM Transactions on Networking (TON)
On optimal spectrum-efficient routing in TDMA and FDMA multihop wireless networks
Computer Communications
A scalable and robust qos architecture for wifi p2p networks
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Throughput and energy efficiency in wireless ad hoc networks with Gaussian channels
IEEE/ACM Transactions on Networking (TON)
Virtual network mapping algorithm in the cloud infrastructure
Journal of Network and Computer Applications
Hi-index | 0.01 |
In this paper, we introduce and investigate a "new" path optimization problem that we denote the all hops optimal path (AHOP) problem. The problem involves identifying, for all hop counts, the optimal, i.e., minimum weight, path(s) between a given source and destination(s). The AHOP problem arises naturally in the context of quality-of-service (QoS) routing in networks, where routes (paths) need to be computed that provide services guarantees, e.g., delay or bandwidth, at the minimum possible "cost" (amount of resources required) to the network. Because service guarantees are typically provided through some form of resource allocation on the path (links) computed for a new request, the hop count, which captures the number of links over which resources are allocated, is a commonly used cost measure. As a result, a standard approach for determining the cheapest path available that meets a desired level of service guarantees is to compute a minimum hop shortest (optimal) path. Furthermore, for efficiency purposes, it is desirable to precompute such optimal minimum hop paths for all possible service requests. Providing this information gives rise to solving the AHOP problem. The paper's contributions are to investigate the computational complexity of solving the AHOP problem for two of the most prevalent cost functions (path weights) in networks, namely, additive and bottleneck weights. In particular, we establish that a solution based on the Bellman-Ford algorithm is optimal for additive weights, but show that this does not hold for bottleneck weights for which a lower complexity solution exists.