Performance Evaluation of Computer and Communication Systems
Taylor & Francis Inc (Verlag)
978-1-4398-4992-7 (ISBN)
- Titel z.Zt. nicht lieferbar
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
Jean-Yves Le Boudec is professor at EPFL and fellow of the IEEE. He graduated from Ecole Normale Superieure de Saint-Cloud, Paris, and received his doctorate in 1984 from the University of Rennes, France. Before joining the EPFL in 1994, he had worked at Bell Northern Research, Ottawa, Canada; and at the IBM Zurich Research Laboratory where he was manager of the Customer Premises Network Department. His interests are in the performance and architecture of communication systems. He is recipient of numerous awards, including the 2008 IEEE Communications Society William R. Bennett Prize in the field of Communications Networking.
Methodology
What is Performance Evaluation ?
Factors
Evaluation Methods
The Scientific Method
Performance Patterns
Summarizing Performance Data, Confidence Intervals
Summarized Performance Data
Confidence Intervals
The Independence Assumption
Prediction Interval
Which Summarization To Use?
Other Aspects of Confidence/Prediction Intervals
Proofs
Model Fitting
Model Fitting Criteria
Linear Regression
Linear Regression with Norm Minimization
Choosing a Distribution
Heavy Tail
Proofs
Tests
The Neyman Pearson Framework
Likelihood Ratio Tests
ANOVA
Asymptotic Results
Other Tests
Proofs
Forecasting
What is Forecasting ?
Linear Regression
The Overfitting Problem
Differencing the Data
Fitting Differenced Data to an ARMA Model
Sparse ARMA and ARIMA Models
Proofs
Discrete Event Simulation
What is a Simulation?
Simulation Tehniques
Computing the Accuracy of Stochastic Simulations
Monte Carlo Simulation
Random Number Generators
How to Sample from a Distribution
Importance Sampling
Proofs
Palm Calculus, or the Importance of the Viewpoint
An Informal Introduction
Palm Calculus
Other Useful Palm Calculus Results
Simulation Defined as Stochastic Recurrence
Application to Markov Chain Models and the PASTA Property
Appendix: Quick Review of Markov Chains
Proofs
Review Questions
Queuing Theory for Those Who Cannot Wait
Deterministic Analysis
Operational Laws For Queuing Systems
Classical Results for a Single Queue
Definitions for Queuing Networks
The Product-Form Theorem
Computational Aspects
What This Tells Us
Mathematical Details About Product-Form Queuing Networks
Case Study
Proofs
Each chapter concludes with a Review that includes review questions.
Erscheint lt. Verlag | 15.4.2021 |
---|---|
Verlagsort | Washington |
Sprache | englisch |
Maße | 156 x 235 mm |
Gewicht | 885 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
Technik ► Elektrotechnik / Energietechnik | |
ISBN-10 | 1-4398-4992-7 / 1439849927 |
ISBN-13 | 978-1-4398-4992-7 / 9781439849927 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich