• ETRI Journal
• /
• v.10 no.2
• /
• pp.40-51
• /
• 1988

ISDN(Integrated Services Digital Network) 개념의 도입은 기존의 회선교환망이나 패킷교환망과 같은 단일망에 대한 전통적인 트래픽 엔지니어링에 많은 문제점들을 제시하여 주고 있다. 즉, 가입자간 정보전송 속도 및 트래픽 특성의 다양화, 신호와 정보의 분리, 교환접속방식의 다양화 등 복잡하며 다양한 특성을 가진 ISDN 교환기의 트래픽 해석은 전통적인 큐잉이론 및 트래픽 이론을 직접 적용하는데 많은 제한 사항이 따른다. 그러므로 ISDN 교환기의 트래픽을 해석하기 위해서는 새로운 이론정립과 아울러 새로운 ISDN 트래픽 변수들을 도출하여 특성을 해석해야 할것이다. 이런 목적하에서 본고에서는 ISDN 트래픽 특성 및 성능, ISDN 트래픽이 교환기에 미치는 영향, CPE(Customer Premises Equipment)의 offered 트래픽 및 ISDN 교환기의 트래픽 엔지니어링 등에 관해 기술하였다.

• Review of KIISC
• /
• v.10 no.1
• /
• pp.39-49
• /
• 2000

본 논문에서는 큐잉 이론을 바탕으로 한국형 한정 수신 시스템인 Digipass-2 성능 분석을 한다. 기간별 예상 가입자 수 증가에 따른 최적의 키 생성 및 전달 주기를 산정하고, 최적의 키 관리 주기에 따른 최대/최소 키 전달 시간을 산정한다. 또한 기간별 예상 가입자수 증가에 따른 과금 데이터 수입에 최적 전용선 용량을 산정하고, 과금 데이터 수집을 위한 최적의 시스템 용량을 산정한다.

• 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.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.07a
• /
• pp.201-202
• /
• 2018

자동차 부품산업은 자동차산업의 후방산업으로 완성차 메이커 제조산업의 조립용인 중간재 산업으로 부품의 품질에 따라 완성차의 성능이 좌우된다. 자동차 산업구조상 완성차에 종속적인 사업구조로 부품사의 독자 성장이 어렵고 수익성이 완성차업체에 종속 된다. 자동차부품사의 대형화 및 생산공정 자동화 변화로 기존의 수직계열화된 부품 공급 관계에도 변화가 예상되며, 완성차업체는 통합적인 시스템 부품을 생산할 수 있는 글로벌 대형 부품업체에 의존하는 상황이 전개될 수도 있다. 이와 같은 위기와 변화를 극복하기 위해 본 연구에서는 산업구조분석을 자동차 부품산업에 적용하여 자동차부품산업의 경쟁력제고 전략을 도출하고자 한다.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.191-199
• /
• 1996

In this paper, We assume that the closed computer system model composed of multiprocessor system is analyzed by BCMP queueing network theory with priority levels. In this system that contains terminals, processors and I/O devices, We show maximum throughput and the number of active terminals in the optimum multiprogramming levels. It is compared the performance with the other. In the result, it is obtained the optimum number of processors and active terminals. Therefore, the system model consisted of the optimum number of processor and multiprogramming level m is analyzed by the servers with a priority level. Each server is applied to the type of server which is characterized terminal, processor I/O device etc.. This model is analyzed by the server with a probability ditribution. Ideal state is proposed by the modeling for priority levels. Finally, we try to increase the performance in overload system.

• Journal of Korea Multimedia Society
• /
• v.12 no.1
• /
• pp.31-40
• /
• 2009

Call centers have become the prevalent contact points between companies and their customers. By virtue of recent advances in communication technology, the number and size of call centers have grown dramatically. As a large portion of the operating costs are related to the labor costs, efficient design and workforce staffing are crucial for the economic success of call centers. Therefore it is very important to determine the adequate number of agents. In this context, the workforce staffing level can be modeled as mathematical optimization problem using queueing theory. In this paper, we deal with an approximate analysis of an N-design call center with two finite queues and two types of reneging customers by using the state decomposition method. We also represent some numerical examples and show the impact of the system parameters on the performance measures of the call center.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.529-538
• /
• 2007

