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

Performance最新文献

筛选
英文 中文
Fast updating scheme of forwarding tables on TCAM TCAM上转发表的快速更新方案
Performance Pub Date : 2004-11-08 DOI: 10.1109/MASCOT.2004.1348308
Weidong Wu, Bingxin Shi, Feng Wang
{"title":"Fast updating scheme of forwarding tables on TCAM","authors":"Weidong Wu, Bingxin Shi, Feng Wang","doi":"10.1109/MASCOT.2004.1348308","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348308","url":null,"abstract":"Ternary content-addressable memories (TCAMs) have become a popular hardware device for fast routing lookups. However, due to the need to keep a sorted list of entries on TCAM, the entries are moved to make free space for the new entry. The slow update is a performance bottleneck. The paper presents a TCAM-based forwarding engine that is update efficient. We analyze the hierarchy of prefixes in the routing table, and give a level-partitioning algorithm to construct the routing table in TCAM. In our scheme, the update algorithm is fast and simple, the number of movements per update depends on the inserting sequence of new prefixes and is independent of the initial prefixes. For real route update traces, the average number of movements is less than 0.01.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"81 1","pages":"522-527"},"PeriodicalIF":0.0,"publicationDate":"2004-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88531779","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
VRing: a case for building application-layer multicast rings (rather than trees) VRing:构建应用层多播环(而不是树)的案例
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348299
Ahmed Sobeih, W. Yurcik, J. Hou
{"title":"VRing: a case for building application-layer multicast rings (rather than trees)","authors":"Ahmed Sobeih, W. Yurcik, J. Hou","doi":"10.1109/MASCOT.2004.1348299","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348299","url":null,"abstract":"The paper presents the design, analysis and performance evaluation of VRing, a novel application-layer multicast (ALM) protocol that establishes a virtual ring as an overlay network among the multicast group members in a self-organizing and distributed manner. In order to reduce the routing delay of the ring overlay network, we propose to form a spare ring overlay structure that improves connectivity among group members. The design of the spare ring is justified by proposing, and analytically studying, the performance of a data delivery and duplicate suppression mechanism that makes use of both the original ring and the spare ring for forwarding data packets. We conduct simulations of both VRing and a hierarchical ALM protocol, NICE, using the J-Sim network simulator Simulation results show that, although VRing has a higher path stretch and a higher link stress than NICE, it provides less control overhead, consumes less bandwidth, and provides lower average node degree than NICE. Furthermore, VRing achieves a higher average data delivery ratio in the presence of failures than NICE. The performance improvement is especially pronounced for larger multicast groups.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"14 1","pages":"437-446"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78132331","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}
引用次数: 40
The N-burst/G/1 model with heavy-tailed service-times distribution 具有重尾服务时间分布的N-burst/G/1模型
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348190
Ronit Nossenson, H. Attiya
{"title":"The N-burst/G/1 model with heavy-tailed service-times distribution","authors":"Ronit Nossenson, H. Attiya","doi":"10.1109/MASCOT.2004.1348190","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348190","url":null,"abstract":"The paper introduces a new analytic queuing model, the N-burst/G/1 model with heavy-tailed service-time distribution, which captures many of the issues that affect Web servers as observed by empirical studies. An asymptotic calculation of the model's waiting-time distribution is presented; this relies on calculating the waiting-time distribution in the M/G/1 model with heavy-tailed service-time distribution. Finally, using real data and simulation, we verify the model's assumptions and demonstrate its accuracy.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"102 1","pages":"131-138"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79431323","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}
引用次数: 11
Disk scrubbing in large archival storage systems 大型档案存储系统中的磁盘擦除
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348296
T. Schwarz, Qin Xin, E. L. Miller, D. Long, A. Hospodor, S. Ng
{"title":"Disk scrubbing in large archival storage systems","authors":"T. Schwarz, Qin Xin, E. L. Miller, D. Long, A. Hospodor, S. Ng","doi":"10.1109/MASCOT.2004.1348296","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348296","url":null,"abstract":"Large archival storage systems experience long periods of idleness broken up by rare data accesses. In such systems, disks may remain powered off for long periods of time. These systems can lose data for a variety of reasons, including failures at both the device level and the block level. To deal with these failures, we must detect them early enough to be able to use the redundancy built into the storage system. We propose a process called \"disk scrubbing\" in a system in which drives are periodically accessed to detect drive failure. By scrubbing all of the data stored on all of the disks, we can detect block failures and compensate for them by rebuilding the affected blocks. Our research shows how the scheduling of disk scrubbing affects overall system reliability, and that \"opportunistic\" scrubbing, in which the system scrubs disks only when they are powered on for other reasons, performs very well without the need to power on disks solely to check them.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"115 1","pages":"409-418"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80364460","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}
引用次数: 156
A flexible architecture for remote server-based emulation 用于远程服务器仿真的灵活架构
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348300
Yan Gu, R. Fujimoto
{"title":"A flexible architecture for remote server-based emulation","authors":"Yan Gu, R. Fujimoto","doi":"10.1109/MASCOT.2004.1348300","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348300","url":null,"abstract":"Network emulation allows one to perform experiments in a controlled laboratory environment by applying network characteristics to live traffic. With recent advances in parallel simulation, it is becoming feasible to emulate large-scale networks at a high level of fidelity. However, high performance computing platforms are required. When such facilities are not locally available, remote computing facilities might be used. This approach is problematic, however, because of the latency introduced in the real time emulation environment to access the remote parallel machine. A distributed server-based architecture is proposed that utilizes local low-fidelity emulators to provide real-time QoS information to distributed applications, coupled with a remote high-fidelity simulator that is used to update and calibrate the local low-fidelity emulators continuously. The accuracy of this server-based emulation system is evaluated using test cases involving a worm propagation scenario.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"24 1","pages":"447-454"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87918713","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
Analysis of peer-to-peer systems: workload characterization and effects on traffic cacheability 点对点系统的分析:工作负载特征和对流量可缓存性的影响
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348186
M. Andreolini, R. Lancellotti, Philip S. Yu
{"title":"Analysis of peer-to-peer systems: workload characterization and effects on traffic cacheability","authors":"M. Andreolini, R. Lancellotti, Philip S. Yu","doi":"10.1109/MASCOT.2004.1348186","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348186","url":null,"abstract":"Peer-to-peer file sharing networks have emerged as a new popular application in the Internet scenario. We provide an analytical model of the resource size and of the contents shared at a given node. We also study the composition of the content workload hosted in the Gnutella network over time. Finally, we investigate the negative impact of oversimplified hypotheses (e.g., the use of filenames as resource identifiers) on the potentially achievable hit rate of a file-sharing cache. It is clear from our findings that file sharing traffic can be reduced by using a cache to minimize download time and network usage. The design and tuning of the cache server should take into account the presence of different resources sharing the same name and should consider push-based downloads. Failing to do so can result in reduced effectiveness of the caching mechanism.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"1 1","pages":"95-104"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83155802","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}
引用次数: 15
Performance analysis and improvement of HighSpeed TCP with TailDrop/RED routers 基于TailDrop/RED路由器的高速TCP性能分析与改进
Performance Pub Date : 2004-10-04 DOI: 10.1093/ietcom/e88-b.6.2495
Zongsheng Zhang, G. Hasegawa, M. Murata
{"title":"Performance analysis and improvement of HighSpeed TCP with TailDrop/RED routers","authors":"Zongsheng Zhang, G. Hasegawa, M. Murata","doi":"10.1093/ietcom/e88-b.6.2495","DOIUrl":"https://doi.org/10.1093/ietcom/e88-b.6.2495","url":null,"abstract":"The continuing and explosive growth of the Internet has shown that current TCP mechanisms cannot achieve efficient utilization of networks with large bandwidth-delay products. To address this problem, we propose an enhanced transport-layer protocol called gHSTCP, which is based on the HighSpeed TCP proposed by S. Floyd (see RFC 3649, 2003). By monitoring the changing trend of RTT (round trip time), gHSTCP adapts to the traffic load by switching between two congestion control modes, which is shown to provide significant performance improvement against traditional TCP Reno in terms of throughput and fairness. Furthermore, it is observed that the performance of gHSTCP is limited by both TailDrop and RED/ARED routers, thus we develop a modified adaptive RED called gARED to address the problem of simultaneous packet drops among multiple flows. By adapting to the trend in variation of the average queue length, gARED performs active queue management more effectively than ARED. Simulations show that combining gHSTCP with gARED leads to achieving utilization of network bandwidth and good fairness.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"10 1","pages":"505-512"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88729904","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}
引用次数: 18
A hysteresis model for Web/TCP transfer latency Web/TCP传输延迟的滞后模型
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348194
Yujian Li, C. Williamson
{"title":"A hysteresis model for Web/TCP transfer latency","authors":"Yujian Li, C. Williamson","doi":"10.1109/MASCOT.2004.1348194","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348194","url":null,"abstract":"The paper presents an accurate stochastic model for transfer latency of short-lived Web-like TCP flows with random packet losses. Our model characterizes a data transfer in alternating cycles, with TCP state information carried over from one cycle to the next. Simulation experiments show that our model matches simulation results for short-lived flows better than earlier TCP models, and fits long-lived TCP flows as well. Our model is then extended to estimate transfer times for CATNIP TCP, which is shown to be 5-42% faster than TCP Reno, depending on transfer size and packet loss ratio.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"34 1","pages":"167-174"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90388897","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
Structured stochastic modeling of fault-tolerant systems 容错系统的结构化随机建模
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348191
C. Bertolini, L. Brenner, Paulo Fernandes, Afonso Sales, A. Zorzo
{"title":"Structured stochastic modeling of fault-tolerant systems","authors":"C. Bertolini, L. Brenner, Paulo Fernandes, Afonso Sales, A. Zorzo","doi":"10.1109/MASCOT.2004.1348191","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348191","url":null,"abstract":"Fault-tolerant mechanisms have been increasingly used to develop safety-critical systems. Therefore, the accurate description of these mechanisms is crucial if we do not want their use to bring any kind of unexpected result due to the misinterpretation of their features. The paper presents a new way of precisely describing fault tolerant mechanisms using a formalism that has a Markovian behavior. More specifically, we describe how to apply stochastic automata networks (SAN) to describe a dependable multiparty interaction (DMI) mechanism.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"38 1","pages":"139-146"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79872064","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}
引用次数: 18
ASPEN: towards effective simulation of threads & engines in evolving platforms ASPEN:在不断发展的平台上实现线程和引擎的有效仿真
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348181
Jaideep Moses, R. Illikkal, R. Iyer, R. Huggahalli, D. Newell
{"title":"ASPEN: towards effective simulation of threads & engines in evolving platforms","authors":"Jaideep Moses, R. Illikkal, R. Iyer, R. Huggahalli, D. Newell","doi":"10.1109/MASCOT.2004.1348181","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348181","url":null,"abstract":"As platforms evolve from employing single-threaded, single-core CPUs to multi-threaded, multi-core CPUs and embedded hardware-assist engines, the simulation infrastructure required for performance analysis of these platforms becomes extremely complex. While investigating hardware/software solutions for server network acceleration (SNA), we encountered limitations of existing simulators for some of these solutions. For example, light weight threading and asynchronous memory copy solutions for SNA could not be modeled accurately and efficiently and hence we developed a flexible trace-driven simulation framework called ASPEN (architectural simulator for parallel engines). ASPEN is based on the use of rich workload traces (RWT), which capture the major events of interest during the execution of a workload on a single-threaded CPU and platform and replaying it a multi-threaded architecture with hardware-assist engines. We introduce the overall ASPEN framework and describe its usage in the context of SNA. We believe that ASPEN is a useful performance tool for future platform architects and performance analysts.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"22 1","pages":"51-58"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82420959","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}
引用次数: 13
下一页 尾页
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学术官方微信