A minimal duplex connection capability is described as the ability to open, close, abort, and transfer data through a duplex connection between two application processes. The goal of this paper is to describe a minimal duplex connection capability for the top three layers of the Open Systems Interconnection (OSI) Reference Model that will be appropriate for use by very small Open Systems such as home computers. Such a connection capability would allow these small systems to interconnect with machines of arbitrary size. The approach taken is to use only the parameters on service primitives that are absolutely required to accomplish this connection service. The protocol and services necessary to accomplish such a minimal connection are described for the application, presentation, and session layers of the OSI Reference Model. The existing draft proposals for services and protocol for the session layer provide a basis for this duplex connection service. A minor modification to the session draft proposals is suggested. The services for the presentation and application layer are defined in terms of the tentative service primitives being considered in the international standards efforts. The transparent initial context defined for the presentation layer is used to minimize the work of that layer. The benefits of this minimal duplex connection capability are then discussed from the point of view of very small Open Systems.
{"title":"A minimal duplex connection capability in the top three layers of the OSI reference model","authors":"M. F. Dolan","doi":"10.1145/800056.802078","DOIUrl":"https://doi.org/10.1145/800056.802078","url":null,"abstract":"A minimal duplex connection capability is described as the ability to open, close, abort, and transfer data through a duplex connection between two application processes. The goal of this paper is to describe a minimal duplex connection capability for the top three layers of the Open Systems Interconnection (OSI) Reference Model that will be appropriate for use by very small Open Systems such as home computers. Such a connection capability would allow these small systems to interconnect with machines of arbitrary size. The approach taken is to use only the parameters on service primitives that are absolutely required to accomplish this connection service. The protocol and services necessary to accomplish such a minimal connection are described for the application, presentation, and session layers of the OSI Reference Model. The existing draft proposals for services and protocol for the session layer provide a basis for this duplex connection service. A minor modification to the session draft proposals is suggested. The services for the presentation and application layer are defined in terms of the tentative service primitives being considered in the international standards efforts. The transparent initial context defined for the presentation layer is used to minimize the work of that layer. The benefits of this minimal duplex connection capability are then discussed from the point of view of very small Open Systems.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"17 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":"129267014","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 apply a method of automatic proof to verify some properties of a computer network protocol. The method used is defined as an extension of classical resolution to temporal operators (@@@@), (@@@@), (@@@@) and Until. We define a Precedes operator that is very useful for the specification of protocols. The method has the form of a set of recursive rules. The examples that we give are FIFO and LIFO queues and the alternating bit protocol, and the properties that we verify are livennes properties of the Sender and Receiver processes in order to prove a liveness property of the global system.
{"title":"A method of automatic proof for the specification and verification of protocols","authors":"A. Cavalli","doi":"10.1145/800056.802066","DOIUrl":"https://doi.org/10.1145/800056.802066","url":null,"abstract":"In this paper we apply a method of automatic proof to verify some properties of a computer network protocol. The method used is defined as an extension of classical resolution to temporal operators (@@@@), (@@@@), (@@@@) and Until. We define a Precedes operator that is very useful for the specification of protocols. The method has the form of a set of recursive rules. The examples that we give are FIFO and LIFO queues and the alternating bit protocol, and the properties that we verify are livennes properties of the Sender and Receiver processes in order to prove a liveness property of the global system.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"294 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114029632","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}
Interprocess communication (IPC) normally allows one process to communicate with only one other process at a time. One-to-many IPC allows one process to communicate simultaneously with a group of processes., possibly of unknown membership. While the broadcast and multicast facilities of local networks support efficient one-to-many communication between hosts, its use between processes has been limited by the lack of support in the distributed operating system. This paper describes the integration of one-to-many communication into V interprocess communication system. We discuss the different models of use and the reliability and present some initial applications.
{"title":"One-to-many interprocess communication in the V-system","authors":"D. Cheriton, W. Zwaenepoel","doi":"10.1145/800056.802061","DOIUrl":"https://doi.org/10.1145/800056.802061","url":null,"abstract":"Interprocess communication (IPC) normally allows one process to communicate with only one other process at a time. One-to-many IPC allows one process to communicate simultaneously with a group of processes., possibly of unknown membership. While the broadcast and multicast facilities of local networks support efficient one-to-many communication between hosts, its use between processes has been limited by the lack of support in the distributed operating system. This paper describes the integration of one-to-many communication into V interprocess communication system. We discuss the different models of use and the reliability and present some initial applications.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"14 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":"133582937","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 computer communication networks, routing is often accomplished by maintaining copies of the network topology and dynamic performance characteristics in various network nodes. The present paper describes an algorithm that allows complete flexibility in the placement of the topology information. In particular, we assume that an arbitrary subset of network nodes are capable of maintaining the topology. In this environment, protocols are defined to allow automatic updates to flow between these more capable nodes. In addition, protocols are defined to allow less capable nodes to report their topology data to the major nodes, and acquire route information from them.
{"title":"Automatic update of replicated topology data bases","authors":"J. Jaffe, A. Segall","doi":"10.1145/800056.802071","DOIUrl":"https://doi.org/10.1145/800056.802071","url":null,"abstract":"In computer communication networks, routing is often accomplished by maintaining copies of the network topology and dynamic performance characteristics in various network nodes. The present paper describes an algorithm that allows complete flexibility in the placement of the topology information. In particular, we assume that an arbitrary subset of network nodes are capable of maintaining the topology. In this environment, protocols are defined to allow automatic updates to flow between these more capable nodes. In addition, protocols are defined to allow less capable nodes to report their topology data to the major nodes, and acquire route information from them.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"22 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":"123817780","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 Universe Network is composed of a number of local area networks at various sites in the U. K., joined by high capacity data links. Apart from one token ring, all of the local area networks are Cambridge rings; the high capacity data links are provided by a 1 Mbit/s satellite broadcast channel. The Universe Project encompasses both the design and implementation of the network, and a program of experiments which make use of the network. One of the notable features of the network is that a host's view of communication over the network is no different from communication over a single ring; no internet protocol is used.
{"title":"The architecture of the universe network","authors":"I. Leslie, R. Needham, J. Burren, Graham C. Adams","doi":"10.1145/800056.802053","DOIUrl":"https://doi.org/10.1145/800056.802053","url":null,"abstract":"The Universe Network is composed of a number of local area networks at various sites in the U. K., joined by high capacity data links. Apart from one token ring, all of the local area networks are Cambridge rings; the high capacity data links are provided by a 1 Mbit/s satellite broadcast channel. The Universe Project encompasses both the design and implementation of the network, and a program of experiments which make use of the network. One of the notable features of the network is that a host's view of communication over the network is no different from communication over a single ring; no internet protocol is used.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"552 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":"133988468","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 present and analyze a class of tree algorithms with variable message length. First we analyze the algorithm according to which a message, consisting of a number of packets, is transmitted continuously after the successful transmission of its first packet, referred to as the tree algorithm with variable message length. The analysis of the algorithm is presented for the two cases of small number of users and of large number of users. In both cases the analysis shows a considerable improvement for the maximum throughput, which gets larger as the average message length increases. Second, we present the reservation tree algorithm, R-Tree, which uses &test& packets instead of the message's first packet to resolve the collision among users. The R-Tree maximum throughput approaches one as the average message length increases, which for single packet messages can be a maximum throughput of 0.776 for infinite number of users.
{"title":"A class of tree algorithms with variable message length","authors":"D. Gerakoulis, T. Saadawi, D. Schilling","doi":"10.1145/800056.802084","DOIUrl":"https://doi.org/10.1145/800056.802084","url":null,"abstract":"In this paper we present and analyze a class of tree algorithms with variable message length. First we analyze the algorithm according to which a message, consisting of a number of packets, is transmitted continuously after the successful transmission of its first packet, referred to as the tree algorithm with variable message length. The analysis of the algorithm is presented for the two cases of small number of users and of large number of users. In both cases the analysis shows a considerable improvement for the maximum throughput, which gets larger as the average message length increases. Second, we present the reservation tree algorithm, R-Tree, which uses &test& packets instead of the message's first packet to resolve the collision among users. The R-Tree maximum throughput approaches one as the average message length increases, which for single packet messages can be a maximum throughput of 0.776 for infinite number of users.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"33 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":"116152599","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 National Bureau of Standards has three primary goals in computer networking. 1. To develop networking and protocol standards which meet U.S. Government and industry requirements and will be implemented in off-the-shelf, commercial products. 2. To develop testing methodologies to support the development and implementation of computer network protocols; and 3. To assist Government and industry users in the application of advanced networking technologies, and computer and communication manufacturers, in the implementation of standard protocols. To support these objectives, NBS has laboratory activities where prototypes of draft protocol standards are implemented and tested in a variety of communications environments (e.g. global networks, local networks, office systems networks), supporting different applications (e.g. file transfer, message processing), on difference kinds and sizes of computers. The primary purposes are to advance the state of the art in measurement methodologies for advanced computer networking technologies, and to determine protocol implementation correctness and performance. NBS views testing as a cooperative research effort and works with other agencies, private sector companies and other countries in the development of methodologies. At this time, this cooperation involves five network laboratories in other countries and over 20 computer manufacturers. The test methodologies developed at NBS are well documented and the testing tools themselves are developed with an objective of portability and made available to many organizations engaged in protocol development and implementations. Consistent with goals, NBS standards developments, research in testing methodologies, and technical assistance are characterized by direct industry/government cooperation and mutual support.
{"title":"Protocol testing methdology development at NBS","authors":"R. Blanc","doi":"10.1145/639624.802086","DOIUrl":"https://doi.org/10.1145/639624.802086","url":null,"abstract":"The National Bureau of Standards has three primary goals in computer networking. 1. To develop networking and protocol standards which meet U.S. Government and industry requirements and will be implemented in off-the-shelf, commercial products. 2. To develop testing methodologies to support the development and implementation of computer network protocols; and 3. To assist Government and industry users in the application of advanced networking technologies, and computer and communication manufacturers, in the implementation of standard protocols. To support these objectives, NBS has laboratory activities where prototypes of draft protocol standards are implemented and tested in a variety of communications environments (e.g. global networks, local networks, office systems networks), supporting different applications (e.g. file transfer, message processing), on difference kinds and sizes of computers. The primary purposes are to advance the state of the art in measurement methodologies for advanced computer networking technologies, and to determine protocol implementation correctness and performance. NBS views testing as a cooperative research effort and works with other agencies, private sector companies and other countries in the development of methodologies. At this time, this cooperation involves five network laboratories in other countries and over 20 computer manufacturers. The test methodologies developed at NBS are well documented and the testing tools themselves are developed with an objective of portability and made available to many organizations engaged in protocol development and implementations. Consistent with goals, NBS standards developments, research in testing methodologies, and technical assistance are characterized by direct industry/government cooperation and mutual support.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"38 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":"126744872","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}
Many real-life protocols can be observed to go through different phases performing a distinct function in each phase. We present a multi-phase model for such protocols. A phase is formally defined to be a network of communicating finite state machines with certain desirable correctness properties; these include proper termination, and freedom from deadlocks and unspecified receptions. A multi-function protocol is constructed by first constructing separate phases to perform its different functions. We discuss how to connect these phases together to implement the multi-function protocol such that the resulting network of communicating finite state machines is also a phase (i.e. it possesses the desirable properties defined for phases). A high-level session control protocol modeled after one in IBM's Systems Network Architecture is discussed, and constructed as a multi-phase protocol.
{"title":"An exercise in constructing multi-phase communication protocols","authors":"C. E. Chow, M. Gouda, S. Lam","doi":"10.1145/800056.802058","DOIUrl":"https://doi.org/10.1145/800056.802058","url":null,"abstract":"Many real-life protocols can be observed to go through different phases performing a distinct function in each phase. We present a multi-phase model for such protocols. A phase is formally defined to be a network of communicating finite state machines with certain desirable correctness properties; these include proper termination, and freedom from deadlocks and unspecified receptions. A multi-function protocol is constructed by first constructing separate phases to perform its different functions. We discuss how to connect these phases together to implement the multi-function protocol such that the resulting network of communicating finite state machines is also a phase (i.e. it possesses the desirable properties defined for phases). A high-level session control protocol modeled after one in IBM's Systems Network Architecture is discussed, and constructed as a multi-phase protocol.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"30 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":"121525593","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
扫码关注我们
求助内容：
应助结果提醒方式：