The paper describes the reliability microkernel framework (RMK), a loadable kernel module for providing application-aware reliability and dynamically configuring reliability mechanisms installed in RMK. The RMK prototype is implemented in Linux and supports detection of application/OS failures and transparent application checkpointing. Experiment results show that the OS hang detection, which exploits characteristics of application and system behavior, can achieve high coverage (100% in our experiments) and low false positive rate. Moreover, the performance overhead is negligible because instruction counting is performed in hardware
{"title":"An OS-level Framework for Providing Application-Aware Reliability","authors":"Long Wang, Z. Kalbarczyk, W. Gu, R. Iyer","doi":"10.1109/PRDC.2006.19","DOIUrl":"https://doi.org/10.1109/PRDC.2006.19","url":null,"abstract":"The paper describes the reliability microkernel framework (RMK), a loadable kernel module for providing application-aware reliability and dynamically configuring reliability mechanisms installed in RMK. The RMK prototype is implemented in Linux and supports detection of application/OS failures and transparent application checkpointing. Experiment results show that the OS hang detection, which exploits characteristics of application and system behavior, can achieve high coverage (100% in our experiments) and low false positive rate. Moreover, the performance overhead is negligible because instruction counting is performed in hardware","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129438583","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}
J. Grov, L. Soares, A. Correia, J. Pereira, R. Oliveira, F. Pedone
Multi-master update everywhere database replication, as achieved by protocols based on group communication such as DBSM and Postgres-R, addresses both performance and availability. By scaling it to wide area networks, one could save costly bandwidth and avoid large round-trips to a distant master server. Also, by ensuring that updates are safely stored at a remote site within transaction boundaries, disaster recovery is guaranteed. Unfortunately, scaling existing cluster based replication protocols is troublesome. In this paper we present a database replication protocol based on group communication that targets interconnected clusters. In contrast with previous proposals, it uses a separate multicast group for each cluster and thus does not impose any additional requirements on group communication, easing implementation and deployment in a real setting. Nonetheless, the protocol ensures one-copy equivalence while allowing all sites to execute update transactions. Experimental evaluation using the workload of the industry standard TPC-C benchmark confirms the advantages of the approach
{"title":"A Pragmatic Protocol for Database Replication in Interconnected Clusters","authors":"J. Grov, L. Soares, A. Correia, J. Pereira, R. Oliveira, F. Pedone","doi":"10.1109/PRDC.2006.11","DOIUrl":"https://doi.org/10.1109/PRDC.2006.11","url":null,"abstract":"Multi-master update everywhere database replication, as achieved by protocols based on group communication such as DBSM and Postgres-R, addresses both performance and availability. By scaling it to wide area networks, one could save costly bandwidth and avoid large round-trips to a distant master server. Also, by ensuring that updates are safely stored at a remote site within transaction boundaries, disaster recovery is guaranteed. Unfortunately, scaling existing cluster based replication protocols is troublesome. In this paper we present a database replication protocol based on group communication that targets interconnected clusters. In contrast with previous proposals, it uses a separate multicast group for each cluster and thus does not impose any additional requirements on group communication, easing implementation and deployment in a real setting. Nonetheless, the protocol ensures one-copy equivalence while allowing all sites to execute update transactions. Experimental evaluation using the workload of the industry standard TPC-C benchmark confirms the advantages of the approach","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123142242","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}
An issue when using the RSA public-key system is that for reasonable levels of security, both the public key and the private key must be quite large. Since few people are capable of memorizing a 1024-bit private key, most people must store this number on a computer hard drive or other digital storage device. There are (at least) three problems with this; the first is that if your computer is even temporarily compromised, your private key could be stolen. The second is that if you are away from your computer (and don't have your key on a portable storage device) but need your private key to access some resource, you are unable to do so. The third is that your key could be irrevocably lost because of hardware problems. This paper describes a way of generating a public/private RSA key pair from a passphrase to overcome these problems. Although the paper's focus is on the generation of RSA keys, the process can be applied to any cryptosystem (symmetric or asymmetric) which relies on random data for generating keys
{"title":"Storing RSA Private Keys In Your Head","authors":"Taisya Krivoruchko, J. Diamond, J. Hooper","doi":"10.1109/PRDC.2006.58","DOIUrl":"https://doi.org/10.1109/PRDC.2006.58","url":null,"abstract":"An issue when using the RSA public-key system is that for reasonable levels of security, both the public key and the private key must be quite large. Since few people are capable of memorizing a 1024-bit private key, most people must store this number on a computer hard drive or other digital storage device. There are (at least) three problems with this; the first is that if your computer is even temporarily compromised, your private key could be stolen. The second is that if you are away from your computer (and don't have your key on a portable storage device) but need your private key to access some resource, you are unable to do so. The third is that your key could be irrevocably lost because of hardware problems. This paper describes a way of generating a public/private RSA key pair from a passphrase to overcome these problems. Although the paper's focus is on the generation of RSA keys, the process can be applied to any cryptosystem (symmetric or asymmetric) which relies on random data for generating keys","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134171076","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}
Multimedia streaming over wireless network faces the problem of low-bandwidth data transmission in an error prone environment. Furthermore, due to the frame dependency exploited by the video coding schemes, packet loss could degrade the perceptual quality of the media streams. In this paper, we design and implement a group-of-pictures (GOP) based video packet interleaving technique to reduce the impact of bursty packet losses. At the server side of our system, the packets of B or P frames are interleaved into the packets of a single I frame. At the client side, the de-interleaving method is developed based on the RTP timestamp of RTP header. We also apply the technique to the MPEG-4 video codec in the streaming system and integrate its error resilient tools - video packet, data partition, and RVLC, to increase the performance of GOP based video packet interleaving technique. From the experiment results, we show that our technique improves the perceptual quality better than the classic scheme does
{"title":"Reliable Video Transmission Techniques for Wireless MPEG-4 Streaming Systems","authors":"Sheng-Tzong Cheng, Jianrui Lin","doi":"10.1109/PRDC.2006.53","DOIUrl":"https://doi.org/10.1109/PRDC.2006.53","url":null,"abstract":"Multimedia streaming over wireless network faces the problem of low-bandwidth data transmission in an error prone environment. Furthermore, due to the frame dependency exploited by the video coding schemes, packet loss could degrade the perceptual quality of the media streams. In this paper, we design and implement a group-of-pictures (GOP) based video packet interleaving technique to reduce the impact of bursty packet losses. At the server side of our system, the packets of B or P frames are interleaved into the packets of a single I frame. At the client side, the de-interleaving method is developed based on the RTP timestamp of RTP header. We also apply the technique to the MPEG-4 video codec in the streaming system and integrate its error resilient tools - video packet, data partition, and RVLC, to increase the performance of GOP based video packet interleaving technique. From the experiment results, we show that our technique improves the perceptual quality better than the classic scheme does","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134544629","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}
Yao-Hsin Chou, I. Tsai, Chien-Ming Ko, S. Kuo, Ing-Yi Chen
Quantum entanglement is a phenomenon available only at nanometer scale. In this paper, we show how quantum entanglement can be used to build cryptographic primitives such as oblivious transfer. In addition to studying the protocol itself, we also show how to realize some applications based on our proposal. These include typical e-business applications such as contract signing, certified mail, simultaneous secret exchange, secure transaction and remote coin flip. Unlike classical oblivious transfer, the security of this protocol is based on physical laws, instead of any unproven mathematic conjecture. As a result, our proposal provides unconditional security for e-business
{"title":"Quantum Oblivious Transfer and Fair Digital Transactions","authors":"Yao-Hsin Chou, I. Tsai, Chien-Ming Ko, S. Kuo, Ing-Yi Chen","doi":"10.1109/PRDC.2006.51","DOIUrl":"https://doi.org/10.1109/PRDC.2006.51","url":null,"abstract":"Quantum entanglement is a phenomenon available only at nanometer scale. In this paper, we show how quantum entanglement can be used to build cryptographic primitives such as oblivious transfer. In addition to studying the protocol itself, we also show how to realize some applications based on our proposal. These include typical e-business applications such as contract signing, certified mail, simultaneous secret exchange, secure transaction and remote coin flip. Unlike classical oblivious transfer, the security of this protocol is based on physical laws, instead of any unproven mathematic conjecture. As a result, our proposal provides unconditional security for e-business","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114483339","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}
Memory leaks are known to be a major cause of reliability and performance issues in software. This paper describes a run-time scheme that detects and removes memory leaks with minimal performance overhead and with no modifications to application source code. The scheme consists of a first stage where a pattern recognition technique proactively detects subtle memory leaks, followed by a more resource-intensive second stage that scans the memory space of an application and removes detected memory leaks. The pattern recognition technique in the first stage is based on the multivariate state estimation technique (MSET) which provides accurate detection of subtle memory leaks with very little overhead. The second stage is only activated when problems are identified by the first stage. For our prototype, this second stage is based on debugging and analysis tools provided by Solaris 10. Due to the low-overhead impact of the first stage, the system can be monitored for memory leaks without incurring noticeable performance degradation. We present and discuss some results from our unique proactive detection and debugging methodology
{"title":"Low-Overhead Run-Time Memory Leak Detection and Recovery","authors":"Timothy Tsai, K. Vaidyanathan, K. Gross","doi":"10.1109/PRDC.2006.42","DOIUrl":"https://doi.org/10.1109/PRDC.2006.42","url":null,"abstract":"Memory leaks are known to be a major cause of reliability and performance issues in software. This paper describes a run-time scheme that detects and removes memory leaks with minimal performance overhead and with no modifications to application source code. The scheme consists of a first stage where a pattern recognition technique proactively detects subtle memory leaks, followed by a more resource-intensive second stage that scans the memory space of an application and removes detected memory leaks. The pattern recognition technique in the first stage is based on the multivariate state estimation technique (MSET) which provides accurate detection of subtle memory leaks with very little overhead. The second stage is only activated when problems are identified by the first stage. For our prototype, this second stage is based on debugging and analysis tools provided by Solaris 10. Due to the low-overhead impact of the first stage, the system can be monitored for memory leaks without incurring noticeable performance degradation. We present and discuss some results from our unique proactive detection and debugging methodology","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116274338","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}
The paper addresses the cost of consensus algorithms. It has been shown that in the best case, consensus can be solved in two communication steps with f
本文讨论了共识算法的成本。结果表明，在最佳情况下，协商一致可以在f
{"title":"Improving Fast Paxos: being optimistic with no overhead","authors":"Bernadette Charron-Bost, A. Schiper","doi":"10.1109/PRDC.2006.39","DOIUrl":"https://doi.org/10.1109/PRDC.2006.39","url":null,"abstract":"The paper addresses the cost of consensus algorithms. It has been shown that in the best case, consensus can be solved in two communication steps with f<n/2, and in one communication step with f<n/3 (f is the maximum number of faulty processes). This leads to a dilemma when choosing a consensus algorithm: greater efficiency or higher resiliency degree. Recently Lamport has proposed a solution called Fast Paxos, for partly escaping from this dilemma. The idea is to combine two types of rounds in a single consensus algorithm: fast rounds and rounds of the ordinary Paxos algorithm. In the best case, Fast Paxos solves consensus in one fast round, that is it requires only one communication step. Unfortunately, the combination induces some time overhead, and so Fast Paxos becomes more expensive than ordinary Paxos when fast rounds do not succeed. In this paper we go one step further: we show that it is possible to tentatively execute a fast round before a classical round without any time overhead if the fast round does not succeed","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122733495","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}
Automated diagnosis of software faults can improve the efficiency of the debugging process, and is therefore an important technique for the development of dependable software. In this paper we study different similarity coefficients that are applied in the context of a program spectral approach to software fault localization (single programming mistakes). The coefficients studied are taken from the systems diagnosis/automated debugging tools Pinpoint, Tarantula, and AMPLE, and from the molecular biology domain (the Ochiai coefficient). We evaluate these coefficients on the Siemens Suite of benchmark faults, and assess their effectiveness in terms of the position of the actual fault in the probability ranking of fault candidates produced by the diagnosis technique. Our experiments indicate that the Ochiai coefficient consistently outperforms the coefficients currently used by the tools mentioned. In terms of the amount of code that needs to be inspected, this coefficient improves 5% on average over the next best technique, and up to 30% in specific cases
{"title":"An Evaluation of Similarity Coefficients for Software Fault Localization","authors":"Rui Abreu, P. Zoeteweij, A. V. Gemund","doi":"10.1109/PRDC.2006.18","DOIUrl":"https://doi.org/10.1109/PRDC.2006.18","url":null,"abstract":"Automated diagnosis of software faults can improve the efficiency of the debugging process, and is therefore an important technique for the development of dependable software. In this paper we study different similarity coefficients that are applied in the context of a program spectral approach to software fault localization (single programming mistakes). The coefficients studied are taken from the systems diagnosis/automated debugging tools Pinpoint, Tarantula, and AMPLE, and from the molecular biology domain (the Ochiai coefficient). We evaluate these coefficients on the Siemens Suite of benchmark faults, and assess their effectiveness in terms of the position of the actual fault in the probability ranking of fault candidates produced by the diagnosis technique. Our experiments indicate that the Ochiai coefficient consistently outperforms the coefficients currently used by the tools mentioned. In terms of the amount of code that needs to be inspected, this coefficient improves 5% on average over the next best technique, and up to 30% in specific cases","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129769707","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}
IT-security has become a much diversified field and small and medium sized enterprises (SMEs), in particular, do not have the financial ability to implement a holistic IT-security approach. We thus propose a security ontology, to provide a solid base for an applicable and holistic IT-security approach for SMEs, enabling low-cost risk management and threat analysis
{"title":"Ontology based IT-security planning","authors":"Stefan Fenz, E. Weippl","doi":"10.1109/PRDC.2006.49","DOIUrl":"https://doi.org/10.1109/PRDC.2006.49","url":null,"abstract":"IT-security has become a much diversified field and small and medium sized enterprises (SMEs), in particular, do not have the financial ability to implement a holistic IT-security approach. We thus propose a security ontology, to provide a solid base for an applicable and holistic IT-security approach for SMEs, enabling low-cost risk management and threat analysis","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133649674","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}
It is well-known that, in an asynchronous system where processes are prone to crash, it is impossible to design a protocol that provides each process with the set of processes that are currently alive. Basically, this comes from the fact that it is impossible to distinguish a crashed process from a process that is very slow or with which communications are very slow. Nevertheless, designing protocols that provide the processes with good approximations of the set of processes that are currently alive remains a real challenge in fault-tolerant distributed computing. This paper proposes such a protocol. To that end, it considers a realistic computation model where the processes are provided with non-synchronized local clocks and a function alpha(). That function takes a local duration as a parameter, and returns an integer that is an estimate of the number of processes that can crash during that duration. A simulation-based experimental evaluation of the protocol is also presented. The experiments show that the protocol is practically relevant
{"title":"On the fly estimation of the processes that are alive/crashed in an asynchronous message-passing system","authors":"A. Mostéfaoui, M. Raynal, Gilles Trédan","doi":"10.1109/PRDC.2006.48","DOIUrl":"https://doi.org/10.1109/PRDC.2006.48","url":null,"abstract":"It is well-known that, in an asynchronous system where processes are prone to crash, it is impossible to design a protocol that provides each process with the set of processes that are currently alive. Basically, this comes from the fact that it is impossible to distinguish a crashed process from a process that is very slow or with which communications are very slow. Nevertheless, designing protocols that provide the processes with good approximations of the set of processes that are currently alive remains a real challenge in fault-tolerant distributed computing. This paper proposes such a protocol. To that end, it considers a realistic computation model where the processes are provided with non-synchronized local clocks and a function alpha(). That function takes a local duration as a parameter, and returns an integer that is an estimate of the number of processes that can crash during that duration. A simulation-based experimental evaluation of the protocol is also presented. The experiments show that the protocol is practically relevant","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132086294","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：