http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
임종설 한국전산응용수학회 2013 Journal of applied mathematics & informatics Vol.31 No.5
This paper focuses on the situation of optimizing the total cost with m given messages and n network nodes. Associated with each network node, a fixed cost is incurred to the receiver if at least one message is received. The mean and variance of the total costs are obtained. Normal approximation is used. Empirical results showed that the derived method reduces research work substantially
An analysis of the memory related communication system
임종설,Chin-Hong Park 한국전산응용수학회 2004 Journal of applied mathematics & informatics Vol.16 No.-
We consider communication or computer systems that havethe average memory occupancy and congestion. A certain system may bereduced further if new processes are admitted only when the number ofprocesses queued at the processor is below a certain threshold, run queuecuto(RQ). We show that response time of a process is invariant withrespect toRQ when processes do not communicate each other. The invari-ance property is considered with the evolution of the queue lengths as pointprocesses and demonstrate it numerically using matrix-geometric methods.We illustrate the RQ invariance property.
THE QUEUE LENGTH DISTRIBUTION OF PHASE TYPE
임종설,안성준 한국전산응용수학회 2007 Journal of applied mathematics & informatics Vol.24 No.1
Abstract. In this paper, we examine the Markov chain {Xk, Nk; k = 0, 1, ...}. We show that the marginal steady state distribution of Xk is discrete phase type. The implication of this result is that the queue length distribution of phase type for large number of examples where this Markov chain is applicable and shows a queueing application by matrix geometric methods.
AN INTERPOLATION APPROXIMATION VIA SIMULATION ON A QUEUEING NETWORK
임종설 한국전산응용수학회 2002 Journal of applied mathematics & informatics Vol.9 No.2
In this paper we consider open queueing system with a Poissonarrival process which have a finite upper bound on the arrivalrate for which the system is stable. Interpolation approximationsfor quantities of interest, such as moments of the sojourn timedistribution, have previously been developed for such systems,utilizing exact light and heavy traffic limits. These limitscannot always be easily computed for complex systems. Thus weconsider an interpolation approximation where all of the relevantinformation is estimated via simulation. We show that all therelevant information can in fact be simultaneously estimated in asingle regenerative simulation at any arrival rate. In addition tolight and heavy traffic limits, both the quantity of interest andits derivative (with respect to the arrival rate) are estimated atthe arrival rate of the simulation. All of the estimates are thencombined, using a least squares procedure, to provide aninterpolation approximation.
Some waiting time analysis for certain queueing policies
임종설 한국전산응용수학회 2011 Journal of applied mathematics & informatics Vol.29 No.1
In a M/G/I queue where the server alternates between busy and idle periods, we assume that firstly customers arrive at the system according to a Poisson process and the arrival process and customer service times are mutually independent, secondly the system has infinite waiting room, thirdly the server utilization is less than 1 and the system has reached a steady state. With these assumptions, we analyze waiting times on the systems where some vacation policies are considered.
임종설 선문대학교 1994 鮮文論叢 自然科學 編 Vol.- No.4
CDMA(Code Division Multiple Access) Cellular 이동통신 시스템 성능향상의 중요한 요소로서 용량(Capacity)증대를 들 수 있다. 통상 CDMA Cellular 이동통신 시스템은 기존 아날로그 시스템 보다 20배, TDMA(Time Division Multiple Access) 시스템보다는 6배 정도의 용량을 갖는 것으로 알려졌다. 이 논문은 스펙트럼 효율면에서의 용량증대에 대한 기본적인 이슈를 소개하고 CDMA 시스템이 기존 아날로그(Analog) Cellular 이동통신 시스템보다 약 20배 정도의 용량증대가 가능하다는 것을 보여준다.
General formulas of some vacation models
임종설 한국전산응용수학회 2008 Journal of applied mathematics & informatics Vol.26 No.1
This paper describes a single-server queue where the server is unavailable during some intervals of time, which is referred to as vacations. The major contribution of this work is to derive general formulas for the additional delay in the vacation models of the single vacations, head of line priority queues with non-preemptive service, and multiple vacations and idle time.
SOME WAITING TIME AND BOTTLENECK ANALYSIS
임종설 한국전산응용수학회 2010 Journal of applied mathematics & informatics Vol.28 No.1
In this paper, some vacation policies are considered, which can be related to the past behavior of the system. The server, after serving all customers, stays idle or to wait for some time before a vacation is taken. General formulas for the waiting time and the amount of work in the system are derived for a vacation policy. Using the analysis on the vacation system, we derived the waiting time in the sequential bottleneck station.