Pub Date : 1992-04-14DOI: 10.1109/FTDCS.1992.217487
C. Ramamoorthy, C. Chandra, H. Kim, Y. Shim, V. Vij
The authors identify some of the problems in integration. They give a survey of the various integration strategies that have been proposed in the literature. The success of these integration strategies depends heavily on the characteristics of the application and choosing the appropriate strategy has been for the most part done subjectively. What is needed is a general model which allows the authors to quantitatively explore the tradeoffs and select a strategy or combination of strategies. They propose such a model for the integration process based on graph theory. Their model provides a quantitative method for comparing the different integration strategies to be used for integrating a particular system. Another issue in systems integration is maintaining the consistency of assumptions made by different software engineers. They suggest a technique to keep track of consistent assumptions during the development process.<>
{"title":"A model and methodology for distributed integration","authors":"C. Ramamoorthy, C. Chandra, H. Kim, Y. Shim, V. Vij","doi":"10.1109/FTDCS.1992.217487","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217487","url":null,"abstract":"The authors identify some of the problems in integration. They give a survey of the various integration strategies that have been proposed in the literature. The success of these integration strategies depends heavily on the characteristics of the application and choosing the appropriate strategy has been for the most part done subjectively. What is needed is a general model which allows the authors to quantitatively explore the tradeoffs and select a strategy or combination of strategies. They propose such a model for the integration process based on graph theory. Their model provides a quantitative method for comparing the different integration strategies to be used for integrating a particular system. Another issue in systems integration is maintaining the consistency of assumptions made by different software engineers. They suggest a technique to keep track of consistent assumptions during the development process.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"539 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132172477","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217508
T. Plagemann, B. Plattner, M. Vogt, T. Walter
This paper discusses the configuration of light-weight protocols. As opposed to other proposals which introduce a predetermined protocol hierarchy, the configuration is dynamic in the sense that an application can specify requirements of the underlying services and the configuration of a protocol is done with respect to these requirements. The approach discussed in this paper introduces a model for the configuration of protocols comprising of three layers: application, end-to-end communications, and transport infrastructure layer. The dynamic configuration takes place in the end-to-end communications layer. The emphasis of the paper is on the description of the model, a notation for the description of application requirements, and the configuration of protocol entities. The approach is particularly well-suited to make use of any progress in implementations of protocol functions.<>
{"title":"A model for dynamic configuration of light-weight protocols","authors":"T. Plagemann, B. Plattner, M. Vogt, T. Walter","doi":"10.1109/FTDCS.1992.217508","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217508","url":null,"abstract":"This paper discusses the configuration of light-weight protocols. As opposed to other proposals which introduce a predetermined protocol hierarchy, the configuration is dynamic in the sense that an application can specify requirements of the underlying services and the configuration of a protocol is done with respect to these requirements. The approach discussed in this paper introduces a model for the configuration of protocols comprising of three layers: application, end-to-end communications, and transport infrastructure layer. The dynamic configuration takes place in the end-to-end communications layer. The emphasis of the paper is on the description of the model, a notation for the description of application requirements, and the configuration of protocol entities. The approach is particularly well-suited to make use of any progress in implementations of protocol functions.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132252763","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217504
R. Tsai, Jiann-Liang Chen
The experience with the development and application of a cooperation multi-agent framework (CMAF) derived mainly from integrated technologies of distributed processing system, knowledge-based system, and object-oriented programming style is reported. At the same time, a two-level control mechanism which contains meta-planning and local-planning is also proposed to achieve the high degree of goodness in problem-solving process. At present, the developed prototyping of CMAF system is implemented based on two existed products: Cosmic's CLIPS and Sun's RPC. to demonstrate its effect, the fault management system is built using CMAF installed on the SUN network environment. It is found that using CMAF tool is a very efficient shell of the distributed problem solver. Moreover, based on the versatile properties of reusability shell, transparency facility, and adaptive knowledge base, the CMAF is referred to as tools for large distributed management systems in the future.<>
{"title":"A management paradigm in large distributed computing environment","authors":"R. Tsai, Jiann-Liang Chen","doi":"10.1109/FTDCS.1992.217504","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217504","url":null,"abstract":"The experience with the development and application of a cooperation multi-agent framework (CMAF) derived mainly from integrated technologies of distributed processing system, knowledge-based system, and object-oriented programming style is reported. At the same time, a two-level control mechanism which contains meta-planning and local-planning is also proposed to achieve the high degree of goodness in problem-solving process. At present, the developed prototyping of CMAF system is implemented based on two existed products: Cosmic's CLIPS and Sun's RPC. to demonstrate its effect, the fault management system is built using CMAF installed on the SUN network environment. It is found that using CMAF tool is a very efficient shell of the distributed problem solver. Moreover, based on the versatile properties of reusability shell, transparency facility, and adaptive knowledge base, the CMAF is referred to as tools for large distributed management systems in the future.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130795956","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217499
K. Liang, Y. Chen
The authors discuss an approach for fairness improvement in distributed queue dual bus (DQDB) network, which is a draft standard for IEEE 802.6 metropolitan area network (MAN). The DQDB medium access mechanism may be unfair for some realistic situations where both throughput and delay are dependent upon the geographic location of each node in the network. The authors analyze the asymmetric access property of DQDB and propose an approach called reservation capacity priority control (RCPC), which is both more efficient and fair for sending the segments. The RCPC allows the system to operate more uniformly and has a high degree of fairness in bandwidth sharing. The simulation results show that RCPC approach is more fair than bandwidth balancing mechanism under all traffic conditions.<>
{"title":"An approach for fairness improvement in DQDB networks","authors":"K. Liang, Y. Chen","doi":"10.1109/FTDCS.1992.217499","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217499","url":null,"abstract":"The authors discuss an approach for fairness improvement in distributed queue dual bus (DQDB) network, which is a draft standard for IEEE 802.6 metropolitan area network (MAN). The DQDB medium access mechanism may be unfair for some realistic situations where both throughput and delay are dependent upon the geographic location of each node in the network. The authors analyze the asymmetric access property of DQDB and propose an approach called reservation capacity priority control (RCPC), which is both more efficient and fair for sending the segments. The RCPC allows the system to operate more uniformly and has a high degree of fairness in bandwidth sharing. The simulation results show that RCPC approach is more fair than bandwidth balancing mechanism under all traffic conditions.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123469808","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217507
S. Bocking
This paper presents a lightweight transport protocol called TEMPO which is intended to satisfy the requirements of advanced applications and high-speed network properties. The versatile transport service of TEMPO allows transport users to define their appropriate transport service by composing elementary message streams. The arrangement of the streams is defined by interaction patterns which contain the transport addresses of the corresponding transport users and their relations. The pattern-directed addressing scheme allows TEMPO to support different service forms, e.g. a notification form to transmit single messages, a transaction form to exchange request and reply messages or a connection form to transfer uni- or bidirectionally an unlimited number of messages. Independent of the service form, TEMPO offers a multicasting and relaying function which can be used repeatedly and in various combinations. Based on network properties such as low error rate and high bandwidth, TEMPO was designed as a lightweight protocol: The instruction path and the number of network packet exchanges are minimized for an error free communication.<>
{"title":"TEMPO: a lightweight transport protocol","authors":"S. Bocking","doi":"10.1109/FTDCS.1992.217507","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217507","url":null,"abstract":"This paper presents a lightweight transport protocol called TEMPO which is intended to satisfy the requirements of advanced applications and high-speed network properties. The versatile transport service of TEMPO allows transport users to define their appropriate transport service by composing elementary message streams. The arrangement of the streams is defined by interaction patterns which contain the transport addresses of the corresponding transport users and their relations. The pattern-directed addressing scheme allows TEMPO to support different service forms, e.g. a notification form to transmit single messages, a transaction form to exchange request and reply messages or a connection form to transfer uni- or bidirectionally an unlimited number of messages. Independent of the service form, TEMPO offers a multicasting and relaying function which can be used repeatedly and in various combinations. Based on network properties such as low error rate and high bandwidth, TEMPO was designed as a lightweight protocol: The instruction path and the number of network packet exchanges are minimized for an error free communication.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125731415","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217483
A. Bondavalli, L. Simoncini
This paper presents a structured way of inserting software redundancy in programs and to describe the solutions provided for programming software fault-tolerance techniques. It is based on a data-flow like programming paradigm, which is more suitable to implement fault-tolerant systems, with high levels of flexibility and performability, than conventional imperative programming paradigms. The proposed computational model, BSM describes an application in a set of atomic modules, mainly functional, which: (1) maintain the visibility of the semantic of the application, in order to take full advantage of the possibility offered by the use of assertions and predicates for early error detection, and (2) maintain a close correlation between the logical structure of the application and the physical support, to take full advantage of replication as a mechanism of redundancy. The set of modules is executed asynchronously, with a firing rule similar to that of data-flow model; the modules are atomic and do not interact or communicate with other modules during execution, but release data only at their termination. The close correlation between the semantic of the application and the module structuring also allows to scale the needed redundancy since it can be properly driven by the semantic of the application itself.<>
{"title":"Structured software fault-tolerance with BSM","authors":"A. Bondavalli, L. Simoncini","doi":"10.1109/FTDCS.1992.217483","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217483","url":null,"abstract":"This paper presents a structured way of inserting software redundancy in programs and to describe the solutions provided for programming software fault-tolerance techniques. It is based on a data-flow like programming paradigm, which is more suitable to implement fault-tolerant systems, with high levels of flexibility and performability, than conventional imperative programming paradigms. The proposed computational model, BSM describes an application in a set of atomic modules, mainly functional, which: (1) maintain the visibility of the semantic of the application, in order to take full advantage of the possibility offered by the use of assertions and predicates for early error detection, and (2) maintain a close correlation between the logical structure of the application and the physical support, to take full advantage of replication as a mechanism of redundancy. The set of modules is executed asynchronously, with a firing rule similar to that of data-flow model; the modules are atomic and do not interact or communicate with other modules during execution, but release data only at their termination. The close correlation between the semantic of the application and the module structuring also allows to scale the needed redundancy since it can be properly driven by the semantic of the application itself.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124657900","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217486
M. Mutka, L.M. Ni
This paper presents the design and implementation of the PFS personal file management system. PFS provides transparent and reliable access to personal files that are dispersed across reliable independent file servers. PFS is unique and practical since it runs on variations of the Unix system, it does not modify the operating system kernel, and more importantly, it operates in environments in which a user lacks administrative control. By means of the PFS, a user creates a global structure of personal files that appear identical despite the server that the user accesses. Since each file is replicated once, the system provides transparent access to files despite one failure at any server.<>
{"title":"Managing personal files across independent file management units","authors":"M. Mutka, L.M. Ni","doi":"10.1109/FTDCS.1992.217486","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217486","url":null,"abstract":"This paper presents the design and implementation of the PFS personal file management system. PFS provides transparent and reliable access to personal files that are dispersed across reliable independent file servers. PFS is unique and practical since it runs on variations of the Unix system, it does not modify the operating system kernel, and more importantly, it operates in environments in which a user lacks administrative control. By means of the PFS, a user creates a global structure of personal files that appear identical despite the server that the user accesses. Since each file is replicated once, the system provides transparent access to files despite one failure at any server.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124712474","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 : 1992-04-14DOI: 10.1109/FTDCS.1992.217479
J. Tang
A distributed heterogeneous database system is a collection of interconnected local database systems with diverse properties and local autonomy. In such a system, it is difficult to maintain consistency without compromising local autonomy. A global concurrency control protocol is proposed that maintains consistency without compromising local autonomy. The scheme is based on the observation that sufficient read operations attached to global transactions can prevent local schedules from diverging while keeping the database states intact. The protocol is simple and easy to implement. It does not require the knowledge about local concurrency control methods. Thus local concurrency control mechanisms can be changed without affecting the global concurrency control scheme.<>
{"title":"Using dummy reads to maintain consistency in heterogeneous database systems","authors":"J. Tang","doi":"10.1109/FTDCS.1992.217479","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217479","url":null,"abstract":"A distributed heterogeneous database system is a collection of interconnected local database systems with diverse properties and local autonomy. In such a system, it is difficult to maintain consistency without compromising local autonomy. A global concurrency control protocol is proposed that maintains consistency without compromising local autonomy. The scheme is based on the observation that sufficient read operations attached to global transactions can prevent local schedules from diverging while keeping the database states intact. The protocol is simple and easy to implement. It does not require the knowledge about local concurrency control methods. Thus local concurrency control mechanisms can be changed without affecting the global concurrency control scheme.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126180263","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
扫码关注我们
求助内容：
应助结果提醒方式：