Abstract
In this chapter, we first discuss some more Markovian queueing systems. The queueing system is a classical application of continuous Markov chains. We then present an important numerical algorithm based on the computation of Markov chains for ranking webpages. This is a modern application of Markov chains though the numerical methods used are classical.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Avrachenkov L, Litvak N (2004) Decomposition of the Google PageRank and optimal linking strategy. Research report, INRIA, Sophia Antipolis
Axelsson O (1996) Iterative solution methods. Cambridge University Press, New York
Baldi P, Frasconi P, Smith P (2003) Modeling the internet and the web. Wiley, England
Bell D, Atkinson J, Carlson J (1999) Centrality measures for disease transmission networks. Soc Network 21:1–21
Bonacich P, Lloyd P (2001) Eigenvector-like measures of centrality for asymmetric relations. Soc Network 23:191–201
Bonacich P, Lloyd P (2004) Calculating status with negative relations. Soc Network 26:331–338
Bramble J (1993) Multigrid methods. Longman Scientific and Technical, Essex
Buchholz P (1994) A class of hierarchical queueing networks and their analysis. Queueing Syst 15:59–80
Buchholz P (1995) Hierarchical Markovian models: symmetries and aggregation. Perform Eval 22:93–110
Buchholz P (1995) Equivalence relations for stochastic automata networks. In: Computations of Markov chains: proceedings of the 2nd international workshop on numerical solutions of Markov chains. Kluwer, Dordecht, pp 197–216
Chan R, Ching W (1996) Toeplitz-circulant preconditioners for Toeplitz systems and their applications to queueing networks with batch arrivals. SIAM J Scientif Comput 17:762–772
Chan R, Ching W (2000) Circulant preconditioners for stochastic automata networks. Numerise Mathematik 87:35–57
Chan R, Ma K, Ching W (2006) Boundary value methods for solving transient solutions of Markovian queueing networks. J Appl Math Comput 172:690–700
Chang Q, Ma S, Lei G (1999) Algebraic multigrid method for queueing networks. Int J Comput Math 70:539–552
Ching W (1997) Circulant preconditioners for failure prone manufacturing systems. Linear Algebra Appl 266:161–180
Ching W (1998) Iterative methods for manufacturing systems of two stations in Tandem. Appl Math Lett 11:7–12
Ching W (2001) Machine repairing models for production systems. Int J Product Econ 70:257–266
Ching W (2001) Iterative methods for queuing and manufacturing systems. Springer monographs in mathematics. Springer, London
Ching W (2003) Iterative methods for queuing systems with batch arrivals and negative customers. BIT 43:285–296
Ching W, Chan R, Zhou X (1997) Circulant preconditioners for Markov modulated poisson processes and their applications to manufacturing systems. SIAM J Matrix Anal Appl 18:464–481
Cooper R (1972) Introduction to queueing theory. Macmillan, New York
Garfield E (1955) Citation indexes for science: a new dimension in documentation through association of ideas. Science 122:108–111
Garfield E (1972) Citation analysis as a tool in journal evaluation. Science 178:471–479
Gelenbe E (1989) Random neural networks with positive and negative signals and product solution. Neural Comput 1:501–510
Gelenbe E (1991) Product form networks with negative and positive customers. J Appl Probab 28:656–663
Gelenbe E, Glynn P, Sigman K (1991) Queues with negative arrivals. J Appl Probab 28:245–250
Golub G, van Loan C (1989) Matrix computations. John Hopkins University Press, Baltimore
Haveliwala T, Kamvar S (2003) The second eigenvalue of the google matrix. Technical Report, Stanford University
Haveliwala T, Kamvar S, Jeh G (2003) An analytical comparison of approaches to personalizing PageRank. Stanford University (preprint)
Haveliwala T, Kamvar S, Klein D, Manning C, Golub G (2003) Computing PageRank using power extrapolation. Technical Report, Stanford University
He J, Xu J, Yao X (2000) Solving equations by hybrid evolutionary computation techniques. IEEE Trans Evol Comput 4:295–304
Horn R, Johnson C (1985) Matrix analysis. Cambridge University Press, Cambridge
Kamvar S, Haveliwala T, Golub G (2004) Adaptive methods for the computation of PageRank. Linear Algebra Appl 386:51–65
Kaufman L (1982) Matrix methods for queueing problems. SIAM J Scient Stat Comput 4:525–552
Kincaid D, Cheney W (2002) Numerical analysis: mathematics of scientific computing, 3rd edn. Books/Cole Thomson Learning, CA
Langville A, Meyer C (2005) A survey of eigenvector methods for web information retrieval. SIAM Rev 47:135–161
Langville A, Meyer C (2006) Google’s PageRank and beyond : the science of search engine rankings. Princeton University Press, Princeton
Latouche G, Ramaswami V (1999) Introduction to matrix analytic methods in stochastic modeling. SIAM, Pennsylvania
Latouche G, Taylor P (2002) Matrix-analytic methods theory and applications. World Scientific, Singapore
Leonard K (1975) Queueing systems. Wiley, New York
Lu L, Ching W, Ng M (2004) Exact algorithms for singular tridiagonal systems with applications to Markov chains. J Appl Math Comput 159:275–289
McCormick S (1987) Multigrid methodst. Society for Industrial and Applied Mathematics, Philadelphia
Neuts M (1981) Matrix-geometric solutions in stochastic models: an algorithmic approach. Johns Hopkins University Press, Baltimore
Neuts M (1995) Algorithmic probability : a collection of problems. Chapman & Hall, London
Page L, Brin S, Motwani R, Winograd T (1998) The PageRank citation ranking: bring order to the web, technical report. Stanford University, Stanford
Quandt R (1958) The estimation of parameters of linear regression system obeying two separate regimes. J Am Stat Assoc 55:873–880
Ross S (2000) Introduction to probability models, 7th edn. Academic, New York
Steward W (1994) Introduction to the numerical solution of Markov chain. Princeton University Press, Princeton
Tai A, Ching W, Cheung W (2005) On computing prestige in a network with negative relations. Int J Appl Math Sci 2:56–64
Tavana M, Rappaport J (1997) Optimal allocation of arrivals to a collection of parallel workstations. Int J Oper Product Manag 17:305–325
Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge Univeristy Press, Cambridge
Yuen W, Ching W, Ng M (2004) A hybrid algorithm for queueing systems. CALCOLO 41:139–151
Yuen W, Ching W, Ng M (2005) A hybrid algorithm for solving the PageRank. In: Zhang W, Chen Z, Glowinski R, Tong W (eds) Current trends in high performance computing and its applications proceedings of the international conference on high performance computing and applications, 8–10 August 2004. Springer, Shanghai, China, pp 257–264
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ching, WK., Huang, X., Ng, M.K., Siu, TK. (2013). Queueing Systems and the Web. In: Markov Chains. International Series in Operations Research & Management Science, vol 189. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-6312-2_2
Download citation
DOI: https://doi.org/10.1007/978-1-4614-6312-2_2
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-6311-5
Online ISBN: 978-1-4614-6312-2
eBook Packages: Business and EconomicsBusiness and Management (R0)