Congestion and Flow Control
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.
KeywordsService Time Flow Control Central Processor Queueing Network Closed Chain
Unable to display preview. Download preview PDF.
- 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
- 3.A. S. Tannenbaum, Computer Networks, Prentice-Hall, Englewood Cliffs, New Jersey (1981), pp. 167–177.Google Scholar
- 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
- 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
- 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
- 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