Performance evaluation of computer and communication systems

Performance Evaluation of Computer and Communication Systems

Volumn , Issue , 2011, Pages 1-398

  Boudec, Jean Yves Le ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORK PERFORMANCE EVALUATION; COMPUTER SCIENCE; COMPUTERS;

COMPUTER ENGINEERS; SOFTWARE AND HARDWARES; THEORETICAL FOUNDATIONS;

COMPUTER HARDWARE;

EID: 85059429910     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (108)

1. The ns-3 Network Simulator. http://www.nsnam.org/.
2. I. Adan, J. Visschers and J. Wessels. Sum of Product Forms Solutions to MSCCC Queues with Job Type Dependent Processing Times. Memorandum COSOR 98-19, 1998.
3. F. Baccelli and P. Bremaud. Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences. Springer Verlag, 2003.
4. François Baccelli and Pierre Brémaud. Palm Probabilities and Stationary Queues. Springer LNS, 1987.
5. O. Bakr and I. Keidar. Evaluating the Running Time of a Communication Round over the Internet. In Proceedings of the twenty-first annual symposium on Principles of Distributed Computing, pages 243-252. ACM New York, NY, USA, 2002.
6. S. Balsamo. Product Form Queueing Networks. Lecture Notes in Computer Science, pages 377-402, 2000.
7. C. Barakat, P. Thiran, G. Iannaccone, C. Diot and P. Owezarski. Modeling Internet Backbone Traffic at the Flow Level. IEEE Transactions on Signal Processing, 51(8):2111-2124, 2003.
8. A. D. Barbour. Networks of Queues and the Method of Stages. Advances in Applied Probability, 8(3):584-591, 1976.
9. P. Barford and M. Crovella. Generating Representative Web Workloads for Network and Server Performance Evaluation. SIGMETRICS Perform. Eval. Rev., 26(1):151-160, 1998.
10. F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios. Open, Closed, and Mixed Networks of Queues with Different Classes of Customers. Journal of the ACM (JACM), 22(2):260, 1975.
11. S. A. Berezner, C. F. Kriel and A. E. Krzesinski. Quasi-Reversible Multiclass Queues with Order Independent Departure Rates. Queueing Systems, 19(4):345-359, 1995.
12. C. R. Blyth and H. A. Still. Binomial Confidence Intervals. Journal of the American Statistical Association, pages 108-116, 1983.
13. T. Bonald and A. Proutiere. Insensitive Bandwidth Sharing in Data Networks. Queueing Systems, 44(1):69-100, 2003.
14. T. Bonald and J. Virtamo. Calculating the Flow Level Performance of Balanced Fairness in Tree Networks. Performance Evaluation, 58(1):1-14, 2004.
15. G. E. P. Box and G. M. Jenkins. Time Series Analysis, Forecasting and Control. Holden-Day, San Francisco, 1970.
16. M. Bramson. Instability of FIFO Queueing Networks with Quick Service Times. The Annals of Applied Probability, 4(3):693-718, 1994.
17. P. Brémaud. Markov Chains: Gibbs Fields, Monte Carlo Simulation and Queues. Springer, 1999.
18. P. J. Brockwell and R. A. Davis. Introduction to Time Series and Forecasting. Springer Verlag, 2002.
19. P. J. Brockwell and R.A. Davis. Introduction to Time Series and Forecasting, second edition. Springer-Verlag, New York, 2002.
20. J. P. Buzen. Computational Algorithms for Closed Queueing Networks with Exponential Servers. Commun. ACM, 16(9):527, 1973.
21. E. Çinlar. Introduction to Stochastic Processes. Prentice Hall, 1975.
22. K. Mani Chandy and Charles H. Sauer. Computational Algorithms for Product Form Queueing Networks. Commun. ACM, 23(10):573-583, 1980.
23. C. S. Chang. Performance Guarantees in Communication Networks. Springer-Verlag, New York, 2000.
24. X. Chao, M. Miyazawa and M. Pinedo. Queueing Networks: Customers, Signals and Product Form Solutions. Wiley, 1999.
25. J. B. Chen, E. Yasuhiro and C. Kee. The Measured Performance of Personal Computer Operating Systems, 15 thACM SOSP. Colorado, United States: Copper Mountain, pages 169-173, 1995.
26. G. Chiola, M. A. Marsan and G. Balbo. Product-Form Solution Techniques for the Performance Analysis of Multiple-Bus Multiprocessor Systems with Nonuniform Memory References. IEEE Transactions on Computers, 37(5):532-540, 1988.
27. A. E. Conway and N. D. Georganas. RECAL New Efficient Algorithm for the Exact Analysis of Multiple-Chain Closed Queuing Networks. Journal of the ACM (JACM), 33(4):768-791, 1986.
28. A. E. Conway, E. S. Silva and S. S. Lavenberg. Mean Value Analysis by Chain of Product Form Queueing Networks. IEEE Transactions on Computers, 38(3):432-442, 1989.
29. Verizon Corporation. Verizon NEBS(TM) Compliance: Energy Efficiency Requirements for Telecommunications Equipment. Technical Report VZ.TPR.9205, September 2008.
30. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, 1991.
31. M. E. Crovella and M. S. Taqqu. Estimating the Heavy Tail Index from Scaling Properties. Methodology and computing in applied probability, 1(1):55-79, 1999.
32. A. C. Davison. Statistical Models. Cambridge University Press, 2003.
33. A. C. Davison and D. V. Hinkley. Bootstrap Methods and their Application. Cambridge Univ Pr, 1997.
34. P. J. Denning and J. P. Buzen. The Operational Analysis of Queueing Network Models. ACM Computing Surveys (CSUR), 10(3):225-261, 1978.
35. M. El-Taha and Shaler Jr. Stidham. Sample-Path Analysis of Queueing Systems. Kluwer Academic, 1998.
36. E. Gelenbe. Product-Form Queueing Networks with Negative and Positive customers. Journal of Applied Probability, pages 656-663, 1991.
37. W. J. Gordon and G. F. Newell. Closed Queuing Systems with Exponential Servers. Operations Research, 15(2):254-265, 1967.
38. G. Grimmett and D. Stirzaker. Probability and Random Processes. Oxford University Press, USA, 2001.
39. M. Grossglauser and J. C. Bolot. On the Relevance of Long-Range Dependence in Network Traffic. IEEE/ACM Transactions on Networking (TON), 7(5):629-640, 1999.
40. B. Hechenleitner and K. Entacher. On Shortcomings of the ns-2 Random Number Generator. Proceedings of Communication Networks and Distributed Systems Modeling and Simulation (CNDS 2002), 2002.
41. C. C. Holt. Forecasting Seasonal and Trends by Exponentially Weighted Moving Averages. Carnegie Institute of Technology, Pittsburgh, Pennsylvania, 1957.
42. J. R. Jackson. Jobshop-like Queueing Systems. Management Science, 50(12):1796-1802, 1963.
43. N. L. Johnson, S. Kotz and A. W. Kemp. Univariate Discrete Distributions. Wiley-Interscience, 2005.
44. F. P. Kelly. Reversibility and Stochastic Networks. Wiley, 1979.
45. F. P. Kelly. Models for a self-managed Internet. Philosophical Transactions:Mathematical, Physical and Engineering Sciences, pages 2335-2348, 2000.
46. L. Kleinrock. Queueing Systems Volume I: Theory, volume 1. John-Wiley & Sons, 1975.
47. L. Kleinrock. Queueing Systems Volume II: Computer Applications, volume 2. John-Wiley & Sons, 1976.
48. A. B. Koehler, R. D. Snyder and O. J. Keith. Forecasting Models and Prediction Intervals for the Multiplicative Holt-Winters Method. International Journal of Forecasting, 17:269-286, April-June 2001.
49. M. A. Law and W. D. Kelton. Simulation Modeling and Analysis. McGraw-Hill, 2000.
50. J.-Y. Le Boudec. Rate Adaptation, Congestion Control and Fairness: a Tutorial. http://ica1www.epfl.ch/PS_files/LEB3132.pdf.
51. J.-Y. Le Boudec and P. Thiran. Network Calculus. Springer Verlag Lecture Notes in Computer Science volume 2050 (available online at http://lcawww.epfl.ch), July 2001.
52. J.-Y. Le Boudec and M. Vojnovic. The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation. IEEE/ACM Transactions on Networking, 14(6):1153-1166, 2006.
53. J.-Y. Le Boudec. A BCMP Extension to Multiserver Stations with Concurrent Classes of Customers. ACM SIGMETRICS Perform. Eval. Rev., 14(1):78-91, 1986.
54. J.-Y. Le Boudec. Interinput and Interoutput Time Distribution in Classical Product-Form Networks. IEEE Transactions on Software Engineering, pages 756-759, 1987.
55. J.-Y. Le Boudec. Steady-State Probabilities of the PH/PH/1 Queue. Queueing Systems, 3(1):73-87, 1988.
56. J.-Y. Le Boudec. The MULTIBUS Algorithm. Performance Evaluation, 8(1):1-18, 1988.
57. J.-Y. Le Boudec. Understanding the Simulation of Mobility Models with Palm Calculus. Performance Evaluation, 64(2):126-147, 2007.
58. L. M. Le Ny. Étude analytique de reseaux de files d’attende multiclasses à routage variable. RAIRO Recherche Operationnelle/Oper. Res, 14:331-347, 1980.
59. P. L’Ecuyer. Random number generation. Handbook of Simulation: Principles, Methodology, Advances, Applications, and Practice, 1998.
60. P. L’Ecuyer. Software for Uniform Random Number Generation: Distinguishing the Good and the Bad. In Proceedings of the 33nd Conference on Winter Simulation, pages 95-105. IEEE Computer Society Washington, DC, USA, 2001.
61. E. L. Lehmann. On Likelihood Ratio Tests. In IMS Lecture Notes- 2nd Lehmann Symposium, volume 49, pages 1-8, 2006.
62. E. L. Lehmann and J. P. Romano. Testing Statistical Hypotheses. Springer, 2005.
63. T. Leighton. Improving Performance on the Internet. Commun. ACM, 52(2):44-51, 2009.
64. W. E. Leland, M. S. Taqqu, W. Willinger, D. V. Wilson, and M. Bellcore. On the Self-Similar Nature of Ethernet Traffic (extended version). IEEE/ACM Transactions on networking, 2(1):1-15, 1994.
65. G. Malinas and J. Bigelow. Simpson’s Paradox. Stanford Encyclopedia of Philosophy, online.
66. S. Manthorpe and J.-Y. Le Boudec. A Comparison of ABR and UBR to Support TCP Traffic. Networking and Information Systems Journal, 2(5-6):764-793, 1999.
67. M.Matsumoto and T. Nishimura. Mersenne Twister: a 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator. ACM Transactions on Modeling and Computer Simulation (TOMACS), 8(1):3-30, 1998.
68. R. Merz and J.-Y. Le Boudec. Conditional Bit Error Rate for an Impulse Radio UWB Channel with Interfering Users. In 2005 IEEE International Conference on Ultra-Wideband, 2005. ICU 2005, pages 130-135, 2005.
69. M. Miyazawa. The Derivation of Invariance Relations in Complex Queueing Systems with Stationary Inputs. Advances in Applied Probability, 15(4):874-885, 1983.
70. M. Miyazawa. Rate Conservation Laws: A Survey. Queueing Systems, 15(1-4):1-58, 1994.
71. P. Nain. Basic Elements of Queueing Theory: Application to the Modelling of Computer Systems. Course notes.
72. M. F. Neuts. Stationary Waiting-Time Distributions in the GI/PH/1 Queue. Journal of Applied Probability, 18(4):901-912, 1981.
73. J. P. Nolan. Stable Distributions. Math/Stat Department, American University, 2009.
74. I. Norros. A Storage Model with Self-Similar Input. Queueing systems, 16(3):387-396, 1994.
75. A. V. Oppenheim, R. W. Schafer and J. R. Buck. Discrete-Time Signal Processing (2nd ed.). Prentice-Hall, Inc., 1999.
76. A. Papoulis and S. U. Pillai. Probability, Random Variables, and Stochastic Processes. McGraw-Hill New York, 1965.
77. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, 1988.
78. J. Pellaumail. Formule du produit et décomposition de réseaux de files d’attente. Ann. Inst. H. Poincaré Sect. B (N.S.), 15(3):261-286, 1979.
79. M. D. Perlman and L. Wu. The Emperor’s New Tests. Statistical Science, pages 355-369, 1999.
80. B. Pittel. Closed Exponential Networks of Queues with Saturation:The Jackson-Type Stationary Distribution and its Asymptotic Analysis. Mathematics of Operations Research, 4(4):357-378, 1979.
81. H. V. Poor. An Introduction to Signal Detection and Estimation. Springer, 1994.
82. K. R. Popper. Logik der Forschung: Zur Erkenntnistheorie der modernen Naturwissenschaft. J. Springer, 1935.
83. P. Prandoni and M Vetterli. Signal Processing for Communications. EPFL Press, Communication and Information Sciences, 2008.
84. M. Reiser. Mean-Value Analysis and Convolution Method for Queue-Dependent Servers in Closed Queueing Networks. Performance Evaluation, 1(1):7-18, 1981.
85. M. Reiser and H. Kobayashi. Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms. IBM Journal of Research and Development, 19(3):283-294, 1975.
86. M. Reiser and S. S. Lavenberg. Mean-Value Analysis of Closed Multichain Queuing Networks. Journal of the ACM (JACM), 27(2):313-322, 1980.
87. H. Rinne. The Weibull Distribution: A Handbook. Chapman & Hall/CRC, 2008.
88. Ph. Robert. Stochastic Networks and Queues. Stochastic Modelling and Applied Probability Series. Springer-Verlag, 2003.
89. S. A. Roberts. A General Class of Holt-Winters Type Forecasting Models. Management Science, 28(7):808-820, July 1982.
90. S. M. Ross. Simulation. Academic Press, 2006.
91. W. Rudin. Real and Complex Analysis. McGraw-Hill Series in Mathematics, 1987.
92. M. Sakata, S. Noguchi and J. Oizumi. Analysis of a Processor Shared Queueing Model for Time Sharing Systems. In Proc. 2nd Hawaii International Conference on System Sciences, volume 625628, 1969.
93. G. Samorodnitsky and M. S. Taqqu. Stable Non-Gaussian Random Processes:Stochastic Models with Infinite Variance. Chapman & Hall/CRC, 1994.
94. R. Serfozo. Introduction to Stochastic Networks. Springer Verlag, 1999.
95. R. Serfozo. Basics of Applied Stochastic Processes. Springer Verlag, 2009.
96. A. Shaikh, J. Rexford and K. G. Shin. Load-Sensitive Routing of Long-Lived IP Flows. In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pages 215-226. ACM New York, NY, USA, 1999.
97. R. H. Shumway and D. S. Stoffer. Time Series Analysis and its Applications with R Examples. Springer-Verlag, New York, 2006.
98. P. J. Smith, M. Shafi and H. Gao. Quick Simulation: a Review of Importance Sampling Techniques incommunications systems. IEEE Journal on Selected Areas in Communications, 15(4):597-613, 1997.
99. S. Souders. High-Performance Web Sites. Commun. ACM, 51(12):36-41, 2008.
100. J. L. Van den Berg and O. J. Boxma. The M/G/1 Queue with Processor Sharing and its Relation to a Feedback Queue. Queueing Systems, 9(4):365-401, 1991.
101. N. M. Van Dijk. Queueing Networks and Product Forms: a Systems Approach. John Wiley & Sons, 1993.
102. S. Verrill. Confidence Bounds for Normal and Lognormal Distribution Coefficients of Variation. Technical Report Research Paper 609, USDA Forest Products Laboratory, Madison, Wisconsin, 2003.
103. J. Walrand. An Introduction to Queueing Networks. Prentice Hall, 1988.
104. R. Weber. C11: Statisics, online lecture notes, http://www.statslab.cam.ac.uk.
105. R. Weber. Time Series, online lecture notes, http://www.statslab.cam.ac.uk.
106. Wikipedia. Harmonic Mean. http://en.wikipedia.org.
107. P. R. Winters. Forecasting Sales by Exponentially Weighted Moving Averages. Management Science, 6(60):324-342, 1960.
108. B. Ycart. Modèles et algorithmes markoviens, volume 39. Springer Verlag, 2002.