TY - GEN
T1 - Opportunistic traffic scheduling in cellular data networks
AU - Paul, Utpal
AU - Buddhikot, Milind Madhav
AU - Das, Samir R.
PY - 2012
Y1 - 2012
N2 - Cellular data networks are experiencing a serious capacity crunch in the face of exponential increase in mobile data traffic volume. New traffic management techniques are needed to improve network and user perceived performance. In this work, we consider the existence of a higher-layer, agent-based scheduling system that could potentially delay scheduling of low priority flows at peak loads. The priorities are assumed to be user or application tagged, either automatically or manually. The general goal is to potentially move the low priority flows in time and space opportunistically to reduce the overall resource needs. We develop and evaluate two scheduling schemes-one based on a straightforward greedy method that requires real-time load monitoring and the other based on model-based estimation of traffic loads and subscriber mobility based on historical data. Simulation results using a large-scale cellular network trace data collected inside a nationwide network show the potential of these approaches in reducing base station resource requirements. This indirectly demonstrates that if providers can incentivize subscribers to tag certain flows as low priority, they can potentially accommodate a significant number of additional subscribers in the same network without expending any additional resource.
AB - Cellular data networks are experiencing a serious capacity crunch in the face of exponential increase in mobile data traffic volume. New traffic management techniques are needed to improve network and user perceived performance. In this work, we consider the existence of a higher-layer, agent-based scheduling system that could potentially delay scheduling of low priority flows at peak loads. The priorities are assumed to be user or application tagged, either automatically or manually. The general goal is to potentially move the low priority flows in time and space opportunistically to reduce the overall resource needs. We develop and evaluate two scheduling schemes-one based on a straightforward greedy method that requires real-time load monitoring and the other based on model-based estimation of traffic loads and subscriber mobility based on historical data. Simulation results using a large-scale cellular network trace data collected inside a nationwide network show the potential of these approaches in reducing base station resource requirements. This indirectly demonstrates that if providers can incentivize subscribers to tag certain flows as low priority, they can potentially accommodate a significant number of additional subscribers in the same network without expending any additional resource.
UR - https://www.scopus.com/pages/publications/84876062856
U2 - 10.1109/DYSPAN.2012.6478157
DO - 10.1109/DYSPAN.2012.6478157
M3 - Conference contribution
AN - SCOPUS:84876062856
SN - 9781467344487
T3 - 2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012
SP - 339
EP - 348
BT - 2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012
T2 - 2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012
Y2 - 16 October 2012 through 19 October 2012
ER -