Performance of a software system is the result of many interacting factors. This paper describes a rule-based framework to identify root causes of performance limits, to untangle the effects of the system configuration (such as the allocation of processors) from limits imposed by the software design, and to recommend both configuration and design improvements. The framework uses a performance model which represents (and is derived from) a UML design model, and applies transformations to the given performance model to obtain another improved one. The improvements imply configuration and design changes which can be applied to the system. This paper describes the approach and demonstrates feasibility by applying a small set of rules to the design of a web application.
{"title":"Rule-based automatic software performance diagnosis and improvement","authors":"Jing Xu","doi":"10.1145/1383559.1383561","DOIUrl":"https://doi.org/10.1145/1383559.1383561","url":null,"abstract":"Performance of a software system is the result of many interacting factors. This paper describes a rule-based framework to identify root causes of performance limits, to untangle the effects of the system configuration (such as the allocation of processors) from limits imposed by the software design, and to recommend both configuration and design improvements. The framework uses a performance model which represents (and is derived from) a UML design model, and applies transformations to the given performance model to obtain another improved one. The improvements imply configuration and design changes which can be applied to the system. This paper describes the approach and demonstrates feasibility by applying a small set of rules to the design of a web application.","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"82 1","pages":"525-550"},"PeriodicalIF":0.0,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88064041","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 : 2008-05-01DOI: 10.1016/j.peva.2007.07.002
Jin-Hee Cho, I. Chen, Ding-Chau Wang
{"title":"Performance optimization of region-based group key management in mobile ad hoc networks","authors":"Jin-Hee Cho, I. Chen, Ding-Chau Wang","doi":"10.1016/j.peva.2007.07.002","DOIUrl":"https://doi.org/10.1016/j.peva.2007.07.002","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"1 1","pages":"319-344"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91544372","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}
The general aim of this paper is to analyze the throughput of a HTTP flow. For this, we introduce a simplified model of such a flow which consists of a succession of idle and download periods. The file downloads are subject to a fixed packet loss probability. The same TCP connection is possibly used for the download of a random number of files, for which the effect of the slow start is taken into account. For this stochastic model, we derive a closed form formula for the stationary throughput obtained by a flow. We also derive closed form expressions for the mean time to transfer a file and for the distribution of the throughput. Several laws of file sizes and idle times are considered including heavy tailed distributions. We also briefly discuss how the formulas can be applied to predict bandwidth sharing among competing HTTP flows.
{"title":"A stochastic model for the throughput of non-persistent TCP flows","authors":"F. Baccelli, D. McDonald","doi":"10.1145/1190095.1190169","DOIUrl":"https://doi.org/10.1145/1190095.1190169","url":null,"abstract":"The general aim of this paper is to analyze the throughput of a HTTP flow. For this, we introduce a simplified model of such a flow which consists of a succession of idle and download periods. The file downloads are subject to a fixed packet loss probability. The same TCP connection is possibly used for the download of a random number of files, for which the effect of the slow start is taken into account. For this stochastic model, we derive a closed form formula for the stationary throughput obtained by a flow. We also derive closed form expressions for the mean time to transfer a file and for the distribution of the throughput. Several laws of file sizes and idle times are considered including heavy tailed distributions. We also briefly discuss how the formulas can be applied to predict bandwidth sharing among competing HTTP flows.","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"68 3","pages":"512-530"},"PeriodicalIF":0.0,"publicationDate":"2006-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72590636","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 : 2006-08-01DOI: 10.1016/j.peva.2005.09.003
Xiu-li Xu, Z. Zhang
{"title":"Analysis of multi-server queue with a single vacation (e, d)-policy","authors":"Xiu-li Xu, Z. Zhang","doi":"10.1016/j.peva.2005.09.003","DOIUrl":"https://doi.org/10.1016/j.peva.2005.09.003","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"8 1","pages":"825-838"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76505346","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 : 2006-08-01DOI: 10.1016/j.peva.2005.08.001
Stefan Rank, H. Schwefel
{"title":"Transient analysis of RED queues: A quantitative analysis of buffer-occupancy fluctuations and relevant time-scales","authors":"Stefan Rank, H. Schwefel","doi":"10.1016/j.peva.2005.08.001","DOIUrl":"https://doi.org/10.1016/j.peva.2005.08.001","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"97 1","pages":"725-742"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86990256","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 : 2006-08-01DOI: 10.1016/j.peva.2005.09.001
G. J. Franx, G. Koole, A. Pot
{"title":"Approximating multi-skill blocking systems by HyperExponential Decomposition","authors":"G. J. Franx, G. Koole, A. Pot","doi":"10.1016/j.peva.2005.09.001","DOIUrl":"https://doi.org/10.1016/j.peva.2005.09.001","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"16 1","pages":"799-824"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87256246","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 : 2006-08-01DOI: 10.1016/j.peva.2005.08.002
B. Gijsen, R. Mei, P. Engelberts, H. V. D. Berg, K. Wingerden
{"title":"Sojourn time approximations in queueing networks with feedback","authors":"B. Gijsen, R. Mei, P. Engelberts, H. V. D. Berg, K. Wingerden","doi":"10.1016/j.peva.2005.08.002","DOIUrl":"https://doi.org/10.1016/j.peva.2005.08.002","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"101 1","pages":"743-758"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82753410","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}
One of the triumphs of wireline network research of the last decade has been the casting of the Internet congestion control problem within an optimization framework based on utility functions. Such an approach provides a sound understanding of the underlying stability and fairness issues, as well as a post-facto justification of TCP-like additive-increase multiplicative-decrease (AIMD) algorithms. This paper provides a counter-example showing that the same result cannot be extended to wireless networks, at least not in a straightforward manner.The fundamental difference is that wireless networks are of a broadcast nature. There is no strict notion of a "link," since transmissions from nearby nodes interfere with each other. Using a simple model of interference in wireless networks, a counter-example of a wireless network is presented in which the congestion control mechanism has an unstable equilibrium point at the desired fair solution. Further, ns-2 simulations of this counter-example manifest an oscillatory behavior. Surprisingly, this oscillatory behavior appears to be fairly typical in wireless networks, with most randomly chosen network examples manifesting it. This loss of stability suggests a possible need for the re-design of wireless TCP and wireless queue management to explicitly account for the wireless nature of the effects of interference. wireless interference can make this mechanism unstable. We present counter-example wireless graphs and flow patterns in which the congestion control mechanism fails to remain stable. ns-2 simulations indicate that this loss of stability manifests in practice as oscillatory behavior. Moreover, this oscillatory behavior is fairly typical in wireless networks. This loss of stability suggests a need for the re-design of wireless TCP and wireless queue management to explicitly account for the effects of interference.
{"title":"A counterexample in congestion control of wireless networks","authors":"V. Raghunathan, P. Kumar","doi":"10.1145/1089444.1089496","DOIUrl":"https://doi.org/10.1145/1089444.1089496","url":null,"abstract":"One of the triumphs of wireline network research of the last decade has been the casting of the Internet congestion control problem within an optimization framework based on utility functions. Such an approach provides a sound understanding of the underlying stability and fairness issues, as well as a post-facto justification of TCP-like additive-increase multiplicative-decrease (AIMD) algorithms. This paper provides a counter-example showing that the same result cannot be extended to wireless networks, at least not in a straightforward manner.The fundamental difference is that wireless networks are of a broadcast nature. There is no strict notion of a \"link,\" since transmissions from nearby nodes interfere with each other. Using a simple model of interference in wireless networks, a counter-example of a wireless network is presented in which the congestion control mechanism has an unstable equilibrium point at the desired fair solution. Further, ns-2 simulations of this counter-example manifest an oscillatory behavior. Surprisingly, this oscillatory behavior appears to be fairly typical in wireless networks, with most randomly chosen network examples manifesting it. This loss of stability suggests a possible need for the re-design of wireless TCP and wireless queue management to explicitly account for the wireless nature of the effects of interference. wireless interference can make this mechanism unstable. We present counter-example wireless graphs and flow patterns in which the congestion control mechanism fails to remain stable. ns-2 simulations indicate that this loss of stability manifests in practice as oscillatory behavior. Moreover, this oscillatory behavior is fairly typical in wireless networks. This loss of stability suggests a need for the re-design of wireless TCP and wireless queue management to explicitly account for the effects of interference.","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"50 1","pages":"399-418"},"PeriodicalIF":0.0,"publicationDate":"2005-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72573422","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}
Topology Control (TC) is a well-studied technique used in wireless ad hoc networks to find energy-efficient and/or low-interference subgraphs of the maxpower communication graph. However, existing work has the following limitations: (1) the energy model adopted is quite unrealistic - only transmit power is often considered and homogeneous decay of the radio signal with distance is assumed; (2) the interference measure does not account for multi-hop communications. In this paper, we show the dramatic effect of the underlying energy and interference model on TC. In particular, we demonstrate that by using more realistic energy models and considering the effects of multi-hop interference, radically different conclusions about TC can be drawn; namely that (1) energy efficient TC is essentially meaningless, since every link turns out to be "efficient", and that (2) topologies identified as "interference-optimal" in the current literature can be extremely bad from the viewpoint of multi-hop interference. Given these observations, we propose a new measure of link interference, extend it to deal with multi-hop interference, and design a corresponding optimal communication subgraph, called ATASP. We prove that, in the worst case, ATASP coincides with the maxpower communication graph, showing that in some unfortunate situations also performing multi-hop interference-based TC is pointless. However, the simulation results with random node deployments presented in this paper show that, on the average, ATASP is a sparse subgraph of the maxpower communication graph, and multi-hop interference-based TC is indeed possible. Since computing ATASP requires global knowledge, we experiment through simulation with known localized algorithms for energy-efficient TC and show that they perform well (on the average) with respect to multi-hop interference.
{"title":"Topology control with better radio models: implications for energy and multi-hop interference","authors":"D. Blough, M. Leoncini, G. Resta, P. Santi","doi":"10.1145/1089444.1089491","DOIUrl":"https://doi.org/10.1145/1089444.1089491","url":null,"abstract":"Topology Control (TC) is a well-studied technique used in wireless ad hoc networks to find energy-efficient and/or low-interference subgraphs of the maxpower communication graph. However, existing work has the following limitations: (1) the energy model adopted is quite unrealistic - only transmit power is often considered and homogeneous decay of the radio signal with distance is assumed; (2) the interference measure does not account for multi-hop communications. In this paper, we show the dramatic effect of the underlying energy and interference model on TC. In particular, we demonstrate that by using more realistic energy models and considering the effects of multi-hop interference, radically different conclusions about TC can be drawn; namely that (1) energy efficient TC is essentially meaningless, since every link turns out to be \"efficient\", and that (2) topologies identified as \"interference-optimal\" in the current literature can be extremely bad from the viewpoint of multi-hop interference. Given these observations, we propose a new measure of link interference, extend it to deal with multi-hop interference, and design a corresponding optimal communication subgraph, called ATASP. We prove that, in the worst case, ATASP coincides with the maxpower communication graph, showing that in some unfortunate situations also performing multi-hop interference-based TC is pointless. However, the simulation results with random node deployments presented in this paper show that, on the average, ATASP is a sparse subgraph of the maxpower communication graph, and multi-hop interference-based TC is indeed possible. Since computing ATASP requires global knowledge, we experiment through simulation with known localized algorithms for energy-efficient TC and show that they perform well (on the average) with respect to multi-hop interference.","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"11 1","pages":"379-398"},"PeriodicalIF":0.0,"publicationDate":"2005-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77039412","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
扫码关注我们
求助内容：
应助结果提醒方式：