Perform. Evaluation最新文献_第5页

Rule-based automatic software performance diagnosis and improvement 基于规则的软件性能自动诊断与改进

Perform. Evaluation Pub Date : 2008-06-23 DOI: 10.1145/1383559.1383561

Jing Xu

引用次数: 145

A conditional probability approach to M/G/1-like queues 类M/G/1队列的条件概率方法

Perform. Evaluation Pub Date : 2008-05-01 DOI: 10.1016/j.peva.2007.09.002

A. Brandwajn, Hongyun Wang

引用次数: 15

Performance optimization of region-based group key management in mobile ad hoc networks 移动自组网中基于区域的组密钥管理性能优化

Perform. Evaluation Pub Date : 2008-05-01 DOI: 10.1016/j.peva.2007.07.002

Jin-Hee Cho, I. Chen, Ding-Chau Wang

引用次数: 34

A stochastic model for the throughput of non-persistent TCP flows 非持久TCP流吞吐量的随机模型

Perform. Evaluation Pub Date : 2006-10-11 DOI: 10.1145/1190095.1190169

F. Baccelli, D. McDonald

引用次数: 19

Analysis of multi-server queue with a single vacation (e, d)-policy 具有单一休假(e, d)策略的多服务器队列分析

Perform. Evaluation Pub Date : 2006-08-01 DOI: 10.1016/j.peva.2005.09.003

Xiu-li Xu, Z. Zhang

引用次数: 42

Transient analysis of RED queues: A quantitative analysis of buffer-occupancy fluctuations and relevant time-scales RED队列的瞬态分析:缓冲占用波动和相关时间尺度的定量分析

Perform. Evaluation Pub Date : 2006-08-01 DOI: 10.1016/j.peva.2005.08.001

Stefan Rank, H. Schwefel

引用次数: 5

Approximating multi-skill blocking systems by HyperExponential Decomposition 用超指数分解逼近多技能块系统

Perform. Evaluation Pub Date : 2006-08-01 DOI: 10.1016/j.peva.2005.09.001

G. J. Franx, G. Koole, A. Pot

引用次数: 42

Sojourn time approximations in queueing networks with feedback 带反馈的排队网络的逗留时间逼近

Perform. Evaluation Pub Date : 2006-08-01 DOI: 10.1016/j.peva.2005.08.002

B. Gijsen, R. Mei, P. Engelberts, H. V. D. Berg, K. Wingerden

引用次数: 11

A counterexample in congestion control of wireless networks 无线网络拥塞控制中的一个反例

Perform. Evaluation Pub Date : 2005-10-10 DOI: 10.1145/1089444.1089496

V. Raghunathan, P. Kumar

{"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":null,"pages":null},"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}

引用次数: 43

Topology control with better radio models: implications for energy and multi-hop interference 具有更好无线电模型的拓扑控制:对能量和多跳干扰的影响

Perform. Evaluation Pub Date : 2005-10-10 DOI: 10.1145/1089444.1089491

D. Blough, M. Leoncini, G. Resta, P. Santi

{"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":null,"pages":null},"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}

引用次数: 33