Abstract—The queueing performance of a (secondary) cognitive user is investigated for a hierarchical network where there are N independent and identical primary users. Each primary user employs a slotted transmission protocol, and its channel usage forms a two-state (busy,idle) discrete-time Markov chain. The cognitive user employs the optimal policy to select which channel to sense (and use if found idle) at each slot. In the framework of effective bandwidths, the stationary queue tail distribution of the cognitive user is estimated using a large deviation approach for which closed-form expressions are obtained when N = 2. Upper and lower bounds are obtained for the general N primary user network. For positively correlated primary transmissions, the bounds are shown to be asymptotically tight. Monte Carlo simulations using importance sampling techniques are used to validate the obtained large deviation estimates.