Performance analysis of communications networks and systems

Performance Analysis of Communications Networks and Systems

Volumn 9780521855150, Issue , 2006, Pages 1-530

  Van Mieghem, Piet ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY; QUEUEING THEORY; RANDOM PROCESSES; STOCHASTIC SYSTEMS; STUDENTS;

BASIC BUILDING BLOCK; COMMUNICATIONS NETWORKS; PERFORMANCE ANALYSIS; PROBABILITY THEORY; PROBLEMS AND SOLUTIONS; QUALITY OF COMMUNICATION; STOCHASTIC METHODS; UTILITY INFRASTRUCTURE;

COMPLEX NETWORKS;

EID: 84925138582     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511616488     Document Type: Book

References (124)

1. Abramowitz, M. and Stegun, I. A. (1968). Handbook of Mathematical Functions. (Dover Publications, Inc., New York).
2. Allen, A. O. (1978). Probability, Statistics, and Queueing Theory.Computer Science and Applied Mathematics, (Academic Press, Inc., Orlando).
3. Almkvist, G. and Berndt, B. C. (1988). Gauss, Landen, Ramanuyan, the Arithmic-Geometric Mean, Ellipses, r and the Ladies Diary. American Mathematical Monthly95, 585-608.
4. Anick, D., Mitra, D., and Sondhi, M. M. (1982). Stochastic theory of a data-handling system with multiple sources. The Bell System Technical Journal61,8 (October), 1871-1894.
5. Anupindi, R., Chopra, S., Deshmukh, S. D., Van Mieghem, J. A., and Zemel, E. (2006). Managing Business Flows. Principles of Operations Management, 2nd edn. (Prentice Hall, Upper Saddle River).
6. Barabasi, A.-L. (2002). Linked, The New Science of Networks.(Perseus, Cambridge, MA).
7. Baran, P. (2002). The beginnings of packet switching - some underlying concepts: The Franklin Institute and Drexel University seminar on the evolution of packet switching and the Internet. IEEE Communications Magazine, 2-8.
8. Berger, M. A. (1993). An Introduction to Probabiliy and Stochastic Processes. (Springer-Verlag, New York).
9. Bertsekas, D. and Gallager, R. (1992). Data Networks, 2nd edn. (Prentice-Hall International Editions, London).
10. Billingsley, P. (1995). Probability and Measure, 3rd edn. (John Wiley & Sons, New York).
11. Bisdikian, C., Lew, J. S., and Tantawi, A. N. (1992). On the tail approximation of the blocking probability of single server queues with finite buffer capacity. Queueing Networks with Finite Capacity, Proc. 2nd Int. Conf.,267-280.
12. Bollobas, B. (2001). Random Graphs, 2nd edn. (Cambridge University Press, Cambridge, UK).
13. Borovkov, A. A. (1976). Stochastic Processes in Queueing Theory. (Springer-Verlag, New York).
14. Boyd, S. and Vandenberghe, L. (2004). Convex Optimization. (Cambridge University Press, Cambridge).
15. Brockmeyer, E., Halstrom, H. L., and Jensen, A. (1948). The Life and Works of A. K. Erlang. (Academy of Technical Sciences, Copenhagen).
16. Chalmers, R. C. and Almeroth, K. C. (2001). Modeling the branching characteristics and efficiency gains in global multicast trees. IEEE INFOCOM2001, Alaska.
17. Chen, L. Y. (1975). Poisson approximation for dependent trials. The Annals of Probability3,3, 534-545.
18. Chen, W.-K. (1971). Applied Graph Theory. (North-Holland Publishing Company, Amsterdam).
19. Chuang, J. and Sirbu, M. A. (1998). Pricing multicast communication: A cost-based approach. Proceedings of the INET’98.
20. Cohen, J. W. (1969). The Single Server Queue. (North-Holland Publishing Company, Amsterdam).
21. Cohen-Tannoudji, C., Diu, B., and Laloë, F. (1977). Mécanique Quantique. Vol. I and II. (Hermann, Paris).
22. Comtet, L. (1974). Advanced Combinatorics, revised and enlarged edn. (D. Riedel Publishing Company, Dordrecht, Holland).
23. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. (1991). An Introduction to Algorithms. (MIT Press, Boston).
24. Cvetkovic, D. M., Doob, M., and Sachs, H. (1995). Spectra of Graphs, Theory and Applications, third edn. (Johann Ambrosius Barth Verlag, Heidelberg).
25. Dorogovtsev, S. N. and Mendes, J. F. F. (2003). Evolution of Networks, From Biological Nets to the Internet and WWW. (Oxford University Press, Oxford).
26. Embrechts, P., Klüppelberg, C., and Mikosch, T. (2001a). Modelling Extremal Events for Insurance and Finance, 3rd edn. (Springer-Verlag, Berlin).
27. Embrechts, P., McNeil, A., and Straumann, D. (2001b). Correlation and Dependence in Risk Management: Properties and Pitfalls.Risk Management: Value at Risk and Beyond, ed. M. Dempster and H. K. Moffatt, (Cambridge University Press, Cambridge, UK).
28. Erdös, P. and Rényi, A. (1959). On random graphs. Publicationes Mathematicae Debrecen6, 290-297.
29. Erdös, P. and Rényi, A. (1960). On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutato Int. Kozl.5, 17-61.
30. Feller, W. (1970). An Introduction to Probability Theory and Its Applications, 3rd edn. Vol. 1. (John Wiley & Sons, New York).
31. Feller, W. (1971). An Introduction to Probability Theory and Its Applications, 2nd edn. Vol. 2. (John Wiley & Sons, New York).
32. Floyd, S. and Paxson, V. (2001). Difficulties in simulating the internet. IEEE Transactions on Networking9,4 (August), 392-403.
33. Fortz, B. and Thorup, M. (2000). Internet traffic engineering by optimizing OSPF weights. IEEE INFOCOM2000.
34. Frieze, A. M. (1985). On the value of a random minimum spanning tree problem. Discrete Applied Mathematics10, 47-56.
35. Gallager, R. G. (1996). Discrete Stochastic Processes. (Kluwer Academic Publishers, Boston).
36. Gantmacher, F. R. (1959a). The Theory of Matrices. Vol. I. (Chelsea Publishing Company, New York).
37. Gantmacher, F. R. (1959b). The Theory of Matrices. Vol. II. (Chelsea Publishing Company, New York).
38. Gauss, C. F. (1821). Theoria combinationis observationum erroribus minimus ob-noxiae. Pars prior. Gauss Werke4, 3-26.
39. Gilbert, E. N. (1956). Enumeration of labelled graphs. Canadian Journal of Mathematics8, 405-411.
40. Gnedenko, B. V. and Kovalenko, I. N. (1989). Introduction to Queuing Theory, second edn. (Birkhauser, Boston).
41. Golub, G. H. and Loan, C. F. V. (1983). Matrix Computations. (North Oxford Academic, Oxford).
42. Goulden, I. P. and Jackson, D. M. (1983). Combinatorial Enumeration. (John Wiley & Sons, New York).
43. Grimmett, G. R. (1989). Percolation. (Springer-Verlag, New York).
44. Grimmett, G. R. and Stirzacker, D. (2001). Probability and Random Processes, 3rd edn. (Oxford University Press, Oxford).
45. Hardy, G. H. (1948). Divergent Series. (Oxford University Press, London).
46. Hardy, G. H., Littlewood, J. E., and Polya, G. (1999). Inequalities, 2nd edn. (Cambridge University Press, Cambridge, UK).
47. Hardy, G. H. and Wright, E. M. (1968). An Introduction to the Theory of Numbers, 4th edn. (Oxford University Press, London).
48. Harris, T. E. (1963). The Theory of Branching Processes. (Springer-Verlag, Berlin).
49. Harrison, J. M. (1990). Brownian Motion and Stochastic Flow Systems. (Krieger Publishing Company, Malabar, Florida).
50. van der Hofstad, R., Hooghiemstra, G., and Van Mieghem, P. (2001). First passage percolation on the random graph. Probability in the Engineering and Informational Sciences (PEIS)15, 225-237.
51. van der Hofstad, R., Hooghiemstra, G., and Van Mieghem, P. (2002a). The flooding time in random graphs. Extremes5,2 (June), 111-129.
52. van der Hofstad, R., Hooghiemstra, G., and Van Mieghem, P. (2002b). On the covariance of the level sizes in recursive trees. Random Structures and Algorithms20, 519-539.
53. van der Hofstad, R., Hooghiemstra, G., and Van Mieghem, P. (2005). Distances in random graphs with finite variance degree. Random Structures and Algorithms27,1 (August), 76-123.
54. van der Hofstad, R., Hooghiemstra, G., and Van Mieghem, P. (2006a). Size and weight of shortest path trees with exponential link weights. Combinatorics, Probability and Computing.
55. van der Hofstad, R., Hooghiemstra, G., and Van Mieghem, P. (2006b). The weight of the shortest path tree. Random Structures and Algorithms.
56. Hooghiemstra, G. and Koole, G. (2000). On the convergence of the power series algorithm. Performance Evaluation42, 21-39.
57. Hooghiemstra, G. and Van Mieghem, P. (2005). On the mean distance in scale free graphs. Methodology and Computing in Applied Probability (MCAP)7, 285-306.
58. Jamin, S., C. Jin, A. R. Kurc, D. R., and Shavitt, Y. (2001). Constrained mirror placement on the internet. IEEE INFOCOM’01.
59. Janic, M., Kuipers, F., Zhou, X., and Van Mieghem, P. (2002). Implications for QoS provisioning based on traceroute measurements. Proceedings of 3nd International Workshop on Quality of Future Internet Services, QofIS2002 ed. B. Stiller et al., Zurich, Switzerland, Springer Verlag LNCS 2511, 3-14.
60. Janson, S. (1995). The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph. Random Structures and Algorithms7,4 (December), 337-356.
61. Janson, S. (2002). On concentration of probability. Contemporary Combinatorics, ed. B. Bollobâs, Bolyai Soc. Math. Stud. 10, János Bolyai Mathematical Society, Budapest, 289-301.
62. Janson, S., Knuth, D. E., Luczak, T., and Pittel, B. (1993). The birth of the giant component. Random Structures and Algorithms4,3, 233-358.
63. Karlin, S. and Taylor, H. M. (1975). A First Course in Stochastic Processes, 2nd edn. (Academic Press, San Diego).
64. Karlin, S. and Taylor, H. M. (1981). A Second Course in Stochastic Processes. (Academic Press, San Diego).
65. Kelly, F. P. (1991). Special invited paper: Loss networks. The Annals of Applied Probability1,3, 319-378.
66. Kleinrock, L. (1975). Queueing Systems. Vol. 1 - Theory. (John Wiley and Sons, New York).
67. Kleinrock, L. (1976). Queueing Systems. Vol. 2 - Computer Applications. (John Wiley and Sons, New York).
68. Krishnan, P., Raz, D., and Shavitt, Y. (2000). The cache location problem. IEEE/ACM Transactions on Networking8,5 (October), 586-582.
69. Kuipers, F. A. and Van Mieghem, P. (2003). The Impact of Correlated Link Weights on QoS Routing. IEEE INFOCOM03.
70. Lanczos, C. (1988). Applied Analysis. (Dover Publications, Inc., New York).
71. Langville, A. N. and Meyer, C. D. (2005). Deeper inside PageRank. Internet Mathematics1,3 (Februari), 335-380.
72. Le Boudec, J.-Y. and Thiran, P. (2001). Network Calculus, A Theory of Deterministic Queuing Systems for the Internet. (Springer Verlag, Berlin).
73. Leadbetter, M. R., Lindgren, G., and Rootzen, H. (1983). Extremes and Related Properties of Random Sequences and Processes. (Springer-Verlag, New York).
74. Leon-Garcia, A. (1994). Probability and Random Processes for Electrical Engineering, 2nd edn. (Addison-Wesley, Reading, Massachusetts).
75. van Lint, J. H. and Wilson, R. M. (1996). A course in Combinatorics. (Cambridge University Press, Cambridge, UK).
76. Lovâsz, L. (1993). Random Walks on Graphs: A Survey. Combinatorics2, 1-46.
77. Markushevich, A. I. (1985). Theory of functions of a complex variable. Vol. I - III. (Chelsea Publishing Company, New York).
78. Mehta, M. L. (1991). Random Matrices, 2nd edn. (Academic Press, Boston).
79. Meyer, C. D. (2000). Matrix Analysis and Applied Linear Algebra. (Society for Industrial and Applied Mathematics (SIAM), Philadelphia).
80. Mitra, D. (1988). Stochastic theory of a fluid model of producers and consumers coupled by a buffer. Advances in Applied Probability20, 646-676.
81. Morse, P. M. and Feshbach, H. (1978). Methods of Theoretical Physics. (McGrawHill Book Company, New York).
82. Neuts, M. F. (1989). Structured Stochastic Matrices of the M/G/1 Type and Their Applications. (Marcel Dekker Inc., New York).
83. Norros, I. (1994). A storage model with self-similar input. Queueing Systems16,34, 387-396.
84. Pascal, B. (1954). Oeuvres completes.Bibliothèque de la Pléade, (Gallimard, Paris).
85. Paxson, V. (1997). End-to-end Routing Behavior in the Internet. IEEE/ACM Transactions on Networking5,5 (October), 601-615.
86. Phillips, G., Schenker, S., and Tangmunarunkit, H. (1999). Scaling of multicast trees: Comments on the chuang-sirbu scaling law. ACM Sigcomm99.
87. Pietronero, L. and Schneider, W. (1990). Invasion percolation as a fractal growth problem. Physica A170, 81-104.
88. Press, W. H., Teukolsky, S. A., Vetterling, W. T., and Flannery, B. P. (1992). Numerical Recipes in C, 2nd edn. (Cambridge University Press, New York).
89. Rainville, E. D. (1960). Special Functions. (Chelsea Publishing Company, New York).
90. Riordan, J. (1968). Combinatorial Identities. (John Wiley & Sons, New York).
91. Roberts, J. W. (1991). Performance Evaluation and Design of Multiservice Networks.Information Technologies and Sciences, vol. COST 224. (Commission of the European Communities, Luxembourg).
92. Robinson, S. (2004). The prize of anarchy. SIAM News37,5 (June), 1-4.
93. Ross, S. M. (1996). Stochastic Processes, 2nd edn. (John Wiley & Sons, New York).
94. Royden, H. L. (1988). Real Analysis, 3rd edn. (Macmillan Publishing Company, New York).
95. Sansone, G. and Gerretsen, J. (1960). Lectures on the Theory of Functions of a Complex Variable. Vol. 1 and 2. (P. Noordhoff, Groningen).
96. Schoutens, W. (2000). Stochastic Processes and Orthogonal Polynomials. (SpringerVerlag, New York).
97. Siganos, G., Faloutsos, M., Faloutsos, P., and Faloutsos, C. (2003). Power laws and the AS-level internet topology. IEEE/ACM Transactions on Networking11,4 (August), 514-524.
98. Smythe, R. T. and Mahmoud, H. M. (1995). A survey of recursive trees. Theory of Probability and Mathematical Statistics51, 1-27.
99. Steyaert, B. and Bruneel, H. (1994). Analytic derivation of the cell loss probability in finite multiserver buffers, from infinite buffer results. Proceedings of the second workshop on performance modelling and evaluation of ATM networks, Bradford UK, 18.1-11.
100. Strogatz, S. H. (2001). Exploring complex networks. Nature 4-10, 8 (March), 268-276.
101. Syski, R. (1986). Introduction to Congestion Theory in Telephone Systems, 2nd edn. Studies in Telecommunication, vol. 4. (North-Holland, Amsterdam).
102. Titchmarsh, E. C. (1948). Introduction to the Theory of Fourier Integrals, 2nd edn. (Oxford University Press, Ely House, London W. I).
103. Titchmarsh, E. C. (1964). The Theory of Functions. (Oxford University Press, Amen House, London).
104. Titchmarsh, E. C. and Heath-Brown, D. R. (1986). The Theory of the Zetafunction, 2nd edn. (Oxford Science Publications, Oxford).
105. Van Mieghem, P. (1996). The asymptotic behaviour of queueing systems: Large deviations theory and dominant pole approximation. Queueing Systems23, 2755.
106. Van Mieghem, P. (2001). Paths in the simple random graph and the Waxman graph. Probability in the Engineering and Informational Sciences (PEIS)15, 535-555.
107. Van Mieghem, P. (2004a). Data Communications Networking. (Delft University of Technology, Delft).
108. Van Mieghem, P. (2004b). The Probability Distribution of the Hopcount to an Anycast Group. Delft University of Technology, Report 2003605 (www.nas.ewi.tudelft.nl/people/Piet/teleconference).
109. Van Mieghem, P. (2005). The limit random variable W of a branching process. Delft University of Technology, Report 20050206 (www.nas.ewi.tudelft.nl/people/Piet/teleconference).
110. Van Mieghem, P., Hooghiemstra, G., and van der Hofstad, R. (2000). A Scaling Law for the Hopcount in the Internet. Delft University of Technology, Report2000125 (www.nas.ewi.tudelft.nl/people/Piet/telconference).
111. Van Mieghem, P., Hooghiemstra, G., and van der Hofstad, R. (2001a). On the efficiency of multicast. IEEE/ACM Transactions on Networking9,6 (December), 719-732.
112. Van Mieghem, P., Hooghiemstra, G., and van der Hofstad, R. W. (2001b). Stochastic model for the number of traversed routers in internet. Proceedings of Passive and Active Measurement: PAM-2001, April 23-24, Amsterdam.
113. Van Mieghem, P. and Janic, M. (2002). Stability of a multicast tree. Proceedings IEEE INFOCOM20022, 1099-1108.
114. Veres, A. and Boda, M. (2000). The chaotic nature of TCP congestion control. IEEE INFOCOM’2000, Tel-Aviv, Israel.
115. Walrand, J. (1998). Communication Networks, A First Course, 2nd edn. (McGrawHill, Boston).
116. Wastlund, J. (2005). Evaluation of Janson's constant for the variance in the random minimum spanning tree problem. Linköping studies in Mathematics. Series editor: Bengt Ove Turesson7 (www.ep.liu.se/ea/lsm/2005/007).
117. Waxman, B. M. (1998). Routing of multipoint connections. IEEE Journal on Selected Areas in Communications6,9 (December), 1617-1622.
118. Whittaker, E. T. and Watson, G. N. (1996). A Course of Modern Analysis, Cambridge Mathematical Library edn. (Cambridge University Press, Cambridge, UK).
119. Wigner, E. P. (1955). Characteristic vectors of bordered matrices with infinite dimensions. Annals of Mathematics62,3 (November), 548-564.
120. Wigner, E. P. (1957). Characteristic vectors of bordered matrices with infinite dimensions ii. Annals of Mathematics65,2 (March), 203-207.
121. Wigner, E. P. (1958). On the distribution of the roots of certain symmetric matrices. Annals of Mathematics67,2 (March), 325-327.
122. Wilkinson, J. H. (1965). The Algebraic Eigenvalue Problem. (Oxford University Press, New York).
123. Wolff, R. W. (1982). Poisson arrivals see time averages. Operations Research30,2 (April), 223-231.
124. Wolff, R. W. (1989). Stochastic Modeling and the Theory of Queues. (Prentice-Hall International Editions, New York).