ACM Home Page
Please provide us with feedback. Feedback
Scalable dissemination: what's hot and what's not
Full text PdfPdf (315 KB)
Source WebDB; Vol. 67 archive
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004 table of contents
Paris, France
SESSION: Paper session 3: data dissemination table of contents
Pages: 31 - 36  
Year of Publication: 2004
Authors
Jonathan Beaver  University of Pittsburgh, Pittsburgh, PA
Nicholas Morsillo  University of Pittsburgh, Pittsburgh, PA
Kirk Pruhs  University of Pittsburgh, Pittsburgh, PA
Panos K. Chrysanthis  University of Pittsburgh, Pittsburgh, PA
Vincenzo Liberatore  Case Western Reserve University, Cleveland, Ohio
Sponsor
: INRIA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 11,   Citation Count: 2
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1017074.1017084
What is a DOI?

ABSTRACT

A major problem in web database applications and on the Internet in general is the scalable delivery of data. One proposed solution for this problem is a hybrid system that uses multicast push to scalably deliver the most popular data, and reserves traditional unicast pull for delivery of less popular data. However, such a hybrid scheme introduces a variety of data management problems at the 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 band-width 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
K. C. Almeroth, M. H. Ammar, and Z. Fei. Scalable delivery of Web pp. using cyclic best-effort (UDP) multicast. In INFOCOM, pp. 1214--1221, 1998.
4
5
 
6
 
7
P. Chrysanthis, K. Pruhs, and V. Liberatore. Middleware support for multicast-based data dissemination: a working reality. In WORDS, 2003.
 
8
9
10
11
12
13
 
14
A. Hall and H. Taubig. Comparing push- and pull-based broadcasting or: Would "microsoft watches" profit from a transmitter? LCNS, 2647, January 2003.
 
15
J. Jannotti, D. Gifford, K. Johnson, M. Kaashoek, and J. O'Toole, Jr. Overcast: Reliable multicasting with an overlay network. In OSDI, pp. 197--212, 2000.
16
17
 
18
A. Labrinidis and N. Roussopoulos. Webview balancing performance and data freshness in web database servers. In VLDB, pp. 393--404, 2003.
19
 
20
21
 
22
V. S. Pai, L. Wang, K. Park, R. Pang, and L. Peterson. The dark side of the Web: An open proxy's view. In HotNets-II, 2004.
 
23
V. Penkrot, J. Beaver, M. Sharaf, S. Roychowdhury, W. Li, W. Zhang, P. Chrysanthis, K. Pruhs, and V. Liberatore. An optimized multicast-based data dissemination middleware: A demonstration. In ICDE 2003, pp. 761--764, 2003.
 
24
P. Rosenzweig, M. Kadansky, and S. Hanna. The java reliable multicast service: A reliable multicast library. SMLI TR-98-68, Sun Microsystems, 1998.
 
25
 
26
 
27
W. Zhang, W. Li, and V. Liberatore. Application-perceived multicast push performance. In IPDPS, 2004.

Collaborative Colleagues:
Jonathan Beaver: colleagues
Nicholas Morsillo: colleagues
Kirk Pruhs: colleagues
Panos K. Chrysanthis: colleagues
Vincenzo Liberatore: colleagues