Abstract
Making electronic newspapers available to users is an attractive business for newspaper editors. The production of electronic newspapers may a priori be realized at low cost using the editor’s news base, while enabling to attain a larger audience. However, the success of an electronic newspaper in a commercial setting depends upon the provided quality of service. The newspaper must guarantee to its users, both content quality in terms of reading comfort, and access quality in terms of response time. This paper presents the Etel electronic newspaper whose main design objective is to guarantee high quality of service to users. Content quality is achieved through the design and production of electronic editions in close collaboration with a newspaper editor. Access quality is realized through the design and implementation of a dedicated client-server distributed system. The proposed distributed system exploits the specifics of electronic newspapers. Precisely, most newspaper readers systematically consult the various editions of their usual newspaper in the same way (e.g. a reader may consult his newspaper by first reading local and then sport pages). In the context of an electronic newspaper, this means that we can safely assume the existence of user profiles in terms of access patterns to newspaper editions. This feature allows us to propose profile-based automatic prefetching and load balancing strategies, which together enable to offer a highly responsive and scalable distributed system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. ACM SIGMOD, 1993.
R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th International Conference on Very Large DataBases, 1994.
A. Bestavros. Speculative data dissemination and service to reduce server load, network trafic and service time for distributed information systems. In Proc. of the 1996 International Conference on Data Engineering, 1996.
S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. ACM SIGMOD, 1997.
P. Cao, E. W. Felten, A. Karlin, and K. Li. A study of integrated prefetching and caching strategies. In Proc. of the 1995 ACM SIGMETRICS Conference, 1995.
B. Charpiot. Rpartition thmatique des accs un systme d’informations distribues. PhD thesis, Universit de Rennes I, 1998.
S. Crowder. A simple method for studying run-length distributions exponentially weighted moving average charts. Journal of Quality Technology, 1987.
C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In ACM SIGMOD, 1994.
E.W. Forgy. Cluster analysis of multivariate data: Efficiency versus interpretability of classifications. Biometric Society Meetings Riverside, 1965.
J. Griffioen and R. Appleton. Reducing file system latency using a predictive approach. In Proc. of the 1994 Summer Usenix Technical Conference, 1994.
J. Griffioen and R. Appleton. The Design, Implementation and Evaluation of a Predictive Caching File System. Technical report, Department of Computer Science, University of Kentucky, Lexington, KY, 1996.
A. Guttman. R-trees: a dynamic index structure for spatial searching. In ACM SIGMOD, 1984.
M. Holsheimer, M. Kersten, H. Mannila, and H. Toivonen. A perspective on databases and data mining. In Proc. of the 1st International Conference on Knowledge Discovery and Data Mining, 1995.
L. Hubert. Monotone invariant clustering. Psychometrika, 38(1), 1973.
T. Kamba, K. Bharat, and M. C. Albers. The krakatoa chronicle: An interactive, personalized, newspaper on the web. In Proc. of the 4th International World Wide Web Conference, 1995.
T. Kimbrel, A. Tomkins, R. H. Patterson, B. Bershad, P. Cao, E. W. Felten, G. A. Gibson, A. R. Karlin, and K. Li. A trace-driven comparison of algorithms for parallel prefetching and caching. In Proc. of the 2nd Conference on Operating System Design and Implementation (OSDI), 1996.
T. M. Kroeger and D. E. Long. Predicting file system actions from prior events. In Proc. of the 1996 Winter Usenix Technical Conference, 1996.
L. Lebart, A. Morineau, and K. M. Warwick. Multivariate descriptive statistical analysis. Willey Series in probability and mathematical statistics, 1984.
H. Lei and D. Duchamp. An analytical approach to file prefetching. In Proceedings of the 1997 Winter Usenix Technical Conference, 1997.
F. Leleu. Techniques d’anticipation des accs un service d’informations distribues. Application un service de presse crite lectronique. PhD thesis, Universit de Rennes I, 1997.
M. Mehta, R. Agrawal, and J. Rissanen. Sliq: A fast scalable classifier for data mining. In 5th International Conference on Extending Database Technology, 1996.
J-M. Menaud. ParaComm: une bibliothèeque de communication d’anticipation des accès. In Actes de la 1 ère Conférence française sur les systèmes d’exploitationn (CFSE’1), 1999.
J-M. Menaud, V. Issarny, and M. Banâtre. A new protocol for efficient transversal web caching. In Proc. of DISC’98 (Formerly WDAG–) 12th International Symposium on Distributed Computing, 1998.
V. N. Padmanabhan and J. C. Mogul. Using predictive prefetching to improve World-Wide Web latency. SIGCOMM Newsletter, 1996.
R. H. Patterson, G. H. Gibson, E. Ginting, D. Stodolsky, and J. Zelenka. Informed prefetching and caching. In Proc. of the 15th ACM Symposium on Operating System Principles (SOSP), 1995.
J. Mac Queen. Some methods for classiffication and analysis of multivariate observations. In 5th Berkeley Symposium on Mathematical Statistics and Probability, 1967.
R. Srikant and R. Agrawal. Mining quantitative association rules in large relationnal tables. In ACM SIGMOD, 1996.
D. Steere and M. Satyanarayanan. Using dynamic sets to overcome high I/O latencies during search. In Proc. of the 5th Workshop on Hot Operating System Topics, 1995.
E. Yashchin. Some aspects of the theory of statistical control schemes. IBM Journal of Research and Development, 31, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Issarny, V., Banâtre, M., Charpiot, B., Menaud, JM. (2000). Quality of Service and Electronic Newspaper: The Etel Solution. In: Krakowiak, S., Shrivastava, S. (eds) Advances in Distributed Systems. Lecture Notes in Computer Science, vol 1752. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46475-1_20
Download citation
DOI: https://doi.org/10.1007/3-540-46475-1_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67196-1
Online ISBN: 978-3-540-46475-4
eBook Packages: Springer Book Archive