Title

Non-Real-Time Content Scheduling Algorithms For Wireless Data Networks

Keywords

Deadline scheduling; Non-real-time traffic; Optimization; Service differentiation; Stretch

Abstract

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. © 2006 IEEE.

Publication Date

7-1-2006

Publication Title

IEEE Transactions on Computers

Volume

55

Issue

7

Number of Pages

893-905

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/TC.2006.106

Socpus ID

33744816531 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/33744816531

This document is currently not available here.

Share

COinS