In this paper, we theoretically analyze the performance in terms of end-to-end call acceptance in Multi-Channel Multi-Radio (MC-MR) Wireless Mesh Networks (WMNs) using queueing theory techniques. We study the impact of the routing protocol and the channel assignment algorithm on the end-to-end call acceptance and address the issue of providing deterministic QoS guarantees to a designated set of nodes. The significance of our work lies in providing an insight into the bounds of the probability of call acceptance under a given set of parameters for a WMN and provide a framework for comparison of existing routing protocols and channel assignment algorithms. This can be used for network dimensioning and comparative study of different protocols. We have adopted a TDMA-based WMN as our base framework. We consider the case of differentiated class of users and derive upper fenced(PAccMax) and lower fenced(PAccMin) bounds for the probability of call acceptance (PAcc) and theoretically estimate the probability of system saturation (PSat) (which is the probability that no more new calls can be accepted in the network). Through simulations, we study the dependence of the (PAcc) on the number of radios in each node (K), the number of channels available in the network (C), the network load (ρ), the routing protocol used, and the channel assignment algorithm. We also study the effect of Weighted Cumulative Expected Transmission Time (WCETT) routing metric and compare its performance with the Shortest Path (SP) routing protocol. The increase in PAcc with the WCETT metric emphasizes the need to consider better routing metrics in an MC-MR network. © 2009 Elsevier B.V. All rights reserved.