Skip to main content

Measuring Performance

  • Chapter
  • First Online:
  • 289 Accesses

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 61))

Abstract

One objective of modeling physical systems, like networks, in SMURPH is to study their quantifiable performance. In this chapter we present the built-in tools provided by SMURPH for collecting performance data. Some performance measures are calculated automatically: for the Client (the network’s abstract application) and for the (wired and wireless) communication channels. The user can easily collect additional statistical data which augment or replace the standard measurements. The calculation of both the standard and user-defined performance measures is based on the concept of random variables represented by a special data type.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Notes

  1. 1.

    The TTime attribute of an empty packet buffer (see Sect. 6.2) is used to store the time when the buffer was last released.

  2. 2.

    Assuming the denominator is nonzero.

  3. 3.

    The counters and methods related to damaged packets are only available if the program has been created with the –z option of mks (Sect. B.5).

  4. 4.

    If receive is called without the second argument (identifying the radio channel, Sect. 8.2.3), the counters are not incremented.

  5. 5.

    The user can still look (peek) into the execution of such a program, which may make sense when its run time is long, and monitor its progress (see Sect. C.1).

  6. 6.

    The last situation occurs when all processes (including system processes) get into a state where no possible event can wake them up. Note that such a situation can be intercepted by a process (or multiple processes) waiting for the STALL event on the Kernel (Sect. 5.1.8). In such a case, running out of events does not trigger termination. A control program running in the real mode (Sects. 1.3.1 and 5.1.8) is not terminated when it runs out of events. It just waits for them to arrive from whatever external sources the program is connected to.

  7. 7.

    As determined by the argument type: type double selects the ETU interpretation.

Reference

  1. A.M. Law, W. D. Kelton, Simulation Modeling & Analysis (McGraw-Hill, 2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Paweł Gburzyński .

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

Gburzyński, P. (2019). Measuring Performance. In: Modeling Communication Networks and Protocols. Lecture Notes in Networks and Systems, vol 61. Springer, Cham. https://doi.org/10.1007/978-3-030-15391-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-15391-5_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-15390-8

  • Online ISBN: 978-3-030-15391-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics