• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.523-533
• /
• 2006

We analyze two finite buffers queueing system with priority scheduling dependent upon queue length. Customers are classified into two types ( type-l and type-2 ) according to their characteristics. Here, the customers can be considered as traffics such as voice and data in telecommunication networks. In order to support customers with characteristics of burstiness and time-correlation between interarrival, the arrival of the type-2 customer is assumed to be an Markov- modulated Poisson process(MMPP). The service order of customers in each buffer is determined by the queue length of two buffers. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, performance measures such as loss and mean delay are derived.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.265-266
• /
• 2015

In a recent paper [1], the authors investigated the maximum stable throughput region of a network composed of a rechargeable primary user and a secondary user plugged to a reliable power supply. The authors studied the cases of an infinite and a finite energy queue at the primary transmitter. However, the results of the finite case are incorrect. We show that under the proposed energy queue model (a decoupled M/D/1 queueing system with Bernoulli arrivals and the consumption of one energy packet per time slot), the energy queue capacity does not affect the stability region of the network.

• ETRI Journal
• /
• v.18 no.3
• /
• pp.127-145
• /
• 1996

A new analytic framework based on a linear algebra approach is proposed for examining the performance of a direct sequence spread spectrum (DS/SS) slotted ALOHA wireless communication network systems with delay capture. The discrete-time Markov chain model has been introduced to account for the effect of randomized time of arrival (TOA) at the central receiver and determine the evolution of the finite population network performance in a single-hop environment. The proposed linear algebra approach applied to the given Markov problem requires only computing the eigenvector ${\prod}$ of the state transition matrix and then normalizing it to have the sum of its entries equal to 1. MATLAB computation results show that systems employing discrete TOA randomization and delay capture significantly improves throughput-delay performance and the employed analysis approach is quite easily and staightforwardly applicable to the current analysis problem.

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.1
• /
• pp.191-207
• /
• 2000

Let R be a ommutative ring with unity and F a finite free R-module. For a nonnegative integer r, there exists a natural filtration of$S_r(S_2F)$ such that its associated graded module is isomorphic to $\Sigma_{{\lambda}{\epsilon}{\tau}_r}\;L_{\lambda}F$, where ${\Gamma}_{\gamma}$ set of partitions such that $$\mid${\lambda}$\mid$-2r,{{\widetilde}{\lambda}}-{{\widetilde}{\lambda}}_1},...,{{\widetilde}{\lambda}}_k},\;each\;{{\widetilde}{\lambda}}_t}$,is even. We call such filtrations plethysm formulas. We extend the above plethysm formula to the version of chain complexes. By plethysm formula we mean the composition of universally free functors. $Let{\emptyset}:G->F$ be a morphism of finite free R-modules. We construct the natural decomposition of $S_{r}(S_2{\emptyset})$,up to filtrations, whose associated graded complex is isomorphic to ${\Sigma}_{{\lambda}{\varepsilon}{\tau}}_r}\;L_{\lambda}{\emptyset}$.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.3
• /
• pp.32-37
• /
• 2004

This paper investigates the mathematical model of multi-server retrial queueing system with the Batch Markovian Arrival Process (BMAP), the Phase type (PH) service distribution and the finite buffer. The sufficient condition for the steady state distribution existence and the algorithm for calculating this distribution are presented. Finally, a formula to solve loss probability in the case of complete admission discipline is derived.

• Journal of the Korean Statistical Society
• /
• v.34 no.3
• /
• pp.235-244
• /
• 2005

In recent years, theoretical properties of Bayesian nonparametric survival models have been studied and the conclusion is that although there are pathological cases the popular prior processes have the desired asymptotic properties, namely, the posterior consistency and the Bernstein-von Mises theorem. In this study, through a simulation experiment, we study the finite sample properties of the Bayes estimator and compare it with the frequentist estimators. To our surprise, we conclude that in most situations except that the prior is highly concentrated at the true parameter value, the Bayes estimator performs worse than the frequentist estimators.

• Communications of the Korean Mathematical Society
• /
• v.14 no.3
• /
• pp.611-625
• /
• 1999

We consider ΜΑΡ/G/ 1 finite capacity queue with mul-tiple thresholds on buffer. The arrival of customers follows a Markov-ian arrival process(MAP). The service time of a customer depends on the queue length at service initiation of the customer. By using the embeded Markov chain method and the supplementary variable method, we obtain the queue length distribution ar departure epochs and at arbitrary epochs. This gives the loss probability and the mean waiting time by Little's law. We also give a simple numerical examples to apply the overload control in packetized networks.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.1
• /
• pp.17-28
• /
• 2017

In this paper, we deal with a class of mean-field backward stochastic differential equations (BSDEs) related to finite state, continuous time Markov chains. We obtain the existence and uniqueness theorem and a comparison theorem for solutions of one-dimensional mean-field BSDEs under Lipschitz condition.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.185-191
• /
• 2015

This paper considers a discrete-time buffer system with session-based arrivals, an infinite storage capacity and one unreliable output line. There are multiple different types of sessions and the output line is governed by a finite state Markov chain. Based on a generating functions approach, we obtain an exact expression for the mean buffer content.

• Proceedings of the Korean Society For Composite Materials Conference
• /
• 1999.04a
• /
• pp.1.1-4
• /
• 1999

The toughening mechanism and fracture behavior of rubber/polymer composites were investigated with respect to two factors; (1) the composition ratio of polymers(PPO and PS which have a different chain flexibility) and (ii) the rubber particle size in PPO/PS blend system Izod impact test and fractographic observation of the fracture surface using scanning electron microscope were conducted, Finite element analysis were carried out to gain understanding of plastic deformation(shear yielding and crazing) of these materials.