{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:42:30Z","timestamp":1725727350555},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642388644"},{"type":"electronic","value":"9783642388651"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38865-1_43","type":"book-chapter","created":{"date-parts":[[2013,5,27]],"date-time":"2013-05-27T01:42:02Z","timestamp":1369618922000},"page":"426-435","source":"Crossref","is-referenced-by-count":7,"title":["Analytical and Numerical Means to Model Transient States in Computer Networks"],"prefix":"10.1007","author":[{"given":"Tadeusz","family":"Czach\u00f3rski","sequence":"first","affiliation":[]},{"given":"Monika","family":"Nycz","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Nycz","sequence":"additional","affiliation":[]},{"given":"Ferhan","family":"Pekergin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1111\/j.2517-6161.1956.tb00217.x","volume":"18","author":"D.C. Champernowne","year":"1956","unstructured":"Champernowne, D.C.: An elementary method of solution of the queueing problem with a single server and constant parameters. J. R. Statist. Soc. B\u00a018, 125\u2013128 (1956)","journal-title":"J. R. Statist. Soc. B"},{"key":"43_CR2","unstructured":"Tak\u00e2cs, L.: Introduction to the Theory of Queues. Oxford University Press (1960)"},{"issue":"4","key":"43_CR3","first-page":"263","volume":"3","author":"A.M.K. Tarabia","year":"2000","unstructured":"Tarabia, A.M.K.: Transient Analysis of M\/M\/1\/N Queue \u2013 An Alternative Approach. Tamkang Journal of Science and Engineering\u00a03(4), 263\u2013266 (2000)","journal-title":"Tamkang Journal of Science and Engineering"},{"issue":"2","key":"43_CR4","first-page":"334","volume":"26","author":"T.C.T. Kotiah","year":"1978","unstructured":"Kotiah, T.C.T.: Approximate transient analysis of some queueing systems. Operations Research\u00a026(2), 334\u2013346 (1978)","journal-title":"Operations Research"},{"issue":"12","key":"43_CR5","doi-asserted-by":"crossref","first-page":"2019","DOI":"10.1109\/TCOM.1980.1094626","volume":"-28","author":"S.K. Jones","year":"1980","unstructured":"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.\u00a0COM-28(12), 2019\u20132020 (1980)","journal-title":"IEEE Trans. on Comm. COM"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Moler, C., van Loan, C.: Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later! SIAM Review\u00a045(1), 30\u201349","DOI":"10.1137\/S00361445024180"},{"key":"43_CR7","volume-title":"Introduction to the Numerical Solution of Markov Chains","author":"W. Stewart","year":"1994","unstructured":"Stewart, W.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Chichester (1994)"},{"key":"43_CR8","unstructured":"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)"},{"issue":"6","key":"43_CR9","doi-asserted-by":"publisher","first-page":"2562","DOI":"10.1137\/060662629","volume":"29","author":"R.B. Sidje","year":"2007","unstructured":"Sidje, R.B., Burrage, K., McNamara, S.: Inexact Uniformization method for computing transient distributions of Markov chains. SIAM J. Sci. Comput.\u00a029(6), 2562\u20132580 (2007)","journal-title":"SIAM J. Sci. Comput."},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/S0167-9473(98)00062-0","volume":"29","author":"R.B. Sidje","year":"1999","unstructured":"Sidje, R.B., Stewart, W.J.: A Numerical Study of Large Sparse Matrix Exponentials Arising in Markov Chains. Computational Statistics & Data Analysis\u00a029, 345\u2013368 (1999)","journal-title":"Computational Statistics & Data Analysis"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Sidje, R.B.: Expokit: A Software Package for Computing Matrix Exponentials. ACM, Transactions on Mathematical Software\u00a024(1) (1998)","DOI":"10.1145\/285861.285868"},{"key":"43_CR12","unstructured":"Numerical computation for Markov chains on GPU: building chains and bounds, algorithms and applications. Project POLONIUM 2012\u20132013, bilateral cooperation PRISM-Universit\u00e9 de Versailles and IITiS PAN, Polish Academy of Sciences"},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"Gelenbe, E.: On Approximate Computer Systems Models. J. ACM\u00a022(2) (1975)","DOI":"10.1145\/321879.321888"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Gelenbe, E., Pujolle, G.: The Behaviour of a Single Queue in a GeneralQueueing Network. Acta Informatica\u00a07(fasc. 2), 123\u2013136 (1976)","DOI":"10.1007\/BF00265766"},{"key":"43_CR15","unstructured":"Czach\u00f3rski, T.: A method to solve diffusion equation with instantaneous return processes acting as boundary conditions. Bulletin of Polish Academy of Sciences, Technical Sciences\u00a041(4) (1993)"},{"issue":"1","key":"43_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/361953.361969","volume":"13","author":"H. Stehfest","year":"1970","unstructured":"Stehfest, H.: Algorithm 368: Numeric inversion of Laplace transform. Comm. of ACM\u00a013(1), 47\u201349 (1970)","journal-title":"Comm. of ACM"},{"key":"43_CR17","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/347059.347421"},{"key":"43_CR18","doi-asserted-by":"crossref","unstructured":"Liu, Y., Lo Presti, F., Misra, V., Gu, Y.: Fluid Models and Solutions for Large-Scale IP Networks. ACM\/SigMetrics (2003)","DOI":"10.1145\/781035.781039"},{"key":"43_CR19","unstructured":"Czach\u00f3rski, T., Nycz, M., Nycz, T., Pekergin, F.: Transient states of flows and router queues \u2013 a discussion of modelling methods. In: Proc. of International Conference on Networking and Future Internet (ICNFI 2012), Istanbul (April 2012)"},{"key":"43_CR20","unstructured":"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)"},{"key":"43_CR21","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/PCCC.2010.5682300"},{"key":"43_CR22","unstructured":"Dijkstra\u2019s Algorithm for Network Optimization Using Fibonacci Heaps (September 2009), http:\/\/www.codeproject.com\/Articles\/42561\/Dijkstra-s-Algorithm-for-Network-Optimization-Usin"},{"key":"43_CR23","unstructured":"Fibonacci heap implementation (March 2012), http:\/\/code.google.com\/p\/gerardus\/source\/browse\/trunk\/matlab\/ThirdPartyToolbox\/dijkstra.cpp"},{"key":"43_CR24","unstructured":"OMNET++ Community Site, http:\/\/www.omnetpp.org"},{"key":"43_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-02742-0_20","volume-title":"Network Performance Engineering","author":"T. Czach\u00f3rski","year":"2011","unstructured":"Czach\u00f3rski, T., Pekergin, F.: Diffusion Approximation as a Modelling Tool. In: Kouvatsos, D.D. (ed.) Next Generation Internet: Performance Evaluation and Applications. LNCS, vol.\u00a05233, pp. 447\u2013476. Springer, Heidelberg (2011)"}],"container-title":["Communications in Computer and Information Science","Computer Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38865-1_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T05:51:27Z","timestamp":1715406687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38865-1_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642388644","9783642388651"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38865-1_43","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2013]]}}}