In this paper, performance analysis of a cognitive radio network is conducted. In the network, there is imperfect sensing and the wireless channel is a Gilbert-Elliott channel. The focus is on the network's capacity in serving traffic with delay constraints. Specifically, the maximum traffic arrival rates of both primary users and secondary users, which the network can support with guaranteed delay bounds, are investigated. The analysis is based on stochastic network calculus. A general relationship between delay bounds, traffic patterns and important characteristics such as spectrum sensing errors and channel fading of the cognitive radio network is derived. This relationship lays a foundation for finding the capacity under different traffic scenarios. Two specific traffic types are exemplified, namely periodic traffic and Poisson traffic. Analytical results are presented in comparison with simulation results. The comparison shows a good match between them, validating the analysis.

With the need and adoption of link aggregation where multiple links exist between two adjacent nodes in order to increase transmission capacity between them, there arise the problems of service guarantee and fair sharing of multiple servers. Although a lot of significant work has been done for single-server scheduling disciplines in the past years, not much work is available for multi-server scheduling disciplines. In this paper, we present and investigate two round robin based multi-server scheduling disciplines, which are Multi-Server Uniform Round Robin (MS-URR) and Multi-Server Deficit Round Robin (MS-DRR). In particular, we analyze their service guarantees and fairness bounds. In addition, we discuss the misordering problem with MS-DRR and present a bound for its misordering probability.