M/G/1 Queuing Theory and Applications
The M/G/1 theory is a powerful tool, generalizing the solution of Markovian queues to the case of general service time distributions. There are many applications of the M/G/1 theory in the field of telecommunications; for instance, it can be used to study the queuing of fixed-size packets to be transmitted on a given link (i.e., M/D/1 case). Moreover, this theory yields results which are compatible with the M/M/1 theory, based on birth–death Markov chains.
KeywordsService Time Arrival Process Packet Delay Poisson Arrival Message Length
- 1.Kleinrock L (1976) Queuing systems. Wiley, New YorkGoogle Scholar
- 2.Hayes JF (1986) Modeling and analysis of computer communication networks. Plenum Press, New YorkGoogle Scholar
- 3.Kleinrock L, Gale R (1996) Queuing systems. Wiley Interscience publication, New YorkGoogle Scholar
- 5.Andreadis A, Giambene G (2002) Protocols for high-efficiency wireless networks. Kluwer, New YorkGoogle Scholar