• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.721-724
• /
• 2010

In a network router, packet loss may occur when it overflows due to sudden burst traffic. This paper studies how much large buffers are required to eliminate the packet losses. There are buffers on which packet arrive and one output port to which a packet is transmitted at a time. The buffer management algorithm should determine one of the buffers whose packet is transmitted to the output port at each time. The front packet belonging to the buffer determined by the algorithm is transmitted. The goal is to minimize the sum of the lengths of buffers to transmit all the packets. We provide an optimal off-line algorithm and also we show the lower bounds of on-line algorithms. The on-line algorithm has no prior information of the packets having arrived in the future. Its performance is compared to that of the optimal off-line algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.15 no.26
• /
• pp.151-157
• /
• 1992

This paper presents a method for analyzing the transfer lines with finite storage buffers. Each machine spends a random amount of time processing each material. This transfer line can be modeled by the tandem queueing system with finite buffers. The great dimensionality of the state space renders the analysis of such system a formidable task. We propose an efficient algorithm to obtain the marginal state probabilities based on the exact algorithm for the two-machine system. Other performance measures, such as the utilization, the blocking probability, the average sojourn time, and the average queue length, can be easily calculated.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.2
• /
• pp.73-80
• /
• 2005

In this paper, we consider characteristics of waiting times in s1n91e-server 3-node tandem queues with finite buffers, a Poisson arrival process and deterministic service times at all nodes. There are three buffers : one at the first node is infinite and the others are finite. We obtain the fact that sojourn time or departure process is independent of the capacities of the finite buffers and does not depend on the order of service times, which are the same results in the literature. Moreover, the explicit expressions of stationary waiting times in all areas of the systems can be derived as functions of the finite buffer capacities. We also disclose a relationship of waiting times in subareas of the systems between two blocking policies communication and manufacturing. Some numerical examples are also provided.

• 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 Korean Society of Industrial and Systems Engineering
• /
• v.43 no.4
• /
• pp.1-14
• /
• 2020

Recently, M/G/1 priority queues with a finite buffer for high-priority customers and an infinite buffer for low-priority customers have applied to the analysis of communication systems with two heterogeneous traffics : delay-sensitive traffic and loss-sensitive traffic. However, these studies are limited to M/G/1 priority queues with finite and infinite buffers under a work-conserving priority discipline such as the nonpreemptive or preemptive resume priority discipline. In many situations, if a service is preempted, then the preempted service should be completely repeated when the server is available for it. This study extends the previous studies to M/G/1 priority queues with finite and infinite buffers under the preemptive repeat-different and preemptive repeat-identical priority disciplines. We derive the loss probability of high-priority customers and the waiting time distributions of high- and low-priority customers. In order to do this, we utilize the delay cycle analysis of finite-buffer M/G/1/K queues, which has been recently developed for the analysis of M/G/1 priority queues with finite and infinite buffers, and combine it with the analysis of the service time structure of a low-priority customer for the preemptive-repeat and preemptive-identical priority disciplines. We also present numerical examples to explore the impact of the size of the finite buffer and the arrival rates and service distributions of both classes on the system performance for various preemptive priority disciplines.

• Journal of Korea Multimedia Society
• /
• v.8 no.2
• /
• pp.249-257
• /
• 2005

This paper aims at reducing aliasing in pixel-based rendering for 3D implicit surfaces by shifted multi Z-buffers. The voxelized implicit surfaces with high resolution take so much time in generating high Quality image without aliasing. So in rendering a voxelized implicit surfaces, a new antialiasing method which can generate a high quality image at a lower resolution is required. Therefore, this paper suggests that a method which get various sampling values by shifting several z-buffers in each voxel and average them, The advantages are effective memory, simple calculation and easy convergence with various filters. But, the increase of number of z-buffer also increase the consuming time rapidly. Therefore, the research for representing the relation the degree of image quality with the consumption of time as a number is required.

• Industrial Engineering and Management Systems
• /
• v.11 no.4
• /
• pp.397-405
• /
• 2012

This research proposes a framework of buffer management for multi-project systems in the critical chain project management (CCPM) method, expressed in the form of max-plus linear (MPL) representation. Since time buffers are inserted in the projects for absorbing uncertainties in task durations and protecting the completion times, the proposed method provides a procedure for frequently surveying the rates of consumed buffers and the rate of elapsed times. Their relation expresses the performance of the projects which is plotted on a chart through the completed processes. The chart presents the current performance of the projects and their interaction, which alerts managers to make necessary decisions at the right time for managing each project and the entire multi-project system. The proposed framework can analyze the complex system readily, and it enables managers to make an effective decision on scheduling. The effectiveness of the framework is demonstrated through a numerical example.

• Journal of the Korea Computer Graphics Society
• /
• v.2 no.2
• /
• pp.1-9
• /
• 1996

It is important issue to increase the efficiency of visibility operations in rendering since the most of rendering time is spent for performing visibility operations. In this paper, we present light buffers of area light sources, which provide efficient visibility operations from the sources. The light buffers are extended to support visibility operations not originated from the sources. We also explore their applications such as shadow generation, ray tracing and radiosity. Our experimental results show that the light buffers support more efficient visibility operations than the previously developed data structures including BSP trees, linear grids, and octrees.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.1
• /
• pp.123-140
• /
• 1997

In this paper we consider closed flow line systems with samploing inspections. The total number of parts in the system is assumed to be N. The processings carried out of each station do not always meet the requirement of quality. Therefore, upon completion of its processing at each station, a part is inspected to determine whether the processings meet the requirement of quality or not. We assume that inspection are done on a random basis. If a part is found to be defective by an inspection, it is fed back to the apropriate station. Two different cases will be considered in this study : a three-station flow line system with infinite buffers and a two-station flow line system with finite buffers. For each case, we will develop an exact method to obtain the performance measures such as throughput, machinen utilization, average outgoing quality and manufacturing lead time. For the case of the two-station flow line system ith finite buffers, we will also develop an approximation method using a stage-aggregation technique. Then using buffers, we will also develop an approximation method using a stage-aggregation technique. Then using these results, we will try to find an optimal inspection policy which maximizes the expected net profit under a certain cost structure. Although we present the results only for the two or three station flow line system in this paper, the results obtained in this paper can be extended easily to the system which consists of more than two or three stations.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.84.3-84
• /
• 2001

Suggesting the standard of optimal transferring for one RGV or two RGV, which have multiple buffers, using average delivery time and sigma in the straight line working place. For performing the optimal transferring, present RGV-Job Dispatching algorithm, which is possible to apply in realtime, and apply random job occurrence conditions for examining the possibility to apply various real environments.