Local congestion control in computer-communication networks with random routing

  • Authors:

  • N. D. Georganas;A. Chatterjee;P. K. Verma

  • Affiliations:

  • -;-;-

  • Venue:
  • SIGCOMM '77 Proceedings of the fifth symposium on Data communications
  • Year:
  • 1977

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper considers the problem of congestion in message-switched, or packet-switched, networks, which employ probabilistic routing schemes. A queueing model for the analysis of a local congestion control scheme is presented. Analytic study of the model shows that local congestion control with random routing is superior to similar control with deterministic routing for a particular example worked out here.