The National Bureau of Standards has developed service and design specifications for transport and session protocols for use in computer system and network procurements. These protocols reside in layers four and five of the International Organization for Standardization's (ISO) Reference Model for Open Systems Interconnection. This paper describes the services, interfaces, and internal behavior of the transport protocol. The transport (and session) protocol specifications were derived from the most recent developments within ISO on these protocols. Specific features were selected based on the needs of the agencies of the Federal Government within the United States, but they are consistent with the needs of any large organization engaged in the procurement or development of networks of heterogeneous computer systems.
{"title":"Description of a planned federal information processing standard for transport protocol","authors":"J. Heafner, R. Blanc","doi":"10.1145/800081.802653","DOIUrl":"https://doi.org/10.1145/800081.802653","url":null,"abstract":"The National Bureau of Standards has developed service and design specifications for transport and session protocols for use in computer system and network procurements. These protocols reside in layers four and five of the International Organization for Standardization's (ISO) Reference Model for Open Systems Interconnection. This paper describes the services, interfaces, and internal behavior of the transport protocol. The transport (and session) protocol specifications were derived from the most recent developments within ISO on these protocols. Specific features were selected based on the needs of the agencies of the Federal Government within the United States, but they are consistent with the needs of any large organization engaged in the procurement or development of networks of heterogeneous computer systems.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129518896","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 a comprehensive survey of different positions around the problematique of how the Telematics will influence the employment. It is concluded with some comments that open new questions specifically for Mexico.
{"title":"The great debate over telematics and employment","authors":"E. Rivera, Lilia Briceño","doi":"10.1145/800081.802660","DOIUrl":"https://doi.org/10.1145/800081.802660","url":null,"abstract":"This paper presents a comprehensive survey of different positions around the problematique of how the Telematics will influence the employment. It is concluded with some comments that open new questions specifically for Mexico.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126569481","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 defines a service class and describes how a completely general service class structure can be provided by a packet switched network. It describes the difference between a handling directive and a routing metric, and defines a service class as an arbitrary collection of handling directives and routing metrics. It describes what types of distributed routing algorithms make it possible to provide for a completely general service class concept in a network, and describes the special problems to be encountered when providing for a general service class capability in a hierarchical network.
{"title":"Incorporation of service classes into a network architecture","authors":"R. Perlman","doi":"10.1145/800081.802675","DOIUrl":"https://doi.org/10.1145/800081.802675","url":null,"abstract":"This paper defines a service class and describes how a completely general service class structure can be provided by a packet switched network. It describes the difference between a handling directive and a routing metric, and defines a service class as an arbitrary collection of handling directives and routing metrics. It describes what types of distributed routing algorithms make it possible to provide for a completely general service class concept in a network, and describes the special problems to be encountered when providing for a general service class capability in a hierarchical network.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116059355","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}
One essential requirement of an Electronic Funds Transfer (EFT) system is that institutions must be able to join together in a common EFT network such that a member of one institution can initiate transactions at entry points in the domain of another institution. The use of such a network is defined as interchange. Cryptographic implementations are developed for such a network in such a way as to keep personal verification and message authentication processes at different institutions completely separate. This is accomplished through the combined use of user-remembered personal identification numbers (PINs), secret system keys, and intelligent secure (bank) cards on which are recorded secret personal cryptographic keys.
{"title":"Some cryptographic principles of authentication in electronic funds transfer systems","authors":"C. H. Meyer, S. Matyas","doi":"10.1145/800081.802661","DOIUrl":"https://doi.org/10.1145/800081.802661","url":null,"abstract":"One essential requirement of an Electronic Funds Transfer (EFT) system is that institutions must be able to join together in a common EFT network such that a member of one institution can initiate transactions at entry points in the domain of another institution. The use of such a network is defined as interchange. Cryptographic implementations are developed for such a network in such a way as to keep personal verification and message authentication processes at different institutions completely separate. This is accomplished through the combined use of user-remembered personal identification numbers (PINs), secret system keys, and intelligent secure (bank) cards on which are recorded secret personal cryptographic keys.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133568826","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 communication system is presented which consists of a switch (Datakit [Fraser 1979]) with associated control and interface hardware and software. The switch offers virtual circuit service which is internally implemented through packet switching. The users of the communication system are operating systems; using our communication system, we have implemented a network of UNIXTM systems and a new distributed operating system derived from UNIX. Our work concentrated on the performance of the subscriber-switch interface; on the reliability and recoverability of the switching service; and on the exploitation of the circuit concept for operating system design.
{"title":"A virtual circuit switch as the basis for distributed systems","authors":"G. Luderer, H. Che, W. T. Marshall","doi":"10.1145/800081.802670","DOIUrl":"https://doi.org/10.1145/800081.802670","url":null,"abstract":"A communication system is presented which consists of a switch (Datakit [Fraser 1979]) with associated control and interface hardware and software. The switch offers virtual circuit service which is internally implemented through packet switching. The users of the communication system are operating systems; using our communication system, we have implemented a network of UNIXTM systems and a new distributed operating system derived from UNIX. Our work concentrated on the performance of the subscriber-switch interface; on the reliability and recoverability of the switching service; and on the exploitation of the circuit concept for operating system design.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128379869","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}
Over the last few years there has been an avalanche of technical literature on techniques for allowing nodes to access and share one of the most valuable resources of a computer communication network, i.e., the bandwidth of the communication media.1 This report describes the design of a new type of Local Area Computer Network called BID that uses a bidirectional token flow as a form of token passing.2 The design of BID not only allows it to process messages having various properties but also makes it possible to operate simultaneously in a packet and circuit-switching mode. This latter mode, using minipackets, enables BID to be used for those applications having real-time response requirements. In describing BID this report defines the basic concepts of the implicit token, token carrier, token generator, and token wait time. It also describes a new preemption technique which reduces the walk time normally associated with token and polling systems. A GPSS computer simulation was made of the BID system to determine the average delay times experienced by the various priority classes of messages. An analytical model using a single priority class of messages is presented, and the results of the computer simulation are compared with this. The simulation results also indicate the uniformity of the average delays experienced by the Bus Interface Units across the bus resulting from the use of bidirectional flow of tokens.
{"title":"Bidirectional token flow system","authors":"M. E. Ulug, G. White, W. J. Adams","doi":"10.1145/800081.802668","DOIUrl":"https://doi.org/10.1145/800081.802668","url":null,"abstract":"Over the last few years there has been an avalanche of technical literature on techniques for allowing nodes to access and share one of the most valuable resources of a computer communication network, i.e., the bandwidth of the communication media.1 This report describes the design of a new type of Local Area Computer Network called BID that uses a bidirectional token flow as a form of token passing.2 The design of BID not only allows it to process messages having various properties but also makes it possible to operate simultaneously in a packet and circuit-switching mode. This latter mode, using minipackets, enables BID to be used for those applications having real-time response requirements. In describing BID this report defines the basic concepts of the implicit token, token carrier, token generator, and token wait time. It also describes a new preemption technique which reduces the walk time normally associated with token and polling systems. A GPSS computer simulation was made of the BID system to determine the average delay times experienced by the various priority classes of messages. An analytical model using a single priority class of messages is presented, and the results of the computer simulation are compared with this. The simulation results also indicate the uniformity of the average delays experienced by the Bus Interface Units across the bus resulting from the use of bidirectional flow of tokens.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125932037","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}
One of the first applications of satellite telecommunication systems being studied within the NADIR pilot project is high speed (several Mbits/s) file transfer. After a short description of the French “TELECOM 1” satellite communication system, the paper points out that usual protocols such as HDLC cannot be simply adapted to fit satellite transmission requirements (high bandwidth, long propagation delay and various error rates). Specific problems, such as choice of frame length, error correction procedure, numbering scheme, and flow control mechanism are discussed, and a set of feasible solutions to be experimented are proposed.
{"title":"An experiment on high speed file transfer using satellite links","authors":"C. Huitema, I. Valet","doi":"10.1145/800081.802682","DOIUrl":"https://doi.org/10.1145/800081.802682","url":null,"abstract":"One of the first applications of satellite telecommunication systems being studied within the NADIR pilot project is high speed (several Mbits/s) file transfer. After a short description of the French “TELECOM 1” satellite communication system, the paper points out that usual protocols such as HDLC cannot be simply adapted to fit satellite transmission requirements (high bandwidth, long propagation delay and various error rates). Specific problems, such as choice of frame length, error correction procedure, numbering scheme, and flow control mechanism are discussed, and a set of feasible solutions to be experimented are proposed.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128804189","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 data network, when messages arrive at a switch to be served (transmitted) on a line, it seems reasonable to assume that the arrival process can be described as a Poisson (random) process. However, when messages are divided into a number of packets of a maximum length, these packets arrive bunched together. This gives rise to what is referred to as “peaked” traffic. The degree of peakedness depends on 1) the interarrival time of packets associated with a particular message and 2) the distribution of the number of packets per message. In this paper we describe a queueing model which accounts for the non-Poissonian nature of the packet arrival process as a function of these two factors. Since packets are of a fixed maximum length, the model assumes that the packet service time is constant, as opposed to the mathematically more tractable but less realistic assumption of exponentially-distributed service time. This queueing model is then used to describe the network delay as affected by: 1. Message switching versus packet switching, 2. A priority discipline in the queues, 3. Packet interarrival time per message, which is probably controlled by the line speed at the packet origination point, and 4. A network which carries only short inquiry-response traffic as opposed to a network which also carries longer low-priority printer traffic. The general conclusions are that the peakedness in the arrival process caused by a short interarrival time of packets per message and the longer printer traffic would cause excessive delays in a network. If inquiry-response traffic with a short response-time requirement is also to be carried on the same network a priority discipline has considerable value. Message switching for such a combination of traffic should be avoided.
{"title":"A versatile queueing model for data switching","authors":"R. V. Laue","doi":"10.1145/800081.802665","DOIUrl":"https://doi.org/10.1145/800081.802665","url":null,"abstract":"In a data network, when messages arrive at a switch to be served (transmitted) on a line, it seems reasonable to assume that the arrival process can be described as a Poisson (random) process. However, when messages are divided into a number of packets of a maximum length, these packets arrive bunched together. This gives rise to what is referred to as “peaked” traffic. The degree of peakedness depends on 1) the interarrival time of packets associated with a particular message and 2) the distribution of the number of packets per message. In this paper we describe a queueing model which accounts for the non-Poissonian nature of the packet arrival process as a function of these two factors. Since packets are of a fixed maximum length, the model assumes that the packet service time is constant, as opposed to the mathematically more tractable but less realistic assumption of exponentially-distributed service time. This queueing model is then used to describe the network delay as affected by: 1. Message switching versus packet switching, 2. A priority discipline in the queues, 3. Packet interarrival time per message, which is probably controlled by the line speed at the packet origination point, and 4. A network which carries only short inquiry-response traffic as opposed to a network which also carries longer low-priority printer traffic. The general conclusions are that the peakedness in the arrival process caused by a short interarrival time of packets per message and the longer printer traffic would cause excessive delays in a network. If inquiry-response traffic with a short response-time requirement is also to be carried on the same network a priority discipline has considerable value. Message switching for such a combination of traffic should be avoided.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130946289","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 Bell Laboratories Network (BLN) provides a host-to-host networking service that has been specifically designed for the heterogeneous computer environment at Bell Laboratories. BLN incorporates two important concepts: a 7-layer architecture similar to the one currently being proposed by ISO and CCITT, and implementation techniques that allow most of the networking software to reside in totally portable modules. BLN has been operational since March, 1979 in first a 3-node and then in an 8-node prototype network. It is now being deployed to replace the existing interlocation network in Bell Labs. In this paper we provide an overview of the network service requirements and the architecture and implementation that was developed to provide those services.
{"title":"An overview of BLN: A bell laboratories computing network","authors":"K. E. Coates, D. Dvorak, R. M. Watts","doi":"10.1145/800081.802678","DOIUrl":"https://doi.org/10.1145/800081.802678","url":null,"abstract":"The Bell Laboratories Network (BLN) provides a host-to-host networking service that has been specifically designed for the heterogeneous computer environment at Bell Laboratories. BLN incorporates two important concepts: a 7-layer architecture similar to the one currently being proposed by ISO and CCITT, and implementation techniques that allow most of the networking software to reside in totally portable modules. BLN has been operational since March, 1979 in first a 3-node and then in an 8-node prototype network. It is now being deployed to replace the existing interlocation network in Bell Labs. In this paper we provide an overview of the network service requirements and the architecture and implementation that was developed to provide those services.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122670948","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. Buzo, Horacio G. Martinez, C. Rivera, A. Jazcilevich
This paper arrived late and can be found, published in full, on pages 268-270 of the Proceedings.
这篇论文姗姗来迟，全文发表在《论文集》第268-270页。
{"title":"Isolated word recognition based upon source coding techniques","authors":"A. Buzo, Horacio G. Martinez, C. Rivera, A. Jazcilevich","doi":"10.1145/1013879.802684","DOIUrl":"https://doi.org/10.1145/1013879.802684","url":null,"abstract":"This paper arrived late and can be found, published in full, on pages 268-270 of the Proceedings.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129521685","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
扫码关注我们
求助内容：
应助结果提醒方式：