Welcome to the ADMT Publication Server

To Broadcast Push or Not and What?

DocUID: 2006-019 Full Text: PDF

Author: Jonathan Beaver, Panos K. Chrysanthis, Kirk Pruhs

Abstract: A major problem in mobile web applications as well as the wireless Internet is the scalable delivery of data. The most popular solution for this problem is a hybrid system that uses broadcast push to scalably deliver the most popular data, and reserves broadcast pull for delivery of less popular data. Such a hybrid scheme introduces a variety of data management problems at the broadcast server. In this paper, we examine three of these problems: the push popularity problem, the document classification problem, and the bandwidth division problem. The push popularity problem is to estimate the popularity of the documents in the web site. The document classification problem is to determine which documents should be pushed and which documents must be pulled. The bandwidth division problem is to determine how much of the server bandwidth to devote to pushed documents and how much of the server bandwidth should be reserved for pulled documents. We propose simple and elegant solutions for these problems. We report on experiments with our system that validate our algorithms.

Published In: Proc. of the 7th Int'l Conference on Mobile Data Management

ISBN: 0-7695-2526-1

Pages: pp. 40-45

Place Published: Nara, Japan

Year Published: 2006

Note: DOI:10.1109/MDM.2006.152

Project: Others Subject Area: Mobile Databases, Data Dissemination

Publication Type: Conference Paper

Sponsor: NSF ITR ANI-0325353, NSF ANI-0123705

Citation:Text Latex BibTex XML Jonathan Beaver, Panos K. Chrysanthis, and Kirk Pruhs. To Broadcast Push or Not and What?, Proc. of the 7th Int'l Conference on Mobile Data Management (MDM'06), pp. 40-45, 0-7695-2526-1 , Nara, Japan, May 2006.(DOI:10.1109/MDM.2006.152 )