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 letter 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.
منابع مشابه
A Performance Study of Multicast Routing Algorithms for ATM Networks
This paper addresses the problem of multicast (i.e., point to multipoint) routing in ATM networks. In particular, formal experimental methods are used to evaluate the relative performance of three simple multicast routing algorithms on simple mesh-based networks, using call-level simulation. The performance study focuses on the scalability of multicast routing algorithms with respect to network...
متن کاملA Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks
In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...
متن کاملA study of teletraffic problems in multicast networks
This dissertation studies teletraffic engineering of dynamic multicast connections. The traditional models in teletraffic engineering do not handle multicast connections properly, since in a dynamic multicast tree, users may join and leave the connection freely, and thus the multicast tree evolves in time. A model called multicast loss system is used to calculate blocking probabilities in a sin...
متن کاملAdaptive Resource Allocation for Prioritized Call Admission over an ATM-Based Wireless PCN
In future personal communications networks (PCN’s) supporting network-wide handoffs, new and handoff requests will compete for connection resources in both the mobile and backbone networks. Forced call terminations due to handoff call blocking are generally more objectionable than new call blocking. The previously proposed guard channel scheme for radio channel allocation in cellular networks r...
متن کاملAn Exact Algorithm for Calculating Blocking Probabilities in Multicast Networks
The paper deals with tree-structured point-to-multipoint networks, where users from infinite user populations at the leaf nodes subscribe to a variety of channels, offered by one source. The users joining the network form dynamic multicast connections that share the network resources. An exact algorithm for calculating end-to-end call blocking probabilities for dynamic connections is devised fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Communications
دوره 51 شماره
صفحات -
تاریخ انتشار 2003