Abstract
Consider a circuit-switched network whereC source switches are connected to a destination switch via a tandem switch. Circuit-switched networks traditionally employ a Blocked Calls Lost (BCL) call admission control: a call is rejected if all access circuits from the originating switch to the tandem switch are busy, or if allB outgoing circuits from the tandem switch to the destination switch are busy. This paper investigates a simple extension to the BCL control. Rather than reject all blocked calls, the Blocked Calls Queued (BCQ) control holds some blocked calls by storing their call signalling information in a buffer at the tandem switch. These calls will later be connected when circuits become available. The BCQ model is solved using standard methods requiring O(BC) storage locations and O(B 2 C) arithmetic operations. We show that the BCQ control becomes effective if calls are rejected (source rejection) when all access circuits are busy. We demonstrate that the BCQ control with source rejection achieves a substantial reduction in the loss probability at the expense of a small connection delay.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
J.M. Akinpelu, The overload performance of engineered networks with nonhierarchical and hierarchical routing, AT&T Tech. J. 63(1984)1261–1281.
F. Baskett, K.M. Chandy, R.R. Muntz and J. Palacios, Open, closed and mixed networks of queues with different classes of customers, JACM 22(1975)249–260.
S.A. Berezner and A.E. Krzesinski, Quasi-reversible multiclass queues with order independent departure rates, Queueing Systems 19(1995)345–359.
S.A. Berezner and A.E. Krzesinski, Order independent loss networks,Proc. Australian Telecommunication Networks and Applications Conference, Sydney (1995) pp. 381–386.
D.Y. Burman, J.P. Lehoczky and Y. Lim, Insensitivity of blocking probabilities in a circuit-switched network, J. of Appl. Prob. 21(1984)850–859.
P. Cazdzicki, I. Lambadaris and R.R. Mazumdar, Blocking probabilities for large multirate Erlang loss systems, Adv. Appl. Prob. 25(1993)997–1009.
S. Crosby and A.E. Krzesinski, Product form solutions for multiserver centres with concurrent classes of customers, Perform. Eval. 11(1990)265–281.
Z. Dziong and J.W. Roberts, Congestion probabilities in a circuit-switched integrated service networks, Perform. Eval. 7(1987)267–284.
P.J. Hunt and F.P. Kelly, On critically loaded loss networks, Adv. Appl. Prob. 21(1989)831–841.
J.S. Kaufman, Blocking in a shared resource environment, IEEE Trans. on Commun. COM-29 (1981)1474–1481.
F.P. Kelly,Reversibility and Stochastic Networks (Wiley, 1979).
F.P. Kelly, Blocking probabilities in large circuit-switched networks, Adv. in Appl. Prob. 18(1986)473–505.
F.P. Kelly, Loss networks, Ann. Appl. Prob. 1(1991)473–505.
Y. Kogan, Exact analysis for a class of simple, circuit-switched networks with blocking, Adv. Appl. Prob. 21(1989)952–955.
S.S. Lam and Y.L. Lien, A tree convolution algorithm for the solution of a queueing network, CACM 26(1983)203–215.
J-Y Le Boudec, A BCMP extension to multiserver stations with concurrent classes of customers,Proc. 1986 ACM Sigmetrics Conference, Perform. Eval. Rev. 14(1)78–91.
D. Mitra, Asymptotic analysis and computational methods for a class of simple circuit-switched networks with blocking, Adv. Appl. Prob. 19(1987)219–239.
D. Mitra and P.J. Weinberger, Probabilistic models of large database locking: solutions, computational algorithms and asymptotics, JACM 31(1984)855–878.
K.W. Ross and D. Tsang, Teletraffic engineering for product-form circuit-switched networks, Adv. Appl. Prob. 22(1990)657–675.
K.W. Ross and D. Tsang, Algorithms to determine exact blocking probabilities for multirate tree networks, IEEE Trans. Commun. 38(1990)1266–1271.
W. Whitt, Blocking when service is required from several facilities simultaneously, AT&T Tech. J. 64(1985)1807–1856.
S. Zachary, On blocking in loss networks, Adv. Appl. Prob. 23, 2(1991)355–372.
I.E. Ziedins and F.P. Kelly, Limit theorems for loss networks with diverse routing, Adv. Appl. Prob. 21(1989)804–830.
Author information
Authors and Affiliations
Additional information
This work was supported by a grant from the Foundation for Research Development Communications Systems Programme.
Rights and permissions
About this article
Cite this article
Berezner, S.A., Krzesinski, A.E. Call queueing in circuit-switched networks. Telecommunication Systems 6, 147–160 (1996). https://doi.org/10.1007/BF02114291
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02114291