Data networks
Computational complexity of loss networks
Theoretical Computer Science - Special issue on probabilistic modelling
ATM network design and optimization: a multirate loss network framework
IEEE/ACM Transactions on Networking (TON)
Optimization over Time
Dynamic Programming and Stochastic Control
Dynamic Programming and Stochastic Control
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
Exact Sampling in Machine Scheduling Problems
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
| Hi-index | 0.00 |
We consider a Time Division Multiple Access (TDMA) system in which each sector is allocated a fixed set of frequency bands. Due to spatial variation in the nature of interference, a voice call originating in a sector may have an acceptable signal to noise ratio only on a subset of the sector's frequencies. Given a Poisson traffic arrival distribution, we derive estimates of the sector blocking probability. In particular, we present lower bounds that are independent of the specific call allocation algorithm, and also examine specific call assignment algorithms such as Repacking, Least Busy and Optimal Random Routing. We develop a simple heuristic that allows us to obtain fast and accurate sector blocking probability estimates. The latter serve as crucial inputs for the design and optimization of capacity and coverage in TDMA networks.