Dynamic QOS routing in a mesh network

G Varaprasad, R S D Wahidabanu


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.


Parallelism; arrival rate; service rate; QoS

Full Text:



  • There are currently no refbacks.