No label defined (Q4824401)

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 2112851
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 2112851

      Statements

      0 references
      0 references
      1 November 2004
      0 references
      logarithmic asymptotics
      0 references
      FIFO-systems
      0 references
      The paper considers an underloaded G/G/1 (general stationary message-sizes independent of general stationary message inter-arrival times) FIFO queue with infinite waiting space. Let \(\omega \) be the waiting time a message spends at the device after it has been running for an infinite period of time, and let \(\eta \) be the number of requests yet to receive service by that time. Under large deviation principle and stability assumptions, Theorem 3.1 proves that \[ \lim _{\pi \to \infty } {1 \over \pi }\log P[\eta > \pi \} = -\inf_{z > 0} \inf_{y \geq 0} \Biggl(zI_\xi \biggl({y \over z}\biggr) + (1 + z)I_\tau \biggl({y \over {1 + z}}\biggr)\Biggr)=: - \delta _\eta, \] where \(I_\xi \) is the message-size rate-function and \(I_\tau \) is the message inter-arrival time rate-function. Under additional assumptions, Theorem 4.1 proves that \(\delta _\eta \) is equal to \(\lambda _\xi (\delta _\omega ) = - \lambda _\tau ( - \delta _\omega )\), where \(\lambda _\xi \) and \(\lambda _\tau \) are the scaled cumulant generating functions for the message-size and inter-arrival time processes, respectively, \(\delta _\omega : = -\lim_{q \to \infty } {1 \over q}\log P[\omega > q]\).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references