| Article ID: | iaor1997728 |
| Country: | United States |
| Volume: | 0-8493-8074-X |
| Start Page Number: | 43 |
| End Page Number: | 78 |
| Publication Date: | Oct 1995 |
| Journal: | Advances In Queueing: Theory, Methods and Open Problems |
| Authors: | Takcs Lajos |
| Keywords: | graphs |
In this article several limit theorems are proved for the fluctuations of the queue size during the initial busy period of a queueing process with one server. These theorems are used to find the solutions of various problems connected with the heights and widths of random-rooted trees.