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

筛选
英文 中文
Understanding the impact of diverse streaming workloads on end-user quality of service 了解不同流工作负载对最终用户服务质量的影响
M. Spasojevic, N. Bhatti, S. Roy, L. Kontothanassis
{"title":"Understanding the impact of diverse streaming workloads on end-user quality of service","authors":"M. Spasojevic, N. Bhatti, S. Roy, L. Kontothanassis","doi":"10.1109/WCW.2005.21","DOIUrl":"https://doi.org/10.1109/WCW.2005.21","url":null,"abstract":"Streaming media has experienced explosive growth over the last few years and will continue to increase in popularity as individual users can easily produce digital images and video. Large scale streaming will require network operators to deploy and manage a larger number of streaming servers within their networks. In order to determine the number of servers needed, and to design the appropriate management policies for a particular workload, administrators will need to understand the performance characteristics of those servers, how to measure performance, and how different workloads can affect performance. In this paper we make the case for a more complete measurement methodology by showing that streaming server performance can vary substantially based on the type of streaming workload, and, as a result, affect the end-user quality of service.","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":"129222748","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}
引用次数: 4
DOMProxy: enabling dynamic-content front-end Web caching DOMProxy:启用动态内容前端Web缓存
Manolis Veliskakis, John Roussos, Panos Georgantas, T. Sellis
{"title":"DOMProxy: enabling dynamic-content front-end Web caching","authors":"Manolis Veliskakis, John Roussos, Panos Georgantas, T. Sellis","doi":"10.1109/WCW.2005.9","DOIUrl":"https://doi.org/10.1109/WCW.2005.9","url":null,"abstract":"Proxy caching is a commonly accepted methodology used to reduce Internet traffic, decrease back-end related user delays, and generally improve Web performance. Nevertheless, it seems to be inadequate when it comes to caching dynamic Web pages, due to their low degree of reusability and strong dependency on the back-end site infrastructure. In order to overcome these drawbacks we present DOMProxy (dynamic objects manager proxy), a new proxy architecture that enables front-end Web caching for dynamically generated Web pages. Instead of caching Web pages produced dynamically or their fragments, the proposed architecture provides methods for \"caching\" their generation process. This is achieved by caching both the applications and the back-end data content that are used to create dynamic Web pages. We discuss the new challenges and issues raised by this approach, with special emphasis on the caching and manipulation of different types of Web objects at a front-end caching point.","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":"127820963","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}
引用次数: 5
TCP-PARIS: a parallel download protocol for replicas TCP-PARIS:用于副本的并行下载协议
R. Karrer, E. Knightly
{"title":"TCP-PARIS: a parallel download protocol for replicas","authors":"R. Karrer, E. Knightly","doi":"10.1109/WCW.2005.20","DOIUrl":"https://doi.org/10.1109/WCW.2005.20","url":null,"abstract":"Parallel download protocols have the potential to reduce file download time and to achieve a server-side load balancing in replica systems, such as peer-to-peer networks, content distribution networks and mirrored servers, by simultaneously establishing connections to multiple replicas and downloading disjoint file parts in parallel. This paper presents TCP-PARIS, a novel parallel download protocol from multiple replicas to one receiver. Because the ideal partitioning of the transfer volume from each server is a dynamic and a difficult-to-predict function of network conditions, server load and data size, TCP-PARIS uses the stream segmentation of TCP and congestion window information to continuously adapt the assigned volume to each server in proportion to the bandwidth-delay product to best approximate the optimal data partitioning. Analytical results, simulation and Internet experiments with a transport-layer implementation characterize the performance and the resource requirements of TCP-PARIS and allow a comparison with related protocols. Extensive simulations with varying network and application parameters show download time reductions of up to 52% compared to single-flow downloads and up to 52% compared to related protocols.","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":"130521923","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}
引用次数: 21
Magellan: performance-based, cooperative multicast 麦哲伦:基于性能的合作多播
S. Birrer, F. Bustamante
{"title":"Magellan: performance-based, cooperative multicast","authors":"S. Birrer, F. Bustamante","doi":"10.1109/WCW.2005.13","DOIUrl":"https://doi.org/10.1109/WCW.2005.13","url":null,"abstract":"Among the proposed overlay multicast protocols, tree-based systems have proven to be highly scalable and efficient in terms of physical link stress and end-to-end latency. Conventional tree-based protocols, however, distribute the forwarding load unevenly among the participating peers. An effective approach for addressing this problem is to stripe the multicast content across a forest of disjoint trees, evenly sharing the forwarding responsibility among participants. DHTs seem to be naturally well suited for the task, as they are able to leverage the inherent properties of their routing model in building such a forest. In heterogeneous environments, though, DHT-based schemes for tree (and forest) construction may yield deep, unbalanced structures with potentially large delivery latencies. This paper introduces Magellan, a new overlay multicast protocol we have built to explore the tradeoff between fairness and performance in these environments. Magellan builds a data-distribution forest out of multiple performance-centric, balanced trees. It assigns every peer in the system a primary tree with priority over the peer's resources. The peers' spare resources are then made available to secondary trees. In this manner, Magellan achieves fairness, ensuring that every participating peer contributes resources to the system. By employing a balanced distribution tree with O(lg N)-bounded, end-to-end hop-distance, Magellan also provides high delivery ratio with comparable low latency. Preliminary simulation results show the advantage of this approach.","PeriodicalId":141241,"journal":{"name":"10th International Workshop on Web Content Caching and Distribution (WCW'05)","volume":"87 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":"133673474","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}
引用次数: 19
Stochastic analysis of chain based file distribution architectures with heterogeneous peers 具有异构节点的基于链的文件分布体系结构的随机分析
D. Carra, R. Cigno
{"title":"Stochastic analysis of chain based file distribution architectures with heterogeneous peers","authors":"D. Carra, R. Cigno","doi":"10.1109/WCW.2005.18","DOIUrl":"https://doi.org/10.1109/WCW.2005.18","url":null,"abstract":"Performance analysis of P2P systems is necessary to understand the real impact on the network of such applications. In this paper we study the performance that can be achieved by a simple file distribution architecture in a heterogeneous environment, i.e., when the access links of peers have randomly distributed capacities. The distribution architecture is a chain, where each peer downloads the content from exactly one node and uploads the content to exactly one node. Our analysis starts from a complete knowledge about peers, so that we can derive analytically the deterministic behavior and use the results as reference. We then remove part of the knowledge a peer has about its neighbors and derive the performance that can be obtained in such an environment. Results show that, if peers have sufficient information about neighbors, they can be organized in such a way that slow peers obtain near optimal performance without affecting faster peers. On the other hand, if peers do not know neighbor characteristics, slow peers have a significant impact on global performance, and other, more sophisticated, distribution architectures are required to maintain proper scalability.","PeriodicalId":141241,"journal":{"name":"10th International Workshop on Web Content Caching and Distribution (WCW'05)","volume":"26 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":"132736119","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}
引用次数: 3
Content-aware global static compression for Web content delivery 用于Web内容交付的内容感知全局静态压缩
Junli Yuan, Chi-Hung Chi, Qibin Sun
{"title":"Content-aware global static compression for Web content delivery","authors":"Junli Yuan, Chi-Hung Chi, Qibin Sun","doi":"10.1109/WCW.2005.8","DOIUrl":"https://doi.org/10.1109/WCW.2005.8","url":null,"abstract":"The effectiveness of real-time lossless compression on Web data is found to be limited by the relatively small size of its basic operation unit, Web object. However, we observe that while the repeated occurrence frequencies of strings within a single object might be low, the frequencies can be very high if they are considered over multiple objects. Furthermore, these strings with high occurrence frequencies are quite static, and the size of such string set is also quite small. In this paper, we propose a complementary compression mechanism on top of the existing HTTP supported algorithms, called the content-aware global static compression (CAGSC), to further improve Web data compression. Its basic idea is to include a static CAGSC table to perform compression on frequently, globally occurred strings. Our experimental result shows that CAGSC can obtain an average of 15% improvement over standard HTTP supported algorithms.","PeriodicalId":141241,"journal":{"name":"10th International Workshop on Web Content Caching and Distribution (WCW'05)","volume":"101 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":"132086174","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学术官方微信