Discrete-Time Analysis of Usage Parameter Control Functions in ATM Systems

  • P. Tran-Gia


The design of the User Network Interface (UNI) in accordance with the incorporated Usage Parameter Control (UPC) plays an important role in the current ATM development and standardization process. Due to the discrete-time nature of ATM cell traffic and the control functions at UNI, queueing models operating in discrete-time domain can be used in a quite direct way.

In this paper, two models dealing with UNI/UPC functions will be presented i) a queueing model to analyse the cell traffic shaping using a spacer, where a discrete-time algorithm for the spacer output process is developed and ii) a queueing model for the generic cell rate algorithm (GCRA) is derived, with which dimensioning aspects of the cell delay variation (CDV) are discussed, in accordance with a versatile discrete-time algorithm.


Bounded Delay Overload Control Traffic Shaping Interdeparture Time Peak Cell Rate 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Ackroyd M.H., “Computing the waiting time distribution for the G/G/1 queue by signal processing methods”, IEEE COM-28(1980) 52–58.Google Scholar
  2. [2]
    ATM Forum, “Traffic Control and Congestion Control”, Draft Baseline Document, April 1993.Google Scholar
  3. [3]
    Bernabei F., Gratta L., Listanti M., Sarghini A., “Analysis of ON-OFF Source Shaping for ATM Multiplexing”, INFOCOM 1993, pp. 1 la.3.Google Scholar
  4. [4]
    Boyer P., Guillemin F.M., Servel M.J., Coudreuse J.-P., “Spacing Cells Protects and Enhances Utilization of ATM Network Links”, IEEE Network Vol. 6(1992) No.5.Google Scholar
  5. [5]
    Brochin F.M., “A Cell Spacing Device for Congestion Control in ATM Networks”, Performance Evaluation, Vol.16, No.1–3, November 1992, 107127.Google Scholar
  6. [6]
    CCITT Draft Recommendation I.371, “Traffic Control and Congestion Control in B-ISDN”, June 1992.Google Scholar
  7. [7]
    CCITT Study Group XVIII Contribution D. 2373, “A Proposal for a Definition of a Sustainable Cell Rate Traffic Descriptor”, January 1993.Google Scholar
  8. [8]
    COST 224 Final Report, “Performance evaluation and design of multiservice networks”, J.W. Roberts (editor), Commission of the European Communities (EUR 14152 ), October 1991.Google Scholar
  9. [9]
    Daley D.J., “Notes on Queueing Output Processes”, Math. Methods in Queueing Theory, Springer, 1974, 351–358.CrossRefGoogle Scholar
  10. [10]
    Gravey A., Boyer P., “Cell Delay Variation Specification in ATM Networks”, Proc. IFIP Workshop TC6, Modelling and Performance Evaluation of ATM Technology, La Martinique, January 1993.Google Scholar
  11. [11]
    Guillemin F.M., Boyer P., Romoeuf L., “The Spacer-Controller: Architecture and First Assessments”, Workshop on Broadband Communications, Estoril, Portugal, January 1992, 313–323.Google Scholar
  12. [12]
    Guillemin F.M., Monin W., “Limitation of Cell Delay Variation in ATM Networks”, ICCT, Beijing, China, September 1992.Google Scholar
  13. [13]
    Guillemin F.M., Monin W., “Management of Cell Delay Variation in ATM Networks”, GLOBECOM 1992, 128–132.Google Scholar
  14. [14]
    Hübner F., “Dimensioning of a Peak Cell Rate Monitor Algorithm Using Discrete-Time Analysis”, University of Würzburg, Institute of Computer Science Research Report Series, Report No.59, March 1993, to appear in Proc. 14-th International Teletraffic Congress, Antibes Juan-les-pins, France, June 1994.Google Scholar
  15. [15]
    Hübner F., Tran-Gia P., “A Discrete-time Analysis of Cell Spacing in ATM Systems”, University of Würzburg, Institute of Computer Science, Research Report Series, Report No. 66, June 1994.Google Scholar
  16. [16]
    Hübner F., “Discrete-time Performance Analysis of finite-capacity Queueing Models for ATM Multiplexers”, University of Würzburg, Institute of Computer Science, Ph.D. Dissertation, 1993.Google Scholar
  17. [17]
    Hluchyi, M. G., Yin, N., “On the Queueing Behavior of Multiplexed Leaky Bucket Regulated Sources”, INFOCOM 1993, paper 6a. 3.Google Scholar
  18. [18]
    Hunter J.J., “Mathematical Techniques of Applied Probability”, Vol. 1: Discrete Time Models: Basic Theory, Academic Press, 1983.Google Scholar
  19. [19]
    Kingman J.F.C., “Inequalities in the Theory of Queues”, J. Roy. Stat. Soc. B32 (1970) 102–110.MathSciNetMATHGoogle Scholar
  20. [20]
    Kobayashi H., “Stochastic Modelling: Queueing Models; Discrete-Time Queueing Systems”, in: Part II, Louchard G., Latouche G. (eds.), “Probability Theory and Computer Science”, Academic Press 1983.Google Scholar
  21. [21]
    Konheim A.G., “An Elementary Solution of the Queueing System GI/G/1”, SIAM J. Comp., 4 (1975) 540–545.MathSciNetMATHGoogle Scholar
  22. [22]
    Lindley D.V., “The Theory of Queues with a Single Server”, Proc. of the Cambridge Philosophical Society, 48 (1952) 277–289.MathSciNetCrossRefGoogle Scholar
  23. [23]
    Meisling T., “Discrete-Time Queueing Theory”, Operations Research 6 (1958) 96–105.MathSciNetCrossRefGoogle Scholar
  24. [24]
    Pack C.D., “The Output of an M/D/1 Queue”, Operations Research 23(1975)4, 750–760.Google Scholar
  25. [25]
    Reiss L.K., Merakos L.F., “Shaping of Virtual Path Traffic for ATM B-ISDN”, INFOCOM 1993, paper 2a. 4.Google Scholar
  26. [26]
    Smith W.L., “On the Distribution of Queueing Times”, Proc. of the Cambridge Philosophical Society, 49 (1953) 449–461.MATHCrossRefGoogle Scholar
  27. [27]
    Tran-Gia P., “Discrete-time analysis for the interdeparture distribution of GI/G/1 queues”, Proc. Semin. Teletraffic Analysis and Comp. Perform. Eval., Amsterdam, The Netherlands, 1986.Google Scholar
  28. [28]
    Tran-Gia P., “Analysis of a load-driven overload control mechanism in discrete-time domain”, Proc. 12th International Teletraffic Congress, Torino 1988.Google Scholar
  29. [29]
    Tran-Gia P., Ahmadi H., “Analysis of a Discrete-Time GM/D/1S Queueing System with Applications in Packet-Switching Systems”, INFOCOM 1988, 861–870.Google Scholar
  30. [30]
    Tran-Gia P., Dittmann R., “A discrete-time analysis of the cyclic reservation multiple access protocol”, Performance Evaluation, Vol. 16, 1992, 185–200.MATHCrossRefGoogle Scholar
  31. [31]
    Tran-Gia P., Rathgeb E., “Performance Analysis of Semidynamic Scheduling Strategies in Discrete-Time Domain”, Proc. INFOCOM ’87, San Francisco, March/April 1987, IEEE Computer Society Press 1987, 962–970.Google Scholar
  32. [32]
    Wallmeier E., Worster T., “The Spacing Policer, an Algorithm for Efficient Peak Bit Rate Control in ATM Networks”, Int. Switching Sympos. 14, October 1992, paper A5. 5.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1994

Authors and Affiliations

  • P. Tran-Gia
    • 1
  1. 1.Institute of Computer ScienceUniversity of WürzburgWürzburgGermany

Personalised recommendations