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.
