Welcome to the InfoSci Platform
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 |Volume: 4 |Issue: 2 |Pages: 12
ISSN: 1554-1045|EISSN: 1554-1053|ISSN: 1554-1045|EISBN13: 9781615203451|EISSN: 1554-1053|DOI: 10.4018/jitwe.2009040105
Cite Article Cite Article

MLA

Prakash Raj, E.George Dharma, et al. "Analysis of Quality of Service Routing Algorithms." IJITWE vol.4, no.2 2009: pp.78-89. http://doi.org/10.4018/jitwe.2009040105

APA

Prakash Raj, E. D., JanitaPrakash, S., & Raja, S. (2009). Analysis of Quality of Service Routing Algorithms. International Journal of Information Technology and Web Engineering (IJITWE), 4(2), 78-89. http://doi.org/10.4018/jitwe.2009040105

Chicago

Prakash Raj, E.George Dharma, Sinthu JanitaPrakash, and S.V.Kasmir Raja. "Analysis of Quality of Service Routing Algorithms," International Journal of Information Technology and Web Engineering (IJITWE) 4, no.2: 78-89. http://doi.org/10.4018/jitwe.2009040105

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.