# Quality of Service by Way of Path Selection Policy

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.

## Key Terms in this Chapter

Preference Function: 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)

Policy Based Metric: A characteristic of a network link that controls what type of traffic and how that traffic moves across the link. Policy metrics can be used to implement access control and data security of the link.

Concave Metrics: w is said to be a concave metric if w(P) = min(w(Li)). Example is bandwidth.

QoS Routing Algorithm: An algorithm that finds a path that meets a set of user constraints.

Strict User Constraints: Let S be a set of paths, then Lj are strict user constraints if: Lj = wj(P*) + ej, j = 1, ..., m where P* is the path for which 1 max( ( )) j m j w S = = is minimum and ej are small positive numbers relative to wj(P*). Strict user constraints imply that few paths exist that can meet the demands of the user.

Additive Metrics: Let w(P) be the total value for metric w on path P, and let w(Li) represent the weight of each link with respect to w on path P. Then w is said to be an additive metric if 1 ( ) ( ) li i w P = w L = S , where l is the number of links in the path. Examples are delay and jitter.

Optimization Goal: The user’s desire to find a path that minimizes or maximizes the value.

## Complete Chapter List

Search this Book:
Reset
Preface
Mario Freire, Manuela Pereira
Acknowledgment
Chapter 1
Michele Mara de Araújo Espíndula Lima, Nelson Luís Saldanha da Fonseca
\$37.50
Chapter 2
Abdelhamid Mellouk
\$37.50
Chapter 3
Christos Bouras, Apostolos Gkamas, Dimitris Primpas, Kostas Stamos
\$37.50
Chapter 4
Pankaj Kamthan
\$37.50
Chapter 5
D. Kagklis, S. Androulidakis, G. Patikis, T. Doukoglou
\$37.50
Chapter 6
Elisa Bertino, Elena Ferrari, Andrea Perego, Gian Piero Zarri
\$37.50
Chapter 7
\$37.50
Chapter 8
Andrea Bosin, Nicoletta Dessì, Maria Grazia Fugini, Diego Liberati, Barbara Pes
\$37.50
Chapter 9
Gábor Hosszú, David Tegze
\$37.50
Chapter 10
Autonomic Computing  (pages 66-71)
Kevin Curran, Maurice Mulvenna, Chris Nugent, Matthias Baumgarten
\$37.50
Chapter 11
Autonomic Networking  (pages 72-78)
Pantelis N. Karamolegkos, Charalampos Patrikakis, Emmanuel Protonotarios
\$37.50
Chapter 12
Mark Burgess
\$37.50
Chapter 13
Gábor Hosszú, Raymond Pardede
\$37.50
Chapter 14
Wong Kok Seng, Sellappan Palaniappan, Nor Adnan Yahaya
\$37.50
Chapter 15
Kyeongja Lee, Armand Toguyeni, Ahmed Rahmani
\$37.50
Chapter 16
Miguel Rodríguez Pérez, Cándidol López-García, Sergio Herrería-Alonso
\$37.50
Chapter 17
Kyungbaek Kim, Byungjip Kim, Daeyeon Park
\$37.50
Chapter 18
Huaqun Guo, Daqing Zhang, Lek-Heng Ngoh, Song Zheng, Wai-Choong Wong
\$37.50
Chapter 19
Vitor Santos, Henrique São Mamede
\$37.50
Chapter 20
Tony C. Shan, Winnie W. Hua
\$37.50
Chapter 21
\$37.50
Chapter 22
Sergio Herrería-Alonso, Manuel Fernández Veiga, Andrés Suárez González, Miguel Rodríguez Pérez, Cándido López-García
\$37.50
Chapter 23
Mihály Orosz, Gábor Hosszú, Ferenc Kovács
\$37.50
Chapter 24
Christos Bouras, Eri Giannaka, Thrasyvoulos Tsiatsos
\$37.50
Chapter 25
Kyungbaek Kim, Daeyeon Park
\$37.50
Chapter 26
E-Learning  (pages 179-184)
Gregory R. Gay, Paola Salomoni, Silvia Mirri
\$37.50
Chapter 27
Lampros Raptis, D. Kagklis, Yiorgos Patikis
\$37.50
\$37.50
Chapter 29
Kevin Curran, Peter Breslin, Kevin McLaughlin, Gary Tracey
\$37.50
Chapter 30
Wen-Chen Hu, Lixin Fu, Hung-Jen Yang, Sheng-Chien Lee
\$37.50
Chapter 31
Udo Averweg, Geoff Erwin, Don Petkov
\$37.50
Chapter 32
Alexandra George
\$37.50
Chapter 33
Internet Gambling  (pages 228-234)
\$37.50
Chapter 34
Internet Measurements  (pages 235-241)
Artur Ziviani
\$37.50
Chapter 35
IP Multicasting  (pages 242-248)
Robert R. Chodorek
\$37.50
Chapter 36
Muhammad Sher, Fabricio Carvalho de Gouveia, Thomas Magedanz
\$37.50
Chapter 37
The IPv6 Protocol  (pages 257-268)
Christos Bouras, Apostolos Gkamas, Dimitris Primpas
\$37.50
Chapter 38
Rachel Babiarz, Jean-Sebastien Bedo
\$37.50
Chapter 39
Tony C. Shan, Winnie W. Hua
\$37.50
Chapter 40
Gábor Richly, Gábor Hosszú, Ferenc Kovács
\$37.50
Chapter 41
Malicious Software  (pages 284-290)
Thomas M. Chen, Gregg W. Tally
\$37.50
Chapter 42
Mobility Protocols  (pages 291-298)
\$37.50
Chapter 43
Karim El Guemhioui
\$37.50
Chapter 44
\$37.50
Chapter 45
Christos Bouras, Apostolos Gkamas, Dimitris Primpas, Kostas Stamos
\$37.50
Chapter 46
Kevin Curran
\$37.50
Chapter 47
Nicola Scalabrino, Daniele Miorandi, Enrico Gregori, Imrich Chlamtac
\$37.50
Chapter 48
Yezid Donoso, Ramón Fabregat
\$37.50
Chapter 49
Hongsik Choi, Seung S. Yang
\$37.50
Chapter 50
Gábor Hosszú, Zoltán Czirkos
\$37.50
Chapter 51
K. Daniel Wong, Ashutosh Dutta
\$37.50
Chapter 52
Madjid Merabti, Paul Fergus, Omar Abuelma’atti
\$37.50
Chapter 53
Optical Burst Switching  (pages 375-382)
Kyriakos Vlachos
\$37.50
Chapter 54
N. S.C. Correia, M. C.R. Medeiros
\$37.50
Chapter 55
Huaqun Guo, Lek-Heng Ngoh, Wai-Choong Wong
\$37.50
Chapter 56
\$37.50
Chapter 58
Stefanos Gritzalis, Costas Lambrinoudakis
\$37.50
Chapter 59
Christos Bouras, Apostolos Gkamas, Dimitris Primpas, Kostas Stamos
\$37.50
Chapter 60
Christos Bouras, Apostolos Gkamas, Dimitris Primpas, Kostas Stamos
\$37.50
Chapter 61
Wayne Goodridge, Hadrian Peter, William Robertson
\$37.50
Chapter 62
Winston K.G. Seah, Hwee-Xian Tan
\$37.50
Chapter 63
\$37.50
Chapter 64
Charalampos Patrikakis, P. Fafali, Pantelis N. Karamolegkos, Y. Despotopoulos, N. Minogiannis
\$37.50
Chapter 65
Christos Bouras, Apostolos Gkamas, Dimitris Primpas, Kostas Stamos
\$37.50
\$37.50
Chapter 67
Rui Prior, Susana Sargento
\$37.50
Chapter 68
David Rincón, Sebastià Sallent
\$37.50
Chapter 69
Tonghong Li
\$37.50
Chapter 70
Kevin Curran, Elaine Smyth
\$37.50
Chapter 71
The Semantic Web  (pages 505-511)
Kevin Curran, Gary Gumbleton
\$37.50
Chapter 72
Livia Predoiu, Anna V. Zhdanova
\$37.50
Chapter 73
Dumitru Roman, Ioan Toma, Dieter Fensel
\$37.50
Chapter 74
\$37.50
Chapter 75
Ilija Basicevic, Miroslav Popovic
\$37.50
Chapter 76
Sylvia Encheva, Sharil Tumin
\$37.50
Chapter 77
Milica Stojmenovic
\$37.50
Chapter 78
Chia-Chu Chiang
\$37.50
Chapter 79
The Speech-Enabled Web  (pages 558-567)
L. E. Moser, P. M. Melliar-Smith
\$37.50
Chapter 80
Sergio Gutiérrez, Abelardo Pardo, Carlos Delgado Kloos
\$37.50
Chapter 81
\$37.50
Chapter 82
Jairo A. Gutiérrez
\$37.50
Chapter 83
M. C.R. Medeiros, N. S.C. Correia
\$37.50
Chapter 84
Sergio Gutiérrez, Abelardo Pardo, Carlos Delgado Kloos
\$37.50
Chapter 85
Kuen Park, Heejo Lee
\$37.50
Chapter 86
Agnieszka Chodorek
\$37.50
Chapter 87
\$37.50
Chapter 88
Nelson Luís Saldanha da Fonseca, Neila Fernanda Michel
\$37.50
Chapter 89
Stamatis Karnouskos
\$37.50
Chapter 90
Pankaj Kamthan
\$37.50
Chapter 91
Traffic Control  (pages 647-652)
Thomas M. Chen
\$37.50
Chapter 92
Viet Hung Nguyen, Tülin Atmaca
\$37.50
Chapter 93
Indranil Bose, Fong Man Chun
\$37.50
Chapter 94
Waking Up Sensor Networks  (pages 670-677)
Yew-Fai Wong, Trina Kok, Lek-Heng Ngoh, Wai-Choong Wong, Winston K.G. Seah
\$37.50
Chapter 95
Web Accessibility  (pages 678-683)
Gregory R. Gay, Paola Salomoni, Silvia Mirri
\$37.50
Chapter 96
Henrik Hanke, Alf Neumann
\$37.50
Chapter 97
Web Services  (pages 690-695)