• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.241-247
• /
• 2008

In this study we consider an M/D/1 queue with a finite buffer. Due to the finiteness of the buffer capacity arriving customers can not join the system and turn away without service when the buffer is full. Even though a computational method for blocking probabilities in an M/D/1/K queue is already known, it is very complex to use. The aim of this study is to propose a new way to compute blocking probability by using (max,+)-algebra. Our approach provide a totally different and easier way to compute blocking probabilities and it is, moreover, immediately applicable to more generous queueing systems.

• Journal of the Korea Society for Simulation
• /
• v.28 no.2
• /
• pp.119-129
• /
• 2019

Although line production systems with finite buffers have been studied over several decades, except for some special cases there are no explicit expressions for system performances such as waiting times(or response time) and blocking probability. Recently, a max-plus algebraic approach for buffer-sharing systems with constant processing times was introduced and it can lead to analytic expressions for (higher) moment and tail probability of stationary waiting. Theoretically this approach can be applied to general processing times, but it cannot give a proper way for computing performance measures. To this end, in this study we developed simulation models using @RISK software and the expressions derived from max-plus algebra, and computed and compared blocking probability, waiting time (or response time) with respect to two blocking policies: communication(BBS: Blocking Before Service) and production(BAS: Blocking After Service). Moreover, an optimization problem which determines the minimum shared-buffer capacity satisfying a predetermined QoS(quality of service) is also considered.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.4
• /
• pp.17-24
• /
• 2004

Call blocking probabilities of streaming data service in CDMA system with access point(AP) of WLAN are analyzed for different cell geometry of base station and AP and queuing is modeled. The considered system leads to successful handoffs between the APs of WLAN. Blocking probabilities are enumerated as a function for ratio of base station and AP sizes, their locations and the number of buffer in the queue. Results show that blocking probability is not influenced by base station and AP locations but mainly by ratio of their sizes. For CDMA system of radius 100m, 5 buffers in the queue and 7㏈ noise rise(NR), in order to obtain 1% call blocking probability, a cell with hot spot of radius 20m has more 0.6Erlang than that of radius 60m.

• Review of KIISC
• /
• v.22 no.3
• /
• pp.37-40
• /
• 2012

국내 이동통신 3사는 스팸피해로부터 가입자를 보호하기 위해 '지능형 스팸차단 서비스'를 부가서비스로 제공하고 있다. 이 서비스는 형태소 분석, 확률 계산 등을 통해 스팸일 가능성을 이통사 시스템이 판단하여 차단해주는 것으로, 청소년 보호에 효과가 높다. 이통3사는 2011년 6월, 청소년 대상으로 이 서비스의 일괄가입을 완료하였다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.13 no.9
• /
• pp.947-955
• /
• 2002

In this paper, we derive an outage probability for the Erlang capacity and the link margin respectively, calculate them with the same parameters and outage probability, and then analyze a capacity and cell coverage in city, suburban, and open area. So, the Erlang capacity is more real than in a cell, and the cell coverage can be calculated with high reliability by the margin. When the $E_b/N_o$ decreases from 7 dB to 5 dB within the outage probability of 5 %, it is observed that the capacity is increased from 18 Erlang to 31 Erlang with the same margin of 2.8 dB, then the coverage is increased to 0.4 km, 1 km, and 2.5 km in city, suburban, and open area respectively. Also if the outage probability is decreased from 5 % to 2 % in case of $E_b/N_o$ of 5 dB, the result shows a very reliable link with additional increment of 0.88 dB in the margin and a high QoS (quality of service) within decrement of 0.15 km, 0.5 km, and 1.5 km for the same areas with decrement of 3 Erlang from 31 Erlang.

• Journal of Advanced Navigation Technology
• /
• v.13 no.3
• /
• pp.372-377
• /
• 2009

This paper evaluates the performance of three methods for predicting resources requested by mobile's calls and a call admission algorithm based on these predicting methods respectively in wireless networks. The first method is based on Wiener prediction model and the second method is based on the MMOSPRED algorithm and the third method is based on the neural network. The proposed call admission algorithm is based on prioritized handoff call in resource allocation. The resources for future handoff calls are therefore predicted and reserved in advance, and then new calls are admitted as long as the remaining resources are sufficient. We compare their performances in terms of prediction error, new call blocking and handoff dropping probabilities by simulation. Results show that the CAC based on Wiener prediction model performs favorably due to exact resources prediction.

• Journal of the Korea Society of Computer and Information
• /
• v.1 no.1
• /
• pp.25-36
• /
• 1996

We have analyzed the reliability of failure models In grid topology circuit switched networks. These models are grid topology circuit_ switched networks. and each node transmits packets to object node using flooding search routing method. We hypothesized that the failure of each link Is Independent. We have analyzed for the performance estimation of failure models It using joint probability method to the reliability of a small grid topology circuit switched network. and compared analytic output with simulated output. Also. We have evaluated the reliability of networks using call blocking Probability occurred in circuit switched networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1282-1289
• /
• 2000

In this paper we propose a Fractional Channel Reservation (FCS) scheme to satisfy a desired handoof dropping probability and to reduce the blocking probability of new calls using mobility characteristics and incoming handoff rate in mobile communication networks. When the ratio of the handoff call arrival rate is less then the ratio of the new call arrival rete, the proposed scheme is capable of determining the number of the guard channels which can guarantee the Quality of Service(QoS) in terms of the request handoff dropping probability and allocating dynamically the wireless channels the new calls according to the rest of the guard channels to reduce the new call blocking probability. Also we perform mathematical analysis and simulation to evaluate the performance of proposed scheme and compare to conventional guard channel scheme in terms of dropping probability blocking probability and the utilization efficiency of wireless channels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4A
• /
• pp.471-480
• /
• 2000

With the limited wireless resources, various traffic in the cellular system is served based on micro-cell or pico-cell structure. The rapid increase in the number of mobile users results in the frequent handoff which is becoming a critical issue. In this paper, we propose a channel allocation scheme to reduce the probability of handoff failure. In this scheme, we provide a guard channel for each service to handle the handoff processes. It maintains the low probability of failure in handoff calls. To prevent the performance degradation due to the traffic variation, we use a channel arbitration method that adaptively manages the number of channels based on the call density. We evaluated the performance in terms of the initial call blocking probability and the handoff call blocking probability for various traffic and motility. We found that the proposed scheme keeps the lower probability of call blocking through the efficient channel arbitration than other suggested methods even for the irregular traffic conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12A
• /
• pp.975-982
• /
• 2003

A connection admission control scheme is proposed that can seamlessly support QoS in face of handoff in mobile packet networks. The proposed scheme is based on the adaptive time-selective bandwidth reservation with the reduced signaling and computational overhead. The reservation parameters are adjusted dynamically to cope with user mobility. Throughout the computer simulations, the performance of the proposed scheme is evaluated. As a result, it is shown that the proposed scheme reduces handoff call blocking probability remarkably, while other parameters (new call blocking probability and bandwidth utilization efficiency) are slightly deteriorated.