Utilizing call admission control for pricing optimization of multiple service classes in wireless cellular networks

Computer Communications

Volumn 32, Issue 2, 2009, Pages 317-323

  Yilmaz, Okan ^a   Chen, Ing Ray ^a  

^a Virginia Polytechnic Institute and State University   (United States)

Author keywords

Call admission control; Pricing optimization; Quality of service; Revenue optimization; Service classes; Wireless networks

Indexed keywords

CELLULAR NEURAL NETWORKS; CELLULAR TELEPHONE SYSTEMS; COSTS; ECONOMICS; OPTIMIZATION; QUALITY CONTROL; QUALITY OF SERVICE; TELECOMMUNICATION SERVICES;

ADMISSION CONTROL ALGORITHMS; CALL ADMISSION CONTROL; HYBRID PARTITIONING; MULTIPLE SERVICES; PRICING OPTIMIZATION; PRICING SCHEMES; QOS GUARANTEES; REVENUE OPTIMIZATION; SERVICE CLASSES; SERVICE DEMANDS; SERVICE PROVIDERS; WIRELESS CELLULAR NETWORKS;

WIRELESS NETWORKS;

EID: 58149488760     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2008.11.001     Document Type: Article

References (17)

1. M. Aldebert, M. Ivaldi, C. Roucolle, Telecommunications demand and pricing structure: an economic analysis, in: Proc. of the 7th Conf. Telecommunications Systems: Modeling and Analysis, Nashville, TN, 1999, pp. 255-267.
2. A. Bouch, M.A. Sasse, Why value is everything: a user centric approach to internet quality of service and pricing, IWQoS, Karlsruhe, Germany, June 2001.
3. Chen I.R., and Chen C.M. Threshold-based admission control policies for multimedia servers. The Computer Journal 39 9 (1996) 757-766
4. Chen I.R., Yilmaz O., and Yen I.L. Admission control algorithms for revenue optimization with QoS guarantees in mobile wireless networks. Wireless Personal Communications 38 3 (2006) 357-376
5. Fang Y. Thinning algorithms for call admission control in wireless networks. IEEE Transactions on Computers 52 5 (2003) 685-687
6. Guerin R. Queuing-blocking systems with two arrival streams and guarded channels. IEEE Transactions on Communication 36 (1988) 153-163
7. Hong D., and Rappaport S.S. Traffic model and performance analysis for cellular mobile radio telephone systems with prioritized and non-prioritized handoff procedures. IEEE Transactions on Vehicular Technology VT35 3 (1986)
8. Hong D., and Rappaport S.S. Priority oriented channel access for cellular systems serving vehicular and portable radio telephones. Communications, Speech and Vision, IEE Proceedings I 131 5 (1989) 339-346
9. Hou J., Yang J., and Papavassiliou S. Integration of pricing with call admission control to meet QoS requirements in cellular networks. IEEE Transactions on Parallel and Distributed Systems 13 9 (2002) 898-910
10. Keon N.J., and Anandalingam G. Optimal pricing for multiple services in telecommunications networks offering quality-of-service guarantees. IEEE/ACM Transactions on Networking 11 1 (2003) 66-80
11. Kyriakakos M., Frangiadakis N., Merakos L., and Hadjiefthymiades S. Enhanced path prediction for network resource management in wireless LANs. IEEE Wireless Communications 10 6 (2003) 62-69
12. Lanning S., Mitra D., Wang Q., and Wright M. Optimal planning for optical transport networks. Philosophical Transactions Royal Society London. Series A 358 1773 (2000) 2183-2196
13. Li B., Lin C., and Chanson S.T. Analysis of a hybrid cutoff priority algorithm for multiple classes of traffic in multimedia wireless networks. Wireless Networks 4 (1998) 279-290
14. Lin Y.B., and Chlamtac I. Wireless and Mobile Network Architecture (2001), Wiley, New York
15. P. Rappaport, J. Alleman, L.D. Taylor, Household demand for wireless telephony: an empirical analysis, in: Proc. of the 31st Annual Telecommunications Policy Research Conf., Arlington, VA, September 2003.
16. Wang J., Zeng Q., and Agrawal D.P. Performance analysis of a preemptive and priority reservation handoff algorithm for integrated service-based wireless mobile networks. IEEE Transactions on Mobile Computing 2 1 (2003) 65-75
17. Ye J., Hou J., and Papavassilliou S. A comprehensive resource management for next generation wireless networks. IEEE Transactions on Mobile Computing 1 4 (2002) 249-263