• Smart Media Journal
• /
• v.8 no.3
• /
• pp.41-46
• /
• 2019

In a MMORPG, a typical application of virtual environment systems, it is a common desire to play in a more realistic environment. However, it is very difficult to provide a latency-free virtual environment to a large user base, mainly due to the fact that the real environment must be configured on multiple servers rather than on single server and that data must be shared on the real server when users move from one region to another. Experiencing response delays continuously in the process of information synchronization between servers greatly deteriorates the degree of immersion. In order to solve this problem, it is necessary to minimize the response delay occurring in the information synchronization process between the servers. In this paper, we propose Migration Agent for efficient information synchronization between field servers providing information of virtual environment and minimizing response delay between Field Server and PC(Player Character) and implement it in cloud computing network. In the proposed system, CPU utilization of field server increased by 6 ~ 13%, and response time decreased by 5 ~ 10 seconds over the existing system in 70,000 ~ 90,000 PCs

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.5
• /
• pp.807-816
• /
• 2021

With the technology of the 4th industrial revolution, network traffic is increasing due to an increase in supply, an increase in demand, and an increase in the complexity of traffic patterns. SDN, a concept in which H/W and S/W are separated in order to efficiently manage such massive traffic, is attracting attention as a next-generation network. A lot of research is being conducted on the merits of applying flexible policies by avoiding the problem of rigid vendor dependency by using the SDN controller implemented with S/W Opensource. Therefore, in this paper, we propose an efficient load balancing technique by grouping through the packet structure of the network layer using the control layer and infrastructure layer of SDN and analyzing the packet delay and reception rate.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.513-522
• /
• 2008

Efficient data dissemination is one of the important subjects for sensor networks. High accessibility of the sensed data can be kept by deploying the data centric storage approach in which data is stored over the nodes in the sensor network itself rather than external storages or systems. The advantage of this approach is its direct accessibility in a real-time without the severe burden on delay and power dissipation on the data path to the external storages or systems. However, if the queries from many users are concentrated to the few nodes with data, then the response time could be increased and it could lead to the reduction of network life time by rapid energy dissipation caused by concentrated network load. In this paper, we propose a adaptive data centric storage scheme based on proxy trajectory (APT) mechanism. We highlight the data centric storage mechanism by taking account of supporting large number of users, and make it feasible to provide high-performance accessibility when a non-uniform traffic pattern is offered. Storing data around the localized users by considering spatial data-access locality, the proxy trajectory of APT provides fast response for the users. The trajectory, furthermore, may help the mobile users to roams freely within the area they dwell.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.295-303
• /
• 2004

In this Paper, we discuss an active TCP link of unsynchronized transmission mode network in two-way traffic and the Improvement of its traffic patron thorough the network pathway of protocol is shown. This is because the traffic pattern is performed on the basis of existing windows which are distributing information in several periods of time in the way of interfacing LTS control module, which is controlling by an information of exceeding the time limit of feedback loop determined by RTP, with TCP. The simulation to utilize this efficiently is performed with the circumstance of bench mark based on physical modeling of the self-similarity traffic in the performance of TCP. In this paper, we use a methodology to understand and evaluate the effect of change of transmitting protocol in sticks under the condition of the self-similar traffic in two-way network and it is shown that an improvement of congestion control by self-similarity under a heavy condition.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.4
• /
• pp.369-380
• /
• 2003

With the proliferation of a wireless support and the advances of mobile devices, there is a growing need of making it available for a wireless network as well. Low bandwidth of a wireless network is one of the major issues that should be considered for extending a synchronous collaboration system developed for a wired network to supuort a wireless network. We propose a priority-based view synchronization scheme, exploiting the relaxed synchronization. The proposed scheme leverages the fact that mobile users need not have the exactly same view as the users in a wired network since they usually have a limited screen size and thus focus only on part of a whole document. We evaluate the performance of a simple group editor with the propose scheme using ns -2. The performance results show that the proposed scheme keeps the message transmission delay low so that mobile users can have synchronous colloboration with wired users without signification delay. The proposed scheme is designed and implemented as a framework to support various kinds of realtime groupware applications, exploiting the existing groupware framework, Habanero. As a client program, we implemented a simple group text editor.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.2
• /
• pp.156-161
• /
• 1997

