Call-Burst Blocking Probabilities of ON-OFF Traffic Sources under the Bandwidth Reservation Policy
نویسندگان
چکیده
We calculate call and burst blocking probabilities (CBP and BBP respectively) in a single link loss system accommodating service-classes of ONOFF traffic calls, either of high or low bandwidth requirements. To benefit high speed calls the bandwidth reservation (BR) policy is considered (ON-OFF/BR model). Poisson arriving calls enter the system via state ON and may alternate between states ON and OFF. When a call passes to state OFF it releases the bandwidth held in state ON which becomes available for new arrivals. When the call tries to return to state ON it re-requests its bandwidth. If it is available a new burst begins; otherwise, the burst is blocked and the call remains in state OFF. The CBP/BBP calculation is based on approximate formulas.
منابع مشابه
New algorithms for Performance Measures Derivatives in the Erlang Multirate Loss Model including the Bandwidth Reservation Policy
We consider a single-link loss system with fixed bandwidth capacity accommodating K service-classes of Poisson traffic with different bandwidth-per-call requirements. Calls of all service-classes compete for the available link bandwidth, under two different policies: a) the complete sharing (CS) policy and b) the bandwidth/trunk reservation (BR) policy. In the CS policy, a call is blocked and l...
متن کاملA Quasi-Random Multirate Loss Model Supporting Elastic and Adaptive Traffic under the Bandwidth Reservation Policy
In this paper, we propose a multirate teletraffic loss model of a single link that accommodates elastic and adaptive services whose calls come from a finite traffic-source population. This call arrival process is known as a quasi-random process and is used in traffic modelling when the number of users who generate traffic is relatively small compared to the system capacity. In-service elastic a...
متن کامل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...
متن کاملQoS Equalization in a W-CDMA Cell Supporting Calls of Infinite or Finite Sources with Interference Cancelation
In this paper, a multirate loss model for the calculation of time and call congestion probabilities in a Wideband Code Division Multiple Access (W-CDMA) cell is considered. It utilizes the Bandwidth Reservation (BR) policy and supports calls generated by an infinite or finite number of users. The BR policy achieves QoS equalization by equalizing congestion probabilities among calls of different...
متن کاملOptimal Bandwidth Allocation with Bandwidth Reservation and Adaptation in Wireless Communication Networks
Efficient management of bandwidth in wireless networks is a critical factor for a successful communication system. Special features of wireless networks such user mobility and growth of wireless applications and their high bandwidth intensity create a major challenge to utilize bandwidth resources optimally. In this research, we propose a model for an adaptable network bandwidth management meth...
متن کامل