{"title":"The relative overhead of piggybacking in causal message logging protocols","authors":"K. Bhatia, K. Marzullo, L. Alvisi","doi":"10.1109/RELDIS.1998.740522","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740522","url":null,"abstract":"Message logging protocols ensure that crashed processes make the same choices when re-executing nondeterministic events during recovery. Causal message logging protocols achieve this by piggybacking the results of these choices (called determinants) on the ambient message traffic. By doing so, these protocols do not create orphan processes nor introduce blocking in failure-free executions. To survive f failures, they ensure that determinants are stored by at least f+1 processes. Causal logging protocols differ in the kind of information they piggyback to other processes. The more information they send, the better each process is able to estimate global properties of the determinants, which in turn results in fewer needless piggybacking of determinants. This paper quantifies the tradeoff between the cost of sending more information and the benefit of doing so.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"10 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":"123396188","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":"An active transcoding proxy to support mobile web access","authors":"H. Bharadvaj, A. Joshi, S. Auephanwiriyakul","doi":"10.1109/RELDIS.1998.740482","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740482","url":null,"abstract":"In this paper, we present a proxy based system (MOWSER) to support web browsing from mobile clients over wireless networks. Mowser is a proxy agent between the mobile host and the web server, which performs active transcoding of data on both upstream and downstream traffic to present web information to the mobile user according to the QoS parameters set by the user. Active transcoding is defined as modifying the HTTP stream in situ, and it is entirely transparent to the user. Further, our system does not pose any additional requirements on the mobile user. This is an improvement over other proxy based systems, which only transcode images on the downstream and are mostly not configurable. While developed for mobile users, such a system can actually be useful in any low bandwidth scenario.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"9 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":"123669238","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}
Taehyung Wang, P. Sheu, Brian J Cummings, C. Cotman
{"title":"An object relational database for brain aging research","authors":"Taehyung Wang, P. Sheu, Brian J Cummings, C. Cotman","doi":"10.1109/RELDIS.1998.740544","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740544","url":null,"abstract":"BioCompose is a next-generation data management system currently being developed at the University of California at Irvine. The system integrates two databases (a clinical patient database and a cellular-level neuropathological database) into a uniform framework with advanced data/knowledge management facilities and a simple, friendly user interface for all classes of users in the Internet environment. Using any standard Web browser, users can access data from any Internet-capable computer. This paper briefly discusses the design, architecture, and some implementation details of BioCompose.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"1 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":"125506174","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":"Survivable consensus objects","authors":"D. Malkhi, M. Reiter","doi":"10.1109/RELDIS.1998.740509","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740509","url":null,"abstract":"Reaching consensus among multiple processes in a distributed system is fundamental to coordinating distributed actions. We present a new approach to building survivable consensus objects in a system consisting of a (possibly large) collection of persistent object servers and a transient population of clients. Our consensus object implementation requires minimal support from servers, but at the same time enables clients to reach coordinated decisions despite the arbitrary (Byzantine) failure of any number of clients and up to a threshold number of servers.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"13 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":"124016194","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":"Pixel level interleaving schemes for robust image communication","authors":"R. Hasimoto-Beltrán, A. Khokhar","doi":"10.1109/RELDIS.1998.740540","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740540","url":null,"abstract":"Interleaving schemes have proven to be an important mechanism in reducing the effect of network errors on image transmission. Current interleaving schemes spatially decorrelate neighboring image blocks by putting them into packets that are a long way apart from each other in the transmission sequence. Most of the existing schemes, while achieving good performance on random packet losses, do not work well in the case of bursty packet losses. In this paper, we propose two interleaving schemes where the decorrelation process is applied not only at the block level but also at the pixel or coefficient level (i.e. on the information within the blocks) in the compressed domain. The decorrelation is achieved via a k-way shuffle of pixels among the blocks and by using the spatial properties of different space-filling curves, where k depends on the total number of blocks in the image. Our results show that in spite of the decorrelation of coefficients in the triangular interleaving scheme, the compression ratio is within 92% to -98% of JPEG standard compression. We also show that, when compared with existing interleaving schemes, our techniques provide improved image quality and a low mean square error in the transmitted images in the presence of random as well as bursty packet losses in networks.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"15 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":"127644277","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":"Managing network security-a pragmatic approach","authors":"R. Falk, Markus Trommer","doi":"10.1109/RELDIS.1998.740530","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740530","url":null,"abstract":"An efficient management is needed to make use of different security mechanisms in large networks. All mechanisms have to be configured consistently according to the security policy. To reduce complexity, the administrator should not have to cope with details not important for him. In the presented concept the network is divided into several administrative domains which are managed rather independently from each other. Each domain maintains its own network access control policy (NAP). The enterprise-wide policy is a combination of all NAPs. It is enforced by different security mechanisms and configuration can be derived from the global access policy automatically. Existing security mechanisms can be integrated by simply adding a policy transformation unit.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"19 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":"127312904","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":"Extending the Coda File System to handle cache misses on isolated clients","authors":"H. Inamura","doi":"10.1109/RELDIS.1998.740519","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740519","url":null,"abstract":"For mobile information access, client caching is widely used for coping with server unavailability due to temporary disconnection of the network. Cache-miss is the most visible phenomenon to users caused by the disconnection. When multiple clients are isolated from servers, cache-miss happening on a client can be fulfilled using cache contents on other clients. Using a mechanism called disconnected operation, clients of the Coda File System can continue to work without contacting servers; however, clients cannot pass files between them by themselves. This paper presents the design and implementation of two mechanisms: import/export and session server. These mechanisms add read-sharing capability for clean objects to clients disconnected from Coda servers with reasonable response time.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"73 3 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":"121813560","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 data allocation algorithm for distributed hypermedia documents","authors":"Siu-Kai So, I. Ahmad, K. Karlapalem","doi":"10.1109/RELDIS.1998.740543","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740543","url":null,"abstract":"A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites to the site where the query is initiated. The objective of a data allocation algorithm is to locate the fragments at different sites so as to minimize the total data transfer cost incurred in executing a set of queries. This is equivalent to minimizing the average query execution time, which is of primary importance in a wide class of distributed systems. The data allocation problem, however, is NP-complete, and thus requires fast heuristics to generate efficient solutions. The problem becomes more complex in the context of hypermedia documents (Web pages), within which the multimedia data objects (MDOs) need to be synchronized during presentation to the end users. Since the basic problem of data allocation in distributed database systems is NP-complete, we need heuristics which can generate near-optimal MDO allocations. In this paper, we propose a navigational model to represent hypermedia documents and their access behaviour from end users. We also formulate the problem by developing a base-case cost model for the response time, and we design an algorithm to find near-optimal solutions for allocating MDOs of the hypermedia documents while adhering to the synchronization requirements. We compare the algorithmic solution with an exhaustive solution over a set of experiments.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"8 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":"132351841","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":"Safe and efficient active network programming","authors":"Scott Thibault, C. Consel, Gilles Muller","doi":"10.1109/RELDIS.1998.740484","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740484","url":null,"abstract":"Active networks are aimed at incorporating programmability into the network to achieve extensibility. One approach to obtaining extensibility is to download router programs into network nodes. This programmability is critical to allow multipoint distributed systems to adapt to network conditions and individual clients' needs. Although promising, this approach raises critical issues such as safety to achieve reliability despite the complexity of a distributed system, security to protect shared resources, and efficiency to maximize usage of bandwidth. This paper proposes the use of a domain-specific language, PLAN-P, to address all of the above issues. To address safety and security, we give examples of properties of PLAN-P programs that can be automatically checked due to the use of a restricted language. For efficiency, we show that an automatically generated run-time compiler for PLAN-P produces code which outperforms an equivalent compiled Java program. Additionally, we present performance results on a real application (learning bridge) where we obtain 100% of the maximum possible throughput.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"4 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":"134369987","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}
F. D. Muñoz-Escoí, Pablo Galdámez, J. Bernabéu-Aubán
{"title":"ROI: an invocation mechanism for replicated objects","authors":"F. D. Muñoz-Escoí, Pablo Galdámez, J. Bernabéu-Aubán","doi":"10.1109/RELDIS.1998.740471","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740471","url":null,"abstract":"The reliable object invocation mechanism provided by HIDRA for the coordinator-cohort and the passive replication models offers support to ensure that all the replicas of the object being invoked are correctly updated before such an invocation is terminated. This mechanism also ensures that if a primary or coordinator replica crashes, the client is able to reconnect to the previously initiated invocations, collecting their results without requiring their reexecution. All this support is provided transparently to the client of the replicated objects, which does not notice any difference in respect to the invocations made to non-replicated objects. Moreover, the protocols described in the paper deal also with the failure of any of the objects involved in this kind of invocations.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"19 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":"134523965","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}