Abstract
A discrete-time, two-server queueing system is studied in this paper. The service time of a customer (cell) is fixed and equal to one time unit. Server 1 provides for periodic service of the queue (periodT). Server 2 provides for service only when server 1 is unavailable and provided that the associated service credit is nonzero. The resulting system is shown to model the queueing behavior of a network user which is subject to traffic regulation for congestion avoidance in high speed ATM networks. A general methodology is developed for the study of this queueing system, based on renewal theory. The dimensionality of the developed model is independent ofT;T increases with the network speed. The cell loss probabilities are computed in the case of finite capacity queue.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Bae and T. Suda, Survey of traffic control schemes and protocols in ATM networks, Proc. IEEE 79 (Feb. 1991).
Congestion control in high speed networks, Special Issue, IEEE Commun. Mag. (Oct 1991).
B-ISDN: High performance transport, Special Issue, IEEE Commun. Mag. (Sept. 1991).
M. Sidi, W. Liu, I. Cidon and I. Gopal, Congestion control through input traffic rate regulation,IEEE Globecom'89 Conf. (1989).
H. Ahmadi, R. Guerin and K. Sohraby, Analysis of a rate-based access control mechanism for high-speed networks,IEEE Globecom'90 Conf. (1990).
K. Sohraby and M. Sidi, On the performance of bursty and correlated sources subject to Leaky Bucket rate-based access control scheme,IEEE Infocom'91 Conf. (1991).
E. Rathgeb, Modeling and performance comparisons at policing mechanisms for ATM networks, IEEE J. Sel. Areas Commun. SAC-9 (Apr. 1991).
M. Butto, E. Cavallero and A. Tonietti, Effectiveness of the “Leaky Bucket” policing mechanism in ATM networks, IEEE J. Sel. Areas Commun. SAC-9 (Apr. 1991).
W. Leland, Window based congestion management in broadband ATM networks: the performance of three access-control policies,IEEE Globecom'89 Conf. (1989).
J. Cohen,On Regenerative Processes in Queueing Theory (Springer, 1976).
K. Bala, I. Cidon and K. Sohraby, Congestion control for high speed packet switched networks,Infocom'90 Conf. (1990).
K. Chung,A Course in Probability Theory (Academic Press, 1974).
C. Bisdikian, J. Lew and A. Tantawi, On the approximation of the blocking probability of single server queues with finite buffer capacity, IBM Research Report, RC 17556, T.J. Watson Research Center (Jan. 1992).
I. Stavrakakis and D. Kazakos, On the approximation of the output process of multi-user random access communication networks, IEEE Trans. Commun. COM-38 (Feb. 1990).
I. Stavrakakis and D. Kazakos, Performance analysis of a star topology of interconnected networks under 2nd-order Markov network output processes, IEEE Trans. Commun. COM-38 (Oct. 1990).
I. Stavrakakis and D. Kazakos, A limited sensing protocol for multi-user packet radio systems, IEEE Trans. Commun. COM-37 (April, 1989).
I. Stavrakakis, A considerate priority queueing system with guaranteed policy fairness,Infocom'92 Conf. (1992).
J.Y. LeBoudec, An efficient solution method for Markov models of ATM links with loss priorities, IEEE J. Sel. Areas in Commun. SAC-9 (April 1991).
Author information
Authors and Affiliations
Additional information
Research supported by the National Science Foundation under grant NCR-9011962.
Rights and permissions
About this article
Cite this article
Stavrakakis, I. A two-server queueing system with periodic and credit-based server availabilities. Ann Oper Res 49, 79–100 (1994). https://doi.org/10.1007/BF02031592
Issue Date:
DOI: https://doi.org/10.1007/BF02031592