Queueing Systems

, Volume 6, Issue 1, pp 89–108 | Cite as

Tandem behavior of a telecommunication system with finite buffers and repeated calls

  • Behnam Pourbabai
Invited Paper

Abstract

The tandem behavior of a telecommunication system with finite buffers and repeated calls is modeled by the performance of a finite capacityG/M/1 queueing system with general interarrival time distribution, exponentially distributed service time, the first-come-first-served queueing discipline and retrials. In this system a fraction of the units which on arrival at a node of the system find it busy, may retry to be processed, by merging with the incoming arrival units in that node, after a fixed delay time. The performance of this system in steady state is modeled by a queueing network and is approximated by a recursive algorithm based on the isolation method. The approximation outcomes are compared against those from a simulation study. Our numerical results indicate that in steady state the non-renewal superposition arrival process, the non-renewal overflow process, and the non-renewal departure process of the above system can be approximated with compatible renewal processes.

Keywords

Queueing network approximation retrials telecommunication simulation overflow process departure process superposition process 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    N.M. Akulinichev and V.A. Ivannikov, Limit distributions of additive-type functions in a particular queueing problem, Izv. Akad. Nauk Tech. Kibernetika 1 (1974) 44–51.Google Scholar
  2. [2]
    D.J. Daley, Characterizing pure loss GI/G/1 queues with renewal output, Proc. Camb. Phil. Soc. 75 (1974) 103–107.Google Scholar
  3. [3]
    B.V. Gnedenko and I.N. Kovalenko,Queueing Theory (Weiner Bindery, Jerusalem, 1968).Google Scholar
  4. [4]
    S. Halfin, Distribution of the interoverflow time for the GI/G/1 loss system, Math. Oper. Res. 6 (1981) 563–470.Google Scholar
  5. [5]
    P.J. Kuehn, Approximate analysis of general queueing networks by decomposition, IEEE Trans. Comm. COM-27 (1979) 113–126.CrossRefGoogle Scholar
  6. [6]
    G.M. Laslett, Characterizing the finite capacity GI/M/1 queue with renewal output, Management Sci. 22 (1975) 106–263.Google Scholar
  7. [7]
    W.M. Nawijn, Stochastic conveyor system, Ph.D. Dissertation, Technische Hogeschool Twente, The Netherlands (1983).Google Scholar
  8. [8]
    B. Pourbabai and D. Sonderman, A recirculation system with random access, Europ. J. Oper. Res. 21 (1985) 367–378.CrossRefGoogle Scholar
  9. [9]
    B. Pourbabai and D. Sonderman, Service utilization factors in queueing systems with ordered entry and heterogeneous servers, J. Appl. Prob. 23 (1986) 236–242.CrossRefGoogle Scholar
  10. [10]
    B. Pourbabai, Performance modeling of a closed loop material handling system, Europ. J. Oper. Res. 32 (1987) 340–352.CrossRefGoogle Scholar
  11. [11]
    B. Pourbabai, Approximation of the overflow process from a G/M/N/K queueing system, Management Sci. 33 (1987) 931–938.Google Scholar
  12. [12]
    B. Pourbabai, Analysis of a G/M/K/0 queueing loss system with heterogeneous servers and retrials, Int. J. Syst. Sci. 18 (1987) 985–992.Google Scholar
  13. [13]
    B. Pourbabai, A random access telecommunication system, Electronische Information Severabeitung und Kybernetik (E.I.K.), J. Information Processing and Cybernetics 24 (1988) 613–625.Google Scholar
  14. [14]
    B. Pourbabai, Approximation of the departure process from a G/G/1 loss system, Oper. Res. Series A: Theory 33 (1989) 109–129.Google Scholar
  15. [15]
    B. Pourbabai, Analysis and design of an integrated material handling system, to appear in Int. J. Prod. Res. (1989).Google Scholar
  16. [16]
    B. Pourbabai, A finite capacity telecommunication system with repeated calls, to appear in Elektronische Information Sverarbeitung und Kybernetik (E.I.K.), J. Information Processing and Cybernetics (1989).Google Scholar
  17. [17]
    A.A. Pritsker, Application of multichannel queueing results to the analysis of conveyor systems, J. Industr. Eng. 17 (1966) 14–21.Google Scholar
  18. [18]
    A.A. Pritsker and C.D. Pegden,Introduction to Simulation and SLAM (Halsted Press, 1979).Google Scholar
  19. [19]
    J. Riordan,Stochastic Service Systems (Wiley, 1962).Google Scholar
  20. [20]
    C.H. Sauer and K.M. Chandy,Computer System Performance Modeling (Prentice Hall, 1981).Google Scholar
  21. [21]
    W. Whitt, Approximating a point process by a renewal process I: Two basic methods, Oper. Res. 30 (1982) 125–147.CrossRefGoogle Scholar
  22. [22]
    W. Whitt, The queueing network analyzer, B.S.T.J. 62, No. 9, part 1 (1983) 2779–2815.Google Scholar

Copyright information

© J.C. Baltzer A.G. Scientific Publishing Company 1990

Authors and Affiliations

  • Behnam Pourbabai
    • 1
  1. 1.Department of Mechanical EngineeringThe University of MarylandCollege ParkUSA

Personalised recommendations