S. Katsunuma, H. Kurita, Ryota Shioya, Kazuto Shimizu, H. Irie, M. Goshima, S. Sakai
Vulnerabilities such as buffer overflows exist in some programs, and such vulnerabilities are susceptible to address injection attacks. The input data tracking method, which was proposed before, prevents I-data, which are the data derived from the input data, being used as addresses. However, the rules to determine address injection attacks are vague, which produces many false-positives and false-negatives in detection results. Generally, the data used as an address consist of a base address and an address offset. We propose an architectural technique to prevent I-data overwriting B-data, which are the data used as base addresses in this paper. It dynamically recognizes the I-data and the B-data. Address injection is detected if I-data that are not B-data are used as addresses. We implemented the proposed technique on a Pentium-based Bochs emulator and investigated its detection capability. We believe that the technique is the most accurate injection detection technique proposed thus far
{"title":"Base Address Recognition with Data Flow Tracking for Injection Attack Detection","authors":"S. Katsunuma, H. Kurita, Ryota Shioya, Kazuto Shimizu, H. Irie, M. Goshima, S. Sakai","doi":"10.1109/PRDC.2006.22","DOIUrl":"https://doi.org/10.1109/PRDC.2006.22","url":null,"abstract":"Vulnerabilities such as buffer overflows exist in some programs, and such vulnerabilities are susceptible to address injection attacks. The input data tracking method, which was proposed before, prevents I-data, which are the data derived from the input data, being used as addresses. However, the rules to determine address injection attacks are vague, which produces many false-positives and false-negatives in detection results. Generally, the data used as an address consist of a base address and an address offset. We propose an architectural technique to prevent I-data overwriting B-data, which are the data used as base addresses in this paper. It dynamically recognizes the I-data and the B-data. Address injection is detected if I-data that are not B-data are used as addresses. We implemented the proposed technique on a Pentium-based Bochs emulator and investigated its detection capability. We believe that the technique is the most accurate injection detection technique proposed thus far","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"48 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":"121693507","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}
A fundamental problem in peer-to-peer streaming is how to select peers with desired media data so that the best possible streaming quality can be maintained. In this paper, we propose an outbound bandwidth based streaming model in which peers are layered according to their offered outbound bandwidth and are permitted to request data of peers from upper layers peers only. Based on the layered approach, a media data assignment algorithm for the subset of media data is presented to select qualified sending peers to ensure that they are received before their scheduled playback time. We also present two resolutions for request conflicts, which arise when there are more than one peer simultaneously requesting data from the same sending peer that can't afford outbound bandwidth for all requests. We evaluated the proposed streaming model through simulations. Experimental results show that streaming quality of the proposed streaming model is excellent and the properties of scalability as well as robustness are obtained even in a highly dynamic environment where peers join and leave frequently
{"title":"A Dependable Outbound Bandwidth Based Approach for Peer to Peer Media Streaming","authors":"Z. Huang, Sheng-de Wang","doi":"10.1109/PRDC.2006.6","DOIUrl":"https://doi.org/10.1109/PRDC.2006.6","url":null,"abstract":"A fundamental problem in peer-to-peer streaming is how to select peers with desired media data so that the best possible streaming quality can be maintained. In this paper, we propose an outbound bandwidth based streaming model in which peers are layered according to their offered outbound bandwidth and are permitted to request data of peers from upper layers peers only. Based on the layered approach, a media data assignment algorithm for the subset of media data is presented to select qualified sending peers to ensure that they are received before their scheduled playback time. We also present two resolutions for request conflicts, which arise when there are more than one peer simultaneously requesting data from the same sending peer that can't afford outbound bandwidth for all requests. We evaluated the proposed streaming model through simulations. Experimental results show that streaming quality of the proposed streaming model is excellent and the properties of scalability as well as robustness are obtained even in a highly dynamic environment where peers join and leave frequently","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"18 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":"125153426","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}
In this paper, a new scenario for tolerating interaction faults is presented. We also address the problem of designing a system capable of tolerating interaction faults generated by the other system. The scenario and other concepts defined in this paper were discussed with more detail. A system is defined as a pair of sub-systems that use a communication standard to interact. Interaction occurs with the exchange of a sequence of messages, each containing a set of data fields. The system that can exhibit faulty behavior is called the external unit. The other system, which is designed to tolerate faults, is the adaptable unit
{"title":"A Scenario of Tolerating Interaction Faults Between Otherwise Correct Systems","authors":"B. Nassu, T. Nanya","doi":"10.1109/PRDC.2006.13","DOIUrl":"https://doi.org/10.1109/PRDC.2006.13","url":null,"abstract":"In this paper, a new scenario for tolerating interaction faults is presented. We also address the problem of designing a system capable of tolerating interaction faults generated by the other system. The scenario and other concepts defined in this paper were discussed with more detail. A system is defined as a pair of sub-systems that use a communication standard to interact. Interaction occurs with the exchange of a sequence of messages, each containing a set of data fields. The system that can exhibit faulty behavior is called the external unit. The other system, which is designed to tolerate faults, is the adaptable unit","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"77 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":"117234393","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}
We propose a database transaction management framework that enables a database replication function to be added to existing cluster systems. This framework is generally applicable to various database products merely by replacing the database connection API library. In this framework, the enhanced database connection API library duplicates the transactions issued by clustered applications and issues them to the primary and backup databases while controlling the issue order for consistency between the two databases. We implemented the proposed framework on a database connection API library for Java and confirmed that the overhead caused by duplication and order control was smaller than the existing replication method's overhead
{"title":"Database Transaction Management for High-Availability Cluster System","authors":"K. Fujiyama, N. Nakamura, Ryuichi Hiraike","doi":"10.1109/PRDC.2006.23","DOIUrl":"https://doi.org/10.1109/PRDC.2006.23","url":null,"abstract":"We propose a database transaction management framework that enables a database replication function to be added to existing cluster systems. This framework is generally applicable to various database products merely by replacing the database connection API library. In this framework, the enhanced database connection API library duplicates the transactions issued by clustered applications and issues them to the primary and backup databases while controlling the issue order for consistency between the two databases. We implemented the proposed framework on a database connection API library for Java and confirmed that the overhead caused by duplication and order control was smaller than the existing replication method's overhead","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"26 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":"133987398","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}
K. Shimamura, Takeshi Takehara, Yosuke Shima, Kunihiko Tsunedomi
A single-chip fail-safe microprocessor has been developed. It contains two processor cores and realizes self-checking feature by comparing the processing results of the two processor cores. In order to overcome redundant input disagreement problem, two mechanisms have been implemented. The one is input data exchange mechanism used with bus comparison feature. The other is memory data comparison and copy mechanism. With the memory data comparison mechanism, input data comparison overhead can be reduced, which is especially useful for short period control task with many input data. The microprocessor utilizes 0.18mum CMOS process and integrates 512KB RAM and 25M transistors random logic in a 14.75mm x 14.75mm die. With the developed microprocessor, the size of a fault-tolerant controller can be reduced, which makes it easy to embed fault-tolerant controllers into equipments controlled
研制了一种单片故障安全微处理器。它包含两个处理器核心，并通过比较两个处理器核心的处理结果来实现自检功能。为了克服冗余输入不一致问题，实现了两种机制。一种是带有总线比较特性的输入数据交换机制。二是内存数据比较和复制机制。通过内存数据比较机制，可以减少输入数据比较开销，这对于具有大量输入数据的短周期控制任务特别有用。该微处理器采用0.18 mm CMOS工艺，在14.75mm x 14.75mm的芯片中集成了512KB RAM和25M晶体管随机逻辑。利用所开发的微处理器，可以减小容错控制器的尺寸，使容错控制器易于嵌入到被控设备中
{"title":"A Single-Chip Fail-Safe Microprocessor with Memory Data Comparison Feature","authors":"K. Shimamura, Takeshi Takehara, Yosuke Shima, Kunihiko Tsunedomi","doi":"10.1109/PRDC.2006.14","DOIUrl":"https://doi.org/10.1109/PRDC.2006.14","url":null,"abstract":"A single-chip fail-safe microprocessor has been developed. It contains two processor cores and realizes self-checking feature by comparing the processing results of the two processor cores. In order to overcome redundant input disagreement problem, two mechanisms have been implemented. The one is input data exchange mechanism used with bus comparison feature. The other is memory data comparison and copy mechanism. With the memory data comparison mechanism, input data comparison overhead can be reduced, which is especially useful for short period control task with many input data. The microprocessor utilizes 0.18mum CMOS process and integrates 512KB RAM and 25M transistors random logic in a 14.75mm x 14.75mm die. With the developed microprocessor, the size of a fault-tolerant controller can be reduced, which makes it easy to embed fault-tolerant controllers into equipments controlled","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"21 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":"131249122","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}
K. Ssu, C. Chou, Wei-Te Shih, P. Chung, H. C. Jiau
With the progress of advanced technology, people anticipate better quality in the medical health care service. Due to more robust requirements in medical environments, higher availability and reliability are expected. This paper describes a recovery scheme for disconnection failures in a Web-based medical teleconsultation system. With the support, the disconnected clients can re-enter the system to resume the unfinished discussion using the synchronization mechanisms. The experiments have shown that the mechanism performed successfully. The lazy synchronization further reduced the required time that the clients had to wait for joining the consultation after network disconnections
{"title":"Detection and Recovery for Disconnection Failures in a Web-based Medical Teleconsultation System","authors":"K. Ssu, C. Chou, Wei-Te Shih, P. Chung, H. C. Jiau","doi":"10.1109/PRDC.2006.28","DOIUrl":"https://doi.org/10.1109/PRDC.2006.28","url":null,"abstract":"With the progress of advanced technology, people anticipate better quality in the medical health care service. Due to more robust requirements in medical environments, higher availability and reliability are expected. This paper describes a recovery scheme for disconnection failures in a Web-based medical teleconsultation system. With the support, the disconnected clients can re-enter the system to resume the unfinished discussion using the synchronization mechanisms. The experiments have shown that the mechanism performed successfully. The lazy synchronization further reduced the required time that the clients had to wait for joining the consultation after network disconnections","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":"126058985","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}
Spyware, a type of potentially unwanted programs (PUPs), has become a significant threat to most Internet users as it introduces serious privacy disclosure and potential security breach to the systems. Current anti-spyware tools use signatures to detect spyware programs. Over time, spyware programs have grown more resilient to this technique; they utilize critical areas of the system to survive reboots and set up mini-installers that re-install a spyware program after it's been detected and removed. Since existing anti-spyware tools are stateless in the sense that they do not remember and monitor the spyware programs that were removed, they fail to permanently remove these self-healing spyware programs. This paper proposes STARS (stateful threat-aware removal system): a tool that at run time intercepts critical system accesses and assures removed spyware does not re-install itself after a successful removal of spyware program in the system. If a re-installation (self-healing) is detected, STARS infers the source of such activities and discovers additional "suspicious" programs. Experimental results show that STARS is effective in removing self-healing spyware programs that existing anti-spyware tools fail to do
{"title":"A Stateful Approach to Spyware Detection and Removal","authors":"Ming-Wei Wu, Yennun Huang, Yi-Min Wang, S. Kuo","doi":"10.1109/PRDC.2006.15","DOIUrl":"https://doi.org/10.1109/PRDC.2006.15","url":null,"abstract":"Spyware, a type of potentially unwanted programs (PUPs), has become a significant threat to most Internet users as it introduces serious privacy disclosure and potential security breach to the systems. Current anti-spyware tools use signatures to detect spyware programs. Over time, spyware programs have grown more resilient to this technique; they utilize critical areas of the system to survive reboots and set up mini-installers that re-install a spyware program after it's been detected and removed. Since existing anti-spyware tools are stateless in the sense that they do not remember and monitor the spyware programs that were removed, they fail to permanently remove these self-healing spyware programs. This paper proposes STARS (stateful threat-aware removal system): a tool that at run time intercepts critical system accesses and assures removed spyware does not re-install itself after a successful removal of spyware program in the system. If a re-installation (self-healing) is detected, STARS infers the source of such activities and discovers additional \"suspicious\" programs. Experimental results show that STARS is effective in removing self-healing spyware programs that existing anti-spyware tools fail to do","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"9 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":"134137723","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}
In general, the software-testing time may be measured by two kinds of time scales: calendar time and test-execution time. In this paper, we develop two-dimensional software reliability models with two-time measures and incorporate both of them to assess the software reliability with higher accuracy. Since the resulting software reliability models are based on the familiar non-homogeneous Poisson processes with two-time scales, which are the natural extensions of one-dimensional models, it is possible to treat both the time data simultaneously and effectively. We investigate the dependence of test-execution time as a testing effort on the software reliability assessment, and validate quantitatively the software reliability models with two-time scales. We also consider an optimization problem when to stop the software testing in terms of two-time measurements
{"title":"Two-Dimensional Software Reliability Models and Their Application","authors":"Tomotaka Ishii, T. Dohi","doi":"10.1109/PRDC.2006.64","DOIUrl":"https://doi.org/10.1109/PRDC.2006.64","url":null,"abstract":"In general, the software-testing time may be measured by two kinds of time scales: calendar time and test-execution time. In this paper, we develop two-dimensional software reliability models with two-time measures and incorporate both of them to assess the software reliability with higher accuracy. Since the resulting software reliability models are based on the familiar non-homogeneous Poisson processes with two-time scales, which are the natural extensions of one-dimensional models, it is possible to treat both the time data simultaneously and effectively. We investigate the dependence of test-execution time as a testing effort on the software reliability assessment, and validate quantitatively the software reliability models with two-time scales. We also consider an optimization problem when to stop the software testing in terms of two-time measurements","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"70 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":"134237234","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}
As SRAM devices are scaled down, the number of variation-induced defective memory cells increases rapidly. Combination of ECC, particularly SECDED, with a redundancy technique can effectively tolerate a high number of defects. While SECDED can repair a defective cell in a block, the block becomes vulnerable to soft errors. This paper proposes SEVA, an original soft-error- and variation-aware cache architecture. SEVA exploits SECDED to tolerate variation-induced defects while preserving high resilience against soft errors. Information about the defectiveness and data dirtiness is maintained for each SECDED block. SEVA allows only the clean data to be stored in defective (but still usable) blocks of a cache. An error occurring in a defective block can be detected and the correct data can be obtained from the lower level of the memory hierarchy. SEVA improves yield and reliability with low overheads
{"title":"SEVA: A Soft-Error- and Variation-Aware Cache Architecture","authors":"L. D. Hung, M. Goshima, S. Sakai","doi":"10.1109/PRDC.2006.56","DOIUrl":"https://doi.org/10.1109/PRDC.2006.56","url":null,"abstract":"As SRAM devices are scaled down, the number of variation-induced defective memory cells increases rapidly. Combination of ECC, particularly SECDED, with a redundancy technique can effectively tolerate a high number of defects. While SECDED can repair a defective cell in a block, the block becomes vulnerable to soft errors. This paper proposes SEVA, an original soft-error- and variation-aware cache architecture. SEVA exploits SECDED to tolerate variation-induced defects while preserving high resilience against soft errors. Information about the defectiveness and data dirtiness is maintained for each SECDED block. SEVA allows only the clean data to be stored in defective (but still usable) blocks of a cache. An error occurring in a defective block can be detected and the correct data can be obtained from the lower level of the memory hierarchy. SEVA improves yield and reliability with low overheads","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"476 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":"133498781","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}
C. Bergenhem, J. Karlsson, C. Archer, Andreas Sjoblom
This paper describes a configurable membership protocol for distributed tasks in time-triggered systems that combine static and dynamic messages such as TTCAN or Flexray. The units of membership are processes in nodes that send messages in static communication slots. The objective is to give nodes a consistent view of the status of processes in the system. Process failures are assumed to be manifested as missing messages (fail-silent assumption). Whenever a node detects a change in the membership status of any process, it broadcasts its opinion about the membership status of all processes. This information is broadcast only by nodes that detect a change of local membership status. The protocol is implemented in a distributed embedded system with TTCAN-communication. The response-time of the protocol has been evaluated experimentally by means of fault injection
{"title":"Implementation Results of a Configurable Membership Protocol for Active Safety Systems","authors":"C. Bergenhem, J. Karlsson, C. Archer, Andreas Sjoblom","doi":"10.1109/PRDC.2006.37","DOIUrl":"https://doi.org/10.1109/PRDC.2006.37","url":null,"abstract":"This paper describes a configurable membership protocol for distributed tasks in time-triggered systems that combine static and dynamic messages such as TTCAN or Flexray. The units of membership are processes in nodes that send messages in static communication slots. The objective is to give nodes a consistent view of the status of processes in the system. Process failures are assumed to be manifested as missing messages (fail-silent assumption). Whenever a node detects a change in the membership status of any process, it broadcasts its opinion about the membership status of all processes. This information is broadcast only by nodes that detect a change of local membership status. The protocol is implemented in a distributed embedded system with TTCAN-communication. The response-time of the protocol has been evaluated experimentally by means of fault injection","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"10 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":"124068069","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
扫码关注我们
求助内容：
应助结果提醒方式：