Analysis of Quality of Service Routing Algorithms

Analysis of Quality of Service Routing Algorithms

E.George Dharma Prakash Raj, Sinthu JanitaPrakash, S.V.Kasmir Raja
Copyright: © 2009 |Pages: 12
DOI: 10.4018/jitwe.2009040105
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

The routing problems can be divided into two major classes. They are 1) Unicast routing and 2) Multicast routing. The Unicast routing problem is as follows. Given a source node sr, a destination node dn, a set of QoS constraints qc and an optimization goal (optional), find the best feasible path from sr to dn, which satisfies qc. The Multicast routing problem is as follows. Given a source node sr, a set st of destination nodes, a set of constraints cts and an optimization goal (optional), find the best feasible path covering sr and all nodes in st, which satisfies cts. This article presents two such Unicast QoS based algorithms called as Source Routing and the proposed Heuristic Routing. A Client Server based model has been generated to study the performance of the two algorithms with respect to the message overhead, response time and path delay. The Experiments and the results are analyzed.

Complete Article List

Search this Journal:
Reset
Volume 19: 1 Issue (2024)
Volume 18: 1 Issue (2023)
Volume 17: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 16: 4 Issues (2021)
Volume 15: 4 Issues (2020)
Volume 14: 4 Issues (2019)
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