• ETRI Journal
• /
• v.36 no.4
• /
• pp.609-616
• /
• 2014

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 (transform-free) formulae for a blocking probability, a stationary probability, and mean sojourn time under either production or communication blocking policy. Additionally, the smallest buffer capacity subject to a given blocking probability can be determined numerically from these formulae. With proper selection of the overall offered load ${\rho}$, the approach described herein can be applicable to more general queues from a computational point of view if the explicit expressions of random vector $D_n$ are available.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.2
• /
• pp.203-213
• /
• 1996

A system is considered which is required to perform tasks that arrive randomly during a fixed mission duration. We develop queueing models to obtain the mission effectiveness and the blocking probabilities. Exact probabilities are computed by using the Finite Fourier Cosine Transform.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1393-1400
• /
• 2006

This paper optimizes the access probabilities (APs) in a network resource allocation scheme based on access probabilities in order that the waiting time and the blocking probability are minimized under the given constraints, and obtains its performance. In order to optimize APs, an infinite number of balance equations is reduced to a finite number of balance equations by applying Neuts matrix geometric method. And the nonlinear programming problem is converted into a linear programming problem. As a numerical example, the performance measures of waiting time and blocking probability for optimal access probabilities and the maximum utilization under the given constraints are obtained. And it is shown that the scheme with optimal APs gives more performance build-up than the strategy without optimization.

• ETRI Journal
• /
• v.20 no.2
• /
• pp.115-132
• /
• 1998

This paper proposes an extended service filtering technique to prevent overload in service control point (SCP) due to televoting (VOT) or mass calling (MAS) services with the heavy traffic characteristics. Also, this paper compares this extended technique with the existing overload control techniques, and calculates steady state call blocking probabilities in intelligent network (IN) under overload conditions. The proposed technique considers SCP overload and IN Capability Set (CS)-1 services (such as VOT or MAS service) that have to use the specialized resources of intelligent peripheral (IP). This technique uses first an activating step in which SCP requests service filtering to service switching point (SSP). Then, in the filtering step, SSP sends filtering results to SCP periodically or each N-calls. Also, when filtering time-out expires, SSP stops service filtering, and sends service filtering response to SCP in the deactivating step. This paper applies this technique to VOT/MAS service, and calculates SCP and SSP-IP (circuit) call blocking probabilities by using an analytical VOT/MAS service model. With the modeling and analyzing of this new technique, it shows that this technique reduces the traffic flow into SCP from SSP and IP prominently.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.167-170
• /
• 2006

Most wavelength assignment algorithms assume that every node has infinite ADMs and I/O blocking is excluded. Furthermore wavelengths continue to occur intermittently in the network using existing algorithms. This can result in increased link blocking under dynamic traffic circumstances. In audition, it can create time-complexity problems such as O(W $N^3$) in the worst case scenario. In this paper, we propose a new wavelength assignment algorithm which has time-complexity of O(W $N^2$) and considers both I/O and link blocking. The basic idea is to maximize the number of links where wavelengths will be assigned continuously after present assignment. As a result, the number of intermittent wavelengths is minimized, and blocking probabilities are decreased.

• 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 KIISE:Computing Practices and Letters
• /
• v.13 no.7
• /
• pp.535-539
• /
• 2007

We study an degree of alternativeness and a survivability of alternate routing algorithm in mobile ad-hoc tactical communication networks. The common channel signaling scheme is used and flood search routing algorithm is used for analysis. We also study a connectivity performance for flood search routing, restricted flooding and hybrid routing. From the results we expect low blocking probabilities with alternate routing and the conventional flood search routing shows better connectivity performance which results in high survivability.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.237-239
• /
• 2007

In the paper, we analyze the performances of random access channels in multi-service multi-user OFDMA systems. The resource of the random access channels in OFDMA systems is the nubmer of available sub-channels and PN-codes. For given available sub-channels and PN-codes. we analyze the performances of the random access channels of OFDMA systems according to three resource allocation methods (resource full sharing, resource partial sharing, resource partition) in tenus of the access success probability, the blocking probability, the access delay and the throughput of each service class. Further, we find the feasible region of the access probability of each service class in which the allowable minimum access success probability, the allowable maximum blocking probability and the allowable maximum access delay are satisfied. The results also can be utilized to find proper region of the access probabilities of each service class for differentiated quality of service(QoS)s, and for the system operations.

• ETRI Journal
• /
• v.32 no.4
• /
• pp.622-625
• /
• 2010

In this letter, we assess the scalability of a path computation flooding (PCF) approach to compute optimal end-to-end inter-domain paths in a path computation element-based multi-domain network. PCF yields a drastically reduced network blocking probability compared to a blind per-domain path computation but introduces significant network control overhead and path computation complexity. In view of this, we introduce and compare an alternative low overhead PCF (LoPCF) solution. From the obtained results, LoPCF leads to similar blocking probabilities to PCF while exhibiting around 50% path computation complexity and network control overhead reduction.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1300-1312
• /
• 1991

In this paper we syudy the time slot sequence integrity(TSSI) of multi-slot calls in the single-buffered switching networks and analyze their traffic characteristics in terms of traffic mixture ratio, number of random searches for idle time slots, and their blocking probablities. This result can be utilized in the design of wideband switching networks in the single buffered systems, such as TDX IA/B swithcing systems, for accommodating multi slot calls.