Skip to main content
Log in

The distribution of the number of arrivals in a subinterval of a busy period of a single server queue

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

In the course of attempting to estimate the arrival rate of a single server queue using an active probing experiment, the authors found it necessary to derive the distribution of the number of arrivals between two probes under the conditions that the busy period of the queue lasts this long. In this paper we derive this distribution. The key building blocks in the derivation of the distribution are the classical ballot theorem and its generalized forms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M. Abramowitz and I.A. Stegun, Handbook of Mathematical Functions : With Formulas, Graphs, and Mathematical Tables, Dover Publications, New York (1965).

    Google Scholar 

  2. T.M. Apostol, Mathematical Analysis, Addison-Wesley, 2nd edition, Massachusetts (1981).

  3. D.R. Cox, Renewal Theory, Methuen & Co., London (1962).

    Google Scholar 

  4. C. Dovrolis, P. Ramanathan and D. Moore, Packet-dispersion techniques and a capacity-estimation methodology, IEEE Transactions on Networking, 12 (Dec. 2004), 6.

    Google Scholar 

  5. O. Gurewitz, M. Sidi and I. Cidon, The ballot theorem strikes again: Packet LOSS PROCESS DISTRIBUTION, IEEE Transactions on Information Theory (2000).

  6. J.F. He and K. Sohraby, An extended combinatorial analysis framework for discrete-time queueing systems with general sources, IEEE Transactions on Networking, 11(1) (2003), 95–110.

    Google Scholar 

  7. S. Keshav, Congestion Control in Computer Networks. PhD Thesis, UC Berkeley TR-654 (1991).

  8. L. Kleinrock, Queueing Systems, vol. 1, John Wiley and Sons (1975).

  9. W. Matthews and L. Cottrell, Internet performance monitoring for the high energy nuclear and particle physics community, in PAM 2000, The First Passive and Active Measurement Workshop, http://pam2000.cs.waikato.ac.nz/final_program.htm, Hamilton, New Zealand (April 2000).

  10. A. Pásztor and D. Veitch, Active probing using packet quartets, in Proc. ACM SIGCOMM Internet Measurement Workshop (IMW-2002), Marseille (Nov. 6–8, 2002), pp. 293–305.

  11. V. Ribeiro, R. Riedi, J. Navratil and L. Cottrell, PathChirp: Efficient available bandwidth estimation for network paths, in PAM 2003, Passive and Active Measurement Workshop, La Jolla, California (April 6–8, 2003).

  12. L. Takács, Combinatorial Methods in the Theory of Stochastic Processes, John Wiley & Sons, Inc., New York (1967).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. Novak.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Novak, A., Taylor, P. & Veitch, D. The distribution of the number of arrivals in a subinterval of a busy period of a single server queue. Queueing Syst 53, 105–114 (2006). https://doi.org/10.1007/s11134-006-6670-4

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-006-6670-4

Keywords

Navigation