Skip to main content
Log in

A unified set of proposals for control and design of high speed data networks

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

In this paper we articulate our philosophy and approach to the design and control of high speed data networks. The object is to put into perspective and to explain the coordination of various isolated pieces of detailed technical analyses that have been reported in several recent papers. In the process we summarize what we have learnt in our recent work and, also, we give indications of the direction of our future work. Our scheme integrates feedback and open loop control. The feedback control is exercised by sliding windows; access controllers regulate bursty sources. All our design proposals are rooted in asymptotic analyses; the justification for asymptotics comes from the largeness of the parameters, such as propagation delay, speed, window size, buffer size, and the number of virtual circuits. This analysis makes a strong case for operating in a specific “moderate usage” regime, and adaptive dynamic windowing algorithms are given that make this happen; moreover, when in this regime, buffers may be sized aggressively small without jeopardizing performance and the simplicity of the retransmission protocol. The topics in the paper are: model of communication, results on the steady-state behavior of the basic model, access control, small buffers and retransmission protocols, dynamic adaptive windows, bursty sources, and contrast with previous work.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Anick, D. Mitra and M.M. Sondhi, Stochastic theory of a data-handling system with multiple sources, Bell System Tech. J. 61 (1982) 1871–1894.

    Google Scholar 

  2. A.W. Berger, Overload control using a rate control throttle: selecting token back capacity for robustness to arrival rates,Proc. 28th IEEE Conf. on Decision and Control (1989) pp. 2527–2529.

  3. K. Bharath-Kumar and J.M. Jaffe, A new approach to performance-oriented flow control, IEEE Trans. Comm. COM-29 (April 1981) 427–435.

    Google Scholar 

  4. M.C. Chuah and R.L. Cruz, Approximate analysis of average performance of (σ, ρ) regulators,Proc. INFOCOM '90 (IEEE Computer Society Press, 1990) pp. 874–880.

  5. J.N. Daigle and J.D. Langford, Models for analysis of packet voice communication systems, IEEE J. Sel. Areas Commun. SAC-4 (1986) 847–855.

    Google Scholar 

  6. A. Demers, S. Keshav and S. Shenker, Analysis and simulation of a fair queueing algorithm,Proc. ACM SIGCOMM (1989).

  7. L. Dittman and S.B. Jacobson, Statistical multiplexing of identical bursty sources in an ATM network,GLOBECOM '88, pp. 1293–1297.

  8. A.E Eckberg, D.T. Luan and D.M. Lucantoni, Bandwidth management: a congestion control strategy for broadband packet networks — characterizing the throughput-burstiness filter,Proc. ITC Specialist Seminar, Adelaide (1989) paper no. 4.4.

  9. A.I. Elwalid and D. Mitra, Analysis and design of rate-based congestion control for high speed networks: stochastic fluid models, access regulation, Queueing Systems, this issue.

  10. K.W. Fendick and M.A. Rodrigues, A heavy-traffic comparison of shared and non-shared buffer strategies for high-speed trunks with fair queueing disciplines, Queueing Systems, this issue.

  11. A.D. Franklin, Flow control scheme for a switching network, US Patent 4,677,616 (June 30, 1987).

  12. A.G. Fraser, Towards a universal data transport system, IEEE J. Sel. Areas Commun. SAC-1 (1983) 803–816.

    Google Scholar 

  13. A.G. Greenberg and N. Madras, Comparison of a fair queueing discipline to processor sharing,Proc. PERFORMANCE '90 (North-Holland) pp. 193–207.

  14. V. Jacobson, Congestion avoidance and control,Proc ACM SIGCOMM (1988) pp. 314–329.

  15. R. Jain, K. Ramakrishnan and D. Chiu, Congestion avoidance in computer networks with a connectionless network layer, in:Innovations in Internetworking (Artech House, 1988).

  16. P. Karn and C. Partridge, Improving round-trip time estimates in reliable transport protocols,Proc. ACM SIGCOMM 1987, pp. 2–7.

  17. A.G. Konheim, I. Meilijson and A. Melkman, Processor-sharing of two parallel lines, J. Appl. Prob. 18 (1981) 952–956.

    Google Scholar 

  18. L. Kosten, Stochastic theory of data-handling systems with groups of multiple sources, in:Performance of Computer-Communication Systems, eds. H. Rudin and W. Bux (Elsevier, Amsterdam, 1984) pp. 321–331.

    Google Scholar 

  19. H. Kroner, T.H. Theimer and U. Briem, Queueing models for ATM systems — a comparison,Proc. 7th ITC Specialist Seminar, Morristown (October 1990), paper 9.1.

  20. K.K. Leung, Cyclic-service systems with probabilistically-limited service, preprint (1990).

  21. D.T.D. Luan and D.M. Lucantoni, Throughput analysis of a window-based flow control subject to bandwidth management,INFOCOM (1988) pp. 4C.3.1–4C.3.7.

  22. B. Maglaris, P. Anastassiou, P. Sen, G. Karlsson and J.D. Robbins, Performance models of statistical multiplexing in packet video communications, IEEE Trans. Comm. COM-36 (1988) 834–843.

    Google Scholar 

  23. R. Mazumdar, L. Mason and C. Douligeris, Fairness in network optimal flow control: optimality of product forms, to appear in IEEE Trans. Commun.

  24. D. Mitra, Asymptotically optimal design of congestion control for high speed data networks, to appear in IEEE Trans. Comm. (1991).

  25. D. Mitra and K.G. Ramakrishnan, A numerical investigation into the optimal design of congestion controls for high speed data networks,Proc. 10th Conf. on Computer Communication (ICCC 90), New Delhi, India (1990) pp. 362–369.

  26. D. Mitra and J.B. Seery, Dynamic adaptive windows for high speed data networks: theory and simulations,Proc. ACM SIGCOMM (1990) pp. 30–40.

  27. D. Mitra, Stochastic theory of a fluid model of producers and consumers coupled by a buffer, Adv. Appl. Prob. 20 (1988) 646–676.

    Google Scholar 

  28. D. Mitra and I. Mitrani, Asymptotic optimality of the go-back-n protocol in high speed data networks with small buffers,Proc. 4th Int. Conf. on data Communication Systems and Their Performance, IFIP, Barcelona (June 1990) pp. 17–31.

    Google Scholar 

  29. D. Mitra and J.B. Seery, Dynamic adaptive windows for high speed data networks with multiple paths and propagation delays,Proc. INFOCOM '91 (IEEE Computer Science Press, 1991) pp. 39–48.

  30. J.A.S. Monteiro, M. Gerla and L. Fratta, Statistical multiplexing in ATM networks,Proc. 4th Int. Conf. on Data Communication Systems and Their Performance, IFIP, Barcelona (1990) pp. 148–162.

    Google Scholar 

  31. J.A. Morrison, Head of the line processor sharing for two symmetric queues, preprint (1990).

  32. R. Nagarajan, J.F. Kurose and D. Towsley, Approximation techniques for computing loss in finite-buffered voice multiplexers,Proc. INFOCOM '90 (IEEE Computer Society Press, 1990) pp. 947–955.

  33. K.G. Ramakrishnan and D. Mitra, PANACEA: an integrated set of tools for performance analysis, in:Modeling Techniques and Tools for Computer Performance Evaluation (Plenum Press, 1989).

  34. M. Reiser, A queueing-network analysis of computer communication networks with window flow control, IEEE Trans. Commun. COM-27 (1979) 1199–1209.

    Google Scholar 

  35. M.A. Rodrigues and K.W. Fendick, Efficient fair scheduling discipline arrangement, preprint (1990).

  36. Z. Rosberg and N. Shacham, Resequencing delay and buffer occupancy under the selectiverepeat ARQ, IEEE Trans Info. Th. IT-35 (1989) 166–173.

    Google Scholar 

  37. K. Sabnani and A. Netravali, A high speed transport protocol for datagram/virtual circuit networks,Proc. ACM SIGCOMM (1989) pp. 146–157.

  38. M. Schwartz,Telecommunication Networks: Protocols, Modeling and Analysis (Addison-Wesley, Reading, MA, 1987).

    Google Scholar 

  39. M. Sidi, W.Z. Liu, I. Cidon and I. Gopal, Congestion control through input rate regulation,Proc. GLOBECOM '89, pp. 1764–1768.

  40. T.E. Stern and A.I. Elwalid, Analysis of separable Markov-modulated rate models for information-handling systems, to appear in Adv. Appl. Prob. (March 1991).

  41. A.S. Tanenbaum,Computer Networks (Prentice Hall, Englewood Cliffs, NJ, 1988).

    Google Scholar 

  42. D. Towsley and J.K. Wolf, On the statistical analysis of queue lengths and waiting times for statistical multiplexers with ARQ retransmission strategies, IEEE Trans. Commun. COM-27 (April 1979) 693–702.

    Google Scholar 

  43. J.S. Turner, New directions in communications (or which way to the information age?), IEEE Communications Magazine (Oct. 1986).

  44. A. Weiss, A new technique for analyzing large traffic systems, Adv. Appl. Prob. 18 (1986) 506–532.

    Google Scholar 

  45. G. Woodruff, R. Kositpaiboon, G. Fitzpatrick and P. Richards, Control of ATM statistical multiplexing performance,Proc. ITC Specialist Seminar, Adelaide (1989) paper 17.2.

  46. L. Zhang, A new architecture for packet switching network protocols, MIT Ph.D. thesis, Laboratory for Computer Science Cambridge, MA 02139.

Download references

Author information

Authors and Affiliations

Authors

Additional information

I. Mitrani's work was done while AT&T Bell Laboratories.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mitra, D., Mitrani, I., Ramakrishnan, K.G. et al. A unified set of proposals for control and design of high speed data networks. Queueing Syst 9, 215–234 (1991). https://doi.org/10.1007/BF01158798

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01158798

Keywords

Navigation