Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-23T10:34:04.006Z Has data issue: false hasContentIssue false
  • English
  • Français

MONOTONICITY RESULTS FOR SINGLE-SERVER FINITE-CAPACITY QUEUES WITH RESPECT TO DIRECTIONALLY CONVEX ORDER

Published online by Cambridge University Press:  01 July 2004

Shigeo Shioda  and
Daisuke Ishii
Shigeo Shioda
Affiliation:
Urban Environment Systems, Faculty of Engineering, Chiba University, 1-33 Yayoi, Inage, Chiba 263-8522, Japan, E-mail: [email protected]
Daisuke Ishii
Affiliation:
Urban Environment Systems, Faculty of Engineering, Chiba University, 1-33 Yayoi, Inage, Chiba 263-8522, Japan, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

In this article, we investigate single-server finite-capacity queues where the partial acceptance rule is applied. In particular, we focus on the monotonicity of the amount of lost (processed) work in the queues with respect to the directionally convex order of work or interarrival processes. We first compare the queues that differ only in their work processes and show that if the work processes are directionally convex ordered, so is the amount of work lost (or processed) in the systems. Next, we compare the queues that differ only in their interarrival processes and show that if the interarrival processes are directionally convex ordered, so is the amount of work lost (or processed) in the systems. Using these results, we establish the formula that gives the upper bound of work-loss probability based only on the marginal distributions of work and interarrival processes. Numerical experiments using the data of actual-LAN (local area network) traffic show that the derived formula gives tight bounds sufficient for practical use.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 18 , Issue 3 , July 2004 , pp. 369 - 393
Copyright
© 2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Chang, C.S., Chao, X.L., & Pinedo, M. (1991). Monotonicity results for queues with doubly stochastic Poisson arrivals: Ross's conjecture. Advances in Applied Probability 23: 210–228.Google Scholar
Chang, C.S., Chao, X.L., Pinedo, M., & Shanthikumar, J.G. (1991). Stochastic convexity for multidimensional processes and its applications. IEEE Transactions on Automatic Controls 36: 1345–1355.Google Scholar
Gani, J. & Prabu, N.U. (1957). Continuous time treatment of a storage problem. Nature 182: 39–40.Google Scholar
Gani, J. & Prabu, N.U. (1958). Remarks on the dam with Poisson type inputs. Australian Journal of Applied Science 10: 113–122.Google Scholar
Leland, W.E., Taqqu, M.S., Willinger, W., & Wilson, D.V. (1994). On the self-similar nature of Ethernet traffic. IEEE/ACM Transactions on Networking 2(1): 1–15.Google Scholar
Jean-Marie, A. & Liu, Z. (1992). Stochastic comparison for queueing models via random sums and intervals. Advances in Applied Probability 24: 960–985.Google Scholar
Meester, L.E. & Shanthikumar, J.G. (1993). Regularity of stochastic processes. Probability in the Engineering and Informational Sciences 7: 343–360.Google Scholar
Miyazawa, M. & Shanthikumar, J.G. (1991). Monotonicity of the loss probabilities of single server finite queues with respect to convex order of arrival or service processes. Probability in the Engineering and Informational Sciences 5: 43–52.Google Scholar
Shaked, M. & Shanthikumar, J.G. (1994) Stochastic orders and their applications. San Diego, CA: Academic Press.
Shanthikumar, J.G. (1994). Convexity of single stage queueing systems with bulk arrivals. Queueing Systems 16: 287–299.Google Scholar
Stoyan, D. (1983). Comparison methods for queues and other stochastic models. New York: Wiley.
Takács, L. (1974). A single-server queue with limited virtual waiting time. Journal of Applied Probability 11: 612–617.Google Scholar
Takada, H. (2001). Markov modulated fluid queues with batch fluid arrivals. Journal of Operations Research Society of Japan 44(4): 344–365.Google Scholar
Takada, H., & Miyazawa M. (2001). A Markov modulated fluid queue with batch arrivals and preemption. IEICE Technical Report IN-2001-25, pp. 9–16. Tokyo: Institute of Electronics, Information, and Communication Engineers.
Toyoizumi, H., Shanthikumar, J.G., & Wolff, R.W. (1997). Two extremal autocorrelated arrival processes. Probability in the Engineering and Informational Sciences 11: 441–450.Google Scholar