Congestion Control Techniques for Packet Networks

  • Simon S. Lam


Congestion control mechanisms are needed for store-and-forward packet networks to maintain a high level of throughput. The basic requirements of network congestion control and some specific control techniques are examined. The use of input buffer (IB) limits for network congestion control is introduced. The rationale for the effectiveness of IB limits is discussed. Strategies for the design of IB limits have been investigated using both queueing analysis and simulation experiments. Some of our preliminary findings are presented.


Traffic Flow Congestion Control Network Throughput Assignment Strategy Virtual Channel 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. CERF 74.
    Cerf, V. and R. Kahn, “A protocol for Packet Network Intercommunication,” IEEE Trans, on Commun., Vol. COM-22, May 1974.Google Scholar
  2. CHOU 76.
    Chou, W. and M. Gerla, “A Unified Flow and Congestion Control Model for Packet Networks,” Proc. Third International Conf. on Computer Communication, Toronto, August 1976.Google Scholar
  3. DAVI 72.
    Davis, D. W., “The Control of Congestion in Packet Switching Networks,” IEEE Trans, on Commun., Vol. COM-20, June 1972.Google Scholar
  4. GIES 76.
    Giessler, A., J. Haenle, A. Koenig and E. Pade, “Packet Networks with Deadlock-Free Buffer Allocation— An Investigation by Simulation,” GMD Report, Darmstadt, Germany, 1976.Google Scholar
  5. IBM 75.
    IBM Corp., Systems Network Architecture General Information, GA27–3102–0, January 1975.Google Scholar
  6. KAHN 72.
    Kahn, R. and W. Crowther, “Flow Control in a Resource- Sharing Computer Network,” IEEE Trans, on Commun., Vol. COM-20, June 1972.Google Scholar
  7. KERM 77.
    Kermani, P., “Switching and Flow Control Techniques in Computer Communication Networks,” Ph.D. Dissertation, Computer Science Department, UCLA, 1977.Google Scholar
  8. KLEI 64.
    Kleinrock, L., Communication Nets: Stochastic Message Flow and Delay, McGraw Hill, New York, 1964.Google Scholar
  9. KLEI 78.
    Kleinrock, L., “On Flow Control in Computer Networks,” Conf. Rec. ICCf78, Toronto, June 1978.Google Scholar
  10. LAM 76.
    Lam, S. S., “Store-and-Forward Buffer Requirements in a Packet Switching Network,” IEEE Trans, on Commun., Vol. COM-24, April 1976.Google Scholar
  11. LAM 77.
    Lam, S. S., “Queueing Networks with Population Size Constraints,” IBM Journal of Res. and Develop., Vol. 21, July 1977.Google Scholar
  12. LAM 78.
    Lam, S. S., “A New Measure for Characterizing Data Traffic,” IEEE Trans, on Commun., Vol. COM-26, Jan. 1978.Google Scholar
  13. LAM 79.
    Lam, S. S. and M. Reiser, “Congestion Control of Store-and-Forward Networks by Input Buffer Limits — An Analysis,” IEEE Trans, on Commun., Jan. 1979.Google Scholar
  14. OPDE 74.
    Opderbeck, H. and L. Kleinrock, “The Influence of Control Procedures on the Performance of Packet-Switched Networks,” Proc. National Telecommunications Conference, San Diego, California, Dec. 1974.Google Scholar
  15. POUZ 73.
    Pouzin, L., “Presentation and Major Design Aspects of the CYCLADES Computer Network,” Data Networks: Analysis and Design, Third Data Communications Symposium, St. Petersburg, Florida, Nov. 1973.Google Scholar
  16. PRIC 77.
    Price, W. L., “Data Network Simulation Experiments at the National Physical Laboratory 1968–1976,” Computer Networks, Vol. 1, 1977.Google Scholar
  17. ROBE 78.
    Roberts, L. G., “The Evolution of Packet Switching,” Proc. IEEE, Vol. 66, Nov. 1978.Google Scholar

Copyright information

© D. Reidel Publishing Company 1980

Authors and Affiliations

  • Simon S. Lam
    • 1
  1. 1.Department of Computer SciencesUniversity of Texas at AustinUSA

Personalised recommendations