{"title":"Optimum speed of service in the design of customer data communications systems","authors":"F. R. Mastromonaco","doi":"10.1145/800165.805241","DOIUrl":"https://doi.org/10.1145/800165.805241","url":null,"abstract":"A model is given for selection of optimum bit speed for private line data communications applications based on the tradeoff between the cost of delay and the cost of equipment. Costs of delay are those costs incurred by the communications user which occur outside the communications system as a result of delays introduced by that system. The delays considered result from transmission delay and customer's queuing delay. The model assumes Poisson input, exponentially distributed message lengths, and k servers. A method for including the effect of error control is given. The bit speed selection model is applied to an information retrieval application.","PeriodicalId":383824,"journal":{"name":"Symposium on Problems in the Optimization of Data Communications Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127937672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Estimates of distributions of random variables for certain computer communications traffic models","authors":"E. Fuchs, P. E. Jackson","doi":"10.1145/800165.805244","DOIUrl":"https://doi.org/10.1145/800165.805244","url":null,"abstract":"A study of multiaccess computer communications has characterized the distributions underlying an elementary model of the user-computer interactive process. The model used is elementary in the sense that many of the random variables that generally are of interest in computer communications studies can be decomposed into the elements of this model. Data were examined from four operational multiaccess systems, and the model is shown to be robust; that is, each of the variables of the model has the same distribution independent of which of the four systems is being examined. It is shown that the gamma distribution can be used to describe each of the continuous variables of the model, and that the geometric distribution can be used to describe the discrete variables. Approximations to the gamma distribution by the exponential distribution are discussed for the systems studied.","PeriodicalId":383824,"journal":{"name":"Symposium on Problems in the Optimization of Data Communications Systems","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126656990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An experimental distributed switching system to handle bursty computer traffic","authors":"W. D. Farmer, E. Newhall","doi":"10.1145/800165.805236","DOIUrl":"https://doi.org/10.1145/800165.805236","url":null,"abstract":"An experimental switching system has been built using commercially available integrated semiconductors to switch data. Data messages to be handled by the system may vary in bit rate (100 bits/sec - 4 × 106 bits/sec), message length, and rate of message occurrence.\u0000 The system uses a synchronous transmission facility with a crystal stabilized clock rate of approximately 6 MHz. The signaling format chosen facilitates data interchange between a number of similar small sequential machines that share a common transmission facility. Efficient data transmission over common carrier systems requires a change in signal format at the channel inputs.\u0000 Systems involving interconnected loops are discussed briefly; however, the traffic handling capacity of such systems must be analyzed to determine the memory requirements at the junction points. This paper is concerned primarily with the detailed organization of a single loop.","PeriodicalId":383824,"journal":{"name":"Symposium on Problems in the Optimization of Data Communications Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134402859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An encoding scheme for word stuffing","authors":"M. M. Buchner, E. J. Hronik","doi":"10.1145/800165.805248","DOIUrl":"https://doi.org/10.1145/800165.805248","url":null,"abstract":"The effectiveness of word stuffing for synchronization depends upon the ability to distinguish the stuff words from the data words at the destination and, thus, delete correctly the stuff words. If all input sequences are permitted, the data words must be encoded before stuffing occurs so that the stuff word can be distinct from the data words. Previously, a code was given in which a single transmission error could change a data word into the stuff word. In this paper, we give the code that maximizes the minimum distance between the stuff word and any data word. It follows that the probability of character synchronization loss because of confusion between data and stuff words due to transmission errors is considerably reduced. Some implementations are given which suggest that the increase in distance can be achieved at a small cost in hardware.\u0000 Some other encoding schemes, for which no immediate applications are known, are presented to show the variety of codes that can be designed in hopes of stimulating new applications.","PeriodicalId":383824,"journal":{"name":"Symposium on Problems in the Optimization of Data Communications Systems","volume":"49 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134593968","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fourier transform communication system","authors":"J. Salz, S. Weinstein","doi":"10.1145/800165.805240","DOIUrl":"https://doi.org/10.1145/800165.805240","url":null,"abstract":"The development of rapid algorithms for computation of the discrete Fourier transform has encouraged the use of this transform in the design of communication systems. Here we describe and analyze a data transmission system in which the transmitted signal is the Fourier transform of the original data sequence and the demodulator is a discrete Fourier transformer. This system is a realization of the frequency division multiplexing strategy known as “parallel data transmission”, and it is constructed in this manner so that the data demodulator, after analog to digital conversion, may be a computer program employing one of the fast Fourier transform algorithms. The system appears attractive in that it may be entirely implemented by digital circuitry. We study the performance of this system in the presence of typical linear channel characteristics. It is shown, via computer simulation and computation of the variances of errors, how the system corrects linear channel distortion.","PeriodicalId":383824,"journal":{"name":"Symposium on Problems in the Optimization of Data Communications Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125605255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The control of congestion in packet switching networks","authors":"D. Davies","doi":"10.1145/800281.811052","DOIUrl":"https://doi.org/10.1145/800281.811052","url":null,"abstract":"Any communication network has a limit to the traffic it can carry. If there is more than a certain traffic demand, some of the traffic must be rejected. Both the nature of the limitation and the reaction of the network to excess demand depend on the design of the network. The network in a condition where it must reject traffic is called 'congested'.","PeriodicalId":383824,"journal":{"name":"Symposium on Problems in the Optimization of Data Communications Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129004752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A preemptive priority model with two classes of customers","authors":"M. Segal","doi":"10.1145/800281.811069","DOIUrl":"https://doi.org/10.1145/800281.811069","url":null,"abstract":"In this paper we propose a model for a service facility which caters to two types of customers. One motivation for this model is a trunk group which is used simultaneously for voice and data communication. We assume that primary customers receive preemptive priority service and leave the system without service if on arrival they find all servers busy with other primary customers. The facility has a queueing provision (buffer) for secondary customers who are served only when the facility is not fully occupied by primary customers. The motivation for this model is discussed. Numerical examples of the statistics of the content of the buffer are presented.","PeriodicalId":383824,"journal":{"name":"Symposium on Problems in the Optimization of Data Communications Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129179491","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Progress in control procedure standardization","authors":"S. R. Rosenblum","doi":"10.1145/800281.811067","DOIUrl":"https://doi.org/10.1145/800281.811067","url":null,"abstract":"The development of Data Communications Control Procedure standards is an essential element in reducing the complexity of Data Communications. The ASCII approach of the nineteen sixties provided a base for accommodating the problems of communication control and computer-oriented data interchange. The ASCII control procedure standard applied a character-oriented philosophy which brought some degree of order to the problem. A brief history and description of the philosophy is presented.\u0000 A proposed bit-oriented advanced control procedure holds great promise for bringing a single data framing format and control technique to the interchange of information over communications links. The objectives of the new procedure are discussed and the procedure is described in some detail. Current status and prospects for standardization are reviewed with respect to progress in domestic and international standards bodies.","PeriodicalId":383824,"journal":{"name":"Symposium on Problems in the Optimization of Data Communications Systems","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130928403","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysis of loop transmission systems","authors":"J. Spragins","doi":"10.1145/800281.811070","DOIUrl":"https://doi.org/10.1145/800281.811070","url":null,"abstract":"A variety of topologies have been used for computer communications systems, including star, multidrop and loop configurations. This paper discusses the results obtained in a theoretical study of loop systems. The type of loop system studied is sketched in Figure la, and consists of one central system (a CPU or system controller) and a number of satellite systems or terminals. Loop adapters connect each system to the loop.","PeriodicalId":383824,"journal":{"name":"Symposium on Problems in the Optimization of Data Communications Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114057361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"State-transition programming techniques and their use in producing teleprocessing device control programs","authors":"Dennis M. Birke","doi":"10.1145/800281.811049","DOIUrl":"https://doi.org/10.1145/800281.811049","url":null,"abstract":"The problems of writing programs for complex and timing dependent processes are discussed and programming techniques using state-transition diagrams are defined. It is shown that programming effort can be reduced by these techniques. Their use in writing teleprocessing device control programs and many other programs is discussed. It is shown that programs written using these techniques are extendable to more general application. A Binary Synchronous Communications multileaving control program in the Pitt Time Sharing System implemented by using these techniques is discussed. A considerable reduction of programming effort was realized for this implementation.","PeriodicalId":383824,"journal":{"name":"Symposium on Problems in the Optimization of Data Communications Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123059003","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}