Skip to main content

DEDS Stochastic Behaviour and Modelling

  • Chapter
  • First Online:
Modelling and Simulation

Part of the book series: Simulation Foundations, Methods and Applications ((SFMA))

  • 1995 Accesses

Abstract

This section explores some important aspects of the random (stochastic) nature of DEDS and introduces several assumptions that are typically made about it within the model development process.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 84.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    This is an example of the statistical notion of an arrival process.

  2. 2.

    Some care is nevertheless required in clarifying which of two possible values is to be taken at the discrete points in time where change occurs. Our convention will be that x(t) = xk for tk ≤ t < tk+1 for k = 0, 1, 2, …

  3. 3.

    The intent here is to circumvent any possible misinterpretation with respect to guidelines (a) and (b).

  4. 4.

    The collection of all values of this output resulting from an experiment, namely, {d1, d2, …, dN} (where N is the total number of messages passing through the network over the course of the observation interval), is an observation of a stochastic process.

  5. 5.

    The notable exception here is the case where a graphical presentation of the data is desired.

  6. 6.

    These two types of study are often referred to as ‘terminating simulations’ and ‘nonterminating simulations’, respectively.

  7. 7.

    Generated using the Microsoft® Office Excel 2003 Application.

  8. 8.

    Source: http://ottawa.weatherstats.ca.

  9. 9.

    The test is shown for the continuous distribution. For discrete distributions, each value in the distribution corresponds to a class interval and pi = P(X = xi).

  10. 10.

    It is also possible to derive the CDF directly from the collected data.

  11. 11.

    The Empirical Class is provided as part of the cern.colt Java package provided by CERN (European Organization for Nuclear Research). See Chap. 5 for some details on using this package.

  12. 12.

    mod is the modulo operator; p mod q yields the remainder when p is divided by q where both p and q are positive integers.

References

  1. Banks J, Carson JS II, Nelson BL, Nicol DM (2005) Discrete-event system simulation, 4th edn. Pearson Prentice Hall, Upper Saddle River

    Google Scholar 

  2. Biller B, Nelson BL (2002) Answers to the top ten input modeling questions. In: Proceedings of the 2002 winter simulation conference, published by ACM. San Diego, California

    Google Scholar 

  3. Choi SC, Wette R (1969) Maximum likelihood estimation of the parameters of the gamma distribution and their bias. Technometrics 11:683–690

    Article  Google Scholar 

  4. Couture R, L’Ecuyer P (eds) (1998) Special issue on random variate generation. ACM Trans Model Simul 8(1)

    Google Scholar 

  5. Coveyou RR (1960) Serial correlation in the generation of pseudo-random numbers. J ACM 7:72–74

    Article  MathSciNet  Google Scholar 

  6. Harrell C, Ghosh BK, Bowden RO Jr (2004) Simulation using ProModel, 2nd edn. McGraw-Hill, New York

    Google Scholar 

  7. Hull TE, Dobell AR (1962) Random number generators. SIAM Rev 4:230–254

    Article  MathSciNet  Google Scholar 

  8. Kelton DW, Sadowski RP, Sturrock DT (2004) Simulation with Arena, 3rd edn. McGraw-Hill, New York

    Google Scholar 

  9. Kleijnen Jack PC (1987) Statistical tools for simulation practitioners. Marcel Dekker Inc, New York

    MATH  Google Scholar 

  10. Knuth DE (1998) The art of computer programming, vol 2: Seminumerical algorithms, 3rd edn. Addison-Wesley, Reading

    Google Scholar 

  11. L’Ecuyer P (1990) Random numbers for simulation. Commun ACM 33:85–97

    Article  Google Scholar 

  12. Law Averill M, McComas MG (1997) Expertfit: total support for simulation input modeling. In: Proceedings of the 1997 winter simulation conference, published by ACM. Atlanta, GA, pp 668–673

    Google Scholar 

  13. Law AM (2015) Simulation modeling and analysis, 5th edn. McGraw-Hill, New York

    Google Scholar 

  14. Leemis LM, Park SK (2006) Discrete event simulation: a first course. Pearson Prentice Hall, Upper Saddle River

    Google Scholar 

  15. Lehmer DH (1949, 1951) Mathematical methods in large scale computing units. In: Proceedings of the second symposium on large-scale digital calculating machinery, 1949 and Ann Comput Lab (26):141–146 (1951). Harvard University Press, Cambridge, MA

    Google Scholar 

  16. Ross SM (1990) A course in simulation. Macmillan Publishing, New York

    MATH  Google Scholar 

  17. Rotenberg A (1960) A new pseudo-random number generator. J ACM 7:75–77

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Louis G. Birta .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Birta, L.G., Arbez, G. (2019). DEDS Stochastic Behaviour and Modelling. In: Modelling and Simulation. Simulation Foundations, Methods and Applications. Springer, Cham. https://doi.org/10.1007/978-3-030-18869-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-18869-6_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-18868-9

  • Online ISBN: 978-3-030-18869-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics