Skip to main content Accessibility help

Login Alert

Cancel
Log in
×
×
Register
Log In
(0) Cart
Logo for Cambridge Core from Cambridge University Press. Click to return to homepage.
Logo for Cambridge Core from Cambridge University Press. Click to return to homepage.

Cited by
  • Crossref logo 33
  • Google Scholar logo
Crossref Citations
Crossref logo
This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Stadje, Wolfgang 1989. Coverage Problems for Random Intervals. SIAM Journal on Applied Mathematics, Vol. 49, Issue. 5, p. 1538.
  • CrossRef
  • Google Scholar

Browne, Sid and Steele, J. Michael 1993. Transient behavior of coverage processes by applications to the infinite-server queue. Journal of Applied Probability, Vol. 30, Issue. 03, p. 589.
  • CrossRef
  • Google Scholar

Zacks, S. and Yadin, M. 1994. The survival probability function of a target moving along a straight line in a random field of obscuring elements. Naval Research Logistics, Vol. 41, Issue. 6, p. 689.
  • CrossRef
  • Google Scholar

Handley, John C. and Dougherty, Edward R. 1996. Optimal nonlinear filter for signal-union-noise and runlength analysis in the directional one-dimensional discrete Boolean random set model. Signal Processing, Vol. 51, Issue. 3, p. 147.
  • CrossRef
  • Google Scholar

Daley, D. J. and Servi, L. D. 1998. Idle and busy periods in stable M/M/k queues. Journal of Applied Probability, Vol. 35, Issue. 04, p. 950.
  • CrossRef
  • Google Scholar

Abate, Joseph and Whitt, Ward 1999. Computing Laplace Transforms for Numerical Inversion Via Continued Fractions. INFORMS Journal on Computing, Vol. 11, Issue. 4, p. 394.
  • CrossRef
  • Google Scholar

MEDHI, J. 2003. Stochastic Models in Queueing Theory. p. 255.
  • CrossRef
  • Google Scholar

Handley, John C. 2004. Computationally efficient approximate likelihood procedures for the Boolean model. Computational Statistics & Data Analysis, Vol. 45, Issue. 2, p. 125.
  • CrossRef
  • Google Scholar

Tsybakov, B. S. 2005. Busy Periods in a System with Heterogeneous Servers or Channels. Problems of Information Transmission, Vol. 41, Issue. 3, p. 280.
  • CrossRef
  • Google Scholar

Tsybakov, Boris 2006. Busy periods in M/M/∞ systems with heterogeneous servers. Queueing Systems, Vol. 52, Issue. 2, p. 153.
  • CrossRef
  • Google Scholar

Crespi, Catherine M. and Lange, Kenneth 2006. Estimation for the Simple Linear Boolean Model. Methodology and Computing in Applied Probability, Vol. 8, Issue. 4, p. 559.
  • CrossRef
  • Google Scholar

Miorandi, Daniele and Altman, Eitan 2006. Connectivity in one-dimensional ad hoc networks: A queueing theoretical approach. Wireless Networks, Vol. 12, Issue. 5, p. 573.
  • CrossRef
  • Google Scholar

Yousefi, Saleh Altman, Eitan El-Azouzi, Rachid and Fathy, Mahmood 2007. Connectivity in vehicular ad hoc networks in presence wireless mobile base-stations. p. 1.
  • CrossRef
  • Google Scholar

Roijers, Frank Mandjes, Michel and van den Berg, Hans 2007. Analysis of congestion periods of an m/m/-queue. Performance Evaluation, Vol. 64, Issue. 7-8, p. 737.
  • CrossRef
  • Google Scholar

Yousefi, S. Altman, E. El-Azouzi, R. and Fathy, M. 2008. Analytical Model for Connectivity in Vehicular Ad Hoc Networks. IEEE Transactions on Vehicular Technology, Vol. 57, Issue. 6, p. 3341.
  • CrossRef
  • Google Scholar

Yousefi, Saleh Altman, Eitan El-Azouzi, Rachid and Fathy, Mahmood 2008. Improving connectivity in vehicular ad hoc networks: An analytical study. Computer Communications, Vol. 31, Issue. 9, p. 1653.
  • CrossRef
  • Google Scholar

Osborne, Jason A. and Grift, Tony E. 2009. M-Estimation of Boolean Models for Particle Flow Experiments. Journal of the Royal Statistical Society Series C: Applied Statistics, Vol. 58, Issue. 2, p. 197.
  • CrossRef
  • Google Scholar

Leeuwaarden, J. S. H. van Löpker, A. H. and Janssen, A. J. E. M. 2010. Connecting Renewal Age Processes with M/D/1 and M/D/∞ Queues Through Stick Breaking. Stochastic Models, Vol. 26, Issue. 1, p. 141.
  • CrossRef
  • Google Scholar

Kherani, A. and Rao, A. 2010. Performance of Node-Eviction Schemes in Vehicular Networks. IEEE Transactions on Vehicular Technology, Vol. 59, Issue. 2, p. 550.
  • CrossRef
  • Google Scholar

Zhang, Zijie Mao, Guoqiang and Anderson, Brian D. O. 2010. On the Information Propagation Speed in Mobile Vehicular Ad Hoc Networks. p. 1.
  • CrossRef
  • Google Scholar

Download full list
Google Scholar Citations

View all Google Scholar citations for this article.

×
Cambridge University Press

Our Site

  • Accessibility
  • Contact & Help
  • Legal Notices

Quick Links

  • Cambridge Core
  • Cambridge Open Engage
  • Cambridge Aspire website

Our Products

  • Journals
  • Books
  • Elements
  • Textbooks
  • Courseware

Join us online

Please choose a valid location.

  • Rights & Permissions
  • Copyright
  • Privacy Notice
  • Terms of Use
  • Cookies Policy
Cambridge University Press 2025

Cancel
Confirm
×

Save article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

The busy period of the queueing system M/G/∞
  • Volume 22, Issue 3
  • Wolfgang Stadje (a1)
  • DOI: https://doi.org/10.2307/3213872
Please provide your Kindle email.
Available formats Please select a format to save.
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

The busy period of the queueing system M/G/∞
  • Volume 22, Issue 3
  • Wolfgang Stadje (a1)
  • DOI: https://doi.org/10.2307/3213872
Available formats Please select a format to save.
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

The busy period of the queueing system M/G/∞
  • Volume 22, Issue 3
  • Wolfgang Stadje (a1)
  • DOI: https://doi.org/10.2307/3213872
Available formats Please select a format to save.
×
×

Reply to: Submit a response

Contents help
Close Contents help

- No HTML tags allowed
- Web page URLs will display as text only
- Lines and paragraphs break automatically
- Attachments, images or tables are not permitted

Please enter your response.

Your details

Email help
Close Email help

Your email address will be used in order to notify you when your comment has been reviewed by the moderator and in case the author(s) of the article or the moderator need to contact you directly.

Please enter a valid email address.

You have entered the maximum number of contributors

Conflicting interests

Do you have any conflicting interests? * Conflicting interests help

Close Conflicting interests help

Please list any fees and grants from, employment by, consultancy for, shared ownership in or any close relationship with, at any time over the preceding 36 months, any organisation whose interests may be affected by the publication of the response. Please also list any non-financial associations or interests (personal, professional, political, institutional, religious or other) that a reasonable reader would want to know about in relation to the submitted work. This pertains to all the authors of the piece, their spouses or partners.