D. Stott, Phillip H. Jones, M. Hamman, Z. Kalbarczyk, R. Iyer
{"title":"NFTAPE: networked fault tolerance and performance evaluator","authors":"D. Stott, Phillip H. Jones, M. Hamman, Z. Kalbarczyk, R. Iyer","doi":"10.1109/DSN.2002.1028964","DOIUrl":"https://doi.org/10.1109/DSN.2002.1028964","url":null,"abstract":"The NFTAPE is a software implemented, highly flexible fault injection environment for conducting automated fault/error injection-based dependability characterization. NFTAPE: (1) enables a user: (i) to specify a fault/error injection plan, (ii) to carry out injection experiments, and (iii) to collect the experimental results for analysis; (2) targets assessment of a broad set of dependability metrics, e.g., availability, reliability, coverage; (3) operates in a distributed environment; (4) can be configured to implement a variety of fault/error injection strategies and thus to serve multiple users and target systems; (5) imposes minimal disturbance of target systems.","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"10 1","pages":"542-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79091810","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}
{"title":"Formal development of an embedded verifier for Java Card byte code","authors":"Ludovic Casset, L. Burdy, Antoine Requet","doi":"10.1109/DSN.2002.1028886","DOIUrl":"https://doi.org/10.1109/DSN.2002.1028886","url":null,"abstract":"The Java security policy is implemented by security components such as the Java Virtual Machine (JVM), the API, the verifier, the loader. It is of prime importance to ensure that the implementation of these components is in accordance with their specifications. Formal methods can be used to bring the mathematical proof that the implementation of these components corresponds to their specification. In the paper, a formal development is performed on the Java Card byte code verifier using the B method. The whole Java Card language is taken into account in order to provide realistic metrics on formal development. The architecture and the tricky points of the development are presented. This formalization leads to an embeddable implementation of the byte code verifier thanks to automatic code translation from formal implementation into C code. We present the formal models, discuss the integration into the card and the results of such an experiment.","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"28 1","pages":"51-56"},"PeriodicalIF":0.0,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84559716","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}
{"title":"Measuring end-user availability on the Web: practical experience","authors":"M. Merzbacher, D. Patterson","doi":"10.1109/DSN.2002.1028932","DOIUrl":"https://doi.org/10.1109/DSN.2002.1028932","url":null,"abstract":"For service applications on a network, measuring availability, performance, and quality of service is critical. Yet traditional software and hardware measures are both inadequate and misleading. Better measures of availability that incorporate end-user experience will lead to meaningful benchmarks and progress in providing high availability services. We present the results of a series of long-term experiments that measured availability of select Web sites and services with the goal of duplicating the end-user experience. Using our measurements, we propose a new metric for availability that goes beyond the traditional sole measure of uptime.","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"47 1","pages":"473-477"},"PeriodicalIF":0.0,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85332254","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}
James C. Reynolds, J. Just, E. Lawson, L. Clough, R. Maglich, K. Levitt
{"title":"The design and implementation of an intrusion tolerant system","authors":"James C. Reynolds, J. Just, E. Lawson, L. Clough, R. Maglich, K. Levitt","doi":"10.1109/DSN.2002.1028912","DOIUrl":"https://doi.org/10.1109/DSN.2002.1028912","url":null,"abstract":"We describe the implementation of an intrusion tolerant system for providing Internet services to known users through secure connections. Network attacks are treated as maliciously devised conditions to exploit design, implementation, or configuration faults, intrusions (successful attacks) are treated as failures, and their effects are mitigated by using the three pillars of fault tolerance: detection, isolation, and recovery. Fundamental to our approach is the use of diverse process pairs, which provides partial solutions to detection and isolation problems. The architecture uses the comparison of outputs from diverse applications to provide a significant and novel intrusion detection capability. The diverse applications also strengthen isolation by forcing attacks to exploit independent vulnerabilities. The isolation of intrusions is mainly achieved with an out-of-band control system. The control system not only provides separation between the primary and backup system, it also initiates attack diagnosis, attack blocking, and recovery, which is accelerated by on-line repair.","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"30 1","pages":"285-290"},"PeriodicalIF":0.0,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85494812","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}
{"title":"Probabilistic multicast","authors":"P. Eugster, R. Guerraoui","doi":"10.1109/DSN.2002.1028915","DOIUrl":"https://doi.org/10.1109/DSN.2002.1028915","url":null,"abstract":"Gossip-based broadcast algorithms have been considered as a viable alternative to traditional deterministic reliable broadcast algorithms in large scale environments. However, these algorithms focus on broadcasting events inside a large group of processes, while the multicasting of events to a subset of processes in a group only, potentially varying for every event, has not been considered. We propose a scalable gossip-based multicast algorithm which ensures, with a high probability, that (1) a process interested in a multicast event delivers that event (just like in typical gossip-based broadcast algorithms), and that (2) a process not interested in that event does not receive it (unlike in broadcast algorithms).","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"30 1","pages":"313-322"},"PeriodicalIF":0.0,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89491396","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}
S. Bhola, R. Strom, S. Bagchi, Yuanyuan Zhao, Joshua S. Auerbach
{"title":"Exactly-once delivery in a content-based publish-subscribe system","authors":"S. Bhola, R. Strom, S. Bagchi, Yuanyuan Zhao, Joshua S. Auerbach","doi":"10.1109/DSN.2002.1028881","DOIUrl":"https://doi.org/10.1109/DSN.2002.1028881","url":null,"abstract":"This paper presents a general knowledge model for propagating information in a content-based publish-subscribe system. The model is used to derive an efficient and scalable Protocol for exactly-once delivery to large numbers (tens of thousands per broker) of content-based subscribers in either publisher order or uniform total order Our protocol allows intermediate content filtering at each hop, but requires persistent storage only at the publishing site. It is tolerant of message drops, message reorderings, node failures, and link failures, and maintains only \"soft\" state at intermediate nodes. We evaluate the performance of our implementation both under failure-free conditions and with fault injection.","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"72 1","pages":"7-16"},"PeriodicalIF":0.0,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85930601","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}
{"title":"Track-based disk logging","authors":"T. Chiueh, Lan Huang","doi":"10.1109/DSN.2002.1028928","DOIUrl":"https://doi.org/10.1109/DSN.2002.1028928","url":null,"abstract":"Disk logging is a fundamental building block for fault tolerance system design because it captures a persistent snapshot of critical system state for subsequent recovery in the occurrence of failures. Logging typically is required to be synchronous to ensure absolute recoverability. Therefore speeding up synchronous disk write is critical to those fault tolerance systems that are based on disk logging. This paper describes a novel track-based disk logging technique that is able to reduce the latency of synchronous disk writes to the minimum without compromising data integrity guarantee. As an application of track-based disk logging, we present the design and implementation of a low-write-latency disk subsystem called Trail. Through a fully operational Trail prototype, we demonstrate that Trail achieves the best known disk. logging performance record, which is close to data transfer delay plus command processing overhead. A 4 KByte disk write takes less than 1.5 msec. Based on the TPC-C benchmark, the transaction throughput of a Trail-based transaction processing system is on an average 62.9% higher-than one based on a standard disk subsystem, and the database logging-related disk I/O overhead is reduced by 42%.","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"63 1","pages":"429-438"},"PeriodicalIF":0.0,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86381985","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}
{"title":"SREPT: a tool for Software Reliability Estimation and Prediction","authors":"Kishor S. Trivedi","doi":"10.1109/DSN.2002.1028977","DOIUrl":"https://doi.org/10.1109/DSN.2002.1028977","url":null,"abstract":"Although several tools have been developed for the estimation of software reliability, they are highly specialized in the approaches they implement and the particular phase of the software life-cycle in which they are applicable. Also the conventional techniques for software reliability evaluation, which treat the software as a monolithic entity are inadequate to assess the reliability of heterogeneous systems. We present a tool called Software Reliability Estimation and Prediction Tool (SREPT) that seeks to address these limitations.","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"40 1","pages":"546-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83582449","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}
{"title":"A simple characterization of provably efficient prefetching algorithms","authors":"Wei Jin, Rakesh D. Barve, Kishor S. Trivedi","doi":"10.1109/DSN.2002.1029003","DOIUrl":"https://doi.org/10.1109/DSN.2002.1029003","url":null,"abstract":"We characterize a broad class C of prefetching algorithms and prove that, for any prefetching algorithm in this class, its total elapsed time is no more than twice the smallest possible total elapsed time. This result provides a performance guarantee for several practical prefetching algorithms, which fall into this class and have no previously proven performance bound. Prefetching involves making two fundamental decisions: when to begin a prefetch operation and which page to replace. Provably optimal prefetching algorithms are rendered impractical because of complicated techniques to decide when to issue prefetches. However, a class C algorithm only has to obey certain simple (previously known) guidelines governing these decisions. The performance guarantee for this class strongly relies on the optimal replacement requirement, and this suggests that more so than the decision of when to start prefetching the next missing page, the replacement decision remains the most important decision to be made in prefetching algorithms.","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"67 1","pages":"571-580"},"PeriodicalIF":0.0,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79536600","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}
{"title":"Test and development process retrospective - a case study using ODC triggers","authors":"R. Chillarege, K. R. Prasad","doi":"10.1109/DSN.2002.1029012","DOIUrl":"https://doi.org/10.1109/DSN.2002.1029012","url":null,"abstract":"We present a case study of a product development retrospective analysis conducted to gain an understanding of the test and development process effectiveness. Orthogonal Defect Classification (ODC) is used as an analysis method to gain insight beyond what classical qualitative analysis would yield for the probable cause of delays during test. 1. ODC Trigger analysis provides the insight to understand the degree of blockage in test, probable cause, and consequences to the test and development process. 2. Trigger distribution changes with respect to time shows the stabilization of the product, and variation among components shows the systemic nature of issues. 3. The study makes nine specific inferences and recommendations based on these analyses to guide the engineering of future releases.","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"10 1","pages":"669-678"},"PeriodicalIF":0.0,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84607817","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}