A lot of effort is being dedicated world-wide to defining Open Systems Interconnection (OSI) protocol standards and tools for formally describing them. However, little work is done in developing methods for applying these tools to the development of new protocols. This paper presents such a methodology based on OSI and software engineering principles. It provides general guidelines for designing protocols based on an extended state transition formal description technique (FDT). It emphasizes a systematic, analytical and algorithmic approach to achieve completeness of protocol specification during the protocol design process. Its possible application to the development of OSI protocol standards is discussed and suggested for study by the standards community.
{"title":"A methodology for protocol design and specification based on an extended state transition model","authors":"Richard Chung","doi":"10.1145/800056.802057","DOIUrl":"https://doi.org/10.1145/800056.802057","url":null,"abstract":"A lot of effort is being dedicated world-wide to defining Open Systems Interconnection (OSI) protocol standards and tools for formally describing them. However, little work is done in developing methods for applying these tools to the development of new protocols. This paper presents such a methodology based on OSI and software engineering principles. It provides general guidelines for designing protocols based on an extended state transition formal description technique (FDT). It emphasizes a systematic, analytical and algorithmic approach to achieve completeness of protocol specification during the protocol design process. Its possible application to the development of OSI protocol standards is discussed and suggested for study by the standards community.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123965835","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}
A request manager is described that provides a set of communication primitives supporting the cooperation between processes requesting service and processes providing service. These communication primitives allow the initiation and termination of atomic actions at remote sites. They also maintain recoverable action state tables, which can be used to recall uncompleted actions during restart recovery. The presented request manager is a good foundation on which to develop application oriented high-level primitives as well as language level primitives. Besides a detailed description of the services offered by the request manager, the paper develops a request management protocol that, no matter what happens, insures the atomic property of actions. Evaluation nets, which are a modified form of Petri nets, are applied to describe this protocol.
{"title":"Communication primitives supporting the execution of atomic actions at remote sites","authors":"K. Rothermel","doi":"10.1145/800056.802079","DOIUrl":"https://doi.org/10.1145/800056.802079","url":null,"abstract":"A request manager is described that provides a set of communication primitives supporting the cooperation between processes requesting service and processes providing service. These communication primitives allow the initiation and termination of atomic actions at remote sites. They also maintain recoverable action state tables, which can be used to recall uncompleted actions during restart recovery. The presented request manager is a good foundation on which to develop application oriented high-level primitives as well as language level primitives. Besides a detailed description of the services offered by the request manager, the paper develops a request management protocol that, no matter what happens, insures the atomic property of actions. Evaluation nets, which are a modified form of Petri nets, are applied to describe this protocol.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123544209","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}
In this brief note, I would like to review the histories of computer networking and multiprocessor architecture and suggest ways in which these two streams of research are flowing back together and enriching each other. One can view both fields of research as departures from an original von Neumann computer organization consisting of a central processing unit (CPU) acting on data in a main memory and interacting with the outside world through peripheral devices.
{"title":"Multiprocessors and computer networks","authors":"M. Solomon","doi":"10.1145/639624.802089","DOIUrl":"https://doi.org/10.1145/639624.802089","url":null,"abstract":"In this brief note, I would like to review the histories of computer networking and multiprocessor architecture and suggest ways in which these two streams of research are flowing back together and enriching each other. One can view both fields of research as departures from an original von Neumann computer organization consisting of a central processing unit (CPU) acting on data in a main memory and interacting with the outside world through peripheral devices.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124682055","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}
In a recent paper, the authors discussed verification of the connection management aspects of the NBS Class 4 transport protocol. An automated protocol development technique was used to verify a subset of the protocol with respect to the protocol properties of completeness, deadlock freeness, livelock freeness, boundedness, and termination. The analysis pointed out several error situations in which the completeness property did not hold for the protocol. This note summarizes the results of the automated analysis and also proposes some plausible solutions to the problems identified in the current specification.
{"title":"Automated verification of connection management of NBS class 4 transport protocol","authors":"D. Sidhu, T. Blumer","doi":"10.1145/800056.802064","DOIUrl":"https://doi.org/10.1145/800056.802064","url":null,"abstract":"In a recent paper, the authors discussed verification of the connection management aspects of the NBS Class 4 transport protocol. An automated protocol development technique was used to verify a subset of the protocol with respect to the protocol properties of completeness, deadlock freeness, livelock freeness, boundedness, and termination. The analysis pointed out several error situations in which the completeness property did not hold for the protocol. This note summarizes the results of the automated analysis and also proposes some plausible solutions to the problems identified in the current specification.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122178497","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}
Name servers that collectively manage a global name space facilitate sharing of resources in a large internetwork by providing means of locating named objects. The efficiency with which the name space can be managed is strongly influenced by the adopted naming convention. Structured name spaces are shown to simplify name space management from both an administrative and system viewpoint. Formulae have been derived which allow one to quantitatively measure the effect of the distributed name server configuration on a given client's level of performance. In general, the cost of a name server query can be reduced by distributing replicated copies of name server database entries in a way that exploits the locality of clients' reference patterns.
{"title":"An analysis of naming conventions for distributed computer systems","authors":"D. Terry","doi":"10.1145/800056.802081","DOIUrl":"https://doi.org/10.1145/800056.802081","url":null,"abstract":"Name servers that collectively manage a global name space facilitate sharing of resources in a large internetwork by providing means of locating named objects. The efficiency with which the name space can be managed is strongly influenced by the adopted naming convention. Structured name spaces are shown to simplify name space management from both an administrative and system viewpoint. Formulae have been derived which allow one to quantitatively measure the effect of the distributed name server configuration on a given client's level of performance. In general, the cost of a name server query can be reduced by distributing replicated copies of name server database entries in a way that exploits the locality of clients' reference patterns.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"21 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132808094","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}
This paper discusses design and performance aspects of Twentenet, one of the few implemented LANs which offers a service based on message priorities. The medium access mechanism uses the CSMA/CD principle, however with a deterministic collision resolution method. These characteristics make Twentenet suitable for real-time applications, as well as a mixture of real-time and non real-time applications. The general system structure is introduced followed by a detailed description of the priority access method. The performance of the system is shown for various traffic conditions and distributions of message priorities. The effect of system parameters, such as transmission rate, message length, cable length, and retry limits, is indicated.
{"title":"Twentenet: A LAN with message priorities, design and performance considerations.","authors":"I. Niemegeers, C. Vissers","doi":"10.1145/800056.802076","DOIUrl":"https://doi.org/10.1145/800056.802076","url":null,"abstract":"This paper discusses design and performance aspects of Twentenet, one of the few implemented LANs which offers a service based on message priorities. The medium access mechanism uses the CSMA/CD principle, however with a deterministic collision resolution method. These characteristics make Twentenet suitable for real-time applications, as well as a mixture of real-time and non real-time applications. The general system structure is introduced followed by a detailed description of the priority access method. The performance of the system is shown for various traffic conditions and distributions of message priorities. The effect of system parameters, such as transmission rate, message length, cable length, and retry limits, is indicated.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129795032","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}
A highly automated approach is proposed for validating the consistency of distinct representations of an identical software functionality. This approach is based on checking whether the observable behaviors presented by software functionality representations given in different levels of abstraction are consistent with one another. These representations are encoded in a relatively mechanical way as procedures in sequential PROLOG, a very high level language. The approach is extremely flexible, straight-forward to use, and particularly appropriate to layered protocol architectures. As well, the approach leads to more reliable and less tedious, less error-prone test harness construction and maintenance. A number of variations and extensions of the approach are given. The use of this approach is illustrated in the context of communication protocols design and evaluation.
{"title":"Automated testing of protocol specifications and their implementations","authors":"H. Ural, R. Probert","doi":"10.1145/800056.802072","DOIUrl":"https://doi.org/10.1145/800056.802072","url":null,"abstract":"A highly automated approach is proposed for validating the consistency of distinct representations of an identical software functionality. This approach is based on checking whether the observable behaviors presented by software functionality representations given in different levels of abstraction are consistent with one another. These representations are encoded in a relatively mechanical way as procedures in sequential PROLOG, a very high level language. The approach is extremely flexible, straight-forward to use, and particularly appropriate to layered protocol architectures. As well, the approach leads to more reliable and less tedious, less error-prone test harness construction and maintenance. A number of variations and extensions of the approach are given. The use of this approach is illustrated in the context of communication protocols design and evaluation.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"14 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114019944","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}
We present a solution to the problem of multidestination routing in internetworks. The component subnets of these internets share a common datagram internet layer, and the gateways and hosts can determine the next gateway en route to a foreign net. Our datagram routing offers high resilience to network failures, major reductions in network traffic, and no changes whatsoever to the subnetwork routing. The routing follows “shortest” paths as defined by the distance criteria of an internet. We intend to use the algorithm as an option of the DoD Internet Protocol with only minor changes to IP while preserving interoperability with IP modules not supporting multidestination.
{"title":"Datagram routing for internet multicasting","authors":"L. Aguilar","doi":"10.1145/800056.802060","DOIUrl":"https://doi.org/10.1145/800056.802060","url":null,"abstract":"We present a solution to the problem of multidestination routing in internetworks. The component subnets of these internets share a common datagram internet layer, and the gateways and hosts can determine the next gateway en route to a foreign net. Our datagram routing offers high resilience to network failures, major reductions in network traffic, and no changes whatsoever to the subnetwork routing. The routing follows “shortest” paths as defined by the distance criteria of an internet. We intend to use the algorithm as an option of the DoD Internet Protocol with only minor changes to IP while preserving interoperability with IP modules not supporting multidestination.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116535564","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}
In this paper, we provide the Petri net formal specifications of three important components of the ISO transport protocol: timeout mechanism, data transfer phase and connection establishment and release phases. A validation of these component Petri net specifications is then presented, followed by a discussion of its results. The validations we conducted made use of a software tool based on OGIVE [1], which can check a given Petri net for general properties such as boundedness, properness and liveness, and designer defined structural properties using Petri net invariants. We have extended OGIVE to allow for the checking of reception errors and state ambiguities as well.
{"title":"Formal specification and validation of ISO transport protocol components, using petri nets","authors":"Wolfgang Jürgensen, S. Vuong","doi":"10.1145/800056.802063","DOIUrl":"https://doi.org/10.1145/800056.802063","url":null,"abstract":"In this paper, we provide the Petri net formal specifications of three important components of the ISO transport protocol: timeout mechanism, data transfer phase and connection establishment and release phases. A validation of these component Petri net specifications is then presented, followed by a discussion of its results. The validations we conducted made use of a software tool based on OGIVE [1], which can check a given Petri net for general properties such as boundedness, properness and liveness, and designer defined structural properties using Petri net invariants. We have extended OGIVE to allow for the checking of reception errors and state ambiguities as well.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124917761","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}
The paper outlines the conceptual and practical aspects encountered in the design and implementation of a heterogeneous computer network based on the standardization output. We discuss the feasability of the reference model and its related standards from a design, implementation and operational point of view focussing on the adopted solutions and their rationales.
{"title":"Some critical considerations on the ISO/OSI RM from a network implementation point of view","authors":"R. Popescu-Zeletin","doi":"10.1145/800056.802077","DOIUrl":"https://doi.org/10.1145/800056.802077","url":null,"abstract":"The paper outlines the conceptual and practical aspects encountered in the design and implementation of a heterogeneous computer network based on the standardization output. We discuss the feasability of the reference model and its related standards from a design, implementation and operational point of view focussing on the adopted solutions and their rationales.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117300843","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
扫码关注我们
求助内容：
应助结果提醒方式：