Balancing competing resource allocation demands in a public cellular network that supports emergency services

Authors:
Jiazhen Zhou;Cory Beard
Affiliations:
Department of Systems and Computer Science, Howard University, Washington, DC;Department of Computer Science Electrical Engineering, University of Missouri - Kansas City, Kansas City, MO
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2010

Citing 9
Cited 0

Analysis of a cutoff priority cellular radio system with finite queueing and reneging/dropping

IEEE/ACM Transactions on Networking (TON)
Prioritized resource allocation for stressed networks

IEEE/ACM Transactions on Networking (TON)
Design and analysis of multi-level active queue management mechanisms for emergency traffic

Computer Communications
Preemptive and delay-based mechanisms to provide preference to emergency traffic

Computer Networks: The International Journal of Computer and Telecommunications Networking
Call admission control in wireless networks: a comprehensive survey

IEEE Communications Surveys & Tutorials
An adaptive bandwidth allocation scheme with preemptive priority for integrated voice/data mobile networks

IEEE Transactions on Wireless Communications
Capacity design and performance of call admission control in cellular CDMA systems

IEEE Journal on Selected Areas in Communications
Approximation models of wireless cellular networks using moment matching

IEEE Journal on Selected Areas in Communications
Dynamic priority queueing of handover calls in wireless networks: an analytical framework

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.07

Visualization

Abstract

When an emergency happens, public communication networks, including cellular networks, public switched telecommunication networks, and the Internet can be utilized to support emergency communications. The admission control strategies currently employed by the Wireless Priority Service (WPS), however, have drawbacks of being not able to address dynamic traffic demands for different scenarios and locations. They assume a standard profile for emergency and public demand at all locations. In contrast, this paper presents an analytical modeling framework that creates flexible, adaptive algorithms for operators to easily use based on the specifics of each scenario. Numerical results show that this provides an obvious improvement over the existing approaches. The analysis approach provided here, that incorporates the reneging behavior of customers waiting for service, also presents another main contribution compared with past work for computing the average waiting time.