• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1170-1173
• /
• 1987

A network flow control method, input buffer limit technique which can adjusts the transit traffics in a node, is proposed. The transit traffics that occupy node buffers more threshold are decreased. It has better performance than input buffer limit. The proposed flow control is analyzed by queueing model. Numerical results of some example are shown.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.2
• /
• pp.167-181
• /
• 1995

We develop an analytical model to estimate the time a workpiece spends in both input and output queues in trip-based material handling systems. The waiting times in the input queues are approximated by M/G/1 queueing system and the waiting times in the output queues are estimated using the method discussed in Bozer, Cho, and Srinivasan [2]. The analytical results are tested via simulation experiment. The result indicates that the analytical model estimates the expected waiting times in both the input and output queues fairly accurately. Furthermore, we observe that a workpiece spends more time waiting for a processor than waiting for a device even if the processors and the devices are equally utilized. It is also noted that the expected waiting time in the output queue with fewer faster devices is shorter than that obtained with multiple slower devices.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.3
• /
• pp.171-190
• /
• 2008

With growing applications of wireless video streaming, an efficient video traffic model featuring modern high-compression techniques is more desirable than ever, because the wireless channel bandwidths are ever limited and time-varying. We propose a modeling and analysis method for video traffic by a class of stochastic processes, which we call '$GEO^Y/G/{\infty}$ input processes'. We model video traffic by $GEO^Y/G/{\infty}$ input process with gamma-distributed batch sizes Y and Weibull-like autocorrelation function. Using four real-encoded, full-length video traces including action movies, a drama, and an animation, we evaluate our modeling performance against existing model, transformed-M/G/${\infty}$ input process, which is one of most recently proposed video modeling methods in the literature. Our proposed $GEO^Y/G/{\infty}$ model is observed to consistently provide conservative performance predictions, in terms of packet loss ratio, within acceptable error at various traffic loads of interest in practical multimedia streaming systems, while the existing transformed-M/G/${\infty}$ fails. For real-time implementation of our model, we analyze G/D/1/K queueing systems with $GEO^Y/G/{\infty}$ input process to upper estimate the packet loss probabilities.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.643-658
• /
• 1998

In this paper we analyze the performance of a statistical ATM multiplexer with bursty input traffic and two thresholds in the buffer by using queueing model. Two priority levels are considered for source traffic which is modeled by Markov Modulated Poisson Process to represent the bursty characteristics. Service time distributions of two priority sources are assumed to be same and deterministic for ATM environment. The partial buffer sharing scheme with one threshold may experience a sensitive state change around the threshold. But the proposed multiplexer with two thresholds avoids this hysterical phenominon to improve the system operation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.415-417
• /
• 2001

RED 알고리즘은 큐 avg가 threshold를 넘으면 일정한 확률로 패킷을 drop하여 congestion을 제어하는 알고리즘이다. RED 알고리즘은 큐 자신의 avg만을 고려하여 drop 확률을 결정한다. 하지만, VOQ를 사용하는 input queueing에서 같은 출력 단을 목적지로 하는 다른 큐들의 사이즈가 큐 내부에서의 delay에 영향을 미치기 때문에 그 큐들의 avg를 고려하는 것이 필요하다. 본 논문에서는 기존의 RED 방법의 drop 확률 결정에서 같은 출력 단을 목적지로 하는 큐들의 avg 값을 고려하는 알고리즘을 제안한다. 시뮬레이션을 통하여 제안한 알고리즘을 구현하고, 성능을 기존의 RED 알고리즘과 비교한다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.3
• /
• pp.47-61
• /
• 1996

An ATM switch must deal with various kinds of input sources having different traffic characteristics and it must guarantee very small value of cel loss probability, about 10$^{8}$ -10$^{12}$ , to deal with loss-sensitive traffics. In order to estimate such a rate event probability with simulation procedure, a variance reduction technique is essential for obtaining an appropriate level of precision with reduced cost. In this paper, we propose a hybrid simulation technique to achieve reduction of variance of cell loss probability estimator, where hybrid means the combination of analytical method and simulation procedure. A discrete time queueing model with multiple input sources and a finite shared buffer is considered, where the arrival process at an input source and a finite shared buffer is considered, where the arrival process at an input source is governed by an Interrupted Bernoulli Process and the service rate is constant. We deal with heterogeneous input sources as well as homogeneous case. The performance of the proposed hybrid simulation estimator is compared with those of the raw simulation estimator and the importance sampling estimator in terms of variance reduction ratios.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.4
• /
• pp.1-9
• /
• 2001

