Multi–constrained Quality of Service (QoS) routing finds a route in the network that satisfies multiple independent quality of service constraints. This problem is NP–hard and a number of heuristic algorithms have been proposed to solve the problem. This paper studies two heuristics, the limited

Quality-of-Service (QoS) routing tries to select a path that satisfies a set of QoS constraints, while also achieving overall network resource efficiency. We present initial results on QoS path selection for traffic requiring bandwidth and delay guarantees. For traffic with bandwidth guarantees, we

Quality-of-service (QoS) routing satisfies application performance requirements and improves network resource usage by selecting paths based on connection traffic parameters and available link capacity. However, QoS-routing protocols can introduce significant network overhead for computing routes

Quality-of-service (QoS) requirements for the timely delivery of real-time multimedia

In this paper we study several issues in the design of localized QoS routing schemes, schemes that make local routing decisions based on locally collected QoS state information (i.e., there is no network-wide information exchange among routers). In particular, we investigate the granularity

Most of the research proposals on Quality-of-Service (QoS) mechanisms have focused on providing guarantees in a single domain. Supporting QoS guarantees in the interdomain setting has been receiving more research attention recently. Most of the proposals for in-terdomain QoS routing has focused

We propose six new heuristics to find a source-to-destination path that satisfies two or more additive constraints on edge weights. Five of these heuristics become ǫ-approximation algorithms when their parameters are appropriately set. The performance of our new heuristics is compared experimentally with that of two recently proposed heuristics for the same problem.

networks, is often impractical in wireless networks for reasons such as power, cost, and government regulation, Quality of Service (QoS) routing is even more important in wireless networks than in wired networks. Though a number of QoS-routing protocols have been proposed for use in ad hoc networks

. These results indicate that the limited path heuristic is relatively insensitive to the number of constraints and is superior to the limited granularity heuristic in solving-constrained QoS routing problems when Q. Index Terms—Quality of service, routing. I.

topology, and link cost function each have a significant impact on the probability of successfully routing new connections. The experiments confirm and extend the findings of other studies, and also lend new insight designing efficient quality-of-service routing policies in large networks.