• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.45-48
• /
• 2002

무선 이동통신환경에서는 시간에 따라 네트워크에 의한 데이터 손실, 일관성 없는 패킷의 도착 간격 등과 같은 문제와 전송 속도의 저하가 발생함으로써 일정한 수준의 QoS 를 제공하기 어렵다. 이러한 문제점에 대처하기 위하여 다중 비트율 코딩, 트랜스코딩 등과 같은 기술이 제안되었다. 그러나 이러한 방식들은 서버의 과도한 연산량 요구나 저장 공간 낭비라는 단점을 가지고 있다. 본 논문에서는 이러한 문제점을 해결하기 위해 다중 비트율 코딩 방식과 스케일러블 코딩 방식을 결합하여 네트워크 QoS 변화에 유연하게 적응될 수 있는 방식을 제시한다. 기존의 심플 혹은 메인 프로파일이 네트워크의 상태가 일정하다는 것을 전제로 하는 반면, 스케일러블 프로파일은 기본 데이터와 부가 데이터를 분리하여 하나의 파일로 관리되므로 서버의 연산량을 줄이고, 저장 공간도 절약한다. 또한 같은 스트림에 대해서도 단말기의 능력에 따라서 부가 데이터를 복호화 할지를 결정할 수 있어 여러 사용자에게 같은 스트림 데이터를 전송할 수 있는 장점이 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.10
• /
• pp.2014-2027
• /
• 1994

A queueing model with two input streams of different service priorities is studied. Specifically, IBP+BP/D/1 with head-of-line priority is analyzed. IBP and BP stand for Interrupted Bernoulli Process and Bernoulli Process respectively. The BP-stream customers have the higher service priority over the IBP-stream customers. An exact analysis of this priority queue is presented to derive the distributions of the state of the system at steady state, the waiting time distributions for each class of customers, and the interdeparture time distributions. The numerical results of the analysis are presented to show how the various parameters of the low and high priority arrival processes affect the performance of the system.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.2
• /
• pp.1-13
• /
• 2009

Although enormous data have been collected in major cities (Korea) by APTS(Advanced Public Transit Systems), most of studies related to bus schedule management evaluation have confined to headway adherence and on-time performance. Therefore, bus operation management have been very lack of using APTS data. This study uses coefficient of correlation to evaluate bus company's schedule management level. However, direct application of coefficient of correlation has inequitable problem because of many limitation(number of vehicle, headway, etc). and so variable calibration method was developed and applied to cope with these problems. Thus, demand-elastic management evaluation index was developed. For verifying the equity of developed index, it is applied to Seoul bus routes. It is expected for the developed index to contribute into the demand-elastic management of bus schedule.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.2
• /
• pp.39-46
• /
• 2023

We present an efficient packet transmission strategy for massively multiplayer online first-person shooter (MMOFPS) games using movement-adaptive packet transmission interval. The player motion in FPS games shows a wide spectrum of movement variability both in speed and orientation, where there is room for reducing the number of packets to be transmitted to the server depending on the predictability of the character's movement. In this work, the degree of variability (nonlinearity) of the player movements is measured at every packet transmission to calculate the next transmission time, which implements the adaptive transmission frequency according to the amount of movement change. Server-side prediction with a few auxiliary heuristics is performed in concert with the incoming packets to ensure reliability for synchronizing the connected clients. The comparison of our method with the previous fixed-interval transmission scheme is presented by demonstrating them using a test game environment.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.6
• /
• pp.112-123
• /
• 2017

The accurate forecasting of the public transportation's transit and arrival time has become increasingly important as more people use buses and subways instead of personal vehicles under the government's public transportation promotion policy. Using bus management system (BMS) data, which provide information on the real-time bus location, operation interval, and operation history, it is now possible to analyze the bus schedule reliability. However, the punctuality should always be considered together with the operation safety. Therefore, this study suggests a new methodology to secure both reliability and safety using the BMS data. Unlike other studies, we calculated the bus travel time between two bus stops by dividing the total travel length into 6 sections using 5 different measuring points. In addition, the optimal travel time for each bus route was proposed by analyzing the mean, standard deviation and coefficient of variation of the each section's measurement. This will ensure the reliability, safety and mobility of the bus operation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.912-921
• /
• 2005

