Numerical Solution of Models

Thomas G. Robertazzi
Additional contact information
Thomas G. Robertazzi: SUNY Stony Brook, Department of Electrical Engineering

Chapter Chapter 4 in Computer Networks and Systems, 2000, pp 163-235 from Springer

Abstract: Abstract The ultimate goal of much performance analysis is to generate numerical performance results for a particular system under specific conditions. These can take the form of tables or a set of performance curves. There are a variety of numerical techniques available, ranging from the brute force solution of the state equations to clever algorithms to Monte Carlo type simulation. With all these techniques the cost of solution in terms of solution time and computer memory requirements are important considerations. The cost of solving a system of even moderate complexity may be prohibitively expensive for a particular technique and computer installation. There is a tradeoff between our ability to model and our ability to solve such models. There is thus an advantage to simplified models that capture the most important aspects of the system in question.

Keywords: Service Rate; Normalization Constant; Queueing Network; Infinitesimal Perturbation Analysis; Convolution Algorithm (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-1164-8_4

Ordering information: This item can be ordered from
http://www.springer.com/9781461211648

DOI: 10.1007/978-1-4612-1164-8_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().