Quality of Service for Multimedia and Real-Time Services

Quality of Service for Multimedia and Real-Time Services

F. W. Albalas (Jadara University, Jordan), B. A. Abu-Alhaija (Middle East University, Jordan), A. Awajan (Al-Balqa’ Applied University, Jordan), A. Awajan (Princess Sumaya University for Technology, Jordan) and Khalid Al-Begain (University of Glamorgan, UK)
Copyright: © 2010 |Pages: 22
DOI: 10.4018/jitwe.2010100101

Abstract

New web technologies have encouraged the deployment of various network applications that are rich with multimedia and real-time services. These services demand stringent requirements are defined through Quality of Service (QoS) parameters such as delay, jitter, loss, etc. To guarantee the delivery of these services QoS routing algorithms that deal with multiple metrics are needed. Unfortunately, QoS routing with multiple metrics is considered an NP-complete problem that cannot be solved by a simple algorithm. This paper proposes three source based QoS routing algorithms that find the optimal path from the service provider to the user that best satisfies the QoS requirements for a particular service. The three algorithms use the same filtering technique to prune all the paths that do not meet the requirements which solves the complexity of NP-complete problem. Next, each of the three algorithms integrates a different Multiple Criteria Decision Making method to select one of the paths that have resulted from the route filtering technique. The three decision making methods used are the Analytic Hierarchy Process (AHP), Multi-Attribute Utility Theory (MAUT), and Kepner-Tregoe KT. Results show that the algorithms find a path using multiple constraints with a high ability to handle multimedia and real-time applications.
Article Preview

Routing can be classified into three types, unicast, multicast and broadcast. Broadcast routing is not a problem because the packets are sent to all receivers, so there is no need to find an optimal path. The routing problem has two major problems, the unicast routing problem and the multicast routing problem. This paper focuses on the unicast routing problem, where the unicast routing problem is to find the best feasible path from the source node to the destination node that satisfies a set of QoS constraints. Unicast routing algorithms can be further divided to single metric, dual-metrics or multiple metrics routing. As this paper aims to provide QoS routing it is necessary to use multiple metrics.

Purchase this article to continue reading all 22 pages >

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 14: 4 Issues (2019): Forthcoming, Available for Pre-Order
Volume 13: 4 Issues (2018)
Volume 12: 4 Issues (2017)
Volume 11: 4 Issues (2016)
Volume 10: 4 Issues (2015)
Volume 9: 4 Issues (2014)
Volume 8: 4 Issues (2013)
Volume 7: 4 Issues (2012)
Volume 6: 4 Issues (2011)
Volume 5: 4 Issues (2010)
Volume 4: 4 Issues (2009)
Volume 3: 4 Issues (2008)
Volume 2: 4 Issues (2007)
Volume 1: 4 Issues (2006)
View Complete Journal Contents Listing