In this thesis, based on Genetic Algorithm, a new route search algorithm is presented to search an optimal route between the origin and the destination in intelligent route guidance systems in order to minimize the route traveling time. The proposed algorithm is effectively employed to complex road networks which have diverse turn constrains, time-delay constraints due to cross signals, and stochastic traffic volume. The algorithm is also shown to significantly promote search efficiency by changing the population size of path individuals that exist in each generation through the concept of age and lifetime to each path individual. A virtual road-traffic network with various turn constraints and traffic volume is simulated, where the suggested algorithm promptly produces not only an optimal route to minimize the route cost but also the estimated travel time for any pair of the origin and the destination, while effectively avoiding turn constraints and traffic jam.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.9-12
• /
• 2000

A forward error correction (FEC) is usually used to correct the errors of the real-time data occurred at the reciever side which require a real-time transmission. The data transmission is peformed after being encapsulating by RTP and UDP. In the ITU-T study group 16, four FEC schemes using the XORing are presented. In the paper, a new supplementary scheme is proposed. In the delay problem the new scheme performs better than the scheme 3 but in the recovery ability for successive packet loss is worse than scheme 3. The proposed scheme which supplements the present schemes can be adapted easily to the current network environment.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.85-90
• /
• 2001

본 논문에서는 한국어 숫자음 인식을 위한 시간 지연 신경망(Time delay neural network-TDNN)과 은닉 마르코프 모델(Midden Markov Model-HMM)의 결합 방법에 대해서 연구하였고 그 성능을 측정하였으며, 기존의 시스템과 비교 평가하였다. 이 알고리즘은 TDNN과 HMM의 구조적인 결합에 기반하고 있는데 TDNN의 두번째 은닉층의 출력이 HMM의 입력으로 들어가도록 구성되었다. 그러면 HMM은 TDNN의 출력으로 각 단어에 대해서 훈련과정을 거치게 된다. 이렇게 구성된 인식알고리즘은 TDNN의 뛰어난 단기간(Short-time)분류 기능과 HMM의 시간 정렬(time-warping) 능력을 동시에 갖게 된다. 위의 과정을 컴퓨터 시뮬레이션을 이용하여 구현하였으며, 한사람의 음성을 녹음하여 실험한 결과 기존의 TDNN만으로 만들어진 인식기보다는 3%, HMM만으로 구성된 인식기 보다는 5.7% 나은 성능을 얻을 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.331-343
• /
• 2015

We propose a distributed medium access control protocol for cognitive radio networks to opportunistically utilize multiple channels. Under the proposed protocol, cognitive radio nodes forecast and rank channel availability observing primary users' activities on the channels for a period of time by time series analyzing using smoothing models for seasonal data by Winters' method. The proposed approach protects primary users, mitigates channel access delay, and increases network performance. We analyze the optimal time to sense channels to avoid conflict with the primary users. We simulate and compare the proposed protocol with the existing protocol. The results show that the proposed approach utilizes channels more efficiently.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.249-252
• /
• 2008

This paper presents a new dynamically adaptable polling scheme for efficient support of real-time traffic over an IEEE 802.11 wireless LAN network. The poll scheduling plays an important role in IEEE 802.11 PCF. However, the current version of the polling list management scheme proposed in the IEEE802.11 standard is inefficient when a variable number of mobile stations have variable packets to transmit. If Point Coordinator has an exact information on the station status, it is possible to efficiently perform polling. In this thesis, we suggest an adaptable polling scheme to meet requirements of the stations. In our scheme, each station transmits packets including a piggyback information to inform that it wants to receive a poll in the next polling duration. Simulation results indicate that our scheme may reduces the packet discard ratio and real-time packet transfer delay.