Skip Navigation

The Computer Journal 1978 21(3):219-223; doi:10.1093/comjnl/21.3.219
© 1978 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Price, W. L.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Simulation studies of data communication networks operating in datagram mode

W. L. Price *

Division of Computer Science, National Physical Laboratory, Teddington, UK

The NPL simulation studies of datagram networks have highlighted the need for an efficient congestion avoidance procedure. It has been shown that in many cases this can be provided very simply by monitoring the occupancy of buffers in each source node, and controlling the local input traffic accordingly. In the hierarchical network, where some nodes had no source users connected, the simple technique was seen to be inadequate; here the more complex isarithmic system was brought into play and provided an adequate guarantee against congestion. The GMD results on their quite different network system have also shown the need for congestion avoidance measures; those adopted have much in common with those introduced in the NPL studies.


Received May 1977.

* Division of Computer Science, National Physical Laboratory, Teddington, Middlesex TW11 0LW


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.