Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Downlink scheduling in CDMA data networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Parallel scheduling problems in next generation wireless networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
A Markov-based channel model algorithm for wireless networks
Wireless Networks
Content Distribution Networks: An Engineering Approach
Content Distribution Networks: An Engineering Approach
Scheduling to Minimize Average Stretch
Scheduling to Minimize Average Stretch
User satisfaction based scheduling algorithm for high-speed wireless networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Dual-threshold admission control for non-real-time traffic in wireless data networks
Computer Communications
ISWCS'09 Proceedings of the 6th international conference on Symposium on Wireless Communication Systems
| Hi-index | 14.98 |
A substantial portion of the emerging wireless data service consists of non-real-time applications such as content download. The existing mechanisms based on per-packet performance guarantees used mainly for voice and streaming media do not suffice for the elastic nature of non-real-time traffic. For a non-real-time user data services, the key performance measure of interest is the total download time. In this paper, we propose a novel scheduling framework for wireless content service. Specifically, we present a two-layer scheduling architecture that combines content-aware scheduling with opportunistic scheduling. In terms of content-awareness, the proposed scheduling policy provides guarantees on the download time of content. In the second stage, the instantaneous channel conditions of different users are exploited in an opportunistic manner so as to maximize the throughput of the system. We define service differentiation in two modes—differential and guaranteed—and provide polynomial time algorithms for both that manipulate the stretch ratio but within allowable limits. Extensive simulations are conducted that verify the efficiency of the proposed schemes and provide insights into the behavior of the scheduling algorithms for non-real-time data.