http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Three-Stage 스위치 네트워크의 Blocking 확률 및 통화처리용량 해석
서재준,노승계,이강원 한국경영과학회 1989 한국경영과학회 학술대회논문집 Vol.- No.1
Lee model and Karnaugh model are widely used to compute the blocking probability of T-S-T three-stage switch network. Application of these models, howerever, is restricted to the case that the number of output time slots is greater than that of input time slots and all the time slots are fully searched. In this paper, an attempt is made to expand Lee and Karnaugh models which can be used in general case. A model, called ETRI model, is also developed considering the dependency on the number of T-SW's and compared with two existing models and their expanded models. A method is introduced to calculate the traffic-carrying capacity of three-tage switch network and illustrated by a numerical example of TDX-1B switch network. Finally, genera considerations are suggested to reduce the blocking probability of T-S-T three-stage switch network.
서재준,이강원,이헌,Seo, Jae-Jun,Lee, Gang-Won,Lee, Hen 한국전자통신연구원 1988 전자통신 Vol.10 No.2
ISDN(Integrated Services Digital Network) 개념의 도입은 기존의 회선교환망이나 패킷교환망과 같은 단일망에 대한 전통적인 트래픽 엔지니어링에 많은 문제점들을 제시하여 주고 있다. 즉, 가입자간 정보전송 속도 및 트래픽 특성의 다양화, 신호와 정보의 분리, 교환접속방식의 다양화 등 복잡하며 다양한 특성을 가진 ISDN 교환기의 트래픽 해석은 전통적인 큐잉이론 및 트래픽 이론을 직접 적용하는데 많은 제한 사항이 따른다. 그러므로 ISDN 교환기의 트래픽을 해석하기 위해서는 새로운 이론정립과 아울러 새로운 ISDN 트래픽 변수들을 도출하여 특성을 해석해야 할것이다. 이런 목적하에서 본고에서는 ISDN 트래픽 특성 및 성능, ISDN 트래픽이 교환기에 미치는 영향, CPE(Customer Premises Equipment)의 offered 트래픽 및 ISDN 교환기의 트래픽 엔지니어링 등에 관해 기술하였다.
시뮬레이션을 통한 AIN IP 시스템의 호처리용량 분석
서재준,최고봉,여건민,전치혁,Suh, Jae-Joon,Choi, Go-Bang,Yeo, Kun-Min,Jun, Chi-Hyuck 대한산업공학회 1998 산업공학 Vol.11 No.3
Intelligent Peripheral(IP) system is to provide specialized resource functions (SRF) such as playing announcement, collecting user information, and receiving messages in the Advanced Intelligent Network (AIN). We analyze the call processing capacity of an AIN IP system being developed in ETRI through an extensive simulation using SLAM II under a variety of AIN service scenarios. We consider televoting (VOT) and universal personal telecommunication (UPT) services which are to be provided at the fit implementation of the AIN in Korea. As the performance criteria to determine the call processing capacity, processor utilization, delay and call loss probability are considered. It turns out that the major processor called SAMP is the bottleneck processor, the service response delay dominates the delay performance, and the call loss probability becomes the primary criterion in determining the call processing capacity of the AIN IP system. It is also shown that the call processing capacity of the AIN IP system is determined by the utilization of the processor and the delay performance when the VOT ratio is below 70 percent but it is determined by the call loss probability due to the lack of service channels for providing the SRF operations.
서재준,강진규 大田産業大學校 2000 한밭대학교 논문집 Vol.17 No.1
In the MPLS forwarding paradigm, once a packet is assigned to a FEC, no further header analysis is done by subsequent routers: all forwarding is driven by the labels. This has a number of advantages over conventional network layer forwarding. The MPLS LER is located at the bound of MPLS domain and plays a role in connecting with the existing Internet as an ingress or an egress router. That is, the MPLS LER as an ingress router assigns a label to a packet which enters the MPLS network form the Internet by analyzing its header and forwards to a corresponding next router in MPLS domain. As an egress router, the MPLS LER turns the packets out of the MPLS network by performing the reverse operation. In this paper, we estimate the IP packet processing capacity of an MPLS LER system using queueing model and simulation. It is found that the maximum IP packet processing capacity of the system is estimated by 420,000 through 460,000 packets/sec.
시뮬레이션과 네트워크 축소기법을 이용한 네트워크 신뢰도 추정
서재준,전치혁,Seo, Jae-Jun,Jeon, Chi-Hyeok 한국전자통신연구원 1992 전자통신 Vol.14 No.4
Since. as is well known, direct computation of the reliability for a large-scaled and complex net work generally requires exponential time, a variety of alternative methods to estimate the network reliability using simulation have been proposed. Monte Carlo sampling is the major approach to estimate the network reliability using simulation. In the paper, a dynamic Monte Carlo sampling method, called conditional minimal cut set (CMCS) algorithm, is suggested. The CMCS algorithm simulates a minimal cut set composed of arcs originated from the (conditional) source node until s-t connectedness is confirmed, then reduces the network on the basis of the states of simulated arcs. We develop the importance sampling estimator and the total hazard estimator and compare the performance of these simulation estimators. It is found that the CMCS algorithm is useful in reducing variance of network reliability estimator.