Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240638
Hernández-Campos Félix, Jeffay F Kevin, Donelson Smith, Web Servers
Understanding the nature and structure of Web traffic is essential for valid simulations of networking technologies that affect the end-to-end performance of HTTP connections. We provide data suitable for the construction of synthetic Web traffic generators and in doing so retrospectively examine the evolution of Web traffic. We use a simple and efficient analysis methodology based on the examination of only the TCP/IP headers of one-half (server-to-client) of the HTTP connection. We show the impact of HTTP protocol improvements such as persistent connections as well as modern content structure that reflect the influences of "banner ads," server load balancing, and content distribution networks. Lastly, we comment on methodological issues related to the acquisition of HTTP data suitable for performing these analyses, including the effects of trace duration and trace boundaries.
{"title":"Tracking the evolution of Web traffic: 1995-2003","authors":"Hernández-Campos Félix, Jeffay F Kevin, Donelson Smith, Web Servers","doi":"10.1109/MASCOT.2003.1240638","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240638","url":null,"abstract":"Understanding the nature and structure of Web traffic is essential for valid simulations of networking technologies that affect the end-to-end performance of HTTP connections. We provide data suitable for the construction of synthetic Web traffic generators and in doing so retrospectively examine the evolution of Web traffic. We use a simple and efficient analysis methodology based on the examination of only the TCP/IP headers of one-half (server-to-client) of the HTTP connection. We show the impact of HTTP protocol improvements such as persistent connections as well as modern content structure that reflect the influences of \"banner ads,\" server load balancing, and content distribution networks. Lastly, we comment on methodological issues related to the acquisition of HTTP data suitable for performing these analyses, including the effects of trace duration and trace boundaries.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124569243","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240671
A. Wierman, T. Osogami, J. Olsén
A general analytical framework for the modeling and analysis of TCP variations is presented. The framework allows the modeling of multiple variations of TCP, including TCP-Vegas, TCP-SACK, and TCP-Reno, under general network situations. In particular, the framework allows us to propose the first analytical model of TCP-Vegas for arbitrary on-off traffic that is able to predict the operating point of the network. The analysis provided by our framework leads to many interesting observations with respect to both the behavior of bottleneck links that are shared by TCP sources and the effectiveness of the design decisions in TCP-SACK and TCP-Vegas.
{"title":"A unified framework for modeling TCP-Vegas, TCP-SACK, and TCP-Reno","authors":"A. Wierman, T. Osogami, J. Olsén","doi":"10.1109/MASCOT.2003.1240671","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240671","url":null,"abstract":"A general analytical framework for the modeling and analysis of TCP variations is presented. The framework allows the modeling of multiple variations of TCP, including TCP-Vegas, TCP-SACK, and TCP-Reno, under general network situations. In particular, the framework allows us to propose the first analytical model of TCP-Vegas for arbitrary on-off traffic that is able to predict the operating point of the network. The analysis provided by our framework leads to many interesting observations with respect to both the behavior of bottleneck links that are shared by TCP sources and the effectiveness of the design decisions in TCP-SACK and TCP-Vegas.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121374865","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240639
Jean-Thomas Acquaviva, F. Quessette
This paper proposes an algorithm to dynamically characterize the coherency traffic occurring in DSM architectures. This algorithm strongly relies on linear regressions to isolate lines among the traffic. The main features are a dynamic algorithm, robustness toward the noise and production of fine characterizations of the traffic. At the end the regularity is summarized in a set of regression lines found and some statistics are provided. The driving idea is while scientific code is widely considered as highly structured, a precise quantification may expose the underlying regularity due the code data structures. We describe the algorithm step by step and give results that show the relevance of the approach.
{"title":"Using linear regression to characterize data coherency traffic","authors":"Jean-Thomas Acquaviva, F. Quessette","doi":"10.1109/MASCOT.2003.1240639","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240639","url":null,"abstract":"This paper proposes an algorithm to dynamically characterize the coherency traffic occurring in DSM architectures. This algorithm strongly relies on linear regressions to isolate lines among the traffic. The main features are a dynamic algorithm, robustness toward the noise and production of fine characterizations of the traffic. At the end the regularity is summarized in a set of regression lines found and some statistics are provided. The driving idea is while scientific code is widely considered as highly structured, a precise quantification may expose the underlying regularity due the code data structures. We describe the algorithm step by step and give results that show the relevance of the approach.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126190145","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}
Pub Date : 2002-08-30DOI: 10.1109/MASCOT.2003.1240641
Jacob R. Lorch, A. Smith
Increasingly, mobile computers use dynamic voltage scaling (DVS) to reduce CPU voltage and speed and thereby increase battery life. To determine how to change voltage and speed when responding to user interface events, we analyze traces of real user workloads. We evaluate a new heuristic for inferring when user interface tasks complete and find it is more efficient and nearly as effective as other approaches. We compare DVS algorithms and find that for a given performance level, the PACE algorithm uses the least energy and the Stepped algorithm uses the second least. We find that different types of user interface event (mouse movements, mouse clicks, and keystrokes) trigger tasks with significantly different CPU use, suggesting one should use different speeds for different event types. We also find differences in CPU use between categories of the same event type, e.g., between pressing spacebar and pressing enter, and between events of different applications. Thus, it is better to predict task CPU use based solely on tasks of the same category and application. However, energy savings from such improved predictions are small.
{"title":"Using user interface event information in dynamic voltage scaling algorithms","authors":"Jacob R. Lorch, A. Smith","doi":"10.1109/MASCOT.2003.1240641","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240641","url":null,"abstract":"Increasingly, mobile computers use dynamic voltage scaling (DVS) to reduce CPU voltage and speed and thereby increase battery life. To determine how to change voltage and speed when responding to user interface events, we analyze traces of real user workloads. We evaluate a new heuristic for inferring when user interface tasks complete and find it is more efficient and nearly as effective as other approaches. We compare DVS algorithms and find that for a given performance level, the PACE algorithm uses the least energy and the Stepped algorithm uses the second least. We find that different types of user interface event (mouse movements, mouse clicks, and keystrokes) trigger tasks with significantly different CPU use, suggesting one should use different speeds for different event types. We also find differences in CPU use between categories of the same event type, e.g., between pressing spacebar and pressing enter, and between events of different applications. Thus, it is better to predict task CPU use based solely on tasks of the same category and application. However, energy savings from such improved predictions are small.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121682585","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}
Pub Date : 1900-01-01DOI: 10.1109/MASCOT.2003.1240634
The following topics are dealt with: workload characterisation; mobile devices and optical networks; network performance simulation; storage system; Web server performance; wireless and mobile networks; Internet performance; Web proxies; distributed and cluster computing.
{"title":"Proceedings of the 11th IEEE/ACM International Symposium on Modeling Analysis and Simulation of Computer Telecommunications Systems. MASCOTS 2003","authors":"","doi":"10.1109/MASCOT.2003.1240634","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240634","url":null,"abstract":"The following topics are dealt with: workload characterisation; mobile devices and optical networks; network performance simulation; storage system; Web server performance; wireless and mobile networks; Internet performance; Web proxies; distributed and cluster computing.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115377021","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：