• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 17,876
Next 10 →

Learning Web Request Patterns

by Brian D. Davison - Web Dynamics: Adapting to Change in Content, Size, Topology and Use , 2004
"... Summary. Most requests on the Web are made on behalf of human users, and like other human-computer interactions, the actions of the user can be characterized by identifiable regularities. Much of these patterns of activity, both within a user, and between users, can be identified and exploited by in ..."
Abstract - Cited by 11 (1 self) - Add to MetaCart
Summary. Most requests on the Web are made on behalf of human users, and like other human-computer interactions, the actions of the user can be characterized by identifiable regularities. Much of these patterns of activity, both within a user, and between users, can be identified and exploited

Classification Pruning for Web-request Prediction

by Ian Tianyi Li, Qiang Yang, Ke Wang - In Poster Proceedings of the 10th World Wide Web Conference (WWW10), Hong Kong , 2001
"... N-gram and repeating pattern based prediction rules have been used for next-web request prediction. However, there is no rigorous study of how to select the best rule for a given observation. The longer patter may not be the best pattern, because such patters are also more rare. In this paper, we pr ..."
Abstract - Cited by 11 (2 self) - Add to MetaCart
N-gram and repeating pattern based prediction rules have been used for next-web request prediction. However, there is no rigorous study of how to select the best rule for a given observation. The longer patter may not be the best pattern, because such patters are also more rare. In this paper, we

Scheduling Web Requests in Broadcast Environments

by Jianliang Xu Hong, Wang-chien Lee , 2004
"... On-demand broadcast has been supported in the Internet to enhance system scalability. Unfortunately, most of existing on-demand scheduling algorithms did not consider the time constraints associated with web requests. This paper proposes a novel scheduling algorithm, called Slack Inverse Number of ..."
Abstract - Add to MetaCart
On-demand broadcast has been supported in the Internet to enhance system scalability. Unfortunately, most of existing on-demand scheduling algorithms did not consider the time constraints associated with web requests. This paper proposes a novel scheduling algorithm, called Slack Inverse Number

A Feedback Real-time Web Request Controller

by unknown authors
"... We propose a feedback controller to efficiently control web requests with real-time characteristics, especially on overloaded networks. The controller is designed based on a feedback closed loop that prevents overload of web server and enforces target CPU utilization via controlling the amount of in ..."
Abstract - Add to MetaCart
We propose a feedback controller to efficiently control web requests with real-time characteristics, especially on overloaded networks. The controller is designed based on a feedback closed loop that prevents overload of web server and enforces target CPU utilization via controlling the amount

Web Caching and Zipf-like Distributions: Evidence and Implications

by Lee Breslau, Pei Cao, Li Fan, Graham Phillips, Scott Shenker - IN INFOCOM , 1999
"... This paper addresses two unresolved issues about web caching. The first issue is whether web requests from a fixed user community are distributed according to Zipf's law [22]. Several early studies have supported this claim [9], [5], while other recent studies have suggested otherwise [16], [2] ..."
Abstract - Cited by 1091 (2 self) - Add to MetaCart
This paper addresses two unresolved issues about web caching. The first issue is whether web requests from a fixed user community are distributed according to Zipf's law [22]. Several early studies have supported this claim [9], [5], while other recent studies have suggested otherwise [16], [2

Dealing with Memory-Intensive Web Requests

by Thiemo Voigt, Per Gunningberg , 2001
"... Web servers must be protected from overload since server overload can lead to low throughput and high, unpredictable response times. In this paper we present a new admission control architecture that prevents server overload caused by high paging rates. The main idea of our admission control scheme ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Web servers must be protected from overload since server overload can lead to low throughput and high, unpredictable response times. In this paper we present a new admission control architecture that prevents server overload caused by high paging rates. The main idea of our admission control

Crowds: Anonymity for Web Transactions

by Michael K. Reiter, Aviel D. Rubin - ACM Transactions on Information and System Security , 1997
"... this paper we introduce a system called Crowds for protecting users' anonymity on the worldwide -web. Crowds, named for the notion of "blending into a crowd", operates by grouping users into a large and geographically diverse group (crowd) that collectively issues requests on behalf o ..."
Abstract - Cited by 838 (13 self) - Add to MetaCart
this paper we introduce a system called Crowds for protecting users' anonymity on the worldwide -web. Crowds, named for the notion of "blending into a crowd", operates by grouping users into a large and geographically diverse group (crowd) that collectively issues requests on behalf

Semantic matching of web services capabilities

by Massimo Paolucci, Takahiro Kawamura, Terry R. Payne, Katia Sycara , 2002
"... Abstract. The Web is moving from being a collection of pages toward a collection of services that interoperate through the Internet. The first step toward this interoperation is the location of other services that can help toward the solution of a problem. In this paper we claim that location of web ..."
Abstract - Cited by 581 (24 self) - Add to MetaCart
propose a solution based on DAML-S, a DAML-based language for service description, and we show how service capabilities are presented in the Profile section of a DAML-S description and how a semantic match between advertisements and requests is performed. 1 Introduction Web services provide a new model

Generating Representative Web Workloads for Network and Server Performance Evaluation

by Paul Barford, Mark Crovella , 1997
"... One role for workload generation is as a means for understanding how servers and networks respond to variation in load. This enables management and capacity planning based on current and projected usage. This paper applies a number of observations of Web server usage to create a realistic Web worklo ..."
Abstract - Cited by 944 (11 self) - Add to MetaCart
One role for workload generation is as a means for understanding how servers and networks respond to variation in load. This enables management and capacity planning based on current and projected usage. This paper applies a number of observations of Web server usage to create a realistic Web

Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes

by Mark E. Crovella, Azer Bestavros , 1996
"... Recently the notion of self-similarity has been shown to apply to wide-area and local-area network traffic. In this paper we examine the mechanisms that give rise to the self-similarity of network traffic. We present a hypothesized explanation for the possible self-similarity of traffic by using a p ..."
Abstract - Cited by 1416 (26 self) - Add to MetaCart
particular subset of wide area traffic: traffic due to the World Wide Web (WWW). Using an extensive set of traces of actual user executions of NCSA Mosaic, reflecting over half a million requests for WWW documents, we examine the dependence structure of WWW traffic. While our measurements are not conclusive
Next 10 →
Results 1 - 10 of 17,876
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University