Optical burst switching(OBS) is a promising solution for building terabit optical routers and realizing If over WDM. Channel scheduling Algorithm for reduce contention is one of the major challenges in OBS. We address the issue of how to provide basic burst channel scheduling in optical burst switched WDM networks with fiber delay lines(FDLs). In OBS networks the control and payload components or a burst are sent separately with a time gap. If CHP arrives to burst switch node, because using scheduling algorithm for data burst, reservation resources such as wavelength and transmit data burst without O/E/O conversion, because contention and void between burst are happened at channel scheduling process for data burst that happened the link utilization and bust drop probability Existent proposed methods are become much research to solve these problems. Propose channel scheduling algorithm that use Release Time of bust to emphasize clearance between data and data dissipation that is happened in data assignment in this treatise and maximize bust drop probability and the resources use rate (RTUC : Release Time Unscheduled Channel). As simulation results, Confirmed that is more superior in terms of data drop and link utilization than scheduling algorithm that is proposed existing. As simulation results, confirmed improved performance than scheduling algorithm that is proposed existing in terms of survival of burst, efficiency resource and delay. However, In case load were less, degradation confirmed than existent scheduling algorithm relatively, and confirmed that is superior in data drop aspect in case of load increased.

• Journal of Korean Society of Transportation
• /
• v.21 no.5
• /
• pp.19-29
• /
• 2003

The purpose of this study is to analyse the effect of the parking information on the waiting time using the simulation method. Stated Preference survey has been implemented to construct the parking lot choice model. A queue simulation is carried out to investigate the effect of various parking information on the waiting time. The results show that providing parking information is likely to increase the utilization of parking place and to decease the waiting time of individual vehicle. Furthermore, as the parking demand increases, the detailed and quantitative parking information such as "5 minutes delay" is more effective than qualitative parking information such as "available".

• Journal of the Korea Society for Simulation
• /
• v.27 no.3
• /
• pp.45-52
• /
• 2018

We consider the busy period of an M/G/1/K queueing system with queue-length-dependent overload control policy. A variant of an oscillating control strategy that was recently analyzed by Choi and Kim (2016) is considered: two threshold values, $L_1({\leq_-}L_2)$ and $L_2({\leq_-}K)$, are assumed, and service rate and arrival rate are adjusted depending on the queue length to alleviate congestion. We investigate the busy period of an M/G/1/K queue with two overload control policies, and present the formulae to obtain the expected length of a busy period for each control policy. Based on the numerical examples, we conclude that the variability and expected value of the service time distribution have the most influence on the length of a busy period.

• Journal of Advanced Navigation Technology
• /
• v.22 no.6
• /
• pp.491-499
• /
• 2018

Runway visual range (RVR), one of the important indicators of aircraft takeoff and landing, is affected by meteorological conditions such as temperature, humidity, etc. It is important to estimate the RVR at the time of arrival in advance. This study estimated the RVR of the local airport after 1 hour by upgrading the RVR estimation model using the proposed deep learning network. To this end, the advancement of the estimation model was carried out by changing the time interval of the meteorological data (temperature, humidity, wind speed, RVR) as input value and the linear conversion of the results. The proposed method generates estimation model based on the past measured meteorological data and estimates the RVR after 1 hour and confirms its validity by comparing with measured RVR after 1 hour. The proposed estimation model could be used for the RVR after 1 hour as reference in small airports in regions which do not forecast the RVR.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2003.11a
• /
• pp.104-109
• /
• 2003

이동 통신과 무선 단말기의 보급이 보편화되면서 사용자의 위치정보를 이용한 위치 기반 서비스(Location Based Service)에 대한 관심이 높아지고 있다. 이러한 위치 기반 서비스를 제공하기 위해서는 이동객체 위치 정보의 효율적인 저장 및 관리가 필요하며 이를 위해 일정 시간 간격을 두고 위치 정보를 획득하여 저장, 관리하는 방법이 연구되어 왔다. 본 논문에서는 이동 객체의 이동경로에 대응되는 위상 정보(Topology)를 이용하여 이동 객체의 위치 정보를 관리하는 기법을 제안한다. 본 기법은 이동 객체가 위상 정보의 노드에 해당하는 위치에 도착할 예상 시점을 계산하고, 그 시점을 위치 획득 시점으로 결정하여 위치 정보를 갱신하며, 또한 명시적으로 저장되지 않은 불확실한 위치 정보의 요청에 대해 위상 정보 노드의 속성 정보와 선형 함수를 이용해 위치 정보를 추정하여 제공한다. 본 기법은 위상 정보의 노드에 대응되는 위치를 획득하여 저장하기 때문에 갱신 횟수와 데이터의 양을 감소시키고, 불확실한 위치 정보에 대한 위치를 추정할 경우, 명시적으로 저장된 위치 정보에서 유추된 이동 객체의 정보와 더불어 이동 객체의 이동 경로를 고려한 위상 정보 속성을 사용하므로, 선형 함수나 스플라인 함수만을 적용하는 것보다 적은 오차를 발생시켜 위치 정보의 정확성을 향상시킬 수 있다.