• KSCI Review
• /
• v.15 no.1
• /
• pp.17-23
• /
• 2007

The change of traffic by the CDV is entered in a condensed form in UPC/NPC, overflowing the buffer of the net and possibly causing its congestion. For this reason this paper proposes the Cell Spacing Scheme. As the Cell Spaing Scheme. two method is proposed; RAT based on the time in which cells enter the spacer and RDT based on the time in which cells come out from the spacer. This Paper Proposes the improved spacing sheme in which the departure time of the present cell determines the departure time of the next one, by combining with Leaky Bucket and using the traffic characteristics of ATM network.

• The Korean Journal of Applied Statistics
• /
• v.7 no.2
• /
• pp.21-34
• /
• 1994

In this paper we consider the M/M/1 Queue with mean inter arrival time $\theta$. We derive a sample path estimator for the derivative of steady state mean system time with respect to $\theta$. We also show that the derived sample path estimate can be expressed as a sum of the IPA estimate and the other effect. We have a similar result for the derivative of limiting probability $P_k$ with respect to $\theta$.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.862-864
• /
• 2004

다수 사용자용 인터넷 게임은 그 특성상 게임 클라이언트간 또는 게임 클라이언트와 게임 서버간에 네트워크 지연은 피할 수 없고 이로 인해서 사용자가 느끼는 실감은 상당히 줄어 든다. 본 논문에서는 클라이언트-서버형태의 게임구조 하에서 이런 네트워크 지연에 따른 문제점을 해결하는 사용자들간의 상태 동기화 방법을 제안한다. 이 방법은 게임상 가상공간을 여러 영역으로 나눈 후, 각 클라이언트에 도착하는 메시지들의 발생 영역에 따라서 배치처리 시간간격 (time interval)을 달리하는 동기화 방법이다. 이 동기화 방법은 기존 방법에 비해서 롤백 (roll back) 수의 큰 증가 없이 사용자 반응시간을 현저히 줄이는 효과를 보인다.

• Journal of the Korea Convergence Society
• /
• v.12 no.4
• /
• pp.217-228
• /
• 2021

After the integrated fare system has been applied, public transportation and transfer traffic increased. As a result, transfer passengers must be considered in the operation of the bus. Although previous studies have limitations due to utilizing deterministic mathematical models, which fails to reflect the stochastic movements of passengers and buses, in this study, a more realistic bus stop micro-simulation model is proposed. Based on the proposed simulation model, we represent the relationship between bus arrival interval and passenger wait time as a regression model and empirically show the differences between the cases with and without transfer passengers. Also, we propose a method converting passenger waiting time to cost and find optimal bus arrival interval based on the converted cost. It is expected the proposed method enables bottom-up decision making reflecting practical situation.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.195-200
• /
• 2004

The change of traffic by the CDV is entered in a condensed form in UUC/NPC, overflowing the buffer of the net and possibly causing its congestion. For this reason this paper proposes the Cell Spacing Scheme. As the Cell Shaping Scheme, two method is proposed ; RAT based on the time in which cells enter the spacer and RDT based on the time in which cells come out from the spacer. This paper proposes the improved spacing sheme in which the departure time of the present cell determines the departure time of the next one, by combining with Leaky Bucket and on the traffic characteristics of ATM network.

• Journal of Navigation and Port Research
• /
• v.45 no.3
• /
• pp.102-108
• /
• 2021

The purpose of this study is to develop a proactive methodology for disruption due to uncertainty in vessels' arrival time. As worldwide imports and exports increased rapidly, the importance of berth planning in container terminals has increased accordingly. Since the berth plan determines the capacity of the container terminal, it aims to maximize efficiency by minimizing the time and space gap between the vessels. In reality, several uncertainties disrupt the initial berth plan resulting in economic losses. In this study, we propose a robust berth plan for preventing disruption.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.950-952
• /
• 2012

음원 위치추정 시스템은 일반적으로 여러 개의 마이크에서 수집된 음원의 시간 간격을 이용해 음원의 위치를 추정하는 방식을 적용한다. 본 논문에서는 감시카메라에 적합한 4개의 마이크로폰을 이용한 음원 위치추정 시스템에서 마이크로폰에 수신된 음원의 도착순서를 이용해 음원의 위치를 추정하는 알고리즘을 제안하였다. 제안한 알고리즘을 시뮬레이션 프로그램을 통해 검증한 결과, 음원 추정각도의 오차는 $2^{\circ}{\sim}11.25^{\circ}$로 확인되었으며, 이는 실제각도의 오차범위인 $0^{\circ}{\sim}22.5^{\circ}$ 내에 해당하기 때문에 추정각도의 오차가 최대로 발생하더라도 음원이 발생한 위치를 파악 할 수 있음을 의미한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.4
• /
• pp.424-432
• /
• 2016

World's leading countries are developing next generation digital broadcasting system specifications to support UHDTV (ultra-high definition television) contents and other various services. In order to maximize the transmission capacity by using the bandwidth efficiently, most broadcasting systems adopt MIMO-OFDM. In distributed-MIMO systems, multiple transmit antennas are spatially separated and therefore result in multiple timing offsets. To overcome this problem, this paper proposes a technique using a null symbol to detect each individual signal from distributed transmit antennas. By inserting null symbols before preambles, the receiver can distinguish the signals between each transmit antennas and perform frame synchronization. When the reception time difference is shorter than 500 samples, the proposed method outperforms the conventional method.

• Journal of Korea Multimedia Society
• /
• v.8 no.4
• /
• pp.502-508
• /
• 2005

This paper proposes a dynamic hybrid patching technique that can improve the performance of VOD systems by adopting the advantages of both greedy patching and grace patching to use a VOD server's limited network-I/O bandwidth. The proposed technique uses grace patching to the requests for the videos, arrival intervals of which are smaller than the size of patching window, and uses greedy patching to the rest requests. In addition, proposed patching technique expands the latest particular patching multicast into a regular multicast for a new request. In result, the patching multicast data for the new request can be the data from the beginning to the skew point of the video and the holding time of a dispatched channel can exceedingly decrease. Simulation results confirm that the proposed technique is better than grace patching in terms of defection rate and average service latency.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.05a
• /
• pp.333-337
• /
• 1998

동일 데이터를 액세스하는 다수 요구간의 시간적 지역성을 고려하여, 인접한 요구간의 시간 간격(interval)을 버퍼에 캐슁하여 공유하면 서버의 응답시간이 향상되고, 디스크 액세스 감소로 인한 대역폭 활용이 높아지며, 따라서 보다 많은 사용자 서비스가 가능해 진다. 본 논문에서는 VOD Server로 들어오는 요구 도착시간에 따라 버퍼 공유 크기를 결정하는 그룹핑(grouping)을 수행하게 하여 인접한 요구들의 공유 데이터 블록이 전체 버퍼를 점유하는 현상을 막고 디스크 액세스율을 감소시켜 대역폭의 활용도를 높일 수 있는 알고리즘을 구축한 후 시뮬레이션을 통하여 그 효율성을 분석한다.