{"title":"Lifetime behavior and its impact on Web caching","authors":"Xiangping Chen, P. Mohapatra","doi":"10.1109/WIAPP.1999.788017","DOIUrl":"https://doi.org/10.1109/WIAPP.1999.788017","url":null,"abstract":"The exponential growth of the World Wide Web has made it the most popular information dissemination tool in the world. The growth necessitates caching, prefetching and replication schemes on the Web to alleviate the Web server load, conserve the network bandwidth and reduce the retrieval latency. At the same time, cache consistency should be maintained to avoid returning stale pages to users. The study on the characteristics of Web documents helps to determine which schemes should be adopted in a specific Web environment. This paper presents characterization of Web documents based on their types and environment classes. Nine Web server traces are used in this paper, and these represent three different classes of Web environments: educational, commercial and news. The results indicate significant differences in static as well as dynamic characteristics of documents types in different Web site classes. The efficiency of caching can be improved if caching priorities and TTL (time to live) preferences are given to certain types of Web documents. We also provide guidelines for the design and development of caching and prefetching techniques that can exploit the Web document characteristics in different environments.","PeriodicalId":199170,"journal":{"name":"Proceedings 1999 IEEE Workshop on Internet Applications (Cat. No.PR00197)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125320237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Stochastic voting protocol to protect voters privacy","authors":"H. Kikuchi, J. Akiyama, H. Gobioff, G. Nakamura","doi":"10.1109/WIAPP.1999.788027","DOIUrl":"https://doi.org/10.1109/WIAPP.1999.788027","url":null,"abstract":"The paper proposes a voting scheme that protects voters' privacy, even when the Central Tabulating Facility reveals individual responses. The basic idea is to add random noise to the true opinion by randomizing in a way such that the true vote is chosen with higher probability than the other alternatives. A major part of the paper is to outline the statistical properties of our proposed protocol. A commitment protocol is also proposed to cope with dishonest voters who do not randomize their votes. The primary result is that the accuracy of the voting result improves as the number of voters increases.","PeriodicalId":199170,"journal":{"name":"Proceedings 1999 IEEE Workshop on Internet Applications (Cat. No.PR00197)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128743222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The informed traveller: a case study in building Internet brokering services","authors":"D. Ingham, S. Caughey, P. Watson, S. Halsey","doi":"10.1109/WIAPP.1999.788016","DOIUrl":"https://doi.org/10.1109/WIAPP.1999.788016","url":null,"abstract":"In traditional commerce, brokers act as middlemen between customers and providers, aggregating, repackaging and adding value to products, services or information. In today's World Wide Web, such services are generally lacking, with the result that individuals are forced to manually discover, collate and analyse information to meet their needs. This paper begins by presenting the design and implementation of a travel-planning brokering system which provides a combined travel timetable service using information gleaned from existing Web services. The aim of this prototype was to gain experience as to the needs of Internet brokering systems in general. The lessons learned from the exercise have led to the design of a generic brokering framework, known as Metabroker. The framework provides commonly required functionality and support for popular communication protocols and data formats. Specialist brokers are then created by populating the base framework with the necessary business logic, in the form of workflows, to support the area of speciality of the broker. Our design integrates distributed object, metadata, workflow and object database technologies.","PeriodicalId":199170,"journal":{"name":"Proceedings 1999 IEEE Workshop on Internet Applications (Cat. No.PR00197)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132929255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"End-to-end management of mixed applications across networks","authors":"N. Davies, J. Holyer, P. Thompson","doi":"10.1109/WIAPP.1999.788012","DOIUrl":"https://doi.org/10.1109/WIAPP.1999.788012","url":null,"abstract":"Different applications travelling across networks have different requirements for loss and delay. In some applications, all the traffic arrives very quickly and with very little loss. There are other applications, e.g. file transfers, where traffic must arrive but the arrival time is not very important. For other (especially, real-time) applications, it may be critical that traffic is not delayed more than some small amount, but loss rates may not be so critical. This paper looks at networks that are operating at, or close to, their full capacity. In such a system, performance deteriorates for all traffic, unless the traffic is treated differentially. Traffic is separated into different classes according to loss and delay requirements, using the fact that the system inherently has two degrees of freedom. Different classes of traffic are transmitted in such a way that the classes with the most stringent loss and delay requirements are not adversely affected by other traffic, even when the system is in overload. This enables us to provide a guaranteed quality of service with strong statistical guarantees.","PeriodicalId":199170,"journal":{"name":"Proceedings 1999 IEEE Workshop on Internet Applications (Cat. No.PR00197)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133252036","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Implementing high availability CORBA applications with Java","authors":"M. Little, S. Shrivastava","doi":"10.1109/WIAPP.1999.788028","DOIUrl":"https://doi.org/10.1109/WIAPP.1999.788028","url":null,"abstract":"The integration of Java and CORBA has opened the way for a wide variety of Internet applications. However, such applications will frequently come across communication and node failures which can affect both their performance and consistency. Therefore, there is a need for techniques which will allow applications to tolerate such failures and continue to provide expected services. A common technique is through the use of atomic transactions, which ensure that only consistent state changes take place despite concurrent access and failures. However, they may be insufficient to guarantee forward progress. This can be accomplished by replicating resources, so that the failure of a subset of replicas can be masked from users. The paper describes a toolkit that integrates transactions and replication by making use of standard CORBA services.","PeriodicalId":199170,"journal":{"name":"Proceedings 1999 IEEE Workshop on Internet Applications (Cat. No.PR00197)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115096882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Web caching framework: analytical models and beyond","authors":"J. Zhang, R. Izmailov, D. Reininger, M. Ott","doi":"10.1109/WIAPP.1999.788030","DOIUrl":"https://doi.org/10.1109/WIAPP.1999.788030","url":null,"abstract":"Many Web caching algorithms have been proposed in recent years. However the lack of analytical support and systematic evaluation environment significantly affect the applicability of these algorithms. We introduce a framework within which Web caching algorithms can be consistently analyzed and empirically examined. The framework consists of two complementary parts. The statistical model and the simulation environment. The analytical model covers both the Web trace characteristics and the caching algorithm behaviors. The simulation system, referred to as WebCASE (Web Caching Algorithm Simulation Environment), consists of an extensible simulation core and a front end graphical interface showing the running algorithm behaviors. By using this framework, we are able to better understand the performance discrepancies exhibited by different algorithms and develop more efficient new algorithms. These new algorithms take into consideration practical issues and make noticeable performance improvements over existing algorithms.","PeriodicalId":199170,"journal":{"name":"Proceedings 1999 IEEE Workshop on Internet Applications (Cat. No.PR00197)","volume":"1455 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113994987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Information Discovery Graph: towards a scalable multimedia resource directory","authors":"Nathan R Sturtevant, N. Tang, Lixia Zhang","doi":"10.1109/WIAPP.1999.788021","DOIUrl":"https://doi.org/10.1109/WIAPP.1999.788021","url":null,"abstract":"Presents the design, rationale and basic mechanisms of the Information Discovery Graph (IDG), a scalable multimedia resource directory. Facing the fundamental challenge of scaling with both large amounts of resources and large numbers of users, the IDG is made up of a self-organizing hierarchy of information managers, each maintaining resource information for specific topics or areas. Multimedia data sources register themselves with the IDG system and keep the information up to date. Preliminary simulation results demonstrate the approach's promise. A number of open research issues are also addressed.","PeriodicalId":199170,"journal":{"name":"Proceedings 1999 IEEE Workshop on Internet Applications (Cat. No.PR00197)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132860634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Coordinated placement and replacement for large-scale distributed caches","authors":"M. Korupolu, M. Dahlin","doi":"10.1109/WIAPP.1999.788018","DOIUrl":"https://doi.org/10.1109/WIAPP.1999.788018","url":null,"abstract":"In a large-scale information system such as a digital library or the World Wide Web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions. Using simulation, we examine three practical cooperative placement algorithms, including one that is provably close to optimal, and we compare these algorithms to the optimal placement algorithm and several cooperative and non-cooperative replacement algorithms. We draw five conclusions from these experiments: (1) cooperative placement can significantly improve performance compared to local replacement algorithms, particularly when the size of individual caches is limited compared to the universe of objects; (2) although the Amortized Placement algorithm is only guaranteed to be within 14 times the optimal, in practice it seems to provide an excellent approximation of the optimal; (3) in a cooperative caching scenario, the GreedyDual local replacement algorithm performs much better than the other local replacement algorithms; (4) our Hierarchical GreedyDual replacement algorithm yields further improvements over the GreedyDual algorithm, especially when there are idle caches in the system; and (5) a key challenge to coordinated placement algorithms is generating good predictions of access patterns based on past accesses.","PeriodicalId":199170,"journal":{"name":"Proceedings 1999 IEEE Workshop on Internet Applications (Cat. No.PR00197)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133592037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Specification of order and reliability in SMIL documents","authors":"M. J. Urbano, A.J. Mendes, E.H. Monteiro, P. Amer","doi":"10.1109/WIAPP.1999.788023","DOIUrl":"https://doi.org/10.1109/WIAPP.1999.788023","url":null,"abstract":"Investigates the concepts of order and reliability in multimedia presentations. This paper starts by briefly presenting REMDOR (REmote Multimedia DOcuments Retrieval), an architecture for multimedia communication based on the concepts of partial order and partial reliability at the transport level. The paper then refers to SMIL (Synchronized Multimedia Integration Language), a recent W3C (World Wide Web Consortium) standard for multimedia documents, and looks at how the order and reliability concepts of REMDOR can be expressed within SMIL. More specifically, it shows some differences existing between the SMIL and REMDOR temporal models, and shows the limitations of the current SMIL specification in accomplishing the transport layer concepts mentioned above. Suggested extensions of SMIL to handle these differences and limitations are given.","PeriodicalId":199170,"journal":{"name":"Proceedings 1999 IEEE Workshop on Internet Applications (Cat. No.PR00197)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121382733","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A shopping assistant agent for Web-shops","authors":"M. Sakaguchi, A. Sugiura, T. Kamba","doi":"10.1109/WIAPP.1999.788014","DOIUrl":"https://doi.org/10.1109/WIAPP.1999.788014","url":null,"abstract":"One of the most important problems of online shops on the World Wide Web is that a site visitor finds it difficult to choose an item to buy unless he or she has sufficient knowledge of that item. In this paper, the authors describe an intelligent software agent that works as a shopping assistant. The agent has knowledge about the merchandise and helps visitors to the shop choose items. The interaction with this agent has three features: (1) two interaction channels (selection and conversation); (2) flexible topic change (the user can trigger a new conversation flow even in the middle of a conversation); and (3) personalized interaction (the interaction is personalized according to user behavior). This agent has been applied to our Web site to help potential buyers of built-to-order (BTO) PCs. Implementation details and user behavior on the above site are described.","PeriodicalId":199170,"journal":{"name":"Proceedings 1999 IEEE Workshop on Internet Applications (Cat. No.PR00197)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127448036","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}