Abstract
In this chapter, we discuss the add-ons to the standard collection of types defined by C++ that create what we would call the look and feel of SMURPH programs, and introduce a few basic operations laying out the foundations for developing models in SMURPH.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In the days when SMURPH was programmed, C++ was a much less established tool than it is today.
- 2.
This “variable” is in fact a macro referencing Time, so current time is stored in one place.
- 3.
Thus, for BIG_precision equals 1 and 2, BIG numbers will be represented in the same way, using the standard integer type long.
- 4.
If the size of type LONG is 64 bits, the overflow and error conditions are only checked for precisions higher than 2.
- 5.
Recall that BIG numbers cannot be negative.
- 6.
The original rationale for this feature was entering link distance matrices (Sect. 4.3.3) that, in many cases, consisted of a large number of identical entries.
- 7.
The parser has been adapted from a publicly available (MIT license) code by Aaron Voisine .
- 8.
The minimum guaranteed size of FLAGS is \(32\) bits.
- 9.
Implemented as C macros.
- 10.
A SMURPH program may be contained in several files and the fact that no multiple inheritance is used in one file does not preclude it from being used in another one.
- 11.
The comma following “nickname” is needed (it is not a mistake).
- 12.
This only concerns those mailboxes that are owned by stations. Mailboxes owned by processes can be destroyed (see Sect. 9.2.1).
References
P. Gburzyński, P. Rudnicki, A Better-than-token protocol with bounded packet delay time for Ethernet-type LAN’s, in Proceedings of Symposium on the Simulation of Computer Networks (Colorado Springs, Co., 1987)
P. Gburzyński, P. Rudnicki, Using time to synchronize a token Ethernet, in Proceedings of CIPS Edmonton ’87 (1987)
P. Gburzyński, P. Rudnicki, A note on the performance of ENET II. IEEE J. Sel. Areas Commun. 7(4), 424–427 (1989)
L.G. Birta, G. Arbez, Modelling and Simulation (Springer, 2013)
L.A. Adamic, Zipf, power laws, and Pareto: a ranking tutorial. Xerox Palo Alto Research Center, Palo Alto, CA, http://ginger.hpl.hp.com/shl/papers/ranking/ranking.html (2000)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Gburzyński, P. (2019). Basic Operations and Types. 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_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-15391-5_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-15390-8
Online ISBN: 978-3-030-15391-5
eBook Packages: EngineeringEngineering (R0)