Call blocking performance of distributed algorithms for dynamic channel allocation in microcells

Satellite-UMTS traffic dimensioning and resource management technique analysis

“…We expect that the cost-function DCA allows a value greater than 0.658, under homogeneous assumptions. According to [22], has been estimated by simulations: we have obtained ; this value has been validated through the fitting between the blocking results obtained by simulations and those analytically predicted with the method described below.…”

“…The theoretical evaluation of the performance of DCA techniques has been carried out in the literature [22] for the case of "fixed users" (i.e.,…”

“…In [22], the value of has been estimated by simulations for different DCA strategies from the cost function considered here; in particular, "timid DCA" and "aggressive DCA." The timid DCA algorithm chooses a channel among those available in a cell without making an optimized choice; no channel reconfiguration is performed for a call in progress.…”

“…Then, cost-function DCA can be considered as an improved version of timid DCA. In [22], the authors show that the value of for the aggressive DCA is greater than timid DCA; in particular, simulation results in [22] give for timid DCA with a planar cellular system and a sevencell cluster. We expect that the cost-function DCA allows a value greater than 0.658, under homogeneous assumptions.…”

Dynamic channel allocation in interference-limited cellular systems with uneven traffic distribution

“…Proposed channel assignment strategies vary along a spectrum from random assignment, which randomly assigns any free channel satisfying the admission control policy to a new call, to global assignment, which uses information about all existing channel assignments in the entire service region to assign a channel that will in some sense minimize the system-wide detrimental effects. Intermediate policies differ in the amount of information required and include hybrid strategies [4], channel borrowing [2], [8], aggressive channel assignment [29], and heuristics to minimize impact upon neighboring cells [1], [3], [8]. Proposed packing algorithms vary along a spectrum from no reassignment, as in FCA, to maximum packing, which will reassign as many calls in the entire service region as necessary to accommodate a new call.…”