We present an analytical framework for modeling a priority-based load balancing scheme in cellular networks based on a modified version of the direct retry algorithm . The model differs in many respects from previous works on load balancing , in particular by incorporating the call admission process, through random access ; by allowing the differentiation of users based on their priorities ; and by incorporating received signal properties . The quantitative results illustrate that, for example, as more shared channels are used for load balancing an increase in overall system channel utilization is observed. However, more interestingly, the improvement in blocking probability per shared channel for load balanced users  is maximized at an intermediate number of shared channels  as opposed to the maximum number of these shared resources. This occurs because a balance is achieved between the number of users requesting connections and those that are already admitted to the network . Our analysis proves that cellular network operators can control the manner in which traffic is offloaded between neighboring cells by simply manipulating the length of the random access phase .
We present an analytical framework for modeling a priority-based load balancing scheme in cellular networks based on a new algorithm called direct retry with truncated offloading channel resource pool (DR_{K . The model differs in many respects from previous works on load balancing . Foremost, it incorporates the call admission process, through random access . In specific, the proposed model implements the Physical Random Access Channel used in 3GPP network standards. Furthermore, the proposed model allows the differentiation of users based on their priorities . The quantitative results illustrate that, for example, cellular network operators can control the manner in which traffic is offloaded between neighboring cells by simply manipulating the length of the random access phase. Our analysis allow to quantitatively determine the blocking probability individual users will experience given a specific length of random access phase. Furthermore, we observe that the improvement in blocking probability per shared channel for load balanced users using DR_{K is maximized at an intermediate number of shared channels , as opposed to the maximum number of these shared resources. This occurs because a balance is achieved between the number of users requesting connections and those that are already admitted to the network .
R
modified version of the direct retry algorithm
new algorithm called direct retry with truncated offloading channel resource pool (DR_{K
R
, in particular by incorporating
. Foremost, it incorporates
R
; by allowing the
. In specific, the proposed model implements the Physical Random Access Channel used in 3GPP network standards. Furthermore, the proposed model allows the
D
; and by incorporating received signal properties
R
as more shared channels are used for load balancing an increase in overall system channel utilization is observed. However, more interestingly,
cellular network operators can control the manner in which traffic is offloaded between neighboring cells by simply manipulating the length of the random access phase. Our analysis allow to quantitatively determine the blocking probability individual users will experience given a specific length of random access phase. Furthermore, we observe that
A
using DR_{K
A
,
D
. Our analysis proves that cellular network operators can control the manner in which traffic is offloaded between neighboring cells by simply manipulating the length of the random access phase