Dynamic call-blocking algorithms for telecommunications networks

Mass-calling events can cause significant congestion in the phone network due to the high volume of redial attempts. This paper presents dynamic algorithms which randomly block some calls at their origination points, thus reducing traffic in the network. The algorithms respond to changing congestion levels by observing whether or not previous calls have been answered. The algorithms reduce call attempts by 50% during periods of 80% blocking, with little disruption in blocking levels to the dialing customers (blocking increases by less than 1%). We also derive an improved blocking heuristic which is more effective under periods of heavier congestion.

[1]  H. Joseph Weber.  Some traffic characteristics of communications networks with automatic alternate routing , 1962, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[2]  Moshe Zukerman,et al.  Performance analysis of SS7 congestion controls under sustained overload , 1994, IEEE J. Sel. Areas Commun..

[3]  Donald E. Smith,et al.  A comparison of SS7 congestion control options during mass call-in situations , 1995, TNET.

[4]  Walter L. Smith.  Probability and Statistics , 1959, Nature.

[5]  Donald E. Smith.  Ensuring robust call throughput and fairness for SCP overload controls , 1995, TNET.

[6]  Akira Fukuda.  Input regulation control based on periodical monitoring using call gapping control , 1986 .

[7]  Michael Rumsewicz.  On the efficacy of using the transfer-controlled procedure during periods of STP processor overload in SS7 networks , 1994, IEEE J. Sel. Areas Commun..

[8]  M. Naldi,et al.  Measurement-based modelling of Internet dial-up access connections , 1999, Comput. Networks.

[9]  D.E. Smith.  Effects of feedback delay on the performance of the transfer-controlled procedure in controlling CCS network overloads , 1994, IEEE J. Sel. Areas Commun..

[10]  Anurag Kumar,et al.  Optimal control of arrivals to queues with delayed queue length information , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

[11]  Donald E. Smith,et al.  Service control point overload rules to protect intelligent network services , 1998, TNET.

[12]  L. Sennott.  Stochastic Dynamic Programming and the Control of Queueing Systems , 1998 .

[13]  Arthur W. Berger.  Comparison of call gapping and percent blocking for overload control in distributed switching systems and telecommunications networks , 1991, IEEE Trans. Commun..

[14]  Aaron Kershenbaum,et al.  Telecommunications Network Design Algorithms , 1993 .

[15]  C. E. Johnson,et al.  No. 4 ESS: Network management and traffic administration , 1977, The Bell System Technical Journal.

[16]  V. Rykov,et al.  Controlled Queueing Systems , 1995 .

[17]  D. Haenschke,et al.  Network Management and Congestion in the U.S. Telecommunications Network , 1981, IEEE Trans. Commun..

[18]  J. H. Weber,et al.  A simulation study of routing and control in communications networks , 1964 .