Indian Institute of Science. Short Communication Dynamic QOS routing in a mesh network.pdfVIP

J. Indian Inst. Sci. , Nov.–Dec. 2006, 86, 785–789 © Indian Institute of Science. Short Communication Dynamic QOS routing in a mesh network G. VARAPRASAD 1,* AND R. S. D. WAHIDABANU2 1Department of Computer Science and Engineering, B. M. S. College of Engineering, Bangalore 560 019, India. 2Department of Electronics and Communication Engineering, Government College of Engineering, Salem 636 011, India. email: varaprasad2001@, Ph: 91-80-2662 2130, Fax: +91-80-2661 4357 Received on May 8, 2004; Revised on May 19, 2006. Abstract This paper proposes an algorithm which helps in reducing the network traffic at intermediate nodes in a mesh network. This model analyses the network performance by using queuing theory and provides QoS for end-users. The performance metrics are mean waiting time, throughput and delay. Each node is assumed to be M/M/m model in the network. The major focus of this work is to provide better QoS for end-users by effective utilization of bandwidth and balancing load over the network. Keywords: Parallelism, arrival rate, service rate, QoS. 1. Introduction In recent years, communication networks have become robust and play a vital role in pro- viding QoS for end-users under different networks. Network performance is measured by delay and reliability. Many traditional routing algorithms [1–3], proposed for optimal/ suboptimal routes, suffer from several drawbacks. First, the computation is massive to find optimal/suboptimal routes. Secondly, the speed of computation to bind new route is less when component fails [2]. Thirdly, the failures of node are affected by others [3]. Currently, two main functions are performed by dynamic routing. The first function uses a number of routes from source to destination to route the packet. The second function uses a variety of protocols for communicati