Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A Distributed Algorithm for Delay-Constrained Unicast Routing
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
QSHINE '04 Proceedings of the First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
IEEE Network: The Magazine of Global Internetworking
SoMR: A scalable distributed QoS multicast routing protocol
Journal of Parallel and Distributed Computing
Energy-aware online routing with QoS constraints in multi-rate wireless ad hoc networks
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
A survey on multi-constrained optimal path computation: Exact and approximate algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Monitoring quality optimization in wireless sensor networks with a mobile sink
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Routing with multiple quality-of-services constraints: An approximation perspective
Journal of Network and Computer Applications
Path approximation for multi-hop wireless routing under application-based accuracy constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
Taming uncertainties in real-time routing for wireless networked sensing and control
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Hi-index | 0.00 |
Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, MPLS path selection, ATM circuit routing, and traffic engineering. The problem is to find the cheapest path that satisfies certain constraints. In particular, finding the cheapest delay-constrained path is critical for real-time data flows such as voice/video calls. Because it is NP-complete, much research has been designing heuristic algorithms that solve the ε-approximation of the problem with an adjustable accuracy. A common approach is to discretize (i.e., scale and round) the link delay or link cost, which transforms the original problem to a simpler one solvable in polynomial time. The efficiency of the algorithms directly relates to the magnitude of the errors introduced during discretization. In this paper, we propose two techniques that reduce the discretization errors, which allows faster algorithms to be designed. Reducing the overhead of computing constrained shortest paths is practically important for the successful design of a high-throughput QoS router, which is limited at both processing power and memory space. Our simulations show that the new algorithms reduce the execution time by an order of magnitude on power-law topologies with 1000 nodes. The reduction in memory space is similar.