scientific article; zbMATH DE number 1466126
This book (Ph. D. thesis) gives an overview of the queueing models which can be used in the performance analysis of multiservice (with integrated-services) telecommunication networks. The book consists of 5 chapters. Chapter 1 describes the most relevant features of these networks. The various traffic types are treated as a basis for a unified approach in modeling the integration of services. As a model is used a processor-sharing queue with varying service capacity for the performance evaluation of traffic. Chapter 2 gives a detailed analysis of the queue length distribution in an MM1 queue of which the service capacity (and arrival intensity) varies depending on the state of a birth-death process. In particular, the impact on the performance of elastic customers with so-called fluctuations is studied. The theoretic analysis of the influence of time-scale differences is illustrated by means of numerical results from the application of the model to a particular telecommunication system. Chapter 3 concentrates on the sojourn times of customers in such queueing models. The sojourn time distribution is given in terms of its Laplace-Stieltjes transform. The analysis is based on a random time-scale transformation. Chapter 4 discusses how the conditional mean sojourn time can be computed and proposes an efficient approximation for it. The obtained results are validated through the extensive numerical investigations. Chapter 5 presents the tail of the sojourn time distribution in the case that the service requirement distribution has a so-called heavy tail. It is well-known that with the processor-sharing discipline (and constant service capacity) the tails of sojourn time and the service requirement distributions are exactly as heavy. The approach leads to a new and simpler proof of the result in the standard processor-sharing model. This thesis presents the first analytic results concerning sojourn times in processor-sharing queues with varying service capacity which correspond to the transmission times in multiservice telecommunication networks. Numerous remarks, proofs, numerical experiments, all very good, are used to give examples, to illustrate significant points, and even to point toward extensions of the theory. On summary, this thesis under review is a nice addition to the existing literature in performance analysis of modern telecommunication networks.
- Sojourn times in a processor sharing queue with service interruptions
- Sojourn time asymptotics in processor-sharing queues
- Mathematical problems in the theory of processor-sharing queueing systems
- SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
- Queues with equally heavy sojourn time and service requirement distributions
- Waiting times for \(M/M\) systems under state-dependent processor sharing
- The equivalence between processor sharing and service in random order.
- A two phase service \(M/G/1\) queue with a finite number of immediate Bernoulli feedbacks
- Sojourn time asymptotics in processor sharing queues with varying service rate
- Expected waiting time in symmetric polling systems with correlated walking times
- Pricing and distributed QoS control for elastic network traffic
- Mean sojourn times for phase-type discriminatory processor sharing systems
- Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline
- Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
- Sojourn time asymptotics in processor-sharing queues
- SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
- Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines
- Applying Branching Processes to Delay-Tolerant Networks
- Tail asymptotics for processor-sharing queues
- AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
- Heavy-tailed limits for medium size jobs and comparison scheduling
- A large-deviations analysis of the GI/GI/1 SRPT queue
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4486410)