{"title":"Issues in multimedia synchronization over broadband networks","authors":"Shahab Baqai, M. F. Khan, S. Shaikh","doi":"10.1109/RELDIS.1998.740542","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740542","url":null,"abstract":"Distributed, networked multimedia information systems will be a critical component of technology-based information infrastructures in the future. Several ground-breaking applications have already appeared, and more are many are expected to follow. Innovations in hardware and software are feeding this revolution. In this paper, the notion of \"quality of presentation\" (QOP) for multimedia data transferred over the networks is developed. Multimedia data synchronization requirements are studied, and several synchronization protocols are presented. We discuss the management of pre-orchestrated as well as live multimedia data. It is anticipated that, with proper research breakthroughs, broadband multimedia networking technologies will bring about spectacular changes in the ways that we store, process and use information.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125832197","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}
M. Killijian, J. Fabre, Juan-Carlos Ruiz-Garcia, S. Chiba
{"title":"A metaobject protocol for fault-tolerant CORBA applications","authors":"M. Killijian, J. Fabre, Juan-Carlos Ruiz-Garcia, S. Chiba","doi":"10.1109/RELDIS.1998.740483","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740483","url":null,"abstract":"The use of metalevel architectures for the implementation of fault-tolerant systems is today very appealing. Nevertheless, all such fault-tolerant systems have used a general-purpose metaobject protocol (MOP) or are based on restricted reflective features of some object-oriented language. According to our past experience, we define in this paper a suitable metaobject protocol, called FT-MOP for building fault-tolerant systems. We explain how to realize a specialized runtime MOP using compile-time reflection. This MOP is CORBA compliant: it enables the execution and the state evolution of CORBA objects to be controlled and enables the fault tolerance metalevel to be developed as CORBA software.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114067197","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 protocol for providing the exactly-once property of mobile agents","authors":"K. Rothermel, Markus Straßer","doi":"10.1109/RELDIS.1998.740480","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740480","url":null,"abstract":"Mobile agent technology has been proposed for various fault-sensitive application areas, including electronic commerce, systems management and active messaging. Due to the autonomy of mobile agents, there is no natural instance that monitors the progress of an agent's execution. As a result, agents may be lost or blocked due to node crashes or network partitioning even if there are other nodes available that could continue processing. In this paper, we describe a protocol that provides exactly-once semantics of agent execution and additionally reduces the blocking probability of agents by introducing observer nodes for monitoring the progress of agents. This protocol is based on conventional transactional technology such as defined by X/Open DTP or CORBA OTS. It is being implemented in Mole, a mobile agent system developed at Stuttgart University.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121473367","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 VP-accordant checkpointing protocol preventing useless checkpoints","authors":"R. Baldoni, F. Quaglia, B. Ciciani","doi":"10.1109/RELDIS.1998.740475","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740475","url":null,"abstract":"A useless checkpoint corresponds to the occurrence of a checkpoint and communication pattern called Z-cycle. A recent result shows that ensuring a computation without Z-cycles is a particular application of a property, namely Virtual Precedence (VP), defined on an interval-based abstraction of a computation. We first propose a taxonomy of communication-induced checkpointing protocols based on the way they ensure the VP property. Then we derive a sufficient condition ensuring no Z-cycles in a distributed computation. This condition defines a checkpoint and communication pattern, namely suspect Z-cycle, such that if no suspect Z-cycle exists in a distributed computation then no Z-cycle exists. We present finally a communication-induced checkpointing protocol that avoids useless checkpoints by preventing on-the-fly the formation of suspect Z-cycles and discuss its performance with respect to other protocols.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130003151","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":"CORBA evaluation of video streaming w.r.t. QoS provisioning","authors":"Wonjun Lee, J. Srivastava","doi":"10.1109/RELDIS.1998.740538","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740538","url":null,"abstract":"Describes the design, implementation and evaluation of CORBA- and socket-based continuous media (CM) systems. TCP/IP is not suitable for distributed applications which require high network bandwidth and timing criticality. UDP/IP is one of the alternatives. However, due to the fact that UDP is a lossy protocol, many issues arise when implementing distributed CM applications. Most of the QoS (quality of service) metrics known so far assume that the communication channel is lossless. In this paper, since we use UDP for CM data transmission, we adopt a new QoS metric that is applicable to lossy streams to evaluate the performance of our CM server. To reduce QoS loss factors and drift factors, we adopt a new strategy, called the QoS-driven dropping mechanism, for the CM server. Besides the traditional C-socket (TCP-UDP/IP) based CM server mechanisms, we implemented our CM server on CORBA. It turns out that the CORBA-based implementation runs considerably slower than the UDP-version, but faster than the TCP version.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133876502","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":"Design and analysis of a hardware-assisted checkpointing and recovery scheme for distributed applications","authors":"B. Ramamurthy, S. Upadhyaya, B. Bhargava","doi":"10.1109/RELDIS.1998.740478","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740478","url":null,"abstract":"A checkpointing and recovery scheme which exploits the low latency and high coverage characteristics of a hardware error detection scheme is presented. Message dependency which is the main source of multi-step rollback in distributed systems is minimized by using a new message validation technique derived from hardware-assisted error detection. The main contribution of this paper is the development of an analytical model to establish the completeness and correctness of the new scheme. A novel concept of global state matrix is defined to keep track of the global state in a distributed system and assist in recovery. An illustration is given to show the distinction between conventional and the new recovery schemes.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121281422","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":"Consensus in asynchronous systems where processes can crash and recover","authors":"M. Hurfin, A. Mostéfaoui, M. Raynal","doi":"10.1109/RELDIS.1998.740510","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740510","url":null,"abstract":"The consensus problem is now well identified as being one of the most important problems encountered in the design and the construction of fault-tolerant distributed systems. This problem is defined as follows: processes have to reach a common decision, which depends on their inputs, despite failures. We consider the consensus problem in asynchronous distributed systems augmented with unreliable failure detectors. Several protocols have been proposed for these systems, when process crashes are assumed to be definitive. This paper addresses the consensus problem in a more practical asynchronous system model, namely in a context where processes can crash and recover. As a process crash entails the loss of its volatile memory, each process is equipped with a stable storage. So, to be efficient a consensus protocol has to log as few critical data as possible. The proposed protocol uses a new class of failure detectors suited to the crash/recovery model. It is particularly efficient when, whether there are crashes or not, the underlying failure detector makes few mistakes. Additionally, the proposed protocol tolerates message duplication and copes with some message losses.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125074080","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 cost of recovery in message logging protocols","authors":"Sriram Rao, L. Alvisi, H. Vin","doi":"10.1109/RELDIS.1998.740469","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740469","url":null,"abstract":"Past research in message logging has focused on studying the relative overhead imposed by pessimistic, optimistic, and causal protocols during failure-free executions. We give the first experimental evaluation of the performance of these protocols during recovery. We discover that, if a single failure is to be tolerated, pessimistic and causal protocols perform best, because they avoid rollbacks of correct processes. For multiple failures, however, the dominant factor in determining performance becomes where the recovery information is logged (i.e. at the sender, at the receiver, or replicated at a subset of the processes in the system) rather than when this information is logged (i.e. if logging is synchronous or asynchronous).","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134091180","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}