An integrated admission-degradation framework for optimizing real-time call mix in wireless cellular networks

This paper describes an integrated framework for selecting optimal call mixes (in a multimedia traffic scenario) by bandwidth degradation in a wireless cellular network, to maximize the revenue earned by the service provider. Each admitted call in our framework generates a revenue for the service provider based on the parameters of the call. The sum of the revenues generated by all admitted calls at a time is considered as the total revenue earned in a cell. By degradation, we mean that: (1) some channels can be taken away from ongoing calls that are assigned multiple channels and/or (2) newly admitted calls that require multiple channels get fewer than what they requested. To avoid removing more channels from calls than they could tolerate, we incorporate a new call attribute: the degradation tolerance, i.e, the number of channels a call can be degraded without sacrificing the acceptable level of quality. We also consider priorities over calls to influence the admission-degradation decision. Our analytical framework includes both static and dynamic scenarios. The dynamic case is enhanced with the ability to select the optimal call mix using incoming and departing handoffs, new calls, and call terminations in a recursive way. We also discuss how to accommodate non-real-time calls into our system. To evaluate the performance of the proposed scheme a discrete event simulation tool, that accommodates our dynamic framework built on a customized simulated annealing optimization function, has been developed. Simulation results demonstrate that not only does the proposed integrated admission-degradation framework maximize the total revenue earned in cells, but also handoff and new call blocking probabilities are reduced.

[1]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[2]  Edward W. Knightly,et al.  A framework for design and evaluation of admission control algorithms in multi-service mobile networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[4]  Mahmoud Naghshineh,et al.  QOS provisioning in micro-cellular networks supporting multimedia traffic , 1995, Proceedings of INFOCOM'95.

[5]  Taieb Znati,et al.  A path availability model for wireless ad-hoc networks , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[6]  James F. Kurose,et al.  Open issues and challenges in providing quality of service guarantees in high-speed networks , 1993, CCRV.

[7]  Tatsuya Suda,et al.  An adaptive bandwidth reservation scheme for high-speed multimedia wireless networks , 1998, IEEE J. Sel. Areas Commun..

[8]  Chuanyi Ji,et al.  Bounding the performance of dynamic channel allocation with QoS provisioning for distributed admission control in wireless networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[9]  Stephen S. Rappaport,et al.  Prioritized resource assignment for mobile cellular communication systems with mixed services and platform types , 1996 .

[10]  Suresh Singh,et al.  Loss profiles: A quality of service measure in mobile computing , 1996, Wirel. Networks.

[11]  C. Reeves Modern heuristic techniques for combinatorial problems , 1993 .

[12]  Sajal K. Das,et al.  Quality-of-Service degradation strategies in multimedia wireless networks , 1998, VTC '98. 48th IEEE Vehicular Technology Conference. Pathway to Global Wireless Revolution (Cat. No.98CH36151).

[13]  Sajal K. Das,et al.  A call admission and control scheme for quality‐of‐service (QoS) provisioning in next generation wireless networks , 2000, Wirel. Networks.