04329nam 2200637Ia 450 991082988010332120230721005807.01-282-16515-197866121651530-470-61134-00-470-39395-5(CKB)2550000000005862(EBL)477650(OCoLC)593311017(SSID)ssj0000343434(PQKBManifestationID)11286416(PQKBTitleCode)TC0000343434(PQKBWorkID)10289874(PQKB)11065037(MiAaPQ)EBC477650(EXLCZ)99255000000000586220080227d2008 uy 0engur|n|---|||||txtccrSwitching processes in queueing models[electronic resource] /Vladimir V. AnisimovLondon ;ISTE ;Hoboken, NJ John Wiley & Sons20081 online resource (347 p.)ISTE ;v.47Description based upon print version of record.1-84821-045-0 Includes bibliographical references and index.Switching Processes in Queueing Models; Contents; Preface; Definitions; Chapter 1. Switching Stochastic Models; 1.1. Random processes with discrete component; 1.1.1. Markov and semi-Markov processes; 1.1.2. Processes with independent increments and Markov switching; 1.1.3. Processes with independent increments and semi-Markov switching; 1.2. Switching processes; 1.2.1. Definition of switching processes; 1.2.2. Recurrent processes of semi-Markov type (simple case); 1.2.3. RPSM with Markov switching; 1.2.4. General case of RPSM; 1.2.5. Processes with Markov or semi-Markov switchingChapter 3. Processes of Sums of Weakly-dependent Variables3.1. Limit theorems for processes of sums of conditionally independent random variables; 3.2. Limit theorems for sums with Markov switching; 3.2.1. Flows of rare events; 3.2.1.1. Discrete time; 3.2.1.2. Continuous time; 3.3. Quasi-ergodic Markov processes; 3.4. Limit theorems for non-homogenous Markov processes; 3.4.1. Convergence to Gaussian processes; 3.4.2. Convergence to processes with independent increments; 3.5. Bibliography; Chapter 4. Averaging Principle and Diffusion Approximation for Switching Processes; 4.1. Introduction4.2. Averaging principle for switching recurrent sequences4.3. Averaging principle and diffusion approximation for RPSMs; 4.4. Averaging principle and diffusion approximation for recurrent processes of semi-Markov type (Markov case); 4.4.1. Averaging principle and diffusion approximation for SMP; 4.5. Averaging principle for RPSM with feedback; 4.6. Averaging principle and diffusion approximation for switching processes; 4.6.1. Averaging principle and diffusion approximation for processes with semi-Markov switching; 4.7. BibliographyChapter 5. Averaging and Diffusion Approximation in Overloaded Switching Queueing Systems and NetworksSwitching processes, invented by the author in 1977, is the main tool used in the investigation of traffic problems from automotive to telecommunications. The title provides a new approach to low traffic problems based on the analysis of flows of rare events and queuing models. In the case of fast switching, averaging principle and diffusion approximation results are proved and applied to the investigation of transient phenomena for wide classes of overloading queuing networks. The book is devoted to developing the asymptotic theory for the class of switching queuing models which covers modeISTETelecommunicationSwitching systemsMathematical modelsTelecommunicationTrafficMathematical modelsQueuing theoryTelecommunicationSwitching systemsMathematical models.TelecommunicationTrafficMathematical models.Queuing theory.519.8/2519.82Anisimov V. V(Vladimir Vladislavovich)1713524MiAaPQMiAaPQMiAaPQBOOK9910829880103321Switching processes in queueing models4106570UNINA