{"title":"An algebraic approach to validate communication protocols","authors":"A. Benslimane","doi":"10.1109/FTDCS.1992.217517","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217517","url":null,"abstract":"Realizing the need for a precise model of computer communications protocols, many different approaches are being investigated. The author presents an algebraic approach to formally specify protocols composed of many modules. The protocols studied are described in the model of finite state machine and then transformed into a set of process equations. The main concept consists in carrying out transformations on these equations in order to prove some properties. The reachability analysis can then be defined in the form of algebraic transformation rules applied to the global system states. The properties to verify during the communication between processes are the detection of some logical errors such as deadlocks, blocking or unspecified receptions.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"43 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":"125383483","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 service platform for distributed applications","authors":"R. Popescu-Zeletin, V. Tschammer, M. Tschichholz","doi":"10.1109/FTDCS.1992.217520","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217520","url":null,"abstract":"The paper presents the main rationales and design concepts for an architecture and service platform for the development of distributed applications in a cooperative open environment. This environment can be characterised as a 'service market' where various services are offered at different costs and with different qualities. Suitable servers must be selected from a large, varying number of components residing at different locations and belonging to a variety of organisations. In the architecture four planes are identified and the solutions adopted for each plane are described.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":" 42","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132189081","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":"Distributed fault-tolerant routing in Kautz networks","authors":"Wei-Kuo Chiang, Rong-Jaye Chen","doi":"10.1109/FTDCS.1992.217481","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217481","url":null,"abstract":"For a Kautz network with faulty components the authors propose a distributed fault-tolerant routing scheme, called DFTR, in which each nonfaulty node knows no more than the condition of its links and adjacent nodes. They construct rooted tree for a given destination in the Kautz network, and use it to develop DFTR such that a faulty component will never be encountered more than once. In DFTR, each node attempts to route a message via the shortest path. If a node on the path detects a faulty node at the next hop, a best alternative path for routing the message around the faulty component is to be obtained. A best alternative path is first generated by the reduced concatenation of this node and the destination, and then is checked to make sure that it does not contain any of encountered faulty nodes. If it does a new alternative path is generated as before. The authors invent an efficient approach in the checking step to reduce computational time. With slight modification, DFTR may adapt to de Bruijn networks as well.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"26 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":"124467922","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. Schaffa, M. Willebeek-LeMair, B. Patel, M. Gerla
{"title":"A demand driven access protocol for high speed networks","authors":"F. Schaffa, M. Willebeek-LeMair, B. Patel, M. Gerla","doi":"10.1109/FTDCS.1992.217500","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217500","url":null,"abstract":"A demand driven access (DDA) protocol for fiber-optic slotted rings is presented. The proposed protocol is simple and distributed. Under light load conditions, the protocol allows for efficient use of the available bandwidth since no overhead is incurred. In effect, the protocol is demand driven since access arbitration is only activated as the load increases in order to guarantee all nodes a maximum access delay. The protocol is designed for a counter-rotating dual-ring topology. Counter-rotating rings are required to carry backpressure control information in the opposite direction of the data flow. Furthermore, slots are freed at the destination node (as opposed to the source node). This considerably increases the potential throughput of the network. Simulation results demonstrate that for a ring a N nodes, given a uniform destination distribution, a maximum throughput of close to N/4 packets per slot time is achieved under heavy load conditions. Under these load conditions, the average access delay per packet is also on the order of N/4 slot times. The DDA protocol is shown to outperform FDDI both in terms of throughput and access delay.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"30 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":"129179697","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":"Monitoring multimedia systems","authors":"J. Scholten, J. Posthuma","doi":"10.1109/FTDCS.1992.217470","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217470","url":null,"abstract":"As part of a multimedia project research is being done in the area of monitoring and debugging. The monitor to be discussed in this paper is intended for use in distributed systems, in particular in a network of multimedia workstations. The monitor is the first phase in the development of a multimedia debugger. It taps (selected) information streams, tasks, communications, etc. The monitor then displays assorted information on a graphics display and/or stores it in a database for later display and analysis. The debugger is not concerned with 'low level' entities in the system, like values of variables, or contents of registers. This kind of information is handled by a source level debugger which is executed from within the 'high level' debugger. This approach ensures a consistent user interface for the debug system.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"19 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":"122018339","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 system response time model for local area networks","authors":"N. Schneidewind","doi":"10.1109/FTDCS.1992.217469","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217469","url":null,"abstract":"There are several issues that confront LAN management with respect to allocating servers and files in a LAN. These are: how many servers should be used for a given number of user computers? Should files be replicated on the servers to provide better performance or should the available servers store different files in order to maximize the number and variety of programs on the LAN? What should be the acceptable access times for users, singly and simultaneously, to access an application program, with a given number of servers and user computers? These issues are analyzed as a problem in optimization to determine the optimal server/user computer ratios and degree of file replication for given access times. Analytical and empirical results are reported.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"11 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120914488","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":"Real-time Descartes: a real-time specification language","authors":"K. Sung, J. Urban","doi":"10.1109/FTDCS.1992.217511","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217511","url":null,"abstract":"Real-time Descartes is a formal language for specifying real-time software, which is an extension of the executable Descartes specification language. Many formal specification techniques have been proposed to conceptualize real-world semantics of the inherently complex nature of real-time systems. Descartes as one of the specification languages based on the functional model has the advantages of easy constructibility and comprehensibility. Real-time Descartes makes effective use of the advantages of the finite state machine (FSM) model, the assertional model, and the process model while overcoming the disadvantages of the functional model. Easy constructibility and comprehensibility of Real-time Descartes will lessen the burden from software developers and reduce the understanding gap among participants.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"19 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":"126932630","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":"Group orientation: a paradigm for distributed systems of the nineties","authors":"Paulo Veríssimo, Luís E. T. Rodrigues","doi":"10.1109/FTDCS.1992.217514","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217514","url":null,"abstract":"Increasing use of distributed systems, with the corresponding decentralization of activities, stimulates the need for structuring those activities around groups of participants, for reasons of consistency, user-friendliness, performance and dependability. Two very diverse fields illustrate this trend: computer supported cooperative group working; distributed computer control. This paper discusses ways for structuring systems and defining building blocks for group-oriented activity. It is felt that efficient abstractions for the design of highly distributed applications should be structured around concepts like object groups. Furthermore, the group concept should pervade the whole architecture, from network multicasting, to group communications and management, and fundamental synchronisation paradigms. Emerging technology will help materialize these concepts.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"1 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":"130855614","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 architecture for multimedia data stream handling and its implication for multimedia transport service interfaces","authors":"R. Herrtwich","doi":"10.1109/FTDCS.1992.217484","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217484","url":null,"abstract":"A multimedia software system architecture should reflect that-for performance reasons-digital audio and video data is routed through different paths in a computer than traditional data. The author proposes a multimedia architecture based on the notion of 'stream handlers' which generate, filter, forward or consume multimedia data within a real-time environment. Stream handlers provide control operations to determine the content and direction of a multimedia stream. A multimedia transport system is discussed as an example of a multimedia stream handler.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"1 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":"131125053","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 optimal distributed algorithm for failure-driven leader election in bounded-degree networks","authors":"Y. Chow, K. Luo, R. Newman-wolfe","doi":"10.1109/FTDCS.1992.217503","DOIUrl":"https://doi.org/10.1109/FTDCS.1992.217503","url":null,"abstract":"The authors consider the leader election problem in point-to-point network where the number of communication links for each node is bounded. Instead of focusing on electing a leader as an initialization step, this paper emphasizes the election of the leader in a fault-tolerant distributed system where the election is triggered by the failure or the abdication of the current leader; it is assumed that the number of initiators that detect the failure or the abdication and start the election algorithm is bounded. A leader election algorithm is presented. The algorithm is based on a new approach that is sharply different from those of previous works: timestamped multiple-sourced flooding. The worst-case time and communication complexities of the algorithm are both optimal; the former is O(D) and the latter is O(E) equivalent to O(N) in the authors network model.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"63 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":"131675567","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}