A New Hybrid Scheduling Framework for Asymmetric Wireless Environments with Request Repetition

Abstract— The ever-increasing popularity of web services, growing demand for wireless multimedia and introduction of new, feature-enhanced, hand-held devices has already given birth to a new set of data-centric applications. Providing such applications with enhanced data processing capability calls for an efficient scheduling and transmission technique. The goal of most scheduling strategy lies in reducing the average waiting time. However, in most practical systems the variation of waiting time often results in client’s impatience, thus provoking the clients to send repeated requests for the particular data item(s). In this paper we have developed a new hybrid scheduling framework for heterogeneous, asymmetric environments, by exploring the advantages of broadcasting very popular (push) data and dissemination of less popular (pull) data. The data access probabilities and the cut-off point used to segregate push and pull sets are dynamically computed. Packet Fair Scheduling (PFS) ...

• Type: Conference
• Year: 2005
• Where: WIOPT
• Authors: Navrati Saxena, Maria Cristina Pinotti, Kalyan Basu, Sajal K. Das
• Keywords: Cut-off Point, Expected Access Time, Overall Expected Access, WIOPT 2005