{"title":"Sorting a distributed file in a network","authors":"Lutz M Wegner","doi":"10.1016/0376-5075(84)90007-2","DOIUrl":"10.1016/0376-5075(84)90007-2","url":null,"abstract":"<div><p>This paper presents a new algorithm based on Quicksort for sorting in place a distributed file in a message switching network. It discusses in detail the algorithmic aspects of the method and compares it to other possible approaches. The sort is analyzed and is shown to require, on the average, O(<em>M</em>·log(<em>M</em>)) messages and a total data traffic of O(<em>N</em>·log(<em>M</em>)) records for a file of size <em>N</em> fragmented over <em>M</em> stations. Arguments for the performance one may expect in practice, where <em>N</em> is much larger than <em>M</em>, are given. They are supported by results from a sequential simulation.</p></div>","PeriodicalId":100316,"journal":{"name":"Computer Networks (1976)","volume":"8 5","pages":"Pages 451-461"},"PeriodicalIF":0.0,"publicationDate":"1984-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0376-5075(84)90007-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80064203","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":"Author index to volume 8","authors":"","doi":"10.1016/0376-5075(84)90015-1","DOIUrl":"https://doi.org/10.1016/0376-5075(84)90015-1","url":null,"abstract":"","PeriodicalId":100316,"journal":{"name":"Computer Networks (1976)","volume":"8 5","pages":"Pages 501-502"},"PeriodicalIF":0.0,"publicationDate":"1984-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0376-5075(84)90015-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137350379","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":"Local area networks supporting speech traffic","authors":"Wael Hilal, Ming T Liu","doi":"10.1016/0376-5075(84)90058-8","DOIUrl":"10.1016/0376-5075(84)90058-8","url":null,"abstract":"<div><p>This paper presents a new analytical model for estimating the average queue length and the average queueing delay of data packets in a SENET-like integrated voice and data system. The analytical model also computes the mean queue lengths and average queueing delays of data packets for every number of calls allowed in the system. The analysis uses the fluid flow approximation of data queues. The equations used to represent the integrated system provide further insight into the system behavior and can be useful to similar systems. The method presented here is easy to apply, avoids the numerical difficulties of other methods in the literature, and yields estimates in very good agreement with simulation results. Also presented is a new flow control procedure that significantly improves the delay performance and considerably reduces the mean data queue length.</p></div>","PeriodicalId":100316,"journal":{"name":"Computer Networks (1976)","volume":"8 4","pages":"Pages 325-337"},"PeriodicalIF":0.0,"publicationDate":"1984-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0376-5075(84)90058-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74794604","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":"Token ring local area networks: A comparison of experimental and theoretical performance","authors":"J Sventek, W Greiman, M O'Dell , A Jansen","doi":"10.1016/0376-5075(84)90056-4","DOIUrl":"10.1016/0376-5075(84)90056-4","url":null,"abstract":"<div><p>Many existing performance models for local area networks are based on the assumptions of random traffic patterns and infinite buffer capacity. All real network implementations violate the infinite capacity assumption, while an increasingly popular class of local area network applications violates the randomness assumption. This paper describes the experimental measurements of the characteristics of a commercially available token ring network. It is shown that the violation of both assumptions invalidates model predictions, and that the utility of all access control mechanisms for such applications must be re-evaluated. Finally, it is shown that congestion is a very real problem even in small “simple” local area networks. Schemes for controlling interface congestion may require rather novel approaches to the problem.</p></div>","PeriodicalId":100316,"journal":{"name":"Computer Networks (1976)","volume":"8 4","pages":"Pages 301-309"},"PeriodicalIF":0.0,"publicationDate":"1984-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0376-5075(84)90056-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91330765","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":"Performance analysis of a cooperative symmetric algorithm for real-time local area computer communication networks","authors":"B Mahbod, J Howard","doi":"10.1016/0376-5075(84)90057-6","DOIUrl":"10.1016/0376-5075(84)90057-6","url":null,"abstract":"<div><p>A hybrid algorithm for soft real-time local area networks is analyzed under conditions of no buffering and full buffering capability at nodes, and for synchronous and asynchronous networks. This algorithms is a variation of the Reservation Upon Collision (RUC) technique that does not require a synchronized slotted network, and operates on a broadband broadcast medium. It has the desirable first-in-first-out behavior, avoiding large variance in packet transmission times. Approximations to the upper and lower bounds on the capacity of the channel and the mean waiting time at the nodes are found. The performance figures of this algorithm attest to its suitability for soft real-time environments.</p></div>","PeriodicalId":100316,"journal":{"name":"Computer Networks (1976)","volume":"8 4","pages":"Pages 311-323"},"PeriodicalIF":0.0,"publicationDate":"1984-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0376-5075(84)90057-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84980533","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}