Round-Robin Scheduling for Max-Min Fairness in Data Networks

IEEE Journal on Selected Areas in Communications

Volumn 9, Issue 7, 1991, Pages 1024-1039

  Hahne, Ellen L ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TRANSMISSION - PACKET SWITCHING; PROBABILITY; SCHEDULING; TELECOMMUNICATION - TRAFFIC;

MAX-MIN FAIRNESS CRITERION; ROUND-ROBIN SCHEDULING; TRANSIENT ANALYSIS;

COMPUTER NETWORKS;

EID: 0026223925     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.103550     Document Type: Article

References (56)

1. E. L. Hahne and R. G. Gallager, “Round robin scheduling for fair flow control in data communication networks,” in Proc. IEEE Int. Conf. Commun., June 1986, pp. 103–107.
2. M. G. H. Katevenis, “Fast switching and fair control of congested flow in broadband networks,” IEEE J. Select. Areas Commun., vol. 5, no. 8, pp. 1315–1326, Oct. 1987.
3. M. Gerla and L. Kleinrock, “Flow control: A comparative survey,” IEEE Trans. Commun., vol. COM-28, no. 4, pp. 553–574, Apr. 1980.
4. M. Gerla, H. W. Chan, and J. R. Boisson de Marca, “Fairness in computer networks,” in Proc. IEEE Int. Conf. Commun., June 1985, pp. 1384–1389.
5. S. J. Golestaani, “A unified theory of flow control and routing in data communication networks,” rep. LIDS-TH-963, Lab. Info. Decis. Syst., Mass. Inst. Technol., Cambridge, MA, Jan. 1980.
6. R. G. Gallager and S. J. Golestaani, “Flow control and routing algorithms for data networks,” in Proc. Fifth Int. Conf. Comp. Commun., Oct. 1980, pp. 779–784.
7. M. Gerla and M. Staskauskas, “Fairness in flow controlled networks,” in Proc. IEEE Int. Conf. Commun., June 1981, pp. 63.2.1-63.2.5.
8. O. C. Ibe, “Flow control and routing in an integrated voice and data communication network,” rep. LIDS-TH-1115, Lab. Info. Decis. Syst., Mass. Inst. Technol., Cambridge, MA, Aug. 1981.
9. H. P. Hayden, “Voice flow control in integrated packet networks,” rep. LIDS-TH-1152, Lab. Info. Decis. Syst., Mass. Inst. Technol., Cambridge, MA, Oct. 1981.
10. E. M. Gafni, “The integration of routing and flow-control for voice and data in a computer communication network,” rep. LIDS-TH-1239, Lab. Info. Decis. Syst., Mass. Inst. Technol., Cambridge, MA, Sept. 1982.
11. M. Gerla, H. W. Chan, and J. R. Boisson de Marca, “Routing, flow control and fairness in computer networks,” in Proc. IEEE Int. Conf. Commun., May 1984, pp. 1272–1275.
12. G. H. Thaker and J. B. Cain, “Interactions between routing and flow control algorithms,” IEEE Trans. Commun., vol. COM-34, no. 3, pp. 269–277, Mar. 1986.
13. J. Regnier and P. A. Humblet, “Average waiting time assignment-Part I: The single link case,” IEEE Trans. Commun., vol. 38, no. 11, pp. 2049–2059, Nov. 1990.
14. J. Regnier and P. A. Humblet, “Average waiting time assignment-Part II: The integrated services network case,” IEEE Trans. Commun., vol. 38, no. 11, pp. 2060–2072, Nov. 1990.
15. J. P. Sauve, J. W. Wong, and J. A. Field, “On throughput and fairness in packet switching networks with window flow control,” CCNG Rep. E-100, Comput. Commun. Networks Group, Univ. Waterloo, Waterloo, Ont., Canada, Dec. 1981.
16. J. P. Sauve, J. W. Wong, and J. A. Field, “Improving total throughput in packet switching networks with window flow control,” in Proc. IEEE Global Telecommun. Conf., Nov.-Dec. 1982, pp. 1189–1194.
17. K. Bharath-Kumar and J. M. Jaffe, “A new approach to performance-oriented flow control,” IEEE Trans. Commun., vol. COM-29, no. 4, pp. 427–435, Apr. 1981.
18. J. M. Jaffe, “Flow control power is nondecentralizable,” IEEE Trans. Commun., vol. COM-29, no. 9, pp. 1301–1306, Sept. 1981.
19. T. Bially, B. Gold, and S. Seneff, “A technique for adaptive voice flow control in integrated Packet networks,” IEEE Trans. Commun., vol. COM-28, no. 3, pp. 325–333, Mar. 1980.
20. J. M. Jaffe, “A decentralized, ‘optimal,’ multiple-user, flow control algorithm,” in Proc. Fifth Int. Conf. Comp. Commun., Oct. 1980, pp. 839–844.
21. J. M. Jaffe, “Bottleneck flow control,” IEEE Trans. Commun., vol. COM-29, no. 7, pp. 954–962, July 1981.
22. E. M. Gafni and D. P. Bertsekas, “Dynamic control of session input rates in communication networks,” IEEE Trans. Aut. Contr., vol. AC-29, no. 11, pp. 1009–1016, Nov. 1984.
23. D. A. Oshinsky, “Use of fair rate assignment algorithms in networks with bursty sessions,” S.M. Thesis, Dept. Elect. Eng. Comp. Sci., Mass. Inst. Technol., Cambridge, MA, May 1984.
24. J. Mosely, “Asynchronous distributed flow control algorithms,” rep. LIDS-TH-1415, Lab. Info. Decis. Syst., Mass. Inst. Technol., Cambridge, MA, Oct. 1984.
25. H. Luss and D. R. Smith, “Resource allocation among competing activities: A lexicographic minimax approach,” Oper. Res. Lett., vol. 5, no. 5, pp. 227–231, Nov. 1986.
26. U. Mukherji, “A schedule-based approach for flow-control in data communication networks,” rep. LIDS-TH-1527, Lab. Info. Decis. Syst., Mass. Inst. Technol., Cambridge, MA, Jan. 1986.
27. U. Mukherji, “A schedule-based approach for flow-control in data communication networks,” in Proc. IEEE Global Telecommun. Conf., Dec. 1986, pp. 98–104.
28. A. G. Fraser, “Towards a universal data transport system,” IEEE J. Select. Areas Commun., vol. SAC-1, no. 5, pp. 803–816, Nov. 1983.
29. S. P. Morgan, “Window flow control on a trunked byte-stream virtual circuit,” IEEE Trans. Commun., vol. 36, no. 7, pp. 816–825, July 1988.
30. S. P. Morgan, “Queueing disciplines and passive congestion control in byte-stream networks,” in Proc. IEEE INFOCOM’89, Apr. 1989, pp. 711— 720; also to appear in IEEE Trans. Commun.
31. S. S. Panwar, T. K. Philips, and M.-S. Chen, “Golden ratio scheduling for low delay flow control in computer networks,” in Proc. IEEE Global Telecommun. Conf., Dec. 1988, pp. 1113–1118.
32. C. R. Kalmanek, H. Kanakia, and S. Keshav, “Rate controlled servers for very high-speed networks,” presented at the IEEE Global Telecommun. Conf., Dec. 1990.
33. A. Demers, S. Keshav, and S. Shenker, “Analysis and simulation of a fair queueing algorithm,” in Proc. ACM SIGCOMM’89, Sept. 1989, pp. 1–12.
34. A. Greenberg and N. Madras, “Comparison of a fair queueing discipline to processor sharing,” in Proc. Perform. ’90, Sept. 1990, pp. 193–207.
35. J. R. Davin and A. T. Heybey, “A simulation study of fair queueing and policy enforcement,” Comput. Commun. Rev., vol. 20, no. 5, pp. 23–29, Oct. 1990.
36. L. Zhang, “A new architecture for packet switching network protocols,” Ph.D Thesis, Dept. Elec. Eng. Comp. Sci., Mass. Inst. Technol., Cambridge, MA, July 1989.
37. E. L. Hahne, “Round-robin scheduling and window flow control for max-min fairness in data networks,” Tech. Rep., Nov. 1987.
38. F. Baskett et al., “Open, closed, and mixed networks of queues with different classes of customer,” J. ACM, vol. 22, no. 2, pp. 248–260, Apr. 1975.
39. A. J. Lemoine, “Networks of queues—A survey of equilibrium analysis,” Manag. Sci., vol. 24, no. 4, pp. 464–481, Dec. 1977.
40. M. Reiser, “A queueing network analysis of computer communication networks with window flow control,” IEEE Trans. Commun., vol. COM-27, no. 8, pp. 1199–1209, Aug. 1979.
41. E. L. Hahne, “Round robin scheduling for fair flow control in data communication networks,” rep. LIDS-TH-1631, Lab. Info. Decis. Syst., Mass. Inst. Technol., Cambridge, MA, Dec. 1986.
42. R. L. Cruz, “Maximum delay in buffered multistage interconnection networks,” in Proc. IEEE INFOCOM’88, Mar. 1988, pp. 135–144.
43. P. Billingsley, Probability and Measure. New York: Wiley, 1986.
44. M. Iosifescu, Finite Markov Processes and Their Applications. New York: Wiley, 1980.
45. J. D. C. Little, “A proof of the queueing formula L = λ W,” Operat. Res., vol. 9, no. 3, pp. 383–387, May/June 1961.
46. T. P. Barzilai et al., “Adaptive session-level pacing,” U.S. Patent No. 4736369, Apr. 5, 1988.
47. E. L. Hahne, C. R. Kalmanek, and S. P. Morgan, “Fairness and congestion control on a large ATM data network,” presented at 13th Int. Teletraffic Cong., June 1991.
48. V. Jacobson, “Congestion avoidance and control,” in Proc. ACM SIGCOMM’88, Aug. 1988, pp. 314–329.
49. B. T. Doshi and H. Heffes, “Overload performance of an adaptive, buffer-window allocation scheme, with reservation renewal, for a class of high speed networks,” presented at the 13th Int. Teletraffic Cong., June 1991.
50. D. Mitra and J. B. Seery, “Dynamic adaptive windows for high speed data networks: Theory and simulations,” in Proc. ACM SIGCOMM’90, Sept. 1990, pp. 30–40.
51. D. Mitra and J. B. Seery, “Dynamic adaptive windows for high speed data networks with multiple paths and propagation delays (extended abstract),” in Proc. IEEE INFOCOM’91, Apr. 1991, pp. 39–49.
52. R. Jain, “A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks,” Comput. Commun. Rev., vol. 19, no. 5, pp. 56–71, Oct. 1989.
53. R. Jain, “A timeout-based congestion control scheme for window flow-controlled networks,” IEEE J. Select. Areas Commun., vol. SAC-4, no. 7, pp. 1162–1167, Oct. 1986.
54. K. K. Ramakrishnan and R. Jain, “A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer,” in Proc. ACM SIGCOMM’88, Aug. 1988, pp. 303– 313.
55. D. T. D. Luan and D. M. Lucantoni, “Throughput analysis of a window-based flow control subject to bandwidth management,” in Proc. IEEE INFOCOM’88, Mar. 1988, pp. 411–417.
56. S. Keshav, A. K. Agrawala, and S. Singh, “Design and analysis of a flow control algorithm for a network of rate allocating servers,” presented at the IFIP WG 6.1/6.2 2nd Int. Workshop on Protocols for High Speed Net., Nov. 1990.