Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message

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 121
  • 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.

Montgomery, M. and De Veciana, G. 1996. On the relevance of time scales in performance oriented traffic characterizations. Vol. 2, Issue. , p. 513.
  • CrossRef
  • Google Scholar

Duffield, N. G. 1996. Economies of scale in queues with sources having power-law large deviation scalings. Journal of Applied Probability, Vol. 33, Issue. 03, p. 840.
  • CrossRef
  • Google Scholar

Liu, Zhen Nain, Philippe and Towsley, Don 1997. Exponential bounds with applications to call admission. Journal of the ACM, Vol. 44, Issue. 3, p. 366.
  • CrossRef
  • Google Scholar

Likhanov, N. and Mazumdar, R.R. 1998. Cell loss asymptotics in buffers fed with a large number of independent stationary sources. Vol. 1, Issue. , p. 339.
  • CrossRef
  • Google Scholar

Toomey, Fergal 1998. Bursty traffic and finite capacity queues. Annals of Operations Research, Vol. 79, Issue. 0, p. 45.
  • CrossRef
  • Google Scholar

Courcoubetis, C. Kelly, F. P. Siris, V. A. and Weber, R. 1998. Broadband Communications. p. 209.
  • CrossRef
  • Google Scholar

Ephremides, A. and Hajek, B. 1998. Information theory and communication networks: an unconsummated union. IEEE Transactions on Information Theory, Vol. 44, Issue. 6, p. 2416.
  • CrossRef
  • Google Scholar

Heyman, Daniel P. 1998. Some issues in performance modeling of data teletraffic. Performance Evaluation, Vol. 34, Issue. 4, p. 227.
  • CrossRef
  • Google Scholar

Courcoubetis, Costas Siris, Vasilios A. and Stamoulis, George D. 1998. Application and evaluation of large deviation techniques for traffic engineering in broadband networks. ACM SIGMETRICS Performance Evaluation Review, Vol. 26, Issue. 1, p. 212.
  • CrossRef
  • Google Scholar

Duffield, N.G. 1998. Conditioned asymptotics for tail probabilities in large multiplexers. Performance Evaluation, Vol. 31, Issue. 3-4, p. 281.
  • CrossRef
  • Google Scholar

Courcoubetis, Costas Siris, Vasilios A. and Stamoulis, George D. 1998. Application and evaluation of large deviation techniques for traffic engineering in broadband networks. p. 212.
  • CrossRef
  • Google Scholar

Duffield, N.G. and Low, S.H. 1998. The cost of quality in networks of aggregate traffic. Vol. 2, Issue. , p. 525.
  • CrossRef
  • Google Scholar

Likhanov, Nikolay and Mazumdar, Ravi R. 1999. Cell loss asymptotics for buffers fed with a large number of independent stationary sources. Journal of Applied Probability, Vol. 36, Issue. 1, p. 86.
  • CrossRef
  • Google Scholar

1999. Charging Communication Networks. p. 217.
  • CrossRef
  • Google Scholar

Courcoubetis, C. Dimakis, A. and Stamoulis, G.D. 1999. Traffic equivalence and substitution in a multiplexer. p. 1239.
  • CrossRef
  • Google Scholar

Likhanov, Nikolay and Mazumdar, Ravi R. 1999. Cell loss asymptotics for buffers fed with a large number of independent stationary sources. Journal of Applied Probability, Vol. 36, Issue. 01, p. 86.
  • CrossRef
  • Google Scholar

Karasaridis, A. and Hatzinakos, D. 1999. Bandwidth allocation bounds for α-stable self-similar Internet traffic models. p. 214.
  • CrossRef
  • Google Scholar

Delas, S. Mazumdar, R.R. and Rosenberg, C. 1999. Cell loss asymptotics in priority queues accessed by a large number of independent stationary sources. p. 551.
  • CrossRef
  • Google Scholar

Duffield, N.G. 1999. Asymptotic sampling properties of effective bandwidth estimation for admission control. p. 1532.
  • CrossRef
  • Google Scholar

Karasaridis, A. and Hatzinakos, D. 1999. Resource allocation issues for long-tailed LRD Internet WAN traffic. Vol. 2, Issue. , p. 1495.
  • 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

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.

Buffer overflow asymptotics for a buffer handling many traffic sources
  • Volume 33, Issue 3
  • Costas Courcoubetis (a1) and Richard Weber (a2)
  • DOI: https://doi.org/10.2307/3215366
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.

Buffer overflow asymptotics for a buffer handling many traffic sources
  • Volume 33, Issue 3
  • Costas Courcoubetis (a1) and Richard Weber (a2)
  • DOI: https://doi.org/10.2307/3215366
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.

Buffer overflow asymptotics for a buffer handling many traffic sources
  • Volume 33, Issue 3
  • Costas Courcoubetis (a1) and Richard Weber (a2)
  • DOI: https://doi.org/10.2307/3215366
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.