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

Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000最新文献

筛选
英文 中文
Sensitivity analysis of modular dynamic fault trees 模块化动态故障树的灵敏度分析
Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000 Pub Date : 2000-03-27 DOI: 10.1109/IPDS.2000.839462
Y. Ou, J. Dugan
{"title":"Sensitivity analysis of modular dynamic fault trees","authors":"Y. Ou, J. Dugan","doi":"10.1109/IPDS.2000.839462","DOIUrl":"https://doi.org/10.1109/IPDS.2000.839462","url":null,"abstract":"Dynamic fault tree analysis, as currently supported by the Galileo software package, provides an effective means for assessing the reliability of embedded computer-based systems. Dynamic fault trees extend traditional fault trees by defining special gates to capture sequential and functional dependency characteristics. A modular approach to the solution of dynamic fault trees effectively applies Binary Decision Diagram (BOD) and Markov model solution techniques to different parts of the dynamic fault tree model. Reliability analysis of a computer-based system tells only part of the story, however. Follow-up questions such as \"Where are the weak links in the system?\", \"How do the results change if my input parameters change?\" and \"What is the most cost effective way to improve reliability?\" require a sensitivity analysis of the reliability analysis. Sensitivity analysis (often called Importance Analysis) is not a new concept, but the calculation of sensitivity measures within the modular solution methodology for dynamic and static fault trees raises some interesting issues. In this paper we address several of these issues, and present a modular technique for evaluating sensitivity, a single traversal solution to sensitivity analysis for BOD, a simplified methodology for estimating sensitivity for Markov models, and a discussion of the use of sensitivity measures in system design. The sensitivity measures for both the Binary Decision Diagram and Markov approach presented in this paper is implemented in Galileo, a software package for reliability analysis of complex computer-based systems.","PeriodicalId":162523,"journal":{"name":"Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117001781","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
Performance index based network reliability analysis with stratified sampling 基于性能指标的分层抽样网络可靠性分析
Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000 Pub Date : 2000-03-27 DOI: 10.1109/IPDS.2000.839470
L. Jereb, A. Kiss
{"title":"Performance index based network reliability analysis with stratified sampling","authors":"L. Jereb, A. Kiss","doi":"10.1109/IPDS.2000.839470","DOIUrl":"https://doi.org/10.1109/IPDS.2000.839470","url":null,"abstract":"The evolution of communication technologies results in continuously increasing capacities and higher concentration of traffic on relatively fewer network elements. In order to avoid the influence of these failures on the services provided by the network several network resilience schemes have been developed and applied in real networks. The objective of the paper is to present a reliability analysis method based on stratified sampling. The method makes it possible to derive the network performance indices even in the case of real size networks by significantly decreasing the number of necessary states. The effectiveness of the method is demonstrated with some numerical examples.","PeriodicalId":162523,"journal":{"name":"Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130182648","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
A fundamental failure model for fault-tolerant protocols 容错协议的基本失效模型
Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000 Pub Date : 2000-03-27 DOI: 10.1109/IPDS.2000.839465
K. Echtle, A. Masum
{"title":"A fundamental failure model for fault-tolerant protocols","authors":"K. Echtle, A. Masum","doi":"10.1109/IPDS.2000.839465","DOIUrl":"https://doi.org/10.1109/IPDS.2000.839465","url":null,"abstract":"The application area of distributed systems determines the extent to which protocols must provide fault detection and/or fault tolerance. Highest dependability can not be obtained without the cost of a substantial overhead. In order to reduce the message number and the time consumption, protocols should be tailored best to application requirements and system properties. This paper presents a novel failure classification as an instrument to limit fault detection and tolerance features to a reasonable failure set. Evaluation of protocols shows that just exclusion of \"exotic\" failures, which are most unlikely to occur enable a drastic increase in efficiency. Unlike other approaches, our failure classification is based on a completely functional model and on the definition of so-called failure capabilities. This overcomes the limitations of strictly hierarchic and time/value-based models. The new approach provides a framework to precisely specify common failure assumptions as well as very specialized scenarios-in particular so-called non-cooperative Byzantine failures.","PeriodicalId":162523,"journal":{"name":"Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123995645","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
Measure-adaptive state-space construction 测量自适应状态空间构造
Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000 Pub Date : 2000-03-27 DOI: 10.1109/IPDS.2000.839461
W. Douglas, Obal Ii, W. Sanders
{"title":"Measure-adaptive state-space construction","authors":"W. Douglas, Obal Ii, W. Sanders","doi":"10.1109/IPDS.2000.839461","DOIUrl":"https://doi.org/10.1109/IPDS.2000.839461","url":null,"abstract":"Measure-adaptive state-space construction is the process of exploiting symmetry in high-level model and performance measure specifications to automatically construct reduced state-space Markov models that support the evaluation of the performance measure. This paper describes a new reward variable specification technique, which, combined with recently developed state-space construction techniques, will allow us to build tools capable of measure-adaptive state-space construction. That is, these tools will automatically adapt the size of the state space to constraints derived from the system model and the user-specified reward variables. The work described in this paper extends previous work in two directions. First, standard reward variable definitions are extended to allow symmetry in the reward variable to be identified and exploited. Then, symmetric reward variables are further extended to include the set of path-based reward variables described in earlier work. In addition to the theory, several examples are introduced to demonstrate these new techniques.","PeriodicalId":162523,"journal":{"name":"Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122027027","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}
引用次数: 14
Dependability assessment of GUARDS instances 卫兵实例的可靠性评估
Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000 Pub Date : 2000-03-27 DOI: 10.1109/IPDS.2000.839474
J. Arlat, T. Jarboui, Karama Kanoun, David Powell
{"title":"Dependability assessment of GUARDS instances","authors":"J. Arlat, T. Jarboui, Karama Kanoun, David Powell","doi":"10.1109/IPDS.2000.839474","DOIUrl":"https://doi.org/10.1109/IPDS.2000.839474","url":null,"abstract":"The generic architectural concepts developed in the European ESPRIT project GUARDS (Generic Upgradable Architecture for Real time Distributed Systems) provide a comprehensive framework from which specific instances can be derived to meet the dependability requirements of various application domains. Three main application domains are considered (railway, nuclear propulsion and space) that correspond to the fields of the three end-user partners of the project. This paper presents the modeling method supporting the assessment of GUARDS instances. The goal is to assist the designers in making objective decisions for defining a specific instance of the generic architecture. After a short summary of the main architectural concepts of GUARDS, the paper describes the major assumptions concerning: i) component types (both hardware and software), ii) fault types, where special attention is paid to potentially correlated faults, and iii) the generic fault tolerance features of GUARDS. The main architectural characteristics of the target instances (one for each application domain) are briefly described. The modeling strategy is summarized and examples of models (stochastic Petri nets) are given. Selected results are then presented and discussed. They exemplify the usefulness of the modeling and evaluation method, in particular in the light of sensitivity analyses with respect to model parameters.","PeriodicalId":162523,"journal":{"name":"Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126527917","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
Correlational and distributional effects in network traffic models 网络流量模型中的相关效应和分布效应
Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000 Pub Date : 2000-03-27 DOI: 10.1109/IPDS.2000.839469
R. Geist, J. Westall
{"title":"Correlational and distributional effects in network traffic models","authors":"R. Geist, J. Westall","doi":"10.1109/IPDS.2000.839469","DOIUrl":"https://doi.org/10.1109/IPDS.2000.839469","url":null,"abstract":"Simulation studies are used to evaluate the impact of the distributional and correlational characteristics of traffic arrival processes on the performance of network routing elements. It is shown that synthetic traffic models that capture only the distributional or the correlational characteristics of real workloads can yield substantially optimistic predictions of queue lengths and drop rate. A new technique for generating synthetic arrival streams is proposed and evaluated. Arrival streams are generated by the widely-used method of sampling from a target distribution. However, the uniform stream used in the sampling is itself derived from fractional Gaussian noise. The resulting synthetic streams are shown to have sample autocorrelation functions that are consistent with long-range dependence and to provide measurably better performance estimates than standard distribution-based and FGN-based techniques.","PeriodicalId":162523,"journal":{"name":"Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128065927","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}
引用次数: 20
The impact of backoff, EIFS, and beacons on the performance of IEEE 802.11 wireless LANs 退退、EIFS和信标对IEEE 802.11无线局域网性能的影响
Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000 Pub Date : 2000-03-27 DOI: 10.1109/IPDS.2000.839468
A. Heindl, R. German
{"title":"The impact of backoff, EIFS, and beacons on the performance of IEEE 802.11 wireless LANs","authors":"A. Heindl, R. German","doi":"10.1109/IPDS.2000.839468","DOIUrl":"https://doi.org/10.1109/IPDS.2000.839468","url":null,"abstract":"In late 1997, IEEE standardized the physical layers and the medium access for wireless local area networks. This paper presents a performance study of the distributed coordination function, the fundamental contention based access mechanism. Most performance studies adopt unchecked simplifying assumptions or do not reveal all details of the simulation model. We develop a stochastic Petri net model, which captures all relevant system aspects in a concise way. Simulation allows to quantify the influence of many mandatory features of the standard on performance, especially the backoff procedure, extended interframe spaces, and the timing synchronisation function. This study also serves to identify conditions when simplifying assumptions commonly used in analytical modeling are justified.","PeriodicalId":162523,"journal":{"name":"Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116267101","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
Profiling the performance of TCP/IP on Windows NT 在Windows NT上分析TCP/IP的性能
Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000 Pub Date : 2000-03-27 DOI: 10.1109/IPDS.2000.839471
P. Xie, B. Wu, M. Liu, Jim Harris, Chris Scheiman
{"title":"Profiling the performance of TCP/IP on Windows NT","authors":"P. Xie, B. Wu, M. Liu, Jim Harris, Chris Scheiman","doi":"10.1109/IPDS.2000.839471","DOIUrl":"https://doi.org/10.1109/IPDS.2000.839471","url":null,"abstract":"This paper presents detailed network performance measurements of a prototype implementation of the TCP/IP network software on Windows NT. The measurements include latency, throughput, and CPU utilization of the protocol stack and for some key operations within the stack.","PeriodicalId":162523,"journal":{"name":"Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128571470","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
On queueing with customer impatience until the end of service 顾客不耐烦地排队直到服务结束
Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000 Pub Date : 2000-03-27 DOI: 10.1080/15326340500481804
A. Movaghar
{"title":"On queueing with customer impatience until the end of service","authors":"A. Movaghar","doi":"10.1080/15326340500481804","DOIUrl":"https://doi.org/10.1080/15326340500481804","url":null,"abstract":"We study queueing systems where customers have strict deadlines until the end of their service. An analytic method is given for the analysis of a class of such queues, namely, M(n)/M/1+G models with ordered service. These are single-server queues with state-dependent Poisson arrival process, exponential service times, FCFS service discipline, and general customer impatience. We derive a closed-form solution for the conditional probability density function of the offered sojourn time, given the number of customers in the system. This is a novel result that has not been known before. Using this result, we show how the probability measure induced by the offered sojourn time is computed and consequently how performance measures such as the probability of missing deadline and the probability of blocking are obtained. This is further illustrated through a numerical example.","PeriodicalId":162523,"journal":{"name":"Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121602051","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}
引用次数: 64
Reaching efficient fault-tolerance for cooperative applications 实现协作应用程序的高效容错
Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000 Pub Date : 2000-03-27 DOI: 10.1109/IPDS.2000.839463
P. Sobe
{"title":"Reaching efficient fault-tolerance for cooperative applications","authors":"P. Sobe","doi":"10.1109/IPDS.2000.839463","DOIUrl":"https://doi.org/10.1109/IPDS.2000.839463","url":null,"abstract":"Cooperative applications are widely used, e.g. as parallel calculations or distributed information processing systems. Whereby such applications meet the users demand and offer a performance improvement, the susceptibility to faults of any used computer node is raised. Often a single fault may cause a complete application failure. On the other hand, the redundancy in distributed systems can be utilized for fast fault detection and recovery. So, we followed an approach that is based an duplication of each application process to detect crashes and faulty functions of single computer nodes. We concentrate on two aspects of efficient fault-tolerance-fast fault detection and recovery without delaying the application progress significantly. The contribution of this work is first a new fault detecting protocol for duplicated processes. Secondly, we enhance a roll forward recovery scheme so that it is applicable to a set of cooperative processes in conformity to the protocol.","PeriodicalId":162523,"journal":{"name":"Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000","volume":"409 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132033069","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}
引用次数: 7
下一页 尾页
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学术官方微信