2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies最新文献

筛选
英文 中文
Algorithms for Optimizing Bandwidth Costs on the Internet 优化互联网带宽成本的算法
2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies Pub Date : 2006-11-13 DOI: 10.1109/HOTWEB.2006.355262
M. Adler, R. Sitaraman, Harish Venkataramani
{"title":"Algorithms for Optimizing Bandwidth Costs on the Internet","authors":"M. Adler, R. Sitaraman, Harish Venkataramani","doi":"10.1109/HOTWEB.2006.355262","DOIUrl":"https://doi.org/10.1109/HOTWEB.2006.355262","url":null,"abstract":"Content delivery networks (CDNs) deliver Web content to end-users from a large distributed platform of Web servers hosted in data centers belonging to thousands of Internet service providers (ISPs) around the world. The bandwidth cost incurred by a CDN is the sum of the amounts it pays each ISP for routing traffic from its servers located in that ISP out to end-users. A large enterprise may also contract with multiple ISPs to provide redundant Internet access for its origin infrastructure using technologies such as multihoming and mirroring, thereby incurring a significant bandwidth cost across multiple ISPs. This paper initiates the formal study of bandwidth cost minimization in the context of a large enterprise or a CDN, a problem area that is both algorithmically rich and practically very important. First, we model different types of contracts that are used in practice by ISPs to charge for bandwidth usage, including average, maximum, and 95th-percentile contracts. Then, we devise an optimal offline algorithm that routes traffic to achieve the minimum bandwidth cost, when the network contracts charge either on a maximum or on an average basis. Next, we devise a deterministic (resp., randomized) online algorithm that achieves cost that is within a factor of 2 (resp., e/(e - 1)) of the optimal offline cost for maximum and average contracts. In addition, we prove that our online algorithms achieve the best possible competitive ratios in both the deterministic and the randomized cases. An interesting theoretical contribution of this work is that we show intriguing connections between the online bandwidth optimization problem and the seemingly-unrelated but well-studied ski rental problem where similar optimal competitive ratios are known to hold. Finally, we consider extensions for contracts with a committed amount of spend (CIRs) and contracts that charge on a 95th-percentile basis","PeriodicalId":280167,"journal":{"name":"2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132730409","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}
引用次数: 7
Measurement and Modeling of A Web-based Question Answering System 基于web的问答系统的测量与建模
2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies Pub Date : 2006-11-01 DOI: 10.1109/HOTWEB.2006.355265
Chunyi Peng, Zaoyang Gong, G. Shen
{"title":"Measurement and Modeling of A Web-based Question Answering System","authors":"Chunyi Peng, Zaoyang Gong, G. Shen","doi":"10.1109/HOTWEB.2006.355265","DOIUrl":"https://doi.org/10.1109/HOTWEB.2006.355265","url":null,"abstract":"Question-answering (QA) is one of the most natural and effective channels for specific information acquisition. QA systems emerged several decades back. In this paper, we perform a measurement study of a popular, large scale Web-QA system, i.e. iAsk, and systematically investigate various behavior patterns and the system performance. To evaluate such a Web-QA system, we propose three performance metrics, namely reply-rate, reply-number, and reply-latency, which are most closely related to the QoS of a Web-QA system. Based on extensive measurement results, we propose a mathematical framework for the three performance metrics that capture our observation precisely. The framework reveals that the QoS of a Web-QA system actually heavily depends on three key factors: the user scale, user reply probability and a system design artifact (related to Webpage layout). We study their respective impacts on the system performance. Finally, we propose several ways through which current Web-QA system can be improved. To the best of our knowledge, this is the first piece of work that studies the performances of Web-QA systems","PeriodicalId":280167,"journal":{"name":"2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127078369","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
Semantically Coupled Header Compression 语义耦合报头压缩
2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies Pub Date : 2006-11-01 DOI: 10.1109/HOTWEB.2006.355261
P. Seeling, M. Reisslein
{"title":"Semantically Coupled Header Compression","authors":"P. Seeling, M. Reisslein","doi":"10.1109/HOTWEB.2006.355261","DOIUrl":"https://doi.org/10.1109/HOTWEB.2006.355261","url":null,"abstract":"In this paper, we evaluate the semantic coupling of header compressor and decompressor entities in our semantically coupled header compression (SCHC) scheme. We introduce the media interleave factor (MIF) to obtain an interleaving scheme for different media streams, e.g., audio and video streams. We additionally introduce the TIMES algorithm to header compression by assuming constant deltas in the headers of media streams. Exploiting the interleaving and the constant offsets in such streams, we semantically connect the (de)compressors of a framed delta coding header compression scheme to evaluate the advantage of this coupling over traditional header compression schemes using only an individual media stream. We find that our approach of semantic coupling of multiple header (de)compressors results in higher robustness for a broad range of bit error rates. We find that using our approach, expected header savings are more stable and close to the obtainable maximum savings for typical bit error rates. We additionally find that expected packet drop savings due to header compression are larger than with the traditional single stream header compression approach.","PeriodicalId":280167,"journal":{"name":"2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies","volume":"275 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122808212","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
Peer-Assisted File Distribution: The Minimum Distribution Time 对等辅助文件分发:最短分发时间
2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies Pub Date : 2006-11-01 DOI: 10.1109/HOTWEB.2006.355259
Rakesh Kumar, K. Ross
{"title":"Peer-Assisted File Distribution: The Minimum Distribution Time","authors":"Rakesh Kumar, K. Ross","doi":"10.1109/HOTWEB.2006.355259","DOIUrl":"https://doi.org/10.1109/HOTWEB.2006.355259","url":null,"abstract":"With the emergence of BitTorrent, Swarm-cast, and CDNs, peer-assisted file distribution has become a prominent Internet application, both in terms of user popularity and traffic volumes. We consider the following fundamental problem for peer-assisted file distribution. There are seed nodes, each of which has a copy of the file, and leecher nodes, each of which wants a copy the file. The goal is to distribute the file to all the leechers - with the assistance of the upload capacity of the leechers - in order to minimize the time to get the file to all the leechers (the distribution time). We obtain explicit expressions for the minimum distribution time of a general heterogeneous peer-assisted file distribution system. Derived with fluid-flow arguments, the expressions are in terms of the file size, the seeds' upload rates and the leechers' upload and download rates. We demonstrate the utility of the result by comparing the optimal distribution time with the measured distribution time when BitTorrent is used to distribute a file from a seed to ten leechers","PeriodicalId":280167,"journal":{"name":"2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114250836","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}
引用次数: 108
DDG: An Efficient Prefetching Algorithm for Current Web Generation DDG:一种有效的当前Web生成预取算法
2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies Pub Date : 2006-11-01 DOI: 10.1109/HOTWEB.2006.355260
J. Domenech, J. A. Gil, J. Sahuquillo, A. Pont
{"title":"DDG: An Efficient Prefetching Algorithm for Current Web Generation","authors":"J. Domenech, J. A. Gil, J. Sahuquillo, A. Pont","doi":"10.1109/HOTWEB.2006.355260","DOIUrl":"https://doi.org/10.1109/HOTWEB.2006.355260","url":null,"abstract":"Web prefetching is one of the techniques proposed to reduce user's perceived latencies in the World Wide Web. The spatial locality shown by user's accesses makes it possible to predict future accesses based on the previous ones. A prefetching engine uses these predictions to prefetch the Web objects before the user demands them. The existing prediction algorithms achieved an acceptable performance when they were proposed but the high increase in the amount of embedded objects per page has reduced their effectiveness in the current Web. In this paper we show that most of the predictions made by the existing algorithms are useless to reduce the user's perceived latency because these algorithms do not take into account how current Web pages are structured, i.e., an HTML object with several embedded objects. Thus, they predict the accesses to the embedded objects in an HTML after reading the HTML itself. For this reason, the prediction advance is not enough to prefetch the objects and therefore there is no latency reduction. As a result of a wide analysis of the behaviour of the most commonly used algorithms, in this paper we present the DDG algorithm that distinguishes between container objects (HTML) and embedded objects to create a new prediction model according to the structure of the current Web. Results show that, for the same amount of extra requests to the server, DDG always outperforms the existing algorithms by reducing the perceived latency between 15% and 150% more without increasing the computing complexity","PeriodicalId":280167,"journal":{"name":"2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127864857","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}
引用次数: 36
TCP Connection Management Mechanisms for Improving Internet Server Performance 提高Internet服务器性能的TCP连接管理机制
2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies Pub Date : 2006-11-01 DOI: 10.1109/HOTWEB.2006.355264
Amol Shukla, Tim Brecht
{"title":"TCP Connection Management Mechanisms for Improving Internet Server Performance","authors":"Amol Shukla, Tim Brecht","doi":"10.1109/HOTWEB.2006.355264","DOIUrl":"https://doi.org/10.1109/HOTWEB.2006.355264","url":null,"abstract":"This paper investigates TCP connection management mechanisms in order to understand the behaviour and improve the performance of Internet servers during overload conditions such as flash crowds. We study several alternatives for implementing TCP connection establishment, reviewing approaches taken by existing TCP stacks as well as proposing new mechanisms to improve server throughput and reduce client response times under overload. We implement some of these mechanisms in Linux and evaluate their performance. Our evaluation demonstrates that connection establishment mechanisms that eliminate the TCP-level retransmission of connection attempts by clients can increase server throughput by up to 40% and reduce client response times by two orders of magnitude. Additionally we evaluate the cost of supporting half-closed connections at the server and assess the impact of an abortive release of connections by clients on the throughput of an overloaded server. We observe that mechanisms that do not support half-closed connections additionally improve server throughput by more than 15%","PeriodicalId":280167,"journal":{"name":"2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133466947","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}
引用次数: 12
A Soft Semantic Web 软语义网
2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies Pub Date : 2006-11-01 DOI: 10.1109/HOTWEB.2006.355267
R. Brena, E. Ramírez
{"title":"A Soft Semantic Web","authors":"R. Brena, E. Ramírez","doi":"10.1109/HOTWEB.2006.355267","DOIUrl":"https://doi.org/10.1109/HOTWEB.2006.355267","url":null,"abstract":"The importance of automated meaning handling in the Internet has been widely acknowledged; this is indeed the rational behind initiatives like the so-called \"semantic Web\", which proposes the widespread use of \"ontologies\" to define concepts and make online documentation self-described. Nevertheless, several practical problems have hindered the semantic Web from becoming mainstream. In this paper we propose a way to make explicit the underlying semantic structure of the ordinary (HTML-based) Web, by measuring joint keyword occurrences in Web pages, around our notion of \"semantic contexts\". The resulting infrastructure semantically characterizes contextual semantic information in the Internet. Semantic contexts can have many practical uses, such as focusing Internet searches in such a way that results are much more relevant to users than with current search engines, as we show in this paper. Further, we propose to make semantic contexts publicly available online, in order to make semantic-aware many Internet applications in a simpler way than -or even better, complementing - the currently marginal semantic Web","PeriodicalId":280167,"journal":{"name":"2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115267674","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
Web Information Extraction Using Generalized Hidden Markov Model 基于广义隐马尔可夫模型的Web信息提取
2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies Pub Date : 2006-11-01 DOI: 10.1109/HOTWEB.2006.355271
Ping Zhong, Jinlin Chen, Terry Cook
{"title":"Web Information Extraction Using Generalized Hidden Markov Model","authors":"Ping Zhong, Jinlin Chen, Terry Cook","doi":"10.1109/HOTWEB.2006.355271","DOIUrl":"https://doi.org/10.1109/HOTWEB.2006.355271","url":null,"abstract":"Hidden Markov model (HMM) is an important approach for information extraction (IE). When applied to Web IE, several problems exist with HMM based approaches due to the lack of consideration on Web-specific features. In this paper we present a generalized hidden Markov model (GHMM) that extends traditional HMMs by making use of Web-specific information for Web IE. In our approach we use Web content block instead of term as basic extraction unit. Besides, instead of using the traditional sequential state transition order, we detect the state transition order of GHMM based on layout structure of the corresponding Web page. Furthermore, we use multiple emission features instead of single emission feature. In this way GHMM can better accommodate Web IE. Experiments show promising results comparing to traditional HMM based Web IE","PeriodicalId":280167,"journal":{"name":"2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115948236","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
A Mixed Coding Scheme for Inverted File Index Compression 反向文件索引压缩的混合编码方案
2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies Pub Date : 2006-11-01 DOI: 10.1109/HOTWEB.2006.355272
Jinlin Chen, Ping Zhong, Terry Cook
{"title":"A Mixed Coding Scheme for Inverted File Index Compression","authors":"Jinlin Chen, Ping Zhong, Terry Cook","doi":"10.1109/HOTWEB.2006.355272","DOIUrl":"https://doi.org/10.1109/HOTWEB.2006.355272","url":null,"abstract":"Cluster property of d-gaps in inverted lists provides valuable information for improving index compression and subsequently improving the performance of Web search engines. By clustering d-gaps of an inverted list strictly based on a threshold, and then encoding clustered and non-clustered d-gaps using different methods, we can tailor to the specific properties of different d-gaps and achieve better compression ratio. Based on this idea, in this paper we propose a cluster based mixed coding scheme for inverted file index compression: mixed gamma/flat binary code. Experiment results show that the new coding scheme achieves at least equal performance in terms of compression ratio comparing to interpolative code which is considered as one of the most efficient bitwise codes at present. By adjusting the parameters for the new code, even better results can be achieved. Besides, the new code has lower complexity comparing to interpolative code and therefore enables faster encoding and decoding","PeriodicalId":280167,"journal":{"name":"2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115880953","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
The Gugubarra Project: Building and Evaluating User Profiles for Visitors of Web Sites Gugubarra项目:建立和评估网站访问者的用户档案
2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies Pub Date : 2006-11-01 DOI: 10.1109/HOTWEB.2006.355258
Natascha Hoebel, Sascha Kaufmann, Karsten Tolle, R. Zicari
{"title":"The Gugubarra Project: Building and Evaluating User Profiles for Visitors of Web Sites","authors":"Natascha Hoebel, Sascha Kaufmann, Karsten Tolle, R. Zicari","doi":"10.1109/HOTWEB.2006.355258","DOIUrl":"https://doi.org/10.1109/HOTWEB.2006.355258","url":null,"abstract":"In this paper we will report the work currently being doing one the Gugubarra project. The project aims at building tools for better management of communities of Web visitors","PeriodicalId":280167,"journal":{"name":"2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134080037","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}
引用次数: 8
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书