Asymptotic Analysis of a Data-Handling System with Many Sources (Q3834836)

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 4111762
Language Label Description Also known as
default for all languages
No label defined
    English
    Asymptotic Analysis of a Data-Handling System with Many Sources
    scientific article; zbMATH DE number 4111762

      Statements

      Asymptotic Analysis of a Data-Handling System with Many Sources (English)
      0 references
      1989
      0 references
      asymptotics
      0 references
      data handling systems
      0 references
      probability of overflow
      0 references
      Numerical results
      0 references
      asymptotic results
      0 references
      0 references
      The author has considered a model in which a buffer receives messages from N independent and identical information sources that asynchronously alternate between exponentially distributed periods in the ``on'' and ``off'' states. While on, a source transmits at a uniform rate. The buffer depletes through an output channel with a given maximum transmission rate \(c<N.\) G(X) \((=probability\) for the buffer content to exceed x), is analysed under the assumptions that \(c/N=O(1)\) and \(N\gg 1\). In this connection, the asymptotic approximations to G(x) are obtained when \(x=O(1/N)\), O(1) and O(N) and when \(x/N\gg 1\). Numerical results are given for G(0) and are compared with asymptotic results. They help account for the discontinuous behaviour of G(0) at integer values of c.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references