• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.85-94
• /
• 2005

In this thesis, we propose a Speed Accommodation Priority Algorithm Scheme(SPAS) and Traffic Control Model Scheme (TCMS) to satisfy a desired handoff dropping probability and to reduce the blocking probability of new calls using mobility characteristics and handoff rate in mobile communication networks. The guard channels below threshold can guarantee the Quality of Service(QoS) in terms of the request handoff dropping probability and the guard channels above the threshold can be used to handle high priority new calls and high priority handoff calls. When the ratio of the handoff call arrival rate is less then the ratio of the new call arrival rate, the proposed method can guarantee the new call better than the previous guard channel scheme.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.1
• /
• pp.85-92
• /
• 2000

Channel management is critical in designing a cellular mobile system that offers high capacity and high quality. In this paper, an integrated channel management scheme is proposed, which consists of a dynamic channel allocation scheme and an admission control scheme. The dynamic channel allocation scheme allocates a call request the channel which minimizes the impact on its interfering cell, and consists of two types of channel allocation strategies : nominal channel allocation strategy and non-nominal channel allocation strategy. The admission control scheme named the variable cutoff priority scheme reserves some frequency channels for handoff cells in each cell the number of which varies according to the blocking probability of handoff class in that cell. Computationl tests are performed to evaluate the performance of the proposed scheme in terms of overall blocking probability, defined by the weighted value of the blocking probabilities of new calls and handoff calls. The results show that the proposed scheme yields better performance than other compared schemes.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.2
• /
• pp.119-131
• /
• 2008

The paper considers the computation method in the performance evaluation of cellular network in the phase-type distribution assumptions that the channel holding times induced from mobility are modeled by well-fitted distributions to reflect an actual situation. When ww consider a phase-type distribution model instead of exponential distribution, the complexity of the computation increase exponential even though the accuracy is improved. We consider an efficient numerical algorithm to compute the performance evaluations in cellular networks such as a handoff call dropping probability, new call blocking probability, and handoff arrival rate. Numerical experiment shows that numerical analysis results are well approximated to the results of simulation.

• ETRI Journal
• /
• v.29 no.1
• /
• pp.113-115
• /
• 2007

A dynamic tri-threshold call admission control scheme has been developed. This scheme supports voice, data, and multimedia services and it complies with the universal mobile telecommunications system. The performance of the proposed scheme is evaluated under varying handover rates. The QoS performance-including channel utilization, call dropping probability, and blocking probability-is investigated. The performance of the developed scheme is found to be encouraging.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.799-802
• /
• 2006

Capacity has always been a major concern in wireless networks. This letter studies the impact of mobility on the overall system capacity in wireless cellular networks. In this letter, we present a simple system model which we developed to capture the inherent relationships among system capacity, new call blocking probability, handoff dropping probability, call terminating probability, and bandwidth utilization rate. We investigate the complex relationship between mobility and capacity-related parameters. Through simulation, we demonstrate that mobility has a significant impact on capacity and is reversely proportional to the bandwidth reserved for handoff traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9B
• /
• pp.771-777
• /
• 2004

In a COMA system, the capacity is variable and mainly depends on multiple access interference. The multiple access interference has a deep relationship with transmitted or received power. The capacity of COMA2000 system is considered to be limited by the forward link capacity. In this paper, we show that the forward link cell load can be represented by the total transmitted power of base station and we propose a forward link call admission control (CAC) strategy for COMA2000 system. The proposed call admission scheme adopts the rate control algorithm for data call. This call admission scheme enables the system to utilize radio resource dynamically by controlling data rate according to the cell load status, and enhance the system throughput and grade of service (GoS). quality of service(QoS) such as blocking and outage probability.

• Korean Management Science Review
• /
• v.11 no.1
• /
• pp.187-196
• /
• 1994

Time-Space-Time(T-S-T) switching network is modeled as a graceful degrading system. Call blocking probability is defined as a measure of performance. Several performance related measures are suggested under the presence of failure. An optimization model is proposed, which determines optimal values of system parameters of the switching network.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1986.04a
• /
• pp.142-145
• /
• 1986

The traffic characteristics of digital switch network depend on the structure, blocking probability, path searching method and etc. This paper presents the study of TDX-1 switch network traffic capacity by considering some decisive factors such as call processing software, switch network structure and control scheme. Conclusively the study shows that the switch network of TDX-1 can handle approximatly up to 1650 Erlang.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.652-663
• /
• 1996

In this paper, we analyze the blocking probability of a call in a PC communication network. In a PC communication network, a call generated from the PSTN (public switched telephone network) requests the connection to the ICPS(information communication processing system) which interconnects the the PSTN and the PSDN(packet switched data network). Then, as a second step, a packet call is requested to the specific service database attached in the PSDN. The call blocking probabilies are analyzed for these two interface points, the PSTN interface ports of the ICPS and the PSDN interface link of the database. We also present some numerical results to show the effects of the system parameters on the performance of the network. The results show the effects of the capacity of each interface point on the performance point.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1522-1545
• /
• 2012

Call admission control (CAC) plays an important role in mobile cellular network to guarantee the quality of service (QoS). In this paper, a dynamic hybrid CAC scheme with integrated cutoff priority and handoff queue for mobile cellular network is proposed and some performance metrics are derived. The unique characteristic of the proposed CAC scheme is that it can support any number of service types and that the cutoff thresholds for handoff calls are dynamically adjusted according to the number of service types and service priority index. Moreover, timeouts of handoff calls in queues are also considered in our scheme. By modeling the proposed CAC scheme with a one-dimensional Markov chain (1DMC), some performance metrics are derived, which include new call blocking probability ($P_{nb}$), forced termination probability (PF), average queue length, average waiting time in queue, offered traffic utilization, wireless channel utilization and system performance which is defined as the ratio of channel utilization to Grade of Service (GoS) cost function. In order to validate the correctness of the derived analytical performance metrics, simulation is performed. It is shown that simulation results match closely with the derived analytic results in terms of $P_{nb}$ and PF. And then, to show the advantage of 1DMC modeling for the performance analysis of our proposed CAC scheme, the computing complexity of multi-dimensional Markov chain (MDMC) modeling in performance analysis is analyzed in detail. It is indicated that state-space cardinality, which reflects the computing complexity of MDMC, increases exponentially with the number of service types and total channels in a cell. However, the state-space cardinality of our 1DMC model for performance analysis is unrelated to the number of service types and is determined by total number of channels and queue capacity of the highest priority service in a cell. At last, the performance comparison between our CAC scheme and Mahmoud ASH's scheme is carried out. The results show that our CAC scheme performs well to some extend.