Skip to main content
SpringerLink
Log in

Loss bounds for a finite-capacity queue based on interval-wise traffic observation

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We study a single-server finite-capacity queue with batch fluid inputs. We assume that the input traffic is observed in an interval-wise basis; that is, along the time axis divided into fixed-length intervals, with the amount of work brought into the queue during each interval sequentially observed. Since the sequence of the amounts of work during respective intervals, which is referred to as the interval-wise input process in this paper, does not reveal complete information about an input process, we cannot be precisely aware of the performance of the queue. Thus, in this paper, we focus on knowing the performance limit of the queue based on the interval-wise input process. In particular, we establish an upper limit of the long-run loss ratio of the workload in the queue. Our results would reveal useful tools to evaluate the performance of queuing systems when information about input processes in a fine timescale is not available.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Billingsley, P.: Probability and Measure, 3rd edn. Wiley, New York (1995)

    Google Scholar 

  2. Botvich, D., Duffield, N.: Large deviations, economies of scale, and the shape of the loss curve in large multiplexers. Queueing Syst. 20, 293–320 (1995)

    Article  Google Scholar 

  3. Buffet, E., Duffield, N.: Exponential upper bounds via martingales for multiplexers with Markovian arrivals. J. Appl. Probab. 31, 1049–1061 (1994)

    Article  Google Scholar 

  4. Chang, C., Chiu, Y., Song, W.: On the performance of multiplexing independent regulated inputs. In: ACM SIGMETRICS 2001 (2001)

  5. Courcoubetis, C., Weber, R.: Buffer overflow asymptotics for a buffer handling many traffic sources. J. Appl. Probab. 33, 886–903 (1996)

    Article  Google Scholar 

  6. Duffield, N.: Exponential bounds for queues with Markovian arrivals. Queueing Syst. 7, 413–430 (1994)

    Article  Google Scholar 

  7. Duffield, N.: Economies of scale in queues with sources having power-law large deviation scalings. J. Appl. Probab. 33, 840–857 (1996)

    Article  Google Scholar 

  8. Gani, J., Prabhu, N.U.: Continuous time treatment of a storage problem. Nature 182, 39–40 (1957)

    Article  Google Scholar 

  9. Gani, J., Prabhu, N.U.: Remarks on the dam with Poisson type inputs. Aust. J. Appl. Sci. 10, 113–122 (1958)

    Google Scholar 

  10. Glynn, P., Whitt, W.: Logarithmic asymptotics for steady-state tail probabilities in a single-server queue. J. Appl. Probab. 31A, 131–156 (1994)

    Article  Google Scholar 

  11. Leland, W.E., Taqqu, M.S., Willinger, W., Wilson, D.V.: On the self-similar nature of Ethernet traffic. IEEE/ACM Trans. Netw. 2, 1–15 (1994)

    Article  Google Scholar 

  12. Muller, A., Stoyan, D.: Comparison Methods for Stochastic Models and Risks. Wiley, New York (2002)

    Google Scholar 

  13. Parekh, A., Gallager, R.: A generalized processor sharing approach to flow control in Integrated Services networks: the single-node case. IEEE/ACM Trans. Netw. 1, 344–357 (1993)

    Article  Google Scholar 

  14. Parekh, A., Gallager, R.: A generalized processor sharing approach to flow control in Integrated Services networks: the multiple-node case. IEEE/ACM Trans. Netw. 2, 137–150 (1994)

    Article  Google Scholar 

  15. Saito, H.: Call admission control using upper bound of cell loss probability. IEEE Trans. Commun. 40, 1512–1521 (1992)

    Article  Google Scholar 

  16. Saito, H., Shiomoto, K.: Dynamic call admission control in ATM networks. IEEE J. Sel. Areas Commun. 9, 982–989 (1991)

    Article  Google Scholar 

  17. Shioda, S., Ishii, D.: Monotonicity results for single-server finite-capacity queues with respect to directionally convex order. Probab. Eng. Inf. Sci. 18, 369–393 (2004)

    Article  Google Scholar 

  18. Stiliadis, D., Varma, A.: Latency-rate servers: a general model for analysis of traffic scheduling algorithms. IEEE/ACM Trans. Netw. 6, 611–624 (1998)

    Article  Google Scholar 

  19. Takács, L.: A single-server queue with limited virtual waiting time. J. Appl. Probab. 11, 612–617 (1974)

    Article  Google Scholar 

  20. Takada, H.: Markov modulated fluid queues with batch fluid arrivals. J. Oper. Res. Soc. Jpn. 44, 344–365 (2001)

    Google Scholar 

  21. Takada, H., Miyazawa, M.: A Markov modulated fluid queue with batch fluid arrivals and preemption. IEICE Technical Report IN-2001-25 (2001)

  22. Vojnović, M., Boudec, J.Le: Bounds for independent regulated inputs multiplexed in a service curve network element. IEEE Trans. Commun. 51, 735–740 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Urban Environment Systems, Faculty of Engineering, Chiba University, 1-33 Yayoi, Inage, Chiba, 263-8522, Japan

    Shigeo Shioda

Authors
  1. Shigeo Shioda
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shigeo Shioda.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shioda, S. Loss bounds for a finite-capacity queue based on interval-wise traffic observation. Queueing Syst 60, 153–170 (2008). https://doi.org/10.1007/s11134-008-9091-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-008-9091-8

Keywords

Mathematics Subject Classification (2000)

Search

Navigation