This paper proposes an approximation for the blocking probability in a many-server loss model with a non-Poisson time-varying arrival process and flexible staffing (number of servers) and shows that it can be used to set staffing levels to stabilize the time-varying blocking probability at a target level. Because the blocking probabilities necessarily change dramatically after each staffing cha...

In the present paper, we develop an adaptive algorithm for call admission control in wireless networks. The algorithm is built upon the concept of guard channels and it uses an adaptation algorithm to search automatically the optimal number of guard channels to be reserved at each base station. The quality of service parameters used in our study are the new call blocking probability and the han...

This paper presents a complete closed-form timedomain analysis of the blocking probability of time-driven switching (TDS) for the single node case. In this work blocking is defined as the occurrence in which transmission resources are available in both inlet and outlet, but there is no schedule. The main constraints for finding a schedule are: (i) the load and (ii) the maximum scheduling delay ...

The use of OVSF codes in WCDMA systems has offered opportunities to provide variable data rates to flexibly support applications with different bandwidth requirements. Two important issues in such an environment are the code placement problem and code replacement problem. The former may have significant impact on code utilization and, thus, code blocking probability, while the latter may affect...

There is a problem of unfairness in allocation of radio resources among heterogeneous mobile terminals in heterogeneous wireless networks. Low-capability mobile terminals (such as single-mode terminals) suffer high call blocking probability whereas high-capability mobile terminals (such as quad-mode terminals) experience very low call blocking probability, in the same heterogeneous wireless net...

This paper presents a dynamic channel assignment technique in hierarchical structure for Mobile Communications Networks. This technique optimizes the handover call blocking probability performance of High-Speed Moving Terminals (HSMT). Traffic of Low-Speed Moving Terminals (LSMT) is absorbed by a micro cellular architecture solution and traffic of new calls of HSMT is abrorbed by a higher layer...

We prove a slightly more general version of the following: In a G/GI/c/m queueing system where arriving customers are randomly deleted with probability 1 − p, the blocking probability of the remaining customers must be non-decreasing in p. In particular, we show that if more customers are accepted, even with a possibly different service time distribution, the blocking probability is at least as...

Blocking probability has been one of the key performance to solve Routing and Wavelength Assignment problem (RWA) indexes in the design of wavelength-routed all-optical WDM networks. To evaluate blocking probability different analytical model are introduced. Simulation results on different network topologies and routing policies considered demonstrate that the simulation results match closely w...

I n this paper we investigate the relationship between the blocking probability and the configuration of storage hierarchy in a V O D server. Due t o limited sys tem resources available in a V O D server, some user requests can not be serviced immediately and are thus blocked. I n general, one would expect the increasing the I /O rate will reduce the request blockage. However, we report the int...

© 2014 Dong-Won Seo 609 http://dx.doi.org/10.4218/etrij.14.0113.0812 Even though many computational methods (recursive formulae) for blocking probabilities in finite-capacity M/D/1 queues have already been produced, these are forms of transforms or are limited to single-node queues. Using a distinctly different approach from the usual queueing theory, this study introduces explicit (transformfr...