In this paper, we propose Fuzzy M/M/1/K queueing network model which has derived by appling the fuzzy set theory to M/M/l/K queueing network model in which has single server and system capacity K. When the arriving rate of input job and the servicing rate of a server arc represented as the linguistic attributes, the system analysis can be performed by using this model. The major evaluation measures of system such as the average number of jobs existing in the system, the average number of jobs into system, and the average spending time of job in system etc. are derived for the evaluation of system. Computer simulation was performed for verifying the effectiveness of these result equations. In which the various fuzzy arriving rates and fuzzy servicing rates according to varying the system capacity K were given for the system evaluation. We verified that the results of simulation are in accord with the expected evaluations in the proposed fuzzy model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.10
• /
• pp.2014-2027
• /
• 1994

A queueing model with two input streams of different service priorities is studied. Specifically, IBP+BP/D/1 with head-of-line priority is analyzed. IBP and BP stand for Interrupted Bernoulli Process and Bernoulli Process respectively. The BP-stream customers have the higher service priority over the IBP-stream customers. An exact analysis of this priority queue is presented to derive the distributions of the state of the system at steady state, the waiting time distributions for each class of customers, and the interdeparture time distributions. The numerical results of the analysis are presented to show how the various parameters of the low and high priority arrival processes affect the performance of the system.

• ETRI Journal
• /
• v.24 no.4
• /
• pp.311-322
• /
• 2002

Presently, optical burst switching (OBS) technology is under study as a promising solution for the backbone of the optical Internet in the near future because OBS eliminates the optical buffer problem at the switching node with the help of no optical/electro/optical conversion and guarantees class of service without any buffering. To implement the OBS network, there are a lot of challenging issues to be solved. The edge router, burst offset time management, and burst assembly mechanism are critical issues. In addition, the core router needs data burst and control header packet scheduling, a protection and restoration mechanism, and a contention resolution scheme. In this paper, we focus on the burst assembly mechanism. We present a novel data burst generation algorithm that uses hysteresis characteristics in the queueing model for the ingress edge node in optical burst switching networks. Simulation with Poisson and self-similar traffic models shows that this algorithm adaptively changes the data burst size according to the offered load and offers high average data burst utilization with a lower timer operation. It also reduces the possibility of a continuous blocking problem in the bandwidth reservation request, limits the maximum queueing delay, and minimizes the required burst size by lifting up data burst utilization for bursty input IP traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1289-1295
• /
• 1999

본 논문에서는 스위치의 운용 알고리즘에 따라 시뮬레이션 프로그램을 이용하여 입/출력 버퍼의 셀 손실율을 측정하였다. 그 결과 셀 손실에 영향을 주는 요소로서, 셀 도착 간격 시간(k(a))과 SPEEDUP FACTOR(SF) en 가지 요소에 따라 셀손실을 평가할 수 있음을 알 수 있었다. 셀 도착 간격 시간 혹은 주기성은 비트가 셀로 모이는데 걸리는 시간을 의미하며 스위치 속도 SF는 임의의 한 슬롯내에서 한 입력단에서 출력단으로 서비스 가능한 셀의 수를 나타내고 있다. 시뮬레이션의 결과에서 보면 입력 버퍼에서는 주지성에 따라, 출력 버퍼에서는 SF의 크기에 따라 셀손실율이 커진다는 사실을 알 수 있었다. 따라서 보다 정확한 고속 스위칭 향상을 위해서는 입/출력 버퍼의 크기 결정이 중요하다. 본 논문의 시뮬레이션 결과에서는 입력 버퍼가 100x셀 일 때 출력 버퍼가 40x셀 정도의 크기가 적합하다는 것을 얻어내었다. 물론 입/출력 버퍼를 크게 한다면 셀 손실이 작아지지만, 하드웨어를 구성하는데 문제점이 발생될 것이기 때문이다. 그리고 본 논문 결과치중 셀 도착 분포 상황은 변동계수 모델링 성정에 따라 SF가 처리하는 서비스의 셀 도착 분포에 의 \ulcorner달라지지만, 변동계수가 전혀 없는 이상적인 경우(CV=1)를 제외한 경우의 SF값을 만족한다고 하겠다. 끝으로 입/출력 버퍼를 가진 스위치 구조는 단지 출력 버퍼를 갖는 스위치 보다 지연이 크지만, VLSI의 발달로 셀의 처리 속도가 증가하므로 더 많은 장점을 갖게 될 것이다.