Skip to main content
Log in

Modelling and simulating non-stationary arrival processes to facilitate analysis

  • Original Article
  • Published:
Journal of Simulation

Abstract

This paper introduces a method to model and simulate non-stationary, non-renewal arrival processes that depends only on the analyst setting intuitive and easily controllable parameters. Thus, it is suitable for assessing the impact of non-stationary, non-exponential, and non-independent arrivals on simulated performance when they are suspected. A specific implementation of the method is also described and provided for download.

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.

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6

Similar content being viewed by others

References

  • Çinlar E (1975). Introduction to Stochastic Processes. Prentice-Hall: Englewood Cliffs, NJ.

    Google Scholar 

  • Gerhardt I and Nelson BL (2009). Transforming renewal processes for simulation of non-stationary arrival processes. INFORMS J Comput 21: 630–640.

    Article  Google Scholar 

  • Gusella R (1991). Characterizing the variability of arrival processes with indexes of dispersion. IEEE J Select Areas Commun 9: 203–211.

    Article  Google Scholar 

  • Johnson MA (1998). Markov-MECO: A simple Markovian model for approximating non-renewal arrival processes. Commun Statist-Stochast Models 14: 419–442.

    Article  Google Scholar 

  • Johnson MA and Taaffe MR (1989). Matching moments to phase distributions: Mixtures of Erlang distributions of common order. Commun Statist-Stochast Models 5: 711–743.

    Article  Google Scholar 

  • Law AM (2007). Simulation Modeling and Analysis. 4th edn, McGraw Hill: New York.

    Google Scholar 

  • Leemis LM (2006). Arrival processes, random lifetimes and random objects. In: Henderson SG and Nelson BL (eds). Handbooks in Operations Research and Management Science. Chapter 6, North-Holland: New York.

    Google Scholar 

  • Leland WE, Taqqu MS, Willinger W and Wilson DV (1994). On the self-similar nature of ethernet traffic. IEEE/ACM Trans Networking 21: 1–15.

    Article  Google Scholar 

  • Sauer C and Chandy K (1975). Approximate analysis of central server models. IBM J Res Dev 19: 301–313.

    Article  Google Scholar 

  • Sriram K and Whitt W (1986). Characterizing superposition arrival processes in packet multiplexers for voice and data. IEEE J Select Areas Commun 4: 833–846.

    Article  Google Scholar 

  • Tijms HC (1994). Stochastic Models: An Algorithmic Approach. Wiley: New York.

    Google Scholar 

  • Whitt W (1981). Approximating a point process by a renewal process: The view through a queue, an indirect approach. Mngt Sci 27: 619–634.

    Article  Google Scholar 

  • Whitt W (2002). Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues. Springer: New York.

    Google Scholar 

  • Whitt W (2007). What you should know about queueing models to set staffing requirements in service systems. Nav Res Logist 54: 476–484.

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by National Science Foundation Grant DMII-0521857.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nelson, B., Gerhardt, I. Modelling and simulating non-stationary arrival processes to facilitate analysis. J Simulation 5, 3–8 (2011). https://doi.org/10.1057/jos.2010.21

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jos.2010.21

Keywords

Navigation