No label defined (Q4486410)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1466126
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1466126

      Statements

      27 June 2000
      0 references
      queueing models
      0 references
      performance analysis
      0 references
      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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references