On the complexity of quality of service routing
DOI10.1016/S0020-0190(98)00206-3zbMATH Open1338.68121MaRDI QIDQ294629FDOQ294629
Authors: Zheng Wang
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098002063?np=y
Recommendations
- scientific article; zbMATH DE number 1969707
- QOS routing algorithms for anycast services
- Quality-of-Service routing with path information aggregation
- scientific article; zbMATH DE number 1955773
- Dynamic online QoS routing schemes: Performance and bounds
- Packet Routing: Complexity and Algorithms
- Optimal choice of the capacities of telecommunication networks to provide QoS-routing
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
Cited In (16)
- Packet Routing: Complexity and Algorithms
- Efficient QoS routing.
- Complexity results on labeled shortest path problems from wireless routing metrics
- Title not available (Why is that?)
- Polynomial time approximation schemes for the constrained minimum spanning tree problem
- Precomputation for intra-domain QoS routing
- A survey on multi-constrained optimal path computation: exact and approximate algorithms
- Sensible decisions based on QoS
- On the Convexity of Feasible QoS Regions
- Title not available (Why is that?)
- New Routing Strategies for RSP Problems with Concave Cost
- Search space reduction in QoS routing.
- Dynamic online QoS routing schemes: Performance and bounds
- Multi-postpath-based lookahead multiconstraint QoS routing
- Unicast and multicast QoS routing with soft-constraint logic programming
- Highly responsive and efficient QoS routing using pre- and on-demand computations along with a new normal measure
This page was built for publication: On the complexity of quality of service routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294629)