Jean E. Sammet
Pages 1-2
The form, extent, and effect of the communication line overhead in the ARPANET are considered. The source of this overhead is separated into various levels of protocol hierarchy and the characteristics of each level are summarized …
Leonard Kleinrock, William E. Naylor, Holger Opderbeck
Pages 3-13
A model for disk accesses based on published measurements is developed. The model is used to show that under highly probable conditions, FCFS seek scheduling is superior to SSTF scheduling in the sense of having a lower mean
…
Neil C. Wilhelm
Pages 13-17
Two analytic models of a store-and-forward communications network are constructed, one to find the optimal message routing and the other to illustrate the equilibrium (stationary state) maintained by an adaptive routing algorithm …
Carson E. Agnew
Pages 18-22
This paper presents the results of simulations that investigate the performance of height-balanced (HB[k]) trees. It is shown that the only statistic of HB[1] trees (AVL trees) that is a function of the size of the tree is the …
P. L. Karlton, S. H. Fuller, R. E. Scroggs, E. B. Kaehler
Pages 23-28
Items in business systems have to be identified by reference codes, which can later be used as data codes and file keys in an associated data processing system. In business systems associated with large collections of integrated …
J. J. Florentin
Pages 29-32
This paper provides data on Cobol error frequency for correction of errors in student-oriented compilers, improvement of teaching, and changes in programming language. Cobol was studied because of economic importance, widespread …
Charles R. Litecky, Gordon B. Davis
Pages 33-38
Pages 43-48
