Analytical and Numerical Means to Model Transient States in Computer Networks

1. Champernowne, D.C.: An elementary method of solution of the queueing problem with a single server and constant parameters. J. R. Statist. Soc. B 18, 125–128 (1956)

   MathSciNet  MATH  Google Scholar 

2. Takâcs, L.: Introduction to the Theory of Queues. Oxford University Press (1960)

   Google Scholar 

3. Tarabia, A.M.K.: Transient Analysis of M/M/1/N Queue – An Alternative Approach. Tamkang Journal of Science and Engineering 3(4), 263–266 (2000)

   Google Scholar 

4. Kotiah, T.C.T.: Approximate transient analysis of some queueing systems. Operations Research 26(2), 334–346 (1978)

   MathSciNet  Google Scholar 

5. Jones, S.K., Cavin, R.K., Johnston, D.A.: An Efficient Computational Procedure for the Evaluation of the M/M/1 Transient State Occupancy Probabilities. IEEE Trans. on Comm. COM-28(12), 2019–2020 (1980)

   Google Scholar 

6. Moler, C., van Loan, C.: Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later! SIAM Review 45(1), 30–49

   Google Scholar 

7. Stewart, W.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Chichester (1994)

   MATH  Google Scholar 

8. Scientifique, C., Philippe, B., Sidje, R.B.: Transient Solutions of Markov Processes by Krylov Subspaces. In: 2nd International Workshop on the Numerical Solution of Markov Chains (1989)

   Google Scholar 

9. Sidje, R.B., Burrage, K., McNamara, S.: Inexact Uniformization method for computing transient distributions of Markov chains. SIAM J. Sci. Comput. 29(6), 2562–2580 (2007)

   Article  MathSciNet  MATH  Google Scholar 

10. Sidje, R.B., Stewart, W.J.: A Numerical Study of Large Sparse Matrix Exponentials Arising in Markov Chains. Computational Statistics & Data Analysis 29, 345–368 (1999)

    Article  MATH  Google Scholar 

11. Sidje, R.B.: Expokit: A Software Package for Computing Matrix Exponentials. ACM, Transactions on Mathematical Software 24(1) (1998)

    Google Scholar 

12. Numerical computation for Markov chains on GPU: building chains and bounds, algorithms and applications. Project POLONIUM 2012–2013, bilateral cooperation PRISM-Université de Versailles and IITiS PAN, Polish Academy of Sciences

    Google Scholar 

13. Gelenbe, E.: On Approximate Computer Systems Models. J. ACM 22(2) (1975)

    Google Scholar 

14. Gelenbe, E., Pujolle, G.: The Behaviour of a Single Queue in a GeneralQueueing Network. Acta Informatica 7(fasc. 2), 123–136 (1976)

    Google Scholar 

15. Czachórski, T.: A method to solve diffusion equation with instantaneous return processes acting as boundary conditions. Bulletin of Polish Academy of Sciences, Technical Sciences 41(4) (1993)

    Google Scholar 

16. Stehfest, H.: Algorithm 368: Numeric inversion of Laplace transform. Comm. of ACM 13(1), 47–49 (1970)

    Article  Google Scholar 

17. Misra, V., Gong, W.-B., Towsley, D.: Fluid-based Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED. In: ACM SIGCOMM (2000)

    Google Scholar 

18. Liu, Y., Lo Presti, F., Misra, V., Gu, Y.: Fluid Models and Solutions for Large-Scale IP Networks. ACM/SigMetrics (2003)

    Google Scholar 

19. Czachórski, T., Nycz, M., Nycz, T., Pekergin, F.: Transient states of flows and router queues – a discussion of modelling methods. In: Proc. of International Conference on Networking and Future Internet (ICNFI 2012), Istanbul (April 2012)

    Google Scholar 

20. Weisser, M.-A., Tomasik, J.: Automatic Induction of Inter-Domain Hierarchy in Randomly Generated Network Topologies. In: 10th Communication and Networking Simulation Symposium CNS 2007 (2007)

    Google Scholar 

21. Tomasik, J., Weisser, M.-A.: Internet topology on AS-level: model, generation methods and tool. In: 29th IEEE International Performance Computing and Communications Conference (IPCCC 2010) (2010)

    Google Scholar 

22. Dijkstra’s Algorithm for Network Optimization Using Fibonacci Heaps (September 2009), http://www.codeproject.com/Articles/42561/Dijkstra-s-Algorithm-for-Network-Optimization-Usin

23. Fibonacci heap implementation (March 2012), http://code.google.com/p/gerardus/source/browse/trunk/matlab/ThirdPartyToolbox/dijkstra.cpp

24. OMNET++ Community Site, http://www.omnetpp.org

25. Czachórski, T., Pekergin, F.: Diffusion Approximation as a Modelling Tool. In: Kouvatsos, D.D. (ed.) Next Generation Internet: Performance Evaluation and Applications. LNCS, vol. 5233, pp. 447–476. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references