The M/G/∞ Queue

@inproceedings{Gautam2011TheMQ,
  title={The M/G/∞ Queue},
  author={N. Gautam},
  year={2011}
}
  • N. Gautam
  • Published 2011
  • Computer Science
  • The objective of this article is to describe the M/G/∞ system, where the arrivals are according to a Poisson process, the service times are independent and identically distributed, and there are an infinite number of servers. We analyze the number in the system under both transient and steady-state conditions. We describe results for the busy period distribution of as well as departure from an M/G/∞ queue. We finally study an extension in terms of considering time-varying arrivals… CONTINUE READING
    19 Citations

    Topics from this paper

    Introduction to Queueing Theory and Stochastic Teletraffic Models
    • 120
    • PDF
    Modelling V2V message generation rates in a highway environment
    • A. Chandramohan, Geert Heijenk
    • Computer Science
    • 2020 16th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)(50308)
    • 2020
    Thinning, Entropy, and the Law of Thin Numbers
    • 34
    • PDF
    A Markov Chain Model for Contagion
    • 4
    • Highly Influenced
    • PDF
    Streaming content from a vehicular cloud
    • 11
    • PDF
    Efficient Latency Control in Fog Deployments via Hardware-Accelerated Popularity Estimation
    Performance Modeling of Vehicular Floating Content in Urban Settings
    • 12
    • PDF

    References

    SHOWING 1-3 OF 3 REFERENCES
    The Physics of the Mt/G/∞ Queue
    • 247
    Tail probabilities for M/G/∞ input processes (I): Preliminary asymptotics
    • 77