A preference function f has a domain set D consisting of multiple criteria x = (x1, x2, ..., xm), where xj represents the jth criterion. Each alternative is a point q = (q1, q2, ..., qk) in the set D. Building a preference function involves assessment of numerical values of the coordinates (q1, q2, ..., qk) for each alternative. Given x, y, z ? D then the following must hold: 1. x “is preferred to” y ? f(x) = f(y) 2. x– z “is preferred to” y – z ? f(x) – f(z) = f(y) – f(z)
Published in Chapter:
Quality of Service by Way of Path Selection Policy
Wayne Goodridge (Barbados Community College, Barbados), Hadrian Peter (University of the West Indies, Barbados), and William Robertson (Dalhousie University, Canada)
Copyright: © 2008
|Pages: 9
DOI: 10.4018/978-1-59140-993-9.ch061
Abstract
The pervasive use of the Internet, the world’s most extensive public communication system, for services ranging from academic research and e-mail to electronic commerce, necessitates that a policy should be put in place to ensure that such services are delivered in an efficient manner. Quality of service (QoS) is the capability of a network to provide better service to selected network traffic over various technologies. In this paper we focus on a specific aspect of QoS–namely, the path selection policy.