Advertisement

Queueing Systems

, Volume 44, Issue 4, pp 365–398 | Cite as

Models of Network Access Using Feedback Fluid Queues

  • Michel Mandjes
  • Debasis Mitra
  • Werner Scheinhardt
Article

Abstract

At the access to networks, in contrast to the core, distances and feedback delays, as well as link capacities are small, which has network engineering implications that are investigated in this paper. We consider a single point in the access network which multiplexes several bursty users. The users adapt their sending rates based on feedback from the access multiplexer. Important parameters are the user's peak transmission rate p, which is the access line speed, the user's guaranteed minimum rate r, and the bound ε on the fraction of lost data. Two feedback schemes are proposed. In both schemes the users are allowed to send at rate p if the system is relatively lightly loaded, at rate r during periods of congestion, and at a rate between r and p, in an intermediate region. For both feedback schemes we present an exact analysis, under the assumption that the users' file sizes and think times have exponential distributions. We use our techniques to design the schemes jointly with admission control, i.e., the selection of the number of admissible users, to maximize throughput for given p, r and ε. Next we consider the case in which the number of users is large. Under a specific scaling, we derive explicit large deviations asymptotics for both models. We discuss the extension to general distributions of user data and think times.

access network feedback regulation fluid models spectral expansion many-sources scaling large deviations 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    I. Adan, E. van Doorn, J. Resing and W. Scheinhardt, Analysis of a single-server queue interacting with a fluid reservoir, Queueing Systems 29 (1998) 313–336.Google Scholar
  2. [2]
    D. Anick, D. Mitra and M. Sondhi, Stochastic theory of a data-handling system with multiple sources, Bell System Tech. J. 61 (1982) 1871–1894.Google Scholar
  3. [3]
    D. Botvich and N. Duffield, Large deviations, the shape of the loss curve and economies of scale in large multiplexers, Queueing Systems 20 (1995) 293–320.Google Scholar
  4. [4]
    G. Choudhury, D. Lucantoni and W. Whitt, Squeezing the most out of ATM, IEEE Trans. Commun. 44 (1996) 203–217.Google Scholar
  5. [5]
    J. Cohen, The multiple phase service network with generalized processor sharing, Acta Informatica 12 (1979) 245–284.Google Scholar
  6. [6]
    C. Courcoubetis and R. Weber, Buffer overflow asymptotics for a buffer handling many traffic sources, J. Appl. Probab. 33 (1996) 886–903.Google Scholar
  7. [7]
    A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications (Jones and Bartlett, Boston, 1993).Google Scholar
  8. [8]
    N. Duffield, Conditioned asymptotics for tail probabilities in large multiplexers, Performance Evaluation 31 (1998) 281–300.Google Scholar
  9. [9]
    A. Elwalid, D. Heyman, T. Lakshman, D. Mitra and A. Weiss, Fundamental bounds and approximations for ATM multiplexers with applications to videoconferencing, IEEE J. Selected Areas Commun. 13 (1995) 1004–1016.Google Scholar
  10. [10]
    A. Elwalid and D. Mitra, Analysis and design of rate-based congestion control of high-speed networks, I: Stochastic fluid models, access regulation, Queueing Systems 9 (1991) 29–64.Google Scholar
  11. [11]
    A. Elwalid and D. Mitra, Statistical multiplexing with loss priorities in rate-based congestion control of high-speed networks, IEEE Trans. Commun. 42 (1994) 2989–3002.Google Scholar
  12. [12]
    R. Gibbens and F.P. Kelly, Resource pricing and the evolution of congestion control, Automatica 35 (1999) 1969–1985.Google Scholar
  13. [13]
    R. Gibbens and F.P. Kelly, Distributed connection acceptance control for a connectionless network, in: Proceedings ITC 16: Teletraffic Engineering in a Competitive World, eds. P. Key and D. Smith (Elsevier, Amsterdam, 1999) pp. 941–952.Google Scholar
  14. [14]
    P. Glynn and W. Whitt, Logarithmic asymptotics for steady-state tail probabilities in a single-server queue, J. Appl. Probab. A 31 (1994) 131–156.Google Scholar
  15. [15]
    R. Howard, Dynamic Probabilistic Systems, Vol. 1 (Wiley, New York, 1971).Google Scholar
  16. [16]
    F.P. Kelly, Models for a self-managed Internet, Philos. Trans. Roy. Soc. A 358 (2000) 2335–2348.Google Scholar
  17. [17]
    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
  18. [18]
    M. Mandjes, Overflow asymptotics for large communication systems with general Markov fluid sources, Probab. Engrg. Inform. Sci. 10 (1996) 501–518.Google Scholar
  19. [19]
    M. Mandjes and J.H. Kim, Large deviations for small buffers: an insensitivity result, Queueing Systems 37 (2001) 349–362.Google Scholar
  20. [20]
    [20] M. Mandjes and A. Ridder, Optimal trajectory to overflow in a queue fed by a large number of sources, Queueing Systems 31 (1999) 137–170.Google Scholar
  21. [21]
    M. Mandjes and A. Weiss, Sample path large deviations of a multiple time-scale queueing model, submitted.Google Scholar
  22. [22]
    L. Massoulié and J. Roberts, Arguments in favour of admission control for TCP flows, in: Proceedings ITC 16: Teletraffic Engineering in a Competitive World, eds. P. Key and D. Smith (Elsevier, Amsterdam, 1999) pp. 33–44.Google Scholar
  23. [23]
    D. Mitra, Stochastic theory of a fluid model of producers and consumers coupled by a buffer, Adv. in Appl. Probab. 20 (1988) 646–676.Google Scholar
  24. [24]
    R. Pazhyannur and R. Agrawal, Feedback-based flow control of B-ISDN/ATM networks, IEEE J. Selected Areas Commun. 13 (1995) 1252–1266.Google Scholar
  25. [25]
    K. Ramanan and A. Weiss, Sharing bandwidth in ATM, in: Proc. of Allerton Conference, 1997, pp. 732–740.Google Scholar
  26. [26]
    J. Roberts, Engineering for quality of service, in: Self-Similar Network Traffic and Performance Evaluation, eds. K. Park and W. Willinger (Wiley-Interscience, New York, 2000).Google Scholar
  27. [27]
    J. Roberts and S. Oueslati-Boulahia, Quality of service by flow aware networking, Philos. Trans. Roy. Soc. A 358 (2000) 2197–2207.Google Scholar
  28. [28]
    W. Scheinhardt, Markov-modulated and feedback fluid queues, Ph.D. thesis, University of Twente, the Netherlands (1998); available at Internet http://www.ub.utwente.nl/webdocs/tw/ 1/t0000008.pdf.Google Scholar
  29. [29]
    W. Scheinhardt, Analysis of feedback fluid queues, in: Proc. 14th ITC-Specialists Seminar on Access Networks and Systems, Girona, Spain, 25–27 April 2001, pp. 215–220.Google Scholar
  30. [30]
    M. Schwartz, Broadband Integrated Networks (Prentice-Hall, Upper Saddle River, NJ, 1996).Google Scholar
  31. [31]
    A. Shwartz and A. Weiss, Large Deviations for Performance Analysis, Queues, Communication and Computing (Chapman and Hall, New York, 1995).Google Scholar
  32. [32]
    A. Simonian and J. Guibert, Large deviations approximation for fluid queues fed by a large number of on/off sources, IEEE J. Selected Areas Commun. 13 (1995) 1017–1027.Google Scholar
  33. [33]
    A. Weiss, A new technique of analyzing large traffic systems, Adv. in Appl. Probab. 18 (1986) 506– 532.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Michel Mandjes
    • 1
    • 2
    • 3
  • Debasis Mitra
    • 1
  • Werner Scheinhardt
    • 3
    • 2
  1. 1.Bell LaboratoriesLucent TechnologiesMurray HillUSA
  2. 2.CWIAmsterdamThe Netherlands
  3. 3.Department of Applied MathematicsUniversity of TwenteEnschedeThe Netherlands

Personalised recommendations