发布求助
文献互助 智能选刊 最新文献

10th International Workshop on Web Content Caching and Distribution (WCW'05)最新文献

筛选
英文 中文
Optimizing network performance in replicated hosting 优化复制主机中的网络性能
10th International Workshop on Web Content Caching and Distribution (WCW'05) Pub Date : 2005-09-12 DOI: 10.1109/WCW.2005.15
Ningning Hu, O. Spatscheck, Jia Wang, P. Steenkiste
{"title":"Optimizing network performance in replicated hosting","authors":"Ningning Hu, O. Spatscheck, Jia Wang, P. Steenkiste","doi":"10.1109/WCW.2005.15","DOIUrl":"https://doi.org/10.1109/WCW.2005.15","url":null,"abstract":"Most important commercial Web sites maintain multiple replicas of their server infrastructure to increase both reliability and performance. In this paper, we study how many replicas should be used and where they should be placed in order to improve client network performance, including both the latency (e.g., round-trip time) between clients and the replicas, and the bandwidth performance between them. This study is based on a large scale measurement study from an 18-node infrastructure, which reveals for the first time the distribution of today's Internet end-user access bandwidth. For example, we find that 50% of end users have access bandwidth less than 4.2Mbps. Using a greedy algorithm, we show that the first five replicas dominate latency optimization in our measurement infrastructure, while the first two replicas dominate bandwidth optimization. We also found that geographic diversity does not help as much for bandwidth optimization as it does for latency. To determine the proper trade-off between latency and bandwidth, we use a simplified TCP model to show that, when content size is less than 10Kb, the deployment should focus on optimizing latency, while for content sizes larger than 1 Mb, the deployment should focus on optimizing bandwidth.","PeriodicalId":141241,"journal":{"name":"10th International Workshop on Web Content Caching and Distribution (WCW'05)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114304848","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}
引用次数: 9
A novel two tiered proxy caching scheme for video on demand applications 一种新颖的视频点播两层代理缓存方案
10th International Workshop on Web Content Caching and Distribution (WCW'05) Pub Date : 2005-09-12 DOI: 10.1109/WCW.2005.5
A. Nayyeri, M. Hashemi, N. Yazdani
{"title":"A novel two tiered proxy caching scheme for video on demand applications","authors":"A. Nayyeri, M. Hashemi, N. Yazdani","doi":"10.1109/WCW.2005.5","DOIUrl":"https://doi.org/10.1109/WCW.2005.5","url":null,"abstract":"Considering the constant increase of network traffic, and existing bandwidth limitations, caching Internet objects is an essential technique to improve the provided quality of service and to reduce the network load. Caching is particularly helpful for video objects due to their interactive nature, large size, long playback duration, real time constraints, and typically variable bit rate. Several caching schemes for video streams have been proposed in the literature. The performance of the existing methods generally degrades in applications like video on demand where random access is common. In this paper a new two tiered proxy caching scheme for random access applications has been proposed. The proposed design consists of two layers: the cache layer and the fetch layer. The cache layer divides the incoming video stream into small segments, and selects the segments that should be cached based on their current access probability and the utility they provide. The fetch layer organizes the outgoing requests according to the priority it assigns to them. Simulation results indicate that the proposed technique outperforms existing caching schemes when random access is significant. The provided utility is up to three times better than the existing solutions.","PeriodicalId":141241,"journal":{"name":"10th International Workshop on Web Content Caching and Distribution (WCW'05)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134496473","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}
引用次数: 0
Improving scalability of data-centric services using in-network traffic inspection 使用网络内流量检测提高以数据为中心的服务的可伸缩性
10th International Workshop on Web Content Caching and Distribution (WCW'05) Pub Date : 2005-09-12 DOI: 10.1109/WCW.2005.12
C. He, V. Karamcheti
{"title":"Improving scalability of data-centric services using in-network traffic inspection","authors":"C. He, V. Karamcheti","doi":"10.1109/WCW.2005.12","DOIUrl":"https://doi.org/10.1109/WCW.2005.12","url":null,"abstract":"A growing number of network services are being constructed using the XML Web services architecture. By design, client interactions with such services are governed by open protocols such as UDDI, WSDL, and SOAP that permit programmatic discovery and functionality invocation. Additionally, for a large number of currently deployed services, it is possible to interpret service requests as structured accesses against a (physical or virtual) database. These two trends suggest the possibility of building network intermediaries that can inspect traffic flowing between clients and services, infer models for service access patterns, and potentially improve service scalability by taking actions such as replication, request redirection, or admission control. This paper reports on our experience designing and implementing such a network intermediary architecture. Experiments on an emulated WAN using synthetic workloads show that our approach achieves significant performance improvements in client-perceived response time.","PeriodicalId":141241,"journal":{"name":"10th International Workshop on Web Content Caching and Distribution (WCW'05)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124862172","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}
引用次数: 1
Predictability of Web-server traffic congestion web服务器流量拥塞的可预测性
10th International Workshop on Web Content Caching and Distribution (WCW'05) Pub Date : 2005-09-12 DOI: 10.1109/WCW.2005.17
Y. Baryshnikov, E. Coffman, G. Pierre, D. Rubenstein, M. Squillante, T. Yimwadsana
{"title":"Predictability of Web-server traffic congestion","authors":"Y. Baryshnikov, E. Coffman, G. Pierre, D. Rubenstein, M. Squillante, T. Yimwadsana","doi":"10.1109/WCW.2005.17","DOIUrl":"https://doi.org/10.1109/WCW.2005.17","url":null,"abstract":"Large swings in the demand for content are commonplace within the Internet. When a traffic hotspot happens, however, there is a delay before measures such as heavy replication of content can be applied. This paper investigates the potential for predicting hotspots sufficiently far, albeit shortly, in advance, so that preventive action can be taken before the hotpot takes place. Performing accurate load predictions appears to be a daunting challenge at first glance, but this paper shows that, when applied to Web-server page-request traffic, even elementary prediction techniques can have a surprising forecasting power. We first argue this predictability from principles, and then confirm it by the analysis of empirical data, which reveals that large server overloads can often be seen well in advance. This allows steps to be taken to reduce substantially the degradation of service quality.","PeriodicalId":141241,"journal":{"name":"10th International Workshop on Web Content Caching and Distribution (WCW'05)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127326535","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}
引用次数: 64
A two-level semantic caching scheme for super-peer networks 一种用于超级对等网络的两级语义缓存方案
10th International Workshop on Web Content Caching and Distribution (WCW'05) Pub Date : 2005-09-12 DOI: 10.1109/WCW.2005.6
P. Garbacki, D. Epema, Steen van
{"title":"A two-level semantic caching scheme for super-peer networks","authors":"P. Garbacki, D. Epema, Steen van","doi":"10.1109/WCW.2005.6","DOIUrl":"https://doi.org/10.1109/WCW.2005.6","url":null,"abstract":"Recent measurement studies of file-sharing peer-to-peer networks have demonstrated the presence of semantic proximity between peers and between shared files. In this paper we tackle the problem of exploiting the semantic locality of peer requests to improve the performance of a P2P network by the use of semantic caches. Such caches group together peers with similar interests as well as files with similar request patterns. The resulting two-level caching infrastructure can be integrated in a very natural way with the super-peer concept. The super-peers in our system cache pointers to files recently requested by their client peers. The client peers, on the other hand, keep caches of super-peers that answered most of their requests in the past. As a consequence, peers with similar interests are grouped (clustered) under the same super-peers, and also files with similar request patterns are indexed by the same super-peers. We discuss the design choices and optimizations of the presented model. We also evaluate our system versus the network that uses only one level of semantic caches.","PeriodicalId":141241,"journal":{"name":"10th International Workshop on Web Content Caching and Distribution (WCW'05)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123022845","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}
引用次数: 26
XTreeNet: scalable overlay networks for XML content dissemination and querying (synopsis) XTreeNet:用于XML内容传播和查询的可扩展覆盖网络(概要)
10th International Workshop on Web Content Caching and Distribution (WCW'05) Pub Date : 2005-09-12 DOI: 10.1109/WCW.2005.23
W. Fenner, M. Rabinovich, K. Ramakrishnan, D. Srivastava, Yin Zhang
{"title":"XTreeNet: scalable overlay networks for XML content dissemination and querying (synopsis)","authors":"W. Fenner, M. Rabinovich, K. Ramakrishnan, D. Srivastava, Yin Zhang","doi":"10.1109/WCW.2005.23","DOIUrl":"https://doi.org/10.1109/WCW.2005.23","url":null,"abstract":"XML is becoming a ubiquitous format for information exchange on the Internet. To alleviate the problems of \"whom to ask\" and \"whom to tell\" when connecting XML information producers with consumers over the network, content-based querying and dissemination of information have been investigated in the literature. Our XTreeNet project unifies the publish/subscribe and query/response models with a single common XML aware overlay network for XML-based information producers and consumers. This integrated framework lends itself to a variety of applications.","PeriodicalId":141241,"journal":{"name":"10th International Workshop on Web Content Caching and Distribution (WCW'05)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123364302","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}
引用次数: 45
Impacts of the startup behavior of multilayered multicast congestion control protocols on the performance of content delivery protocols 多层组播拥塞控制协议的启动行为对内容分发协议性能的影响
10th International Workshop on Web Content Caching and Distribution (WCW'05) Pub Date : 2005-09-12 DOI: 10.1109/WCW.2005.11
Christoph Neumann, Vincent Roca
{"title":"Impacts of the startup behavior of multilayered multicast congestion control protocols on the performance of content delivery protocols","authors":"Christoph Neumann, Vincent Roca","doi":"10.1109/WCW.2005.11","DOIUrl":"https://doi.org/10.1109/WCW.2005.11","url":null,"abstract":"The FLUTE file delivery application (RFC 3926) and the underlying massively scalable reliable multicast protocol, ALC (RFC 3450), are used for the scalable distribution of contents in a broadcasting system having no feedback channel. When used in a routed network (like the Internet), a layered congestion control protocol is required. This paper analyzes the impacts of the startup behavior of several such protocols on the performance of multicast content delivery protocols through mathematical models. Our results show: (1) that these congestion control protocols have a major impact on the download time; and (2) that the three protocols considered in this study yield significant differences.","PeriodicalId":141241,"journal":{"name":"10th International Workshop on Web Content Caching and Distribution (WCW'05)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125011272","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}
引用次数: 6
Utilizing layered multicast for Web caching 利用分层多播进行Web缓存
10th International Workshop on Web Content Caching and Distribution (WCW'05) Pub Date : 2005-09-12 DOI: 10.1109/WCW.2005.22
J. Schmidbauer, L. Linder
{"title":"Utilizing layered multicast for Web caching","authors":"J. Schmidbauer, L. Linder","doi":"10.1109/WCW.2005.22","DOIUrl":"https://doi.org/10.1109/WCW.2005.22","url":null,"abstract":"Wireless broadcast networks are currently widely deployed to connect users to their Internet providers, but only point-to-point services are typically used over these networks. Multicast Web caching is a readily-available technique embracing the broadcast capabilities of wireless links and benefiting from them. However, certain trade-offs of full multicast Web caching must be taken into consideration, such as an increased amount of data traffic, which must be processed by each client node. This paper analyzes the efficiency of different variations of multicast Web caching and compares them with common hierarchical Web caching. Furthermore, we present a new layered multicast Web caching scheme that allows for significant reductions of the required processing and storage capacity, while introducing only a small inefficiency compared to full multicast Web caching. The overall efficiency of this new approach is validated using trace-based simulation.","PeriodicalId":141241,"journal":{"name":"10th International Workshop on Web Content Caching and Distribution (WCW'05)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131369088","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}
引用次数: 1
Stochastic fluid model for P2P caching evaluation P2P缓存评价的随机流体模型
10th International Workshop on Web Content Caching and Distribution (WCW'05) Pub Date : 2005-09-12 DOI: 10.1109/WCW.2005.19
Florence Clévenot-Perronnin, Philippe Nain
{"title":"Stochastic fluid model for P2P caching evaluation","authors":"Florence Clévenot-Perronnin, Philippe Nain","doi":"10.1109/WCW.2005.19","DOIUrl":"https://doi.org/10.1109/WCW.2005.19","url":null,"abstract":"In this paper we propose a stochastic fluid model to analyze the performance of Squirrel, a P2P cooperative Web cache. This work provides a scalable and insightful extension of our previous analysis of Squirrel. This new model provides a closed-form expression for the hit probability when documents are equally popular. Realistic object popularity is also addressed through a clustering approximation. The accuracy of this model is validated by a comparison with discrete-event simulations. Our model allows us to study the impact of various parameters on the performance of the Squirrel system. In particular, we emphasize the importance of taking object popularity into account. We also investigate the impact of clients announcing their departure on the resulting hit probability.","PeriodicalId":141241,"journal":{"name":"10th International Workshop on Web Content Caching and Distribution (WCW'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129706046","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}
引用次数: 15
Flexible media reflection for collaborative streaming scenarios 用于协作流场景的灵活媒体反射
10th International Workshop on Web Content Caching and Distribution (WCW'05) Pub Date : 2005-09-12 DOI: 10.1109/WCW.2005.10
V. Kahmann, J. Brandt, L. Wolf
{"title":"Flexible media reflection for collaborative streaming scenarios","authors":"V. Kahmann, J. Brandt, L. Wolf","doi":"10.1109/WCW.2005.10","DOIUrl":"https://doi.org/10.1109/WCW.2005.10","url":null,"abstract":"In scenarios where recorded presentations are streamed to a group of clients, users prefer to control streaming on demand and to get content in an individually adapted fashion. IP multicast, the obvious solution for group streaming, cannot provide such a level of flexibility. End-system multicast approaches alleviate the need for multicast routing, but require more powerful clients and are more complex regarding to reconfiguration and inter-client synchronization. The dynamic reflector we propose supports the latter issues by grouping clients with the same play-time position into one reflector session. Individual play-time position changes can be performed by opening new so-called reflector sessions or dynamically switching between them. We provide measurements to show that the latency introduced by the use of a dynamic reflector is low compared to other solutions. Furthermore, we provide scalability enhancements in terms of more efficient network resource usage and delay reduction.","PeriodicalId":141241,"journal":{"name":"10th International Workshop on Web Content Caching and Distribution (WCW'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133938171","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}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信