Congestion Control in Computer Networks: Issues and Trends

IEEE Network

Volumn 4, Issue 3, 1990, Pages 24-30

  Jain, Raj ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84941512106     PISSN: 08908044     EISSN: None     Source Type: Journal    
DOI: 10.1109/65.56532     Document Type: Article

References (32)

1. J. Nagle, “On Packet Switches with Infinite Storage,” IEEE Trans. on Commun., vol. COM-35, no. 4, pp. 435–438, Apr. 1987.
2. R. Jain, “Divergence of Timeout Algorithms for Packet Retransmissions,” Proc. 5th Annual Int'l. Phoenix Conf. on Comp. and Commun., Scottsdale, AZ, pp. 174–179, Mar. 1986.
3. J. C. Majithia et al., “Experiments in Congestion Control Techniques,” Proc. Int'l. Symp. Flow Control Computer Networks, Versailles, France. Feb. 1979, pp. 211–234.
4. D. W. Davis, “The Control of Congestion in Packet-Switching Networks,” IEEE Trans. on Commun., vol. COM-20, no. 6, June 1972.
5. F. D. George and G. E. Young, “SNA Flow Control: Architecture and Implementation,” IBM Syst. J., vol. 21, no. 2, pp. 179–210, 1982.
6. M. Schwartz, “Performance Analysis of the SNA Route Pacing Control,” lEEETrans. on Commun., vol. COM-30, no. 1, pp. 172–184, Jan. 1982.
7. R. Jain, K. K. Ramakrishnan, and D. M. Chiu, “Congestion Avoidance in Computer Networks with a Connectionless Network Layer,” in Innovations in Internetworking. C. Partridge, Ed., Norwood, MA: Artech House, pp. 140–156, 1988.
8. S. S. Lam and Y. C. L. Lien, “Congestion Control of Packet Communication Networks by Input Buffer Limits—A Simulation Study.” IEEE Trans. on Comp., vol. C-30, no. 10, pp. 733–742, Oct. 1981.
9. A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queuing Algorithm,” Proc. ACM SIGCOMM '89 Symp. on Commun. Architectures and Protocols, Austin, TX, pp. 1–12, Sept. 1989.
10. J. S. Turner, “New Directions in Communications (or Which Way to the Information Age?),” IEEE Commun. Mag., vol. 24, no. 10, pp. 8–15, Oct. 1986.
11. D. Cheriton, “Sirpent: A High Performance Internetworking Approach,” Proc. ACM SIGCOMM '89 Symp. on Commun. Architectures and Protocols, Austin, TX, pp. 158–169, Sept. 1989.
12. M. Gerla and L. Kleinrock, “Flow Control: A Comparative Survey,” IEEE Trans. on Commun., vol. COM-28, no. 4, pp. 553–574, Apr. 1980.
13. K. Bharat-Kumar and J. M. Jaffe, “A New Approach to Performance-Oriented Flow Control,” IEEE Trans. on Commun., vol. COM-29, no. 4, pp. 427–435, Apr. 1981.
14. M. Gerla, H. W. Chan, and J. R. B. de Marca, “Fairness in Computer Networks,” Proc. IEEE Int'l. Conf. on Commun. (ICC '85), Chicago, IL, pp. 43.5.1–6, June 23–26, 1985.
15. J.M. Jaffe, “Bottleneck Flow Control,” IEEE Trans. on Commun., vol. COM-29, no. 7, pp. 954–962, July 1981.
16. R. Jain, D. M. Chiu, and W. Hawe, “A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Systems,” Digital Equipment Corporation, Tech. Report DEC-TR-K301, Sept. 1984.
17. S. Stidham, Jr. “Optimal Control of Admission to a Queuing System,” IEEE Trans. on Auto. Control, vol. AC-30, no.8, pp. 705–713, Aug. 1985.
18. R. Jain, “A Delay-Based Approach for Congestion Avoidance in Interconnected Heterogeneous Computer Networks,” Comp. Commun. Rev., vol. 19, no. 5, pp. 56–71, Oct. 1989.
19. E. L. Hahne and R. G. Gallager, “Round Robin Scheduling for Fair Flow Control in Data Commun. Networks,” Proc. ICC '86, Toronto, Canada, pp. 4.3.1–5, June 22–25, 1986.
20. D. Cohen, “Flow Control for Real-Time Communication,” Comp. Commun. Rev., vol. 10, no. 1–2, Jan/Apr. 1980, pp. 41–47.
21. L. Zhang, “A New Architecture for Packet Switching Protocols,” Ph.D. thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, July 1989.
22. V. Jacobson, “Congestion Avoidance and Control,” Proc. ACM SIGCOMM '88, Stanford CA, pp. 314–329, Aug. 1988.
23. P. Karn and C. Partridge, “Improving Round-Trip Time Estimates in Reliable Transport Protocols,” Proc. ACM SIGCOMM '87, Stowe, VT, pp. 2–7, Aug. 1987.
24. N. F. Maxemchuk and M. E. Zarki, “Routing and Flow Control in High Speed, Wide Area Networks,” Proc. of IEEE, vol. 78, no. 1, pp. 204–221, Jan. 1990.
25. M. Irland, “Buffer Management in a Packet Switch,” IEEE Trans. on Commun., vol. COM-26, pp. 328–337, Mar. 1978.
26. R. Jain, “A Timeout-Based Congestion Control Scheme for Window Flow-Controlled Networks,” IEEE J. on Sel. Areas in Commun., vol. SAC-4, no. 7, pp. 1,162–1,167, Oct. 1986.
27. W. Bux and D. Grillo, “Flow Control in Local-Area Networks of Interconnected Token Rings,” IEEE Trans. on Commun., vol. COM-33, no. 10, pp. 1,058–1,066, Oct. 1985.
28. B. T. Doshi and H. Q. Nguyen, “Congestion Control in ISDN Frame-Relay Networks,” AT&T Tech. J., pp. 35–46, Nov./Dec. 1988.
29. D.M. Chiu and R. Jain, “Analysis of Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks,” Comp. Networks and ISDN Syst., vol. 17, pp. 1–14, 1989.
30. R. Jain and K. K. Ramakrishnan, “Congestion Avoidance in Computer Networks with a Connectionless Network Layer: Concepts, Goals and Methodology,” Proc. lEEEComp. Networking Symp., Washington, DC, pp. 134–143, Apr. 1988.
31. K K. Ramakrishnan, D. M. Chiu, and R. Jain, “Congestion Avoidance in Computer Networks with a Connectionless Network Layer. Part IV: A Selective Binary Feedback Scheme for General Topologies,” Digital Equipment Corporation, Tech. Report DEC-TR-510, Aug. 1987.
32. K. K. Ramakrishnan and R. Jain, “An Explicit Binary Feedback Scheme for Congestion Avoidance in Computer Networks with a Connectionless Network Layer,” Proc. ACM SIGCOMM '88, Stanford, CA, pp. 303–313, Aug. 1988.