{"title":"Analyzing dynamic voting using Petri nets","authors":"I. Chen, Ding-Chau Wang","doi":"10.1109/RELDIS.1996.559695","DOIUrl":"https://doi.org/10.1109/RELDIS.1996.559695","url":null,"abstract":"Dynamic voting is considered a promising technique for achieving high availability in distributed systems with data replication. To date, stochastic analysis of dynamic voting algorithms is restricted to either site or link Markov models, but not both, possibly because of the difficulty in specifying the state-space which grows exponentially as the number of sites increases. Furthermore, to reduce the state-space, the assumption of \"frequent updates\" was normally made, which results in an overestimation of the availability. In this paper, we develop a Petri net model that considers both site and link failures and also relaxes the modeling assumption of frequent updates. We test our Petri net model on ring and star network topologies to analyze if availability under dynamic voting can be seriously degraded if updates are not frequent under various site and link failure/repair situations. Finally, We use the Petri net developed in the paper to determine the maximum achievable improvement in availability when null updates are introduced to augment regular updates to keep the status of availability up-to-date.","PeriodicalId":439132,"journal":{"name":"Proceedings 15th Symposium on Reliable Distributed Systems","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126354033","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 fault-tolerant CORBA name server","authors":"Silvano Maffeis","doi":"10.1109/RELDIS.1996.559720","DOIUrl":"https://doi.org/10.1109/RELDIS.1996.559720","url":null,"abstract":"OMG CORBA applications require a distributed naming service in order to install and to retrieve object references. High availability of the naming service is important since most CORBA applications need to access it at least once during their lifetime. Unfortunately, the OMG standards do not deal with availability issues; the naming services of many of the commercially available CORBA object request brokers introduce single points of failure. In this paper we describe the design and implementation of a replicated, highly-available CORBA name server that adheres to the OMG Common Object Services Specification. Our naming service can be replicated at run-time, while many applications are installing and retrieving object references. We compare our approach with the approaches taken by the ILU, NEO, Orbix, and DOME object request brokers. The performance of our name server is measured for various degrees of replication.","PeriodicalId":439132,"journal":{"name":"Proceedings 15th Symposium on Reliable Distributed Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124481862","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":"The design of a CORBA group communication service","authors":"P. Felber, B. Garbinato, R. Guerraoui","doi":"10.1109/RELDIS.1996.559713","DOIUrl":"https://doi.org/10.1109/RELDIS.1996.559713","url":null,"abstract":"The common object request broker architecture (CORBA) is becoming a standard for distributed application middleware, and there are increasing needs for enriching the basic functionalities of CORBA. While mechanisms for persistence, transactions, event channels, etc. have been designed and specified for CORBA, no standard support is provided to handle object replication. In this paper we discuss the issue of augmenting CORBA with group communication, which is considered an adequate paradigm to handle replication. We distinguish two main approaches: the integration approach and the service approach. We argue that the service approach is more appropriate to CORBA as it preserves the modularity of the architecture. We describe a proposal for a group communication service and discuss some implementation issues.","PeriodicalId":439132,"journal":{"name":"Proceedings 15th Symposium on Reliable Distributed Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122636170","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":"Diagnosing crosstalk-faulty switches in photonic networks","authors":"C. Qiao","doi":"10.1109/RELDIS.1996.559708","DOIUrl":"https://doi.org/10.1109/RELDIS.1996.559708","url":null,"abstract":"A procedure for diagnosing crosstalk and crosstalk-faulty switches in photonic dilated Benes networks (DBNs) is presented. It obtains the crosstalk ratios of each and every switch in an N/spl times/N DBN in 4N tests, along with O(N/spl middot/log/sup 2/N) calculations. One of its applications is to identify single or multiple switches in the DBN which are generating excessive crosstalk, or crosstalk-faulty. A recursive algorithm is used to configure the DBN for each test such that the necessary power measurements of the signals can be taken accurately. An important feature of the proposed diagnostic procedure is its suitability for automated test generation.","PeriodicalId":439132,"journal":{"name":"Proceedings 15th Symposium on Reliable Distributed Systems","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127368749","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":"Implementation and performance of a stable-storage service in Unix","authors":"F. Cristian, Shivakant Mishra, Young S. Hyun","doi":"10.1109/RELDIS.1996.559701","DOIUrl":"https://doi.org/10.1109/RELDIS.1996.559701","url":null,"abstract":"This paper describes the design, implementation, and performance of a stable-storage service that has been implemented on top of the Unix operating system. This service allows servers to create, access, and delete persistent memory that survives server crashes. We describe its functionality and exported operations, discuss the experiences and performance of its implementation, and offer concrete examples of its use in implementing some real fault-tolerant distributed protocols.","PeriodicalId":439132,"journal":{"name":"Proceedings 15th Symposium on Reliable Distributed Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123020022","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":"Specialized N-modular redundant processors in large-scale distributed systems","authors":"I. Yen","doi":"10.1109/RELDIS.1996.559688","DOIUrl":"https://doi.org/10.1109/RELDIS.1996.559688","url":null,"abstract":"Computers are being used to achieve increasingly sophisticated control for large and complex systems. Many of these systems require a large shared state-space or database. Thus, handling real-time concurrent accesses to a shared database is an essential feature for modern fault-tolerant systems. Many fault-tolerant systems have been implemented for uniformly tolerating various types of failures, such as MAFT (Multicomputer Architecture for Fault Tolerance), FTP (Fault-Tolerant Processor), FTPP (Fault-Tolerant Parallel Processors) and Delta-4. However, most of these either lack the notion of a shared state-space or do not efficiently support parallel tasks that concurrently access a shared state-space. We use a processor-specialization approach to increase the effectiveness of replication and, consequently, achieve cost-effective fault tolerance in such systems. The SNMR (specialized N-modular redundancy) protocol has been developed based on these concepts. Compared to many existing Byzantine-resilient systems, the SNMR approach incurs less overhead and can be easily parameterized to fit various fault models.","PeriodicalId":439132,"journal":{"name":"Proceedings 15th Symposium on Reliable Distributed Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123567131","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}
E. Nishijima, Hiroshi Yamamoto, K. Kawano, K. Fujiwara, K. Oshima
{"title":"On-line testing for application software of widely distributed system","authors":"E. Nishijima, Hiroshi Yamamoto, K. Kawano, K. Fujiwara, K. Oshima","doi":"10.1109/RELDIS.1996.559698","DOIUrl":"https://doi.org/10.1109/RELDIS.1996.559698","url":null,"abstract":"Widely distributed systems are constructed step-by-step over a long lime. These systems must permit on-line testing. On-line testing verifies newly added application software by receiving the real data in the real environment without disrupting the operating subsystems. To enable testing during system operation, an on-line test technique based on autonomous decentralized system structure was proposed. In this paper, the functions to verify various types of application software are proposed: (1) for non-real-time application software, checking whether it communicates with every operating application software. (2) for real-time application software, checking whether timing of output data is within the timing-deadline or not. (3) for new version software, verifying whether the version of all functions is newer than that off functions in the present software. An example of application software applied to the on-line test and the effectiveness of the technique is shown in a real system.","PeriodicalId":439132,"journal":{"name":"Proceedings 15th Symposium on Reliable Distributed Systems","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115846650","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":"Observations from 16 years at a fault-tolerant computer company","authors":"P. A. Green","doi":"10.1109/RELDIS.1996.559714","DOIUrl":"https://doi.org/10.1109/RELDIS.1996.559714","url":null,"abstract":"Observations acquired from 16 years of experience working for a vendor of fault-tolerant computer systems are presented, along with two \"war stories\" that illustrate some of the principles.","PeriodicalId":439132,"journal":{"name":"Proceedings 15th Symposium on Reliable Distributed Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125364768","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 causal message ordering scheme for distributed embedded real-time systems","authors":"K. M. Zuberi, K. Shin","doi":"10.1109/RELDIS.1996.559724","DOIUrl":"https://doi.org/10.1109/RELDIS.1996.559724","url":null,"abstract":"In any distributed system, messages must be ordered according to their cause-and-effect relation to ensure correct behavior of the system. Causal ordering is also essential for services like atomic multicast and replication. In distributed real-time systems, not only must proper causal ordering be ensured, but message deadlines must be met as well. Previous algorithms which ensure such behavior include the /spl Delta/-protocol family and the MARS approach. However, both these algorithms give large response times by delaying all messages for a fixed period of time. In this paper we show that for small- to medium-sized real-time systems (consisting of a few tens of nodes) as are commonly used for embedded applications, it becomes feasible to extend the h-protocol so that instead of delaying all messages for a fixed period, each message is delayed according to its deadline. Our algorithm requires certain message deadlines to be adjusted by the application designer and we show that for small-scale applications such as those used in embedded systems, this adjustment is feasible and can be automated by the use of proper CAD tools.","PeriodicalId":439132,"journal":{"name":"Proceedings 15th Symposium on Reliable Distributed Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129628302","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":"Analysis of a multistage interconnection network using binary decision diagrams (BDD)","authors":"J. Chiu, J. Dugan","doi":"10.1109/RELDIS.1996.559693","DOIUrl":"https://doi.org/10.1109/RELDIS.1996.559693","url":null,"abstract":"The authors use the BDD to help derive a closed-form solution for the reliability of a multistage interconnection network with n stages. The BDD reveals repeated structures, the reliability of which can be encoded in a recursive formula. An exact solution of a network with an arbitrary number of stages can be computed in time proportional to the number of stages. They also provide results which include the concept of imperfect coverage, in which two mutually-exclusive failure modes (with different effects) are possible for certain switching elements.","PeriodicalId":439132,"journal":{"name":"Proceedings 15th Symposium on Reliable Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132658117","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}