In this paper, we present FBAC (Flexible Bound Admission Control) algorithm using softness profile to reduce handover blocking probability over WLAN and WAAN (Wide Area Access Network). FBAC algorithm utilizes dynamic resource allocation scheme to decrease the blocking probability of vertical handover connections within the limited capacity of system. Based on FBAC algorithm, we derive the hand...

In this paper, we present SBAC (Soft Bound Admission Control) algorithm considering critical bandwidth ratio to reduce handover blocking probability over WLAN and WAAN (Wide Area Access Network). SBAC algorithm utilizes dynamically optimized resource allocation scheme to decrease the blocking probability of vertical handover connections within the limited capacity of system. Based on SBAC algor...

The paper proposed an efficient traffic grooming model for all optical networks. The model has low complexity and it can be easily implemented for traffic grooming problems. It is used to calculate the blocking probability of computer networks and then grooming problems are addressed based on the calculated blocking probability. Blocking probability is considered to be a major parameter during ...

In a wireless network, blocking probability of connection-oriented traffic depends on the transmission radius of the nodes and the channel assignment scheme. In this work we study these two aspects for simple wireless networks. Specifically, we present blocking probability analysis for a wireless line network with random channel allocation to the incoming calls. Based on the expressions derived...

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...

We present an analytical model for calculating upper and lower bounds for call-blocking probabilities in a LEO satellite network that carries voice calls. The method is especially useful for large systems where calculation of call-blocking probabilities are too expensive. Our method calculates upper and lower bounds very easily and produces fairly accurate results.

AbstmctThe geographical connection admission control (GCAC) algorithm is introduced for low earth orbit LEO) satellite networks. The GCAC scheme estimates the L u r e handover blocking probability of a new call attempt based on the user location database, in order to decrease the handover blocking. By simulation, it is shown that the proposed GCAC scheme guarantees the handover blocking probabi...

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...

The sharing of resources between different users and different services is a key concept of radio resources dimensioning in GSM/GPRS networks. In this paper we present dimensioning rules based on traffic evaluation and quality of service level for GSM/GPRS users, focused on two radio resources allocation strategies: CP (Complete Partitioning) and PP( Partial Partitioning).The quality of service...