Pub Date : 1996-05-27DOI: 10.1109/ICDCS.1996.508007
J. Liebeherr, I. Akyildiz, A. Tai
The Available-Bit-Rate (ABR) service that is being standardized by the ATM Forum dynamically determines the maximum transmission rate, so-called explicit rate, of a connection. A drawback of the ABR control scheme for calculating the explicit rates is that it tries to allocate the same bandwidth to all ABR connections regardless of the application type of the connection. In this study a multi-level explicit rate scheme is proposed that can allocate different explicit rates for different classes of connections. ABR traffic is controlled at three levels. At the topmost level, bandwidth is dynamically regulated between CBR, VER, and ABR traffic sources. At the next level, bandwidth is controlled between different classes of ABR traffic. At the lowest level bandwidth is distributed among connections belonging to the same ABR traffic class. The effectiveness of the proposed scheme is demonstrated in simulation experiments.
{"title":"A multi-level explicit rate control scheme for ABR traffic with heterogeneous service requirements","authors":"J. Liebeherr, I. Akyildiz, A. Tai","doi":"10.1109/ICDCS.1996.508007","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.508007","url":null,"abstract":"The Available-Bit-Rate (ABR) service that is being standardized by the ATM Forum dynamically determines the maximum transmission rate, so-called explicit rate, of a connection. A drawback of the ABR control scheme for calculating the explicit rates is that it tries to allocate the same bandwidth to all ABR connections regardless of the application type of the connection. In this study a multi-level explicit rate scheme is proposed that can allocate different explicit rates for different classes of connections. ABR traffic is controlled at three levels. At the topmost level, bandwidth is dynamically regulated between CBR, VER, and ABR traffic sources. At the next level, bandwidth is controlled between different classes of ABR traffic. At the lowest level bandwidth is distributed among connections belonging to the same ABR traffic class. The effectiveness of the proposed scheme is demonstrated in simulation experiments.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132391121","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}
Pub Date : 1996-05-27DOI: 10.1109/ICDCS.1996.508002
Oliver Ciupke, D. Kottmann, H. Walter
Object migration is usually applied to optimize distributed monolithic systems. We investigate the effects of using object migration in cooperative systems which consist of autonomous, independently developed components. We show that the use of migration policies which are set up with only one component in mind can have detrimental effects on the overall performance. To avoid this without changing the internal structure of the components, we introduce two novel approaches: transient placement and reduction of attachment-transitiveness. The effects of these modifications are evaluated by simulation.
{"title":"Object migration in non-monolithic distributed applications","authors":"Oliver Ciupke, D. Kottmann, H. Walter","doi":"10.1109/ICDCS.1996.508002","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.508002","url":null,"abstract":"Object migration is usually applied to optimize distributed monolithic systems. We investigate the effects of using object migration in cooperative systems which consist of autonomous, independently developed components. We show that the use of migration policies which are set up with only one component in mind can have detrimental effects on the overall performance. To avoid this without changing the internal structure of the components, we introduce two novel approaches: transient placement and reduction of attachment-transitiveness. The effects of these modifications are evaluated by simulation.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124804228","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}
Pub Date : 1996-05-27DOI: 10.1109/ICDCS.1996.508026
Yasuo Sato, M. Inoue, T. Masuzawa, H. Fujiwara
This paper considers distributed algorithms for distributed mobile systems. Many distributed algorithms have been designed for distributed systems consisting of static computers only. But most of them cannot be directly applied to mobile systems. This paper proposes a model of mobile systems. Management of movements of mobile hosts is abstracted in our model to simplify design of algorithms for mobile systems. This paper also defines the snapshot problem, one of the fundamental problems, on the model. The problem requires to find a strongly consistent configuration in which topological consistency is satisfied in addition to causal consistency. Furthermore, this paper presents a snapshot algorithm for mobile systems.
{"title":"A snapshot algorithm for distributed mobile systems","authors":"Yasuo Sato, M. Inoue, T. Masuzawa, H. Fujiwara","doi":"10.1109/ICDCS.1996.508026","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.508026","url":null,"abstract":"This paper considers distributed algorithms for distributed mobile systems. Many distributed algorithms have been designed for distributed systems consisting of static computers only. But most of them cannot be directly applied to mobile systems. This paper proposes a model of mobile systems. Management of movements of mobile hosts is abstracted in our model to simplify design of algorithms for mobile systems. This paper also defines the snapshot problem, one of the fundamental problems, on the model. The problem requires to find a strongly consistent configuration in which topological consistency is satisfied in addition to causal consistency. Furthermore, this paper presents a snapshot algorithm for mobile systems.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127391586","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}
Pub Date : 1996-05-27DOI: 10.1109/ICDCS.1996.508009
V. Issarny, C. Bidan
This paper introduces the Aster distributed configuration-based-programming system that is aimed at easing the development of emerging distributed applications having quality of service requirements. Our approach is based on high-level customization: given the specification of application requirements using the Aster interconnection language, a distributed runtime system, customized for meeting these requirements is built. So as to make the customization process sound, we propose a formal method that allows one to reason about specification matching of a customized distributed runtime system with the application's requirements.
{"title":"Aster: a framework for sound customization of distributed runtime systems","authors":"V. Issarny, C. Bidan","doi":"10.1109/ICDCS.1996.508009","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.508009","url":null,"abstract":"This paper introduces the Aster distributed configuration-based-programming system that is aimed at easing the development of emerging distributed applications having quality of service requirements. Our approach is based on high-level customization: given the specification of application requirements using the Aster interconnection language, a distributed runtime system, customized for meeting these requirements is built. So as to make the customization process sound, we propose a formal method that allows one to reason about specification matching of a customized distributed runtime system with the application's requirements.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129600056","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}
Pub Date : 1996-05-27DOI: 10.1109/ICDCS.1996.507908
Sundar Kanthadai, J. Welch
Distributed shared memory, by avoiding the programming complexities of message passing, has become a convenient model to work with. But the benefits given by these systems can possibly be achieved only if the whole system behaves like a failure-free system. Many algorithms that have been proposed for implementing a reliable DSM require the processes to take check points whenever there is a data transfer, thus resulting in a heavy overhead during failure-free execution. We present an algorithm to provide recoverable DSM for sequential consistency where the checkpoint interval can be tailored to balance the cost of checkpointing versus the savings in recovery obtained by taking check points often. Unlike previous recovery techniques that use logging, both the logging and the message overheads are reduced. It can tolerate up to n faults, where n is the number of processes, and can be used in an environment where the cost of synchronizing the checkpoints is substantially high.
{"title":"Implementation of recoverable distributed shared memory by logging writes","authors":"Sundar Kanthadai, J. Welch","doi":"10.1109/ICDCS.1996.507908","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.507908","url":null,"abstract":"Distributed shared memory, by avoiding the programming complexities of message passing, has become a convenient model to work with. But the benefits given by these systems can possibly be achieved only if the whole system behaves like a failure-free system. Many algorithms that have been proposed for implementing a reliable DSM require the processes to take check points whenever there is a data transfer, thus resulting in a heavy overhead during failure-free execution. We present an algorithm to provide recoverable DSM for sequential consistency where the checkpoint interval can be tailored to balance the cost of checkpointing versus the savings in recovery obtained by taking check points often. Unlike previous recovery techniques that use logging, both the logging and the message overheads are reduced. It can tolerate up to n faults, where n is the number of processes, and can be used in an environment where the cost of synchronizing the checkpoints is substantially high.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129846645","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}
Pub Date : 1996-05-27DOI: 10.1109/ICDCS.1996.508022
M. Papazoglou, A. Delis, M. Haghjoo, A. Bouguettaya
Providing a general purpose programming environment that supports the definition of, and exercises control over, the flow of execution of long-running activities is highly beneficial for a variety of client/server distributed data-intensive applications. In this paper, we present a Transaction-Oriented Work-Flow Environment (TOWE) for the programming of long-lived activities through a set of class libraries. The TOWE is based on an amalgamation of object-oriented programming with distributed interprocess communication concepts. The concurrency abstractions provided by TOWE are objects, acting like processes, and involve an asynchronous, location-independent, mode of process invocation coupled with data-driven synchronization of processes.
{"title":"Language support for long-lived concurrent activities","authors":"M. Papazoglou, A. Delis, M. Haghjoo, A. Bouguettaya","doi":"10.1109/ICDCS.1996.508022","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.508022","url":null,"abstract":"Providing a general purpose programming environment that supports the definition of, and exercises control over, the flow of execution of long-running activities is highly beneficial for a variety of client/server distributed data-intensive applications. In this paper, we present a Transaction-Oriented Work-Flow Environment (TOWE) for the programming of long-lived activities through a set of class libraries. The TOWE is based on an amalgamation of object-oriented programming with distributed interprocess communication concepts. The concurrency abstractions provided by TOWE are objects, acting like processes, and involve an asynchronous, location-independent, mode of process invocation coupled with data-driven synchronization of processes.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131988168","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}
Pub Date : 1996-05-27DOI: 10.1109/ICDCS.1996.507927
M. Higuchi, Junko Sano, K. Hara, M. Fujii
Previously, we proposed a verification method via invariants for communication protocol modeled as 2-ECPSMs. In the proposed method, a human verifier describes an invariant of a given protocol in a disjunctive normal form, and a verification system shows safety or liveness based on the invariant. The tedious work on describing invariant formulae is the most significant shortcoming of the proposed method. This paper deals with a semi-automated derivation of invariant formulae for communication protocol modeled as 2-ECFSMs. In the method, the logical formula which holds on a subset of reachable states is automatically generated. Such a subset consists of states which are teachable by synchronous communication from the initial states and those which are reachable by sequences of sending transitions from synchronously reachable states. To obtain an invariant, a human verifier supplements several disjuncts for other part of reachability set. We conducted an experiment on deriving an invariant formula of a sample protocol extracted from the OSI session protocol. By the result, 636 conjunctive formulae were automatically derived and the conjunction of those formulae was shown to be an invariant of the sample protocol, i.e. the sample protocol was shown to be safe automatically.
{"title":"A semi-automated verification method for communication protocols modeled as 2-ECFSMs","authors":"M. Higuchi, Junko Sano, K. Hara, M. Fujii","doi":"10.1109/ICDCS.1996.507927","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.507927","url":null,"abstract":"Previously, we proposed a verification method via invariants for communication protocol modeled as 2-ECPSMs. In the proposed method, a human verifier describes an invariant of a given protocol in a disjunctive normal form, and a verification system shows safety or liveness based on the invariant. The tedious work on describing invariant formulae is the most significant shortcoming of the proposed method. This paper deals with a semi-automated derivation of invariant formulae for communication protocol modeled as 2-ECFSMs. In the method, the logical formula which holds on a subset of reachable states is automatically generated. Such a subset consists of states which are teachable by synchronous communication from the initial states and those which are reachable by sequences of sending transitions from synchronously reachable states. To obtain an invariant, a human verifier supplements several disjuncts for other part of reachability set. We conducted an experiment on deriving an invariant formula of a sample protocol extracted from the OSI session protocol. By the result, 636 conjunctive formulae were automatically derived and the conjunction of those formulae was shown to be an invariant of the sample protocol, i.e. the sample protocol was shown to be safe automatically.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132013964","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}
Pub Date : 1996-05-27DOI: 10.1109/ICDCS.1996.507996
Yuh-Jzer Joung, S. Smolka
We present Multi, a symmetric, fully distributed, randomized algorithm that, with probability 1, schedules multiparty interactions in a strongly fair manner. To our knowledge, Multi is the first algorithm for strong interaction fairness to appear in the literature. Moreover, the expected time taken by Multi to establish an interaction is a constant not depending on the total number of processes in the system. In this sense, Multi guarantees real-time response. Multi makes no assumptions (other than boundedness) about the time it takes processes to communicate. It thus offers an appealing tonic to the impossibility results of Tsay&Bagrodia and Joung concerning strong interaction fairness in an environment, shared-memory or message-passing, in which processes are deterministic and the communication time is nonnegligible. Because strong interaction fairness is as strong a fairness condition that one might actually want to impose in practice, our results indicate that randomization may also prove fruitful for other notions of fairness lacking deterministic realizations and requiring real-time response.
{"title":"Strong interaction fairness via randomization","authors":"Yuh-Jzer Joung, S. Smolka","doi":"10.1109/ICDCS.1996.507996","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.507996","url":null,"abstract":"We present Multi, a symmetric, fully distributed, randomized algorithm that, with probability 1, schedules multiparty interactions in a strongly fair manner. To our knowledge, Multi is the first algorithm for strong interaction fairness to appear in the literature. Moreover, the expected time taken by Multi to establish an interaction is a constant not depending on the total number of processes in the system. In this sense, Multi guarantees real-time response. Multi makes no assumptions (other than boundedness) about the time it takes processes to communicate. It thus offers an appealing tonic to the impossibility results of Tsay&Bagrodia and Joung concerning strong interaction fairness in an environment, shared-memory or message-passing, in which processes are deterministic and the communication time is nonnegligible. Because strong interaction fairness is as strong a fairness condition that one might actually want to impose in practice, our results indicate that randomization may also prove fruitful for other notions of fairness lacking deterministic realizations and requiring real-time response.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128172125","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}
Pub Date : 1996-05-27DOI: 10.1109/ICDCS.1996.508010
Peter Becker
This article addresses the problem of programming by combining already existing programs on the INTERNET. For this, an interpreter based language called Progress is presented. Progress makes it possible to use and combine programs and functionalities provided by various servers in a simple and elegant way, similar to what a UNIX shell does for locally available programs. Moreover the inherent parallelism, which is given due to the fact that programs may reside on different hosts, can be fully exploited in Progress. Other important features of Progress are that the language can be extended by new data types and that it is embeddable in other software systems. This article presents the main concepts and ideas of Progress and gives an overview of the language.
{"title":"An embeddable and extendable language for large-scale programming on the Internet","authors":"Peter Becker","doi":"10.1109/ICDCS.1996.508010","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.508010","url":null,"abstract":"This article addresses the problem of programming by combining already existing programs on the INTERNET. For this, an interpreter based language called Progress is presented. Progress makes it possible to use and combine programs and functionalities provided by various servers in a simple and elegant way, similar to what a UNIX shell does for locally available programs. Moreover the inherent parallelism, which is given due to the fact that programs may reside on different hosts, can be fully exploited in Progress. Other important features of Progress are that the language can be extended by new data types and that it is embeddable in other software systems. This article presents the main concepts and ideas of Progress and gives an overview of the language.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114471796","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}
Pub Date : 1996-05-27DOI: 10.1109/ICDCS.1996.508012
Shigang Chen, Yi Deng, P. Attie, Wei Sun
We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. This WFG is then searched for deadlock. The proposed algorithm has two primary advantages: First, it avoids sending messages along the edges of the global wait-for graph (WFG), thereby achieving a worst-case message complexity of 2n, where n is the number of processes in the WFG. Since information must be obtained from every process reachable from the initiator, this is optimal to within a constant factor. All the existing algorithms for the same problem construct a distributed snapshot of the WFG. As this involves sending messages along the edges of the WFG, the best available message complexity among these algorithms is 4e-2n+2l, which is O(n/sup 2/) in the worst case, where e and l are the number of edges and leaves in the WFG, respectively. Second, since the information about a detected deadlock is readily available at the initiator process, rather than distributed among different processes, it significantly simplifies the task of deadlock resolution, and helps to reduce system overhead associated with the resolution. The time complexity of our algorithm is also better than or equal to the existing algorithms.
{"title":"Optimal deadlock detection in distributed systems based on locally constructed wait-for graphs","authors":"Shigang Chen, Yi Deng, P. Attie, Wei Sun","doi":"10.1109/ICDCS.1996.508012","DOIUrl":"https://doi.org/10.1109/ICDCS.1996.508012","url":null,"abstract":"We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. This WFG is then searched for deadlock. The proposed algorithm has two primary advantages: First, it avoids sending messages along the edges of the global wait-for graph (WFG), thereby achieving a worst-case message complexity of 2n, where n is the number of processes in the WFG. Since information must be obtained from every process reachable from the initiator, this is optimal to within a constant factor. All the existing algorithms for the same problem construct a distributed snapshot of the WFG. As this involves sending messages along the edges of the WFG, the best available message complexity among these algorithms is 4e-2n+2l, which is O(n/sup 2/) in the worst case, where e and l are the number of edges and leaves in the WFG, respectively. Second, since the information about a detected deadlock is readily available at the initiator process, rather than distributed among different processes, it significantly simplifies the task of deadlock resolution, and helps to reduce system overhead associated with the resolution. The time complexity of our algorithm is also better than or equal to the existing algorithms.","PeriodicalId":159322,"journal":{"name":"Proceedings of 16th International Conference on Distributed Computing Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115622428","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
扫码关注我们
求助内容：
应助结果提醒方式：