Meeting QoS requirements of mobile computing by dual-level congestion control

Authors:
Yi-Ming Chen;Chih-Lun Su
Affiliations:
Department of Information Management, National Central University, Jhongli, Taiwan, R.O.C.;Department of Information Management, National Central University, Jhongli, Taiwan, R.O.C.
Venue:
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
Year:
2007

Citing 4
Cited 0

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Integration of Pricing with Call Admission Control to Meet QoS Requirements in Cellular Networks

IEEE Transactions on Parallel and Distributed Systems
Call Admission Control for Multimedia Services in Mobile Cellular Networks: A Markov Decision Approach

ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
New Mobility Based Call Admission Control with On-Demand Borrowing Scheme for QOS Provisioning

ITCC '03 Proceedings of the International Conference on Information Technology: Computers and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

As the resources in a wireless network are limited and freely shared by all network users, Call Admission Control (CAC) plays a significant role in providing the Quality of Service (QoS) in wireless networks. However, when the network is congested with too many users, traditional CAC that mainly focuses on the tradeoff between new call blocking probability and handoff call dropping probability cannot guarantee QoS requirements to users. To address this issue, this paper proposes a dual level congestion control scheme which considers not only the call level admission control but also the user's decision to enter the network or not during the network traffic burst interval (we call it as user-level burst control). We adopt the economical terms of externality and introduce a total user utility function to formally model the user's perceived QoS metric. Our simulation shows that the weighted blocking probability (Pb) of our scheme can decreases 70-80% than traditional CAC systems and increase the total user utility to 2-3 times.