International Conference on Dependable Systems and Networks, 2004最新文献

筛选
英文 中文
Workshop on fault diagnosis and tolerance in cryptography 密码学中的故障诊断和容错研讨会
International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311963
L. Breveglieri, I. Koren
{"title":"Workshop on fault diagnosis and tolerance in cryptography","authors":"L. Breveglieri, I. Koren","doi":"10.1109/DSN.2004.1311963","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311963","url":null,"abstract":"Cryptographic devices are becoming increasingly ubiquitous and complex, making reliability an important design objective. Moreover, the diffusion of mobile, low-price consumer electronic equipment containing cryptographic components makes them more vulnerable to attack procedures, in particular to those based on injection of faults. This workshop aims at providing researchers in both the dependability and cryptography communities an opportunity to start bridging the gap between fault diagnosis and tolerance techniques, and cryptography.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128182712","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}
引用次数: 94
An SLA-oriented capacity planning tool for streaming media services 面向sla的流媒体服务容量规划工具
International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311945
L. Cherkasova, Wenting Tang, S. Singhal
{"title":"An SLA-oriented capacity planning tool for streaming media services","authors":"L. Cherkasova, Wenting Tang, S. Singhal","doi":"10.1109/DSN.2004.1311945","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311945","url":null,"abstract":"This paper addresses the problem of mapping the requirements of a known media service workload into the corresponding system resource requirements and accurately sizing a media server cluster to handle the workload. In this paper, we propose a new capacity planning framework for evaluating the resources needed for processing a given streaming media workload with specified performance requirements. The performance requirements are specified in a service level agreement (SLA) containing: i) basic capacity requirements that define the percentage of time the configuration is capable of processing the workload without performance degradation while satisfying bounds on system utilization; and ii) performability requirements that define the acceptable degradation of service performance during the remaining, non-compliant time and in case of node failures. Using a set of specially benchmarked media server configurations, the capacity planning tool matches the overall capacity requirements of the media service workload profile with the specified SLAs to identify the number of nodes necessary to support the required service performance.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114862793","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}
引用次数: 25
Cheap Paxos 便宜的帕克索斯
International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311900
L. Lamport, M. Massa
{"title":"Cheap Paxos","authors":"L. Lamport, M. Massa","doi":"10.1109/DSN.2004.1311900","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311900","url":null,"abstract":"Asynchronous algorithms for implementing a fault-tolerant distributed system, which can make progress despite the failure of any F processors, require 2F + 1 processors. Cheap Paxos, a variant of the Paxos algorithm, guarantees liveness under the additional assumption that the set of nonfaulty processors does not \"jump around\" too fast, but uses only F + 1 main processors that actually execute the system and F auxiliary processors that are used only to handle the failure of a main processor. The auxiliary processors take part in reconfiguring the system to remove the failed processor, after which they can remain idle until another main processor fails.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"659 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134121013","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}
引用次数: 144
Analysis of second-order Markov reward models 二阶马尔可夫奖励模型分析
International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311955
G. Horváth, Sándor Rácz, M. Telek
{"title":"Analysis of second-order Markov reward models","authors":"G. Horváth, Sándor Rácz, M. Telek","doi":"10.1109/DSN.2004.1311955","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311955","url":null,"abstract":"This paper considers the analysis of second-order Markov reward models. In these systems the reward accumulation during state sojourns is not deterministic, but follows a Brownian motion with a state dependent drift and variance parameter. We give the differential equations that describe the density function and the moments of the accumulated reward, and show the similarities compared to the first-order (ordinary) case. A randomization based numerical method is also presented which is numerically stable, has an error bound to control the precision, and allows the efficient analysis of large models. The computational cost of the proposed procedure is practically the same as the one of the analysis of first-order reward models, while the modeling power of second-order models is clearly larger.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134259400","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}
引用次数: 10
Data-aware multicast 数据感知多播
International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311893
Sébastien Baehni, P. Eugster, R. Guerraoui
{"title":"Data-aware multicast","authors":"Sébastien Baehni, P. Eugster, R. Guerraoui","doi":"10.1109/DSN.2004.1311893","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311893","url":null,"abstract":"This paper presents a multicast algorithm for peer-to-peer dissemination of events in a distributed topic-based publish-subscribe system, where processes publish events of certain topics, organized in a hierarchy, and expect events of topics they subscribed to. Our algorithm is \"data-aware\" in the sense that it exploits information about process subscriptions and topic inclusion relationships to build dynamic groups of processes and efficiently manage the flow of information within and between these process groups. This \"data-awareness\" helps limit the membership information that each process needs to maintain and preserves processes from receiving messages related to topics they have not subscribed to. It also provides the application with means to control, for each topic in a hierarchy, the trade-off between the message complexity and the reliability of event dissemination. We convey this trade-off through both analysis and simulation.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124465824","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}
引用次数: 73
Fault diversity among off-the-shelf SQL database servers 现成SQL数据库服务器之间的故障多样性
International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311908
Ilir Gashi, P. Popov, L. Strigini
{"title":"Fault diversity among off-the-shelf SQL database servers","authors":"Ilir Gashi, P. Popov, L. Strigini","doi":"10.1109/DSN.2004.1311908","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311908","url":null,"abstract":"Fault tolerance is often the only viable way of obtaining the required system dependability from systems built out of \"off-the-shelf\" (OTS) products. We have studied a sample of bug reports from four off-the-shelf SQL servers so as to estimate the possible advantages of software fault tolerance - in the form of modular redundancy with diversity - in complex off-the-shelf software. We checked whether these bugs would cause coincident failures in more than one of the servers. We found that very few bugs affected two of the four servers, and none caused failures in more than two. We also found that only four of these bugs would cause identical, undetectable failures in two servers. Therefore, a fault-tolerant server, built with diverse off-the-shelf servers, seems to have a good chance of delivering improvements in availability and failure rates compared with the individual off-the-shelf servers or their replicated, nondiverse configurations.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123088213","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}
引用次数: 25
An efficient algorithm for the transient analysis of a class of deterministic stochastic Petri nets 一类确定性随机Petri网暂态分析的有效算法
International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311954
M. Gribaudo, M. Sereno
{"title":"An efficient algorithm for the transient analysis of a class of deterministic stochastic Petri nets","authors":"M. Gribaudo, M. Sereno","doi":"10.1109/DSN.2004.1311954","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311954","url":null,"abstract":"In this paper a new algorithm for the transient solution of a sub-class of deterministic stochastic Petri nets (DSPN) is proposed. The technique can be applied to DSPNs comprising only deterministic and immediate transitions and such that in each tangible marking only one deterministic transition is enabled. The algorithm does not require any additional restriction on the deterministic transition delays that can have any positive real value. Most of the optimized algorithms presented in the literature are based on an efficient solution of the equations governing the stochastic process associated with the DSPN; the new algorithm we propose is based on an efficient combinatorial analysis of the paths within the state space underlying the DSPN, instead.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132184294","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
The impact of technology scaling on lifetime reliability 技术规模对寿命可靠性的影响
International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311888
Jayanth Srinivasan, S. Adve, P. Bose, J. Rivers
{"title":"The impact of technology scaling on lifetime reliability","authors":"Jayanth Srinivasan, S. Adve, P. Bose, J. Rivers","doi":"10.1109/DSN.2004.1311888","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311888","url":null,"abstract":"The relentless scaling of CMOS technology has provided a steady increase in processor performance for the past three decades. However, increased power densities (hence temperatures) and other scaling effects have an adverse impact on long-term processor lifetime reliability. This paper represents a first attempt at quantifying the impact of scaling on lifetime reliability due to intrinsic hard errors, taking workload characteristics into consideration. For our quantitative evaluation, we use RAMP (Srinivasan et al., 2004), a previously proposed industrial-strength model that provides reliability estimates for a workload, but for a given technology. We extend RAMP by adding scaling specific parameters to enable workload-dependent lifetime reliability evaluation at different technologies. We show that (1) scaling has a significant impact on processor hard failure rates - on average, with SPEC benchmarks, we find the failure rate of a scaled 65nm processor to be 316% higher than a similarly pipelined 180nm processor; (2) time-dependent dielectric breakdown and electromigration have the largest increases; and (3) with scaling, the difference in reliability from running at worst-case vs. typical workload operating conditions increases significantly, as does the difference from running different workloads. Our results imply that leveraging a single microarchitecture design for multiple remaps across a few technology generations will become increasingly difficult, and motivate a need for workload specific, microarchitectural lifetime reliability awareness at an early design stage.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"125 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128703256","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}
引用次数: 611
On failure dependent protection in optical grooming networks 光梳理网络中故障相关保护的研究
International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311917
S. Ramasubramanian
{"title":"On failure dependent protection in optical grooming networks","authors":"S. Ramasubramanian","doi":"10.1109/DSN.2004.1311917","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311917","url":null,"abstract":"Resiliency to link failures in optical networks is becoming increasingly important due to the increasing data rate in the fiber. Path protection schemes attempt to guarantee a backup path for a connection upon a failure in the network, thereby reducing the recovery time for a connection. In this paper, we develop a failure dependent path protection scheme that dynamically assigns a primary path and backup paths, one for each failure that would affect the primary path. A connection established on the primary path will be re-established on its backup path only if a failure in the network affects the connection. We evaluate the performance of our developed protocol and compare with an alternative approach based on sub-graph routing that achieves high network utilization and low blocking probability at the cost of re-establishing connections even if the failure in the network does not affect the primary path of the connection. We observe that up to a factor of eight reduction in the number of reconfiguration scenarios is achieved with less than 10% reduction in effective network utilization and less than 3% reduction in fairness metrics for tolerating any single link failure in NSFNET and ARPA-2 networks. The failure dependent protection approach developed in this paper is also applicable to any general failure scenarios that are modeled as shared risk link group failures.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131039713","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}
引用次数: 19
Analyses of the reverse path forwarding routing algorithm 反向路径转发路由算法分析
International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311918
C. Marr, G. Lowe
{"title":"Analyses of the reverse path forwarding routing algorithm","authors":"C. Marr, G. Lowe","doi":"10.1109/DSN.2004.1311918","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311918","url":null,"abstract":"The reverse path forwarding algorithm is a protocol for distributing messages throughout networks. The intention is to preserve correctness - messages sent will eventually be received by all nodes in the originator's connected component - whilst minimising the number of propagations of each message. We use a variety of analysis techniques to identify necessary additional constraints, and to prove correctness under these conditions. In particular we present counter examples found by the model-checkers FDR and the Alloy Analyzer, illustrating that the protocol is incorrect if the cost of links is dependent upon the node using that link. We then consider the case where the cost of links is independent of the node using that link; we use a special-purpose network sampling program to increase confidence in the correctness of this stricter protocol, and then perform a hand-proof to verify correctness. We conclude with a discussion of the suitability of these techniques for reasoning about protocols of this complexity.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125434916","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}
引用次数: 17
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学术官方微信