Advertisement

Congestion and Flow Control

  • Jeremiah F. Hayes
Part of the Applications of Communications Theory book series (ACTH)

Abstract

In terms of the open systems interconnection protocol discussed in Section 2.3, the models that we have considered to this point are part of the link level. In this and in the next chapter we develop models for higher-level protocols, primarily at the network level. In this chapter we study congestion and flow control, in the next, routing.

Keywords

Service Time Flow Control Central Processor Queueing Network Closed Chain 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Gerla and L. Kleinrock, “Flow Control Protcols”, Computer Network Architectures and Protocols, P. E. Green, Jr., editor, Plenum Press, New York (1982); also Special Issue IEEE Transactions on Communications, April (1980).Google Scholar
  2. 2.
    M. Reiser, “Performance Evaluation of Data Communication Systems,” Proceedings of IEEE, 70(2), 171–196, February (1982).CrossRefGoogle Scholar
  3. 3.
    A. S. Tannenbaum, Computer Networks, Prentice-Hall, Englewood Cliffs, New Jersey (1981), pp. 167–177.Google Scholar
  4. 4.
    D. E. Carlson, “Bit-Oriented Data Link Control,” Computer Network Architectures and Protocols, P. E. Green, Jr. editor, Plenum Press, New York (1982).Google Scholar
  5. 5.
    M. Easton, “Batch Throughout Efficiency of ADCCP/HDLC/SDLC Selective Reject Protocols,” IEEE Transaction Communications, COM-28(2), 187–195, February (1980).CrossRefGoogle Scholar
  6. 6.
    J. Labetoulle and G. Pujolle, “HDLC Throughput and Response Time for Bidirectional Data Flow with Nonuniform Frame Sizes,” IEEE Transactions on Communications, COM-30(6), 405–413, June (1981).Google Scholar
  7. 7.
    W. Bux, K. Kummerle, and H. L. Tuong, “Balanced HDLC Procedures: A Performance Analysis,” IEEE Transactions on Communications, COM-28(11), 1889–1898, November (1980).CrossRefGoogle Scholar
  8. 8.
    A. J. LeMoyne, “Networks of Queues—A Survey of Equilibrium Analysis,” Management Science, 24(4), 464–481, December (1977).MathSciNetCrossRefGoogle Scholar
  9. 9.
    F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios, “Open, Closed, and Mixed Networks of Queues with Different Classes of Customers,” Journal of the ACM, 22(2), 248–260, April (1975).MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    M. C. Pennotti and M. Schwartz, “Congestion Control in Store-and-Forward Tandem Links,” IEEE Transactions on Communications, COM-23(12), 1434–1443, December (1975).CrossRefGoogle Scholar
  11. 11.
    J. P. Buzen, “Computational Algorithms for Closed Networks with Exponential Servers,” Communications of the ACM, 16, 527–531, September (1973).MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    M. Reiser and H. Kobayashi, “Numerical Solution of Semiclosed Exponential Server Queueing Networks,” Proceedings of the 7th Asilomar Conference on Circuits Systems and Computers, November (1973), pp. 308–312.Google Scholar
  13. 13.
    M. Reiser and S. S. Lavenberg, “Mean Value Analysis of Closed Multichain Queueing Networks,” Journal of the ACM, 22, 313–322, April (1980).MathSciNetCrossRefGoogle Scholar
  14. 14.
    M. Reiser, “A Queueing Network Analysis of Computer Communications Networks with Window Flow Control,” IEEE Transactions on Communications, COM-27(8), 1199–1209, August (1979).MathSciNetCrossRefGoogle Scholar
  15. 15.
    K. M. Chandy and C. H. Sauer, “Computational Algorithms for Product Form Queueing Networks,” Communications of the ACM, 23(10), 573–583, October (1980).MathSciNetMATHCrossRefGoogle Scholar
  16. 16.
    M. Reiser, “Mean Value Analysis and Convolution Method for Queue Dependent Servers in Closed Queueing Networks,” Performance Evaluation, 1(1), 7–18, January (1981).MathSciNetMATHCrossRefGoogle Scholar
  17. 17.
    P. J. Schweitzer and S. S. Lam, “Buffer Overflow in a Store-and-Forward Node,” IBM Journal of Research and Development, 20, 542–550 (1976).MathSciNetMATHCrossRefGoogle Scholar
  18. 18.
    S. S. Lam, “Store-and-Forward Requirements in a Packet Switching Network,” IEEE Transactions on Communications, COM-24(4), 394–403, April (1977).Google Scholar
  19. 19.
    S. S. Lam and M. Reiser, “Congestion Control of Store-and-Forward Networks with Input Buffer Limits: An Analysis,” IEEE Transactions on Communications, COM-27(l), 127–134, January (1979).CrossRefGoogle Scholar

Copyright information

© Plenum Press, New York 1984

Authors and Affiliations

  • Jeremiah F. Hayes
    • 1
  1. 1.Concordia UniversityMontrealCanada

Personalised recommendations