skip to main content
10.1145/1066677.1067061acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

Combining queueing networks and web usage mining techniques for web performance analysis

Published:13 March 2005Publication History

ABSTRACT

The growing interest in Web applications that satisfy end-to-end Quality of Service (QoS) requirements is leading many organizations to build and analyze performance behavior models. In this direction, Web usage mining techniques may help in the automatic construction of user profiles from Web access logs. However, their use has been mainly limited to customer relationship management (CRM) issues and to market analyses. The aim of this paper is to explain how Web usage mining can be combined with queueing networks for effective Web capacity planning. After introducing a new general relative cosine similarity measure, we define a performance-oriented similarity for Web usage data. A methodology to devise the input parameters of a queueing network from the resulting clusters is also presented. Finally, the proposed approach is illustrated on a simple case study.

References

  1. R. Agrawal, R. Srikant. Fast Algorithms for Mining Association Rules. Proc. 20th Int. Conf. Very Large D. Bases (VLDB), 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Arlitt, T. Jin. A Workload Characterization Study of the 1998 World Cup Web Site. HP Tech. Rep. HPL-1999-35(R.1), 1999.]]Google ScholarGoogle Scholar
  3. K. Benabdeslem, Y. Bennani, and E. Janvier. Connectionist Approach for Website Visitors Behaviors Mining. Proc. of the ACS/IEEE Int. Conf. on Comp. Sys. and App. (AICCSA '01), 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. B. Berendt, B. Mobasher, M. Spiliopoulou, and J. Wiltshire. Measuring the Accuracy of Sessionizers for Web Usage Analysis. Proc. of the 1st SIAM Int. Conf. on Data Mining, 2001.]]Google ScholarGoogle Scholar
  5. G. Casale, G. Serazzi. Bottlenecks Identification in Multiclass Queueing Networks using Convex Polytopes. In Proc. 12th IEEE / ACM Int. Symp. on Model., Anal., and Simul. of Comp. and Tlc. Sys. (MASCOTS 2004), pp:223--230, IEEE Press.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. R. Cooley, B. Mobasher, and J. Srivastava. Data Preparation for Mining World Wide Web Browsing Patterns. J. of Knowledge and Inf. Sys., 1(1), 5--32.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. V. Estivill-Castro, J. Yang Categorizing Visitors Dynamically by Fast and Robust Clustering of Access Logs. LCNS 2198, pp. 498+, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Joshi, R. Krishnapuram. Robust Fuzzy Clustering Methods to Support Web Mining. In Proc. W.shop in Data Mining and Know. Discovery, 15-1--15-8, 1998.]]Google ScholarGoogle Scholar
  9. G. Karypis, E. S. Han, and V. Kumar CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling. IEEE Computer, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. B. Mobasher, H. Dai, T. Luo, Y. Sun, and J. Zhu. Integrating Web usage and content mining for more effective personalization. In Proc. 1st Int. Conf. on E. Commerce and Web Tech., 165 - 176, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. Rabinovich, O. Spatscheck. Web Caching and Replication. Addison Wesley, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. E. D., Lazowska, J., Zahorjan, G. S., Graham, K. C., Sevcik, Quantitative System Performance: Computer System Analysis Using Queueing Network Models. Prentice-Hall, 1984.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. J. Srivastava, R. Cooley, M. Desdhpande, and P. Tan. Web usage mining: Discovery and applications of usage patterns from web data. SIGKDD Explorations, 1(2), 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. O. R. Zaiane, M. Xin, J. Han. Discovering Web Access Patterns and Trends by Applying OLAP and Data Mining Techniques on Web Logs Proc. Advances in Digital Libraries Conf. (ADL98), pp.19--29, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Combining queueing networks and web usage mining techniques for web performance analysis

            Recommendations

            Reviews

            Amos O Olagunju

            Historical Web site access records are useful for predicting the behaviors of customers and system workload capacity. Constructing representative behavioral profiles of customers from historical Web access logs is not straightforward. Moreover, the reliability of data mining results is contingent on conformity between forecast models and the current behaviors of customers. Mapping profiles of customers to prediction models is crucial in strategic Web capacity planning. Clustering algorithms based on similarity indices for the automatic classification of documents and queries exist in the literature [1]. Casale proposes a novel relative cosine similarity measure for use in system workload performance characterization and Web usage mining algorithms. The newly developed measure produced consistent and reliable similarities for sessions in a synthetic Web data set. Although this relative cosine similarity might be incongruous for comparing heterogeneous system workloads with possibly unreliable data, the paper offers distinctive insights for incorporating Web usage analytical results into queueing network performance models. Online Computing Reviews Service

            Access critical reviews of Computing literature here

            Become a reviewer for Computing Reviews.

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              SAC '05: Proceedings of the 2005 ACM symposium on Applied computing
              March 2005
              1814 pages
              ISBN:1581139640
              DOI:10.1145/1066677

              Copyright © 2005 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 13 March 2005

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate1,650of6,669submissions,25%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader