http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
국광호,이창호,강성열,오창환 한국경영과학회 1997 한국경영과학회지 Vol.22 No.4
The cell loss probability recommended in the B-ISDN is in the range of 10^-8~10^-12. When a simulation technique is used to analyze the performance of the ATM node, an enormous amount of computer processing time is required. In this study, we derive an importance sampling simulation technique that can be used to evaluate the performance of the ATM node very quickly, that is, the probability that the queue size at the ATM node reaches some large value N. The simulation results show that the backlog probability obtained by the importance sampling simulation is very close to that obtained by the ordinary simulation and the computer time can be reduced drastically by the importance sampling simulation.
충돌해결기법에 기초한 WiBro 시스템의 Random Access 기법
국광호,이강원 서울産業大學校 2005 논문집 Vol.54 No.4
이동중인 단말들에게 인터넷 서비스를 제공해 주는 Wibro 시스템은 무선자원의 효율적인 사용을 위해서 전송할 데이터가 있는 단말들이 기지국으로 대역폭을 요청하면, 이들에게만 대역 폭을 할당하는 demand-based 대역폭 할당 방식을 사용한다. 이때 여러 단말들이 동시에 대역폭을 요청할 경우 총돌이 발생하므로 이들의 전송순서를 정해주는 것이 필요하다. 기존의 WiBro 시스템에서는 binary exponential backoff algorithm에 기초한 충돌해결기법을 사용하는 데, 본 연구에서는 conflict-resolution 기법에 기초한 새로운 총돌해결기법을 제안하고, 새로운 기법의 성능이 보다 우수함을 시뮬레이션을 통해 보였다.
큐잉모델과 추계적 페트리 네트를 이용한 핸드오프 호의 채널 할당방식에 대한 성능분석
노철우,국광호 新羅大學校 1995 論文集 Vol.39 No.1
A traffic model and analysis for cellular mobile system with handoff are described. Four channel assignment schems for handoff procedures are considered. In the first scheme, the base station makes no distinction between new call attempts and handoff call attempts. In the second scheme, a fixed number of channels in each cell are reserved exclusively for handoff calls. In the third scheme, queueing is allowed only to handoff calls. The last scheme combines the second and third schemes. We propose to model the channel assignment scheme by both a class of queueing model and Stochastic Petri Nets. The SPN(Stochastic Petri Net) can be solved numerically by SPNP, a software tool for the analysis so SRN(Stochastic Reward Net). Using our model, we compare above four schems and numerical results. These numericall results show blocking probabilities and throughputs.
資源制約下의 PERT/CPM의 Heuristic 解法硏究
鞠光鎬 청주대학교 이공대학 공업경영학과 1983 工業 經營 論集 Vol.1 No.-
본 논문은 제한된 자원하에서 PERT/CPM network의 각 활동을 어떤 순서로 수행하는 것이 전체 활동수행 시간을 줄일 수 있는가를 세가지 휴리스틱 기법을 사용하여 비교 분석하였다. 즉 PERT/CPM에서 LS(lastest start time)가 작은 순서대로 활동을 수행하는 방법과 현재 작업을 시작할 수 있는 활동중에서 주어진 자원을 최대한으로 활용하는 활동조합부터 수행하는 방법, 그리고 현재 즉시 활동을 수행하지 않으면 현재로서 가능하리라 생각되는 전체 활동수행 시간이 지연되는 활동들을 우선적으로 수행하고, 남은 자원들을 최대한으로 활용하는 활동조합을 수행하는 세가지 휴리스틱 기법을 비교 분석하였다. 세가지 기법중 어느 한 기법이 항상 좋지는 않았고 경우에 따라서 각 기법이 나음을 알 수 있었다. 따라서 한가지 기법만 사용하기 보다는 세가지 기법을 모두 사용하여 해를 구하고 그중 나은 활동수행 순서를 택하는 것이 바람직하리라 생각된다.
국광호 서울産業大學校 1994 논문집 Vol.40 No.1
A service system with batch arrivals and batch services, respresented by MЬn/MЬn/1, is considered. This is a single-server system in which batches of units arrive according to a Poisson process with rate depending on the number in the system and the batch size have a geometric distribution . Similarly, the service process is a batch service system in which batches depart according to a Poisson process with rate depending on the number in the system and the batch size truncated geometric variables. We derive the closed-form equilibrium distribution of the number of units in this MЬn/MЬn/1 system. We also consider a two-node tandem queueing network in which batches of units arrive according to a MЬn process and a two-node tandem queueing network in which batches of units depart the system according to a MЬn process. We derive the closed-form equilibrium distribution of the number of units these tandem queueing networks.
An Efficient Simulation of Discrete Time Queueing Systems with Markov-modulated Arrival Processes
국광호,강성열,Kook Kwang-Ho,Kang Sungyeol 한국시뮬레이션학회 2004 한국시뮬레이션학회 논문지 Vol.13 No.3
The cell loss probability required in the ATM network is in the range of 10$^{-9}$ ∼10$^{-12}$ . If Monte Carlo simulation is used to analyze the performance of the ATM node, an enormous amount of computer time is required. To obtain large speed-up factors, importance sampling may be used. Since the Markov-modulated processes have been used to model various high-speed network traffic sources, we consider discrete time single server queueing systems with Markov-modulated arrival processes which can be used to model an ATM node. We apply importance sampling based on the Large Deviation Theory for the performance evaluation of, MMBP/D/1/K, ∑MMBP/D/1/K, and two stage tandem queueing networks with Markov-modulated arrival processes and deterministic service times. The simulation results show that the buffer overflow probabilities obtained by the importance sampling are very close to those obtained by the Monte Carlo simulation and the computer time can be reduced drastically.
국광호,백장현,김경희 한국경영과학회 2006 韓國經營科學會誌 Vol.31 No.3
WiBro (Wireless Broadband Internet) system is going to be got down to commercialization. The high portable internet system is able to be connected to the high-speed internet using 2.3 GHz frequency bandwidth, anytime and anywhere. An effective scheduling for UGS, rtPS, nrtPS and BE requiring different QoS, which are service types of the WiBro, is necessary to increase the efficiency of radio channels that are the limiting resource. This paper researches an uplink scheduling that plays a role in assignment for the radio channels from subscribers to base stations. The suggested scheduling provides priorities with each service type considering QoS of them but reserves some bandwidth for lower priory services. After deciding effective amount of bandwidth for reservation, we suggest analytical result on mean delayed time of packet transmission for each terminal, transmission rate for the data, and capacity for uplink. This research can be used as basic data for the standard in the high portable internet system and as data to predict the capacity of base stations.