This paper is intended to survey the applicability of Petri nets for protocol, as well as for service specification and validation. At the specification level, different classes of nets are introduced, and emphasis is given to the modular specification of a protocol layer. At the validation level, the analysis techniques implemented in the CAD package OGIVE/OVIDE are presented, and are used in order to prove safety and progress properties of a protocol layer. Finally, the specification and validation of the ISO Transport protocol is chosen as a significant example of the proposed design methodology.
{"title":"Petri nets are good for protocols","authors":"J. Courtiat, J. Ayache, B. Algayres","doi":"10.1145/800056.802062","DOIUrl":"https://doi.org/10.1145/800056.802062","url":null,"abstract":"This paper is intended to survey the applicability of Petri nets for protocol, as well as for service specification and validation. At the specification level, different classes of nets are introduced, and emphasis is given to the modular specification of a protocol layer. At the validation level, the analysis techniques implemented in the CAD package OGIVE/OVIDE are presented, and are used in order to prove safety and progress properties of a protocol layer. Finally, the specification and validation of the ISO Transport protocol is chosen as a significant example of the proposed design methodology.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"12 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":"130433842","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}
Communication between various makes of communication equipment and across international boundaries is becoming easier due to the continuing development of international standards on communication protocols, such as those defined by ISO for Open Systems Interworking (OSI). Although the agreement to use standard protocols by the various parties involved is the first necessary step towards OSI, it is not sufficient without assuring that the protocols be correctly implemented in the communication equipment. The assessment of the adherence of a communication protocol implementation to its specification relies on testing as its main tool. The development of the tests and their application (the architecture of the test system) have properties and constraints which make them different from those currently created for testing hardware and software systems. In the remainder of the presentation, these constraints and problems as related to the successful development of a protocol test system will be reviewed. They will be separated into those aspects which pertain more to the form of the test support system (the system architecture), and to those which influence the selection of effective test interaction sequences. This division is slightly arbitrary, for some of the issues have effect on both of the above components of the test system.
{"title":"Some issues in protocol implementation testing","authors":"E. Cerny","doi":"10.1145/800056.802087","DOIUrl":"https://doi.org/10.1145/800056.802087","url":null,"abstract":"Communication between various makes of communication equipment and across international boundaries is becoming easier due to the continuing development of international standards on communication protocols, such as those defined by ISO for Open Systems Interworking (OSI). Although the agreement to use standard protocols by the various parties involved is the first necessary step towards OSI, it is not sufficient without assuring that the protocols be correctly implemented in the communication equipment. The assessment of the adherence of a communication protocol implementation to its specification relies on testing as its main tool. The development of the tests and their application (the architecture of the test system) have properties and constraints which make them different from those currently created for testing hardware and software systems. In the remainder of the presentation, these constraints and problems as related to the successful development of a protocol test system will be reviewed. They will be separated into those aspects which pertain more to the form of the test support system (the system architecture), and to those which influence the selection of effective test interaction sequences. This division is slightly arbitrary, for some of the issues have effect on both of the above components of the test system.","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":"126189265","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 method for analyzing the performance of computer communication networks using queueing network models (QNM's) is presented in this paper. The user/computer sites are interconnected by a wide-area network with an end-to-end window flow-control mechanism. The QNM for the system including the communication subnet and the host computers is intractable because of blocking due to window flow control and memory constraints at computer systems, even under otherwise analytically favorable assumptions. The approximate solution method, which is based on iteration and decomposition, combines several recently developed computationally inexpensive algorithms to compute user response times, taking into account the delay in the communication network and the processing time at computer systems. We also introduce a fast non-iterative procedure to analyze QNM's with external arrivals and with population size constraints, such that blocked customers are queued. The effect of the choice of window sizes and minimum link/bifurcated routing on system performance is investigated.
{"title":"Analytic solution of an integrated performance model of a computer communication network with window flow control","authors":"Alexander Thomasian, Paul F. Bay","doi":"10.1145/800056.802082","DOIUrl":"https://doi.org/10.1145/800056.802082","url":null,"abstract":"A method for analyzing the performance of computer communication networks using queueing network models (QNM's) is presented in this paper. The user/computer sites are interconnected by a wide-area network with an end-to-end window flow-control mechanism. The QNM for the system including the communication subnet and the host computers is intractable because of blocking due to window flow control and memory constraints at computer systems, even under otherwise analytically favorable assumptions. The approximate solution method, which is based on iteration and decomposition, combines several recently developed computationally inexpensive algorithms to compute user response times, taking into account the delay in the communication network and the processing time at computer systems. We also introduce a fast non-iterative procedure to analyze QNM's with external arrivals and with population size constraints, such that blocked customers are queued. The effect of the choice of window sizes and minimum link/bifurcated routing on system performance is investigated.","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":"120939039","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 series of simulation studies into channel access protocols suitable for use in local area networks operating in baseband mode at bit rates of 100 Mbit/s or more is presented, and the usefulness of these protocols for supporting data transmission with mixed traffic is discussed.
{"title":"Analysis of channel access schemes for high-speed LANs","authors":"Niels Nørup Pedersen, Robin Sharp","doi":"10.1145/800056.802074","DOIUrl":"https://doi.org/10.1145/800056.802074","url":null,"abstract":"A series of simulation studies into channel access protocols suitable for use in local area networks operating in baseband mode at bit rates of 100 Mbit/s or more is presented, and the usefulness of these protocols for supporting data transmission with mixed traffic is discussed.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"43 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":"131997970","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 being used to explore broadcasting techniques in a highly integrated computer communications experiment connecting local area networks via a broadcast satellite channel. The broadcast protocol which has been devised within the Project provides a versatile framework in which different types of broadcast applications can be carried out. The requirements and definition of this protocol are described, and details are given of how the broadcast satellite channel is used and the implementation of the protocols in the system which provides satellite access from each site. Experimental use of the protocol is also described, in particular its use for file distribution. The paper also aims to show how the protocols could be used for more advanced applications.
{"title":"The use of broadcast techniques on the universe network","authors":"A. Waters, C. Adams, I. Leslie, R. Needham","doi":"10.1145/800056.802059","DOIUrl":"https://doi.org/10.1145/800056.802059","url":null,"abstract":"The Universe network is being used to explore broadcasting techniques in a highly integrated computer communications experiment connecting local area networks via a broadcast satellite channel. The broadcast protocol which has been devised within the Project provides a versatile framework in which different types of broadcast applications can be carried out. The requirements and definition of this protocol are described, and details are given of how the broadcast satellite channel is used and the implementation of the protocols in the system which provides satellite access from each site. Experimental use of the protocol is also described, in particular its use for file distribution. The paper also aims to show how the protocols could be used for more advanced applications.","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":"125989435","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 presents and analyses a simple algorithm for setting an adaptive timeout value at a source Host for end-to-end retransmission on a packet-switched connection. The algorithm allows the recipient Host to acknowledge arriving data in either original transmission order or out-of-order. The time out at the source Host is determined from current estimates - using exponentially weighted moving averages - of the mean and variance of successive acknowledgement delays. We show that when these delays are random variables forming certain stationary or non-stationary stochastic processes, the ensuing timeout gives a near-minimum retransmission delay, subject to some specified limit on the amount of unnecessary retransmission. This property is illustrated for a simulated sequence of acknowledgement delays obtained from loop delay measurements.
{"title":"An adaptive timeout algorithm for retransmission across a packet switching network","authors":"S. W. Edge","doi":"10.1145/800056.802085","DOIUrl":"https://doi.org/10.1145/800056.802085","url":null,"abstract":"This paper presents and analyses a simple algorithm for setting an adaptive timeout value at a source Host for end-to-end retransmission on a packet-switched connection. The algorithm allows the recipient Host to acknowledge arriving data in either original transmission order or out-of-order. The time out at the source Host is determined from current estimates - using exponentially weighted moving averages - of the mean and variance of successive acknowledgement delays. We show that when these delays are random variables forming certain stationary or non-stationary stochastic processes, the ensuing timeout gives a near-minimum retransmission delay, subject to some specified limit on the amount of unnecessary retransmission. This property is illustrated for a simulated sequence of acknowledgement delays obtained from loop delay measurements.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"15 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":"129212657","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 documents our efforts to connect our network front-ends to the 10 Mbps Ethernet,TM and presents some quantitative and qualitative results that may prove useful to those who, like us, are implementing a distributed-function architecture built upon a high-speed local area network.
{"title":"Interfacing to the 10Mbps ethernetTM: Observations and conclusions","authors":"Jose Nabielsky","doi":"10.1145/800056.802069","DOIUrl":"https://doi.org/10.1145/800056.802069","url":null,"abstract":"This paper documents our efforts to connect our network front-ends to the 10 Mbps Ethernet,TM and presents some quantitative and qualitative results that may prove useful to those who, like us, are implementing a distributed-function architecture built upon a high-speed local area network.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"7 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":"124221211","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}
Petri Net models have been extended in a variety of ways and have been used to prove the correctness and evaluate the performance of communication protocols. Several extensions have been proposed to model time. This work uses a form of Timed Petri Nets and presents a technique for symbolically deriving expressions, which describe system performance. Unlike past work on performance evaluation of Petri Nets which assumes a priori knowledge of specific time delays, the technique presented here applies to a wide range of time delays so long as the delays satisfy a set of timing constraints. The technique is demonstrated using a simple communication protocol.
{"title":"The derivation of performance expressions for communication protocols from timed petri net models","authors":"R. Razouk","doi":"10.1145/800056.802080","DOIUrl":"https://doi.org/10.1145/800056.802080","url":null,"abstract":"Petri Net models have been extended in a variety of ways and have been used to prove the correctness and evaluate the performance of communication protocols. Several extensions have been proposed to model time. This work uses a form of Timed Petri Nets and presents a technique for symbolically deriving expressions, which describe system performance. Unlike past work on performance evaluation of Petri Nets which assumes a priori knowledge of specific time delays, the technique presented here applies to a wide range of time delays so long as the delays satisfy a set of timing constraints. The technique is demonstrated using a simple communication protocol.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"15 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":"123760793","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 uses a broadcast satellite channel to connect local area networks into a high speed wide area network. The satellite channel is scheduled using a packet TDMA scheme. Time allocation is controlled by one site acting as master, but is based on indications received from each participating site about its own requirements. The TDMA scheduling is thus based not on circuits or the requirements of individual packets, but on a picture of the distributed requirements of the network as a whole. The paper describes the protocol currently implemented on the Universe network and looks forward to a more general way of applying this technique.
{"title":"The satellite transmission protocol of the universe project","authors":"A. Waters, C. Adams","doi":"10.1145/800056.802055","DOIUrl":"https://doi.org/10.1145/800056.802055","url":null,"abstract":"The Universe network uses a broadcast satellite channel to connect local area networks into a high speed wide area network. The satellite channel is scheduled using a packet TDMA scheme. Time allocation is controlled by one site acting as master, but is based on indications received from each participating site about its own requirements. The TDMA scheduling is thus based not on circuits or the requirements of individual packets, but on a picture of the distributed requirements of the network as a whole. The paper describes the protocol currently implemented on the Universe network and looks forward to a more general way of applying this technique.","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":"114518452","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 achievement of widely accepted standards for Open Systems Interconnection (OSI) is closely tied to the ability of producing unambiguous and implementation independent specifications of related protocols and services. LOTOS, the Language fOr Temporal Ordering Specification, is a Formal Description Technique (FDT) whose definition, though not completed, has already reached such a state as to allow trial specifications of rather sophisticated services and protocols. This paper explores the specification in LOTOS of some of the session services whose discussion is underway within various standardization bodies. Conciseness of specification is tried by adopting a few notational variants which are guessed to be useful at various OSI layers. The session services selected for this trial specification comprise the Basic Combined Subset (BCS) enriched with the Expedited Data service.
{"title":"A temporal ordering specification of some session services","authors":"V. Carchiolo, A. Faro, G. Scollo","doi":"10.1145/800056.802067","DOIUrl":"https://doi.org/10.1145/800056.802067","url":null,"abstract":"The achievement of widely accepted standards for Open Systems Interconnection (OSI) is closely tied to the ability of producing unambiguous and implementation independent specifications of related protocols and services. LOTOS, the Language fOr Temporal Ordering Specification, is a Formal Description Technique (FDT) whose definition, though not completed, has already reached such a state as to allow trial specifications of rather sophisticated services and protocols. This paper explores the specification in LOTOS of some of the session services whose discussion is underway within various standardization bodies. Conciseness of specification is tried by adopting a few notational variants which are guessed to be useful at various OSI layers. The session services selected for this trial specification comprise the Basic Combined Subset (BCS) enriched with the Expedited Data service.","PeriodicalId":197970,"journal":{"name":"Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium","volume":"28 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":"131755045","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
扫码关注我们
求助内容：
应助结果提醒方式：