发布求助
文献互助 智能选刊 最新文献

Performance最新文献

筛选
英文 中文
Experimental evaluation of TCP performance in multi-hop wireless ad hoc networks 多跳无线自组网中TCP性能的实验评估
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348176
Abhinav Gupta, Ian Wormsbecker, C. Williamson
{"title":"Experimental evaluation of TCP performance in multi-hop wireless ad hoc networks","authors":"Abhinav Gupta, Ian Wormsbecker, C. Williamson","doi":"10.1109/MASCOT.2004.1348176","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348176","url":null,"abstract":"The paper presents experimental measurements of TCP bulk data transfer performance in a multi-hop wireless ad hoc network environment. The paper first studies how TCP throughput is affected by AODV routing, user mobility, and the number of hops traversed in the network. The paper then studies the effectiveness of rate-based pacing (RBP) of TCP packets in improving TCP throughput. Contrary to prior simulation results in the networking literature, our measurement results show no performance advantages for RBP TCP in our experimental scenarios.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"2 1","pages":"3-11"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79595077","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}
引用次数: 60
Mining performance data from sampled event traces 从采样事件跟踪中挖掘性能数据
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348304
Ricardo Portillo, Diana Villa, P. Teller, B. Olszewski
{"title":"Mining performance data from sampled event traces","authors":"Ricardo Portillo, Diana Villa, P. Teller, B. Olszewski","doi":"10.1109/MASCOT.2004.1348304","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348304","url":null,"abstract":"The prominent role of the memory hierarchy as one of the major bottlenecks in achieving good program performance has motivated the search for ways of capturing the memory performance of an application/machine pair that is both practical in terms of time and space, yet detailed enough to gain useful and relevant information. The strategy that we endorse periodically samples events during program execution, producing an event trace that is both manageable and informative. As demonstrated, adopting this strategy, a diverse set of performance issues can be studied using the same set of traces. For example, using one set of traces and our performance evaluation framework, memory access performance, process migration, compulsory and conflict misses, and false sharing can be characterized.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"500 1","pages":"484-493"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77048683","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}
引用次数: 2
Bottlenecks identification in multiclass queueing networks using convex polytopes 基于凸多边形的多类排队网络瓶颈识别
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348242
G. Casale, G. Serazzi
{"title":"Bottlenecks identification in multiclass queueing networks using convex polytopes","authors":"G. Casale, G. Serazzi","doi":"10.1109/MASCOT.2004.1348242","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348242","url":null,"abstract":"It is known that the resources that limit the overall performance of a system are the congested ones, referred to as bottlenecks. From knowledge of bottleneck stations, it is possible, with limited computational effort, to derive asymptotic values of several performance indices. While identifying the bottleneck stations is a well-established practice under a single-class workload, no simple methodology for multiclass models exists. We present new algorithms for identifying the bottlenecks in multiclass queueing networks with constant-rate servers. We show how the application of assessed techniques, such as the ones related to convex polytopes, can provide insights on the performance of a queueing network. The application of our techniques to the asymptotic analysis of closed product-form networks is also investigated.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"163 1","pages":"223-230"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84999182","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}
引用次数: 37
Reliable response delivery in peer-to-peer systems 点对点系统中可靠的响应交付
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348298
Xiaomei Liu, Yunhao Liu, Li Xiao
{"title":"Reliable response delivery in peer-to-peer systems","authors":"Xiaomei Liu, Yunhao Liu, Li Xiao","doi":"10.1109/MASCOT.2004.1348298","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348298","url":null,"abstract":"The unstructured peer-to-peer (P2P) system is the prevalent model in today's P2P systems. In such systems, a response is sent along the same path that carried the incoming query message. To guarantee the anonymity of the requester, no requester information is included in the query message and each node in the query incoming path only knows its immediate neighbor who sent the query request. This mechanism introduces response loss when any one node or connection in the path fails, which is a general case in the P2P system due to its dynamic nature. We address the response loss problem and present three techniques to alleviate it: redundant response delivery (RRD) scheme as a proactive approach; adaptive response delivery (ARD) scheme as a reactive approach; extended ARD rendered to function in an unstructured P2P system with limited or no flooding based search mechanism. With limited traffic overhead, all three techniques reduce response loss rate by more than 65% and they are all fully distributed.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"30 1","pages":"427-434"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86861709","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
Bluetooth simulations for wireless sensor networks using GTNetS 使用GTNetS的无线传感器网络的蓝牙模拟
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348292
Xin Zhang, G. Riley
{"title":"Bluetooth simulations for wireless sensor networks using GTNetS","authors":"Xin Zhang, G. Riley","doi":"10.1109/MASCOT.2004.1348292","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348292","url":null,"abstract":"We introduce a simulation environment for wireless sensor networks using the Bluetooth wireless protocol in our Georgia Tech Network Simulator (GTNetS). Our goal is to explore the applicability of the Bluetooth protocol for wireless sensor networks. Our Bluetooth simulator implements detailed behavior of lower layers of the Bluetooth protocol stack, including baseband, LMP, L2CAP, and BNEP, with the emphasis on interference resilient and power efficient characteristics. The implementation is based on the design of GTNetS and will allow our Bluetooth simulator to be used for large-scale network simulations once an effective scatternet protocol implementation is completed. Further, our Bluetooth simulator is designed by using a strict layered model, which makes it easy to extend in order to accommodate modifications to the Bluetooth protocol or new MAC protocols for sensor networks. We present some simulation results with a simple network configuration to measure the performance of Bluetooth networks in terms of power consumption.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"95 1","pages":"375-382"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85107136","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}
引用次数: 26
Network performance of multi-service circuit switched networks: simulational comparison of variants of DAR and RTNR 多业务电路交换网络的网络性能:DAR和RTNR变体的仿真比较
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348307
Luísa Jorge, J. Craveirinha, Teresa Gomes
{"title":"Network performance of multi-service circuit switched networks: simulational comparison of variants of DAR and RTNR","authors":"Luísa Jorge, J. Craveirinha, Teresa Gomes","doi":"10.1109/MASCOT.2004.1348307","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348307","url":null,"abstract":"The use of dynamic routing methods has an important impact on the performance of multi-service networks in overload and failure conditions. The paper describes and compares the performance of variants of reference dynamic routing methods (DAR and RTNR). Two variants of DAR (dynamic alternate routing), resulting from the extension to multi-service networks of the original formulation of the method, are presented. Also, a simplification of the trunk reservation mechanism per traffic class of RTNR (real time network routing) is considered. The major results of extensive experimentation with these variants of the routing methods using a discrete event simulation platform are discussed. The simulation model includes Poisson and Engset type multi-class traffic flows. Conclusions concerning the relative performance of the methods at network level and per traffic class are put forward.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"30 1","pages":"513-521"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83624063","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
Performance evaluation of fairness-oriented active queue management schemes 面向公平性的主动队列管理方案的性能评价
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348187
M. Huggard, Mathieu Robin, Arkaitz Bitorika, Ciarán Mc Goldrick
{"title":"Performance evaluation of fairness-oriented active queue management schemes","authors":"M. Huggard, Mathieu Robin, Arkaitz Bitorika, Ciarán Mc Goldrick","doi":"10.1109/MASCOT.2004.1348187","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348187","url":null,"abstract":"Active queue management (AQM) schemes are a class of queueing algorithms designed to surmount some of the shortcomings of classic drop-tail queues in best effort networks. Most AQM algorithms are primarily designed to improve congestion control through early notification. However, significant work has been done on more advanced AQM schemes designed to protect responsive flows against unresponsive traffic. Such schemes are designed to identify and penalise unresponsive flows, which may use an unfair share of the available resources. We evaluate six algorithms through simulation-based experiments. The schemes chosen employ lightweight mechanisms for approximating fair bandwidth sharing. They are designed to be scalable and allow for incremental deployment in the current best-effort Internet infrastructure. Evaluation of their performance is effected under various network traffic conditions. The operational complexity of the schemes is also assessed.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"23 3","pages":"105-112"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72585337","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
Is TCP packet reordering always harmful? TCP包重排序总是有害的吗?
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348185
G. Neglia, V. Falletta, G. Bianchi
{"title":"Is TCP packet reordering always harmful?","authors":"G. Neglia, V. Falletta, G. Bianchi","doi":"10.1109/MASCOT.2004.1348185","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348185","url":null,"abstract":"IP networks do not provide any guarantee that packets belonging to the same flow are delivered in the correct order. Out-of-order reception of packets was commonly considered due to pathological network conditions (such as link failures, etc.). However, it has been shown that packet reordering is a phenomenon which occurs even in normal network operation, due to a number of link-level and/or router-level implementation features, such as local parallelism and load balancing. Packet reordering is intuitively considered as a negative phenomenon, which may severely affect TCP traffic performance since it is expected to cause inefficient usage of the available link bandwidth and is expected to induce bursty transmission behaviour. We show that a limited amount of reordering can, instead, improve network performance. To the best of our knowledge, this is the first claim that TCP packet reordering, rather than being harmful, may be a beneficial phenomenon in terms of overall network performance. In order to justify this, perhaps counter-intuitive, result, in addition to simulation results, we present a theoretical justification, by providing an analogy with the performance improvements experienced when TCP flows encounter a small dropping probability.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"25 1","pages":"87-94"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81011646","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
Routing in an Internet-scale network emulator internet规模网络模拟器中的路由
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348282
Jay Chen, Diwaker Gupta, K. Vishwanath, A. Snoeren, Amin Vahdat
{"title":"Routing in an Internet-scale network emulator","authors":"Jay Chen, Diwaker Gupta, K. Vishwanath, A. Snoeren, Amin Vahdat","doi":"10.1109/MASCOT.2004.1348282","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348282","url":null,"abstract":"One of the primary challenges facing scalable network emulation and simulation is the overhead of storing network-wide routing tables or computing appropriate routes on a per-packet basis. We present an approach to routing table calculation and storage based on spanning tree construction that provides an order of magnitude reduction in routing table size for Internet-like topologies. In our approach, we maintain a variable number of spanning trees for a given topology and choose the path between two hosts in each tree, choosing the shortest. We also populate offline a negative cache of actual shortest paths for source-destination pairs - typically a few percent of the total - where the lookups result in sub-optimal routes. We have implemented our technique in a popular network emulator, ModelNet, and show that our enhanced version can emulate Internet topologies 10-100 times larger than previously possible.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"1 1","pages":"275-283"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90810930","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}
引用次数: 23
Multiclass multiservers with deferred operations in layered queueing networks, with software system applications 分层排队网络中具有延迟操作的多类多服务器，具有软件系统应用
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348262
G. Franks, M. Woodside
{"title":"Multiclass multiservers with deferred operations in layered queueing networks, with software system applications","authors":"G. Franks, M. Woodside","doi":"10.1109/MASCOT.2004.1348262","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348262","url":null,"abstract":"Layered queueing networks describe the simultaneous-resource behaviour of servers that request lower-layer services and wait for them to complete. Layered software systems often follow this model, with messages to request service and receive the results. Their performance has been computed successfully using mean-value queueing approximations. Such systems also have multiservers (which model multi-threaded software processes), multiple classes of service, and what we call deferred operations or \"second phases\", which are executed after sending the reply message to the requester. Three established MVA approximations for multiclass multiservers are extended to include deferred service, and evaluated within the layered queueing context. Errors ranged from 1% up to about 15%. These servers were then used to model the network file system, as implemented on Linux, to show that the method scales up and gives good accuracy on typical systems, with computation times of a few seconds to a few minutes. This is hundreds of times faster than simulation.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"111 ","pages":"239-248"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/MASCOT.2004.1348262","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72446529","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
首页 上一页 下一页 尾页
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学术官方微信