• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1987.04a
• /
• pp.98-102
• /
• 1987

본 논문에서는 유한 축적용량과 단일 도기 서버를 갖는 패킷 스위칭 노드로서 처리량이 향상될 수 있도록 하는 버퍼 운용방법으로 패킷 교체 수용 큐잉 시스템을 제시하였다. 시스템의 해석은 J.F CMANG 과 R.F CHAMG 이 제안한 시간 미소 단위 근사법을 이용하였다. 위의 시스템과 기존적인 패킷 수용 방법으로서 패킷이 시스템에 도착하는 순서에 따라 수용되어 처리 되는 J.F CHANG 과 R.F CHANG 이 해석한 큐잉 시스템에 대한 성능을 처리량과 시험옥텟의 Rjocking 확률로 비교한 결과 패킷 교체 수용 큐잉시스템의 성능이 더 향상되었음을 보였으며, 이 해석적 결과로 컴퓨터 시뮬레이션으로 검증하였다.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.247-250
• /
• 1998

In this paper, a special kind of timer-controlled network is analyzed. A timer-controlled network with an immediate response scheme is modeled and analyzed. It is assumed that each station on the network has single buffer and individual finite number of maximum retransmission limit. The physical meanings of derived results are briefly explained, which prove that the results completely coincide with the physical operations of that kind of network. It is also shown by computer simulations that derived analysis results are valid.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.257-260
• /
• 2000

본 연구에서는 유한용량을 갖는 조립/분해 생산시스템의 산출율분석을 위한 근사적 방법을 제시한다. 유한용량을 갖는 조립/분해 생산시스템은 상태공간이 매우 크기 때문에 효율적으로 분석하기가 어렵다. 따라서 근사적 방법에서는 조립/분해 생산시스템을 비교적 작은 규모의 상태공간을 갖도록 단순 조런/분해 시스템과 단일 직렬시스템을 갖는 각각의 부분시스템으로 분해한다. 각 부분시스템은 2차 모멘트가 고려된 PH/Ph/1/C 시스템으로 기술되고 수리적 방법에 의해 분석되어진다. 실험결과는 시뮬레이션과 비교되고, 제시된 근사적 방법이 효과적이라는 것을 보여준다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.769-778
• /
• 1997

Assembly/Disassembly Queueing Networks (ADQNs) with finite buffers have been used as a major tool for evaluating the performances of manufacturing and parallel processing systems. In this study, we present simple but effective methods which yield throughput upper and lower bounds for ADQNs with exponential service times and finite buffers. These methods are based on the monotonicity properties of throughputs with respect to service times and buffer capacities. The throughput-upper bounding method is elaborated on with general network configuration (specifically acyclic configuration). But our lower bounding method is restricted to the ADQNs with more specialized configuration. Computational experiments will be performed to confirm the effectiveness of our throughput-bounding methods.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.8 no.6
• /
• pp.165-175
• /
• 2000

In order to improve the function of a door seal, its section design technique is discussed in this study, Its roles are prevention of an inflow of dusts, noise interception, insulation, wateproof, and the vibroisolating action which reduces vibration between the body and the door of a car while running, and the buffer action which sustain the proper reacting force as the door is closed. In this study, the optimal cross section of a door seal is designed using nonlinear finite element analysis (commercial finete element analysis program EASi-SEAL) and tables of orthogonal arralys with respect to relations between door and door seal to secure the satisfactory airtight property with the minimum force to shut the door.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.4
• /
• pp.673-689
• /
• 2009

We analyze $MAP_1,\;MAP_2$/G/1 finite queues with service scheduling function dependent upon queue lengths. The customers are classified into two types. The arrivals of customers are assumed to be the Markovian Arrival Processes (MAPs). The service order of customers in each buffer is determined by a service scheduling function dependent upon queue lengths. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, the performance measures such as loss probability and mean waiting time are derived. Some numerical examples also are given with applications in telecommunication networks.

• 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 Korea Society of Digital Industry and Information Management
• /
• v.13 no.3
• /
• pp.35-42
• /
• 2017

This paper presents hardware implementation of background timing-skew calibration technique for time-interleaved analog-to-digital converters (TI ADCs). The timing skew between any two adjacent analog-digital (A/D) channels is detected by using pure digital Finite Impulse Response (FIR) delay filter. This paper includes hardware architecture of the system, main units and small sub-blocks along with control logic circuits. Moreover, timing diagrams of logic simulations using ModelSim are provided and discussed for further understanding about simulations. Simulation process in MATLAB and Verilog is also included and provided with basic settings need to be done. For hardware implementation it not practical to work with all samples. Hence, the simulation is conducted on 512 TI ADC output samples which are stored in the buffer simultaneously and the correction arithmetic is done on those samples according to the time skew algorithm. Through the simulated results, we verified the implemented hardware is working well.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.14 no.6
• /
• pp.575-593
• /
• 2012

This paper briefly introduces the scope and objectives of SKB Task 8, which is an international cooperative research project. In addition, the hydraulic behaviors of bentonite buffer focusing on the interactions between bentonite and a rock mass with a joint were investigated using TOUGH2 code as part of a sub-mission of Task 8a. The effects of a rock joint and high capillary pressure of bentonite on the re-saturation properties and pressure distribution in a buffer were identified and successfully incorporated in the TOUGH2 code. Based on the numerical results, it was found that the speed of re-saturation in bentonite surrounded by a rock mass with a joint is 2.5 to 12 times faster than that in a condition without a rock joint, while the degree of saturation in the lower part of the buffer material is generally higher than in the upper part in both the cases of with and without a joint. It can be anticipated that the results obtained from this study can be applied to an estimation of the full saturation time and a determination of optimum thickness with regard to the design of the bentonite buffer in a high level waste disposal system.

• Journal of the Korea Society for Simulation
• /
• v.21 no.4
• /
• pp.11-24
• /
• 2012

We compared a DBR(drum-buffer-rope) system with a CONWIP(constant work-in-process) system in a production line with constant processing times. Based on the observation that a WIP-controlled line production system such as DBR and CONWIP is equivalent to a m-node tandem queue with finite buffer, we applied a max-plus algebra based solution method for the tandem queue to evaluate the performance of two systems. Numerical examples with 6 workstations were also used to demonstrate the proposed analysis. The mathematical analyses support that CONWIP outperforms DBR in terms of expected waiting time and WIP. Unlike the CONWIP case, sequencing workstations in a DBR affects the performance of the system. Delaying a bottleneck station in a DBR reduces expected waiting time.