Fair Queueing algorithms based on Generalized Processor Sharing (GPS) not only guarantee sessions with service rate and delay, but also provide sessions with instantaneous fair sharing. This fair sharing distributes server capacity to currently backlogged sessions in proportion to their weights without regard to the amount of service that the sessions received in the past. From a long-term perspective, the instantaneous fair sharing leads to a different quality of service in terms of delay and bandwidth to sessions with the same weight depending on their traffic pattern. To minimize such long-term unfairness, we propose a delay-bandwidth normalization model that defines the concept of value of service (VoS) from the aspect of both delay and bandwidth. A model and a packet-by-packet scheduling algorithm are proposed to realize the VoS concept. Performance comparisons between the proposed algorithm and algorithms based on fair queueing and service curve show that the proposed algorithm provides better long-term fairness among sessions and that is more adaptive to dynamic traffic characteristics without compromising its service rate and delay guarantees.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2484-2496
• /
• 2000

High speed switches have been developing to interconnect a large number of nodes. It is important to analyze the switch performance under various conditions to satisfy the requirements. Queueing analysis, in general, has the intrinsic problem of large state space dimension and complex computation. In fact, The petri net is a graphical and mathematical model. It is suitable for various applications, in particular, manufacturing systems. It can deal with parallelism, concurrence, deadlock avoidance, and asynchronism. Currently it has been applied to the performance of computer networks and protocol verifications. This paper presents a framework for modeling and analyzing ATM switch using stochastic activity networks (SANs). In this paper, we provide the ATM switch model using SANs to extend easily and an approximate analysis method to apply A TM switch models, which significantly reduce the complexity of the model solution. Cell arrival process in output-buffered Queueing A TM switch with finite buffer is modeled as Markov Modulated Poisson Process (MMPP), which is able to accurately represent real traffic and capture the characteristics of bursty traffic. We analyze the performance of the switch in terms of cell-loss ratio (CLR), mean Queue length and mean delay time. We show that the SAN model is very useful in A TM switch model in that the gates have the capability of implementing of scheduling algorithm.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.1145-1148
• /
• 1999

본 논문은 다중마스터 시스템의 버스 공유를 큐잉이론으로 모델링하여 정량화하고 이를 바탕으로 최적화 된 실시간 시스템을 설계하는 방법을 제안하였으며 그 결과를 실측 실험을 통해서 검증하였다. 다중마스터 모드와 슬레이브 모드를 지원하는 마스터를 이용한 다중 마스터 시스템에서 버스의 공유로 인한 지연과 각 작업의 대기 시간은 각각에 대한 모델링을 통해 정량화 할 수 있으며 이를 통하여 최적화된 시스템을 구성할 수 있게 된다. 본 논문의 실험에서는 VMEbus 상에서 3개의 마스터와 그에 종속된 4개의 슬레이브 시스템을 구성하여 각 마스터들의 버스 요구율과 서비스 시간에 따라 버스를 점유하기 위해 기다리는 시간을 정량적으로 분석하였으며 이를 통하여 개선된 시스템은 각 작업의 버스 상에서의 대기 시간을 최소화하고 효과적으로 버스를 공유하므로써 작업 시간 오차와 오류 발생을 최소화 할 수 있음을 보였다.

• The Journal of the Korea Contents Association
• /
• v.6 no.11
• /
• pp.276-284
• /
• 2006

WRR scheme was developed for scheduling scheme for guaranteeing bandwidth requirement. In these days, WRR scheme can handle multiple queues straightforwardly by putting a different weight on each queue in order to offer differentiated services such as different bandwidth or delay bound in wireless communication network. Also, WRR algorithm can be implemented efficiently by dynamic binary scheduling wheel(DBSW) architecture. This paper performs the mathematical analysis of the DBSW architecture and compares the results with simulation results. The analysis data and simulation data show that the mathematical analysis developed properly.