Performance and efficiency evaluation of channel allocation schemes for HSCSD in GSM

Several channel allocation schemes for high speed circuit switched data (HSCSD) over GSM are studied. The schemes differ in the way channels are packed (first fit, best fit and repacking), and in the connection admission policy. We study their blocking probability and utilisation. The performance of the schemes is studied with special focus on their simplicity/efficiency tradeoffs.

[1]  G. Nemhauser,et al.  Integer Programming , 2020 .

[2]  D. Calin,et al.  Performance analysis of high speed circuit switched data (HSCSD) over GSM , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[3]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[4]  Moshe Zukerman.  Circuit Allocation and Overload Control in a Hybrid Switching System , 1989, Comput. Networks.

[5]  Moshe Zukerman,et al.  Channel allocation methods for half and full rate connections in GSM , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[6]  Moshe Zukerman,et al.  Bandwidth allocation for bursty isochronous traffic in a hybrid switching system , 1989, IEEE Trans. Commun..

[7]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .