Multiple Metric QoS Routing in Differentiated Services Networks Using Preference Functions Measurement Concepts.
ABSTRACT QoS routing protocols involving several combinations of network metrics can be difficult to solve in polynomial time. Our
research introduces anovel approach that allows bandwidth brokers to perform QoS management in Diffserv Domains with any
number and combination of network metrics with algorithm complexity of O(m(n + 1)) where m is the number of paths between
two edge devices in the network and n is the number of metrics involved.
- SourceAvailable from: psu.edu
Conference Paper: On finding multi-constrained paths[Show abstract] [Hide abstract]
ABSTRACT: New emerging distributed multimedia applications provide guaranteed end-to-end quality of service (QoS) and have stringent constraints on delay, delay-jitter, cost, etc. The task of QoS routing is to find a route in the network which has sufficient resources to satisfy the constraints. The delay-cost-constrained routing problem is NP-complete. We propose a heuristic algorithm for this problem. The idea is to first reduce the NP-complete problem to a simpler one which can be solved in polynomial time, and then solve the new problem by either an extended Dijkstra's algorithm or an extended Bellman-Ford algorithm. We prove the correctness of our algorithm by showing that a solution for the simpler problem must also be a solution for the original problem. The performance of the algorithm is studied by both theoretical analysis and simulationCommunications, 1998. ICC 98. Conference Record.1998 IEEE International Conference on; 07/1998
- [Show abstract] [Hide abstract]
ABSTRACT: Several new architectures have been developed for supporting multimedia applications such as digital video and audio. However, quality-of-service (QoS) routing is an important element that is still missing from these architectures. In this paper, we consider a number of issues in QoS routing. We first examine the basic problem of QoS routing, namely, finding a path that satisfies multiple constraints, and its implications on routing metric selection, and then present three path computation algorithms for source routing and for hop-by-hop routingIEEE Journal on Selected Areas in Communications 10/1996; · 3.12 Impact Factor
- [Show abstract] [Hide abstract]
ABSTRACT: This memo describes extensions to the OSPF [Moy94] protocol to support QoS routes. The focus of the document is on the algorithms used to compute QoS routes and on the necessary modifications to OSPF to support this function, e.g., the information needed, its format, how it is distributed, and how it is used by the QoS path selection process. Aspects related to how QoS routes are established and managed are also discussed. The goal of this document is to identify a framework and possible approaches to allow deployment of QoS routing capabilities with the minimum possible impact to the existing routing infrastructure. Guerin, et al. Expires 30 September 1997 [Page i] Internet Draft QoS Routing Mechanisms 25 March 1997 Contents Status of This Memo i Abstract i 1. Introduction 1 1.1. Overall Framework . . . . . . . . . . . . . . . . . . . . 1 1.2. Simplifying Assumptions . . . . . . . . . . . . . . . . . 2 2. Path Selection Information and Algorithms 4 2.1. Metrics . . . . . . . ....10/1998;