• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.178-180
• /
• 2002

모바일 클라이언트(Mobile Client, MC) - 서버 환경에서 캐쉬된 공간 데이타는 용량과 가용성이 크고 긴단절을 가지는 특징이 있다. 이러한 긴 단절을 거친 MC의 일관성 제어시 캐쉬된 데이타 전체가 무효화되어 재전송 하는 것은 비효율적이므로 서버는 변경된 객체 정보를 로그로 기록하여, 캐쉬된 영역에 속하는 최근 변경 정보만을 전송하는 것이 필요하다. 또한 일반적으로 로그의 순차 검색과 불필요한 로그의 누적으로 인해 일관성 제어시 통신 비용이 증가하게 되므로, 서버의 로그 검색 시간과 전송량을 최소화 하기위한 기법이 필요하다. 이를 위해 본 논문에서는 로그를 이용안 공간 로그 인덱스(Spatial Log Index, SLI) 기법과 공간 로그 관리(Spatial Log Management, SLM) 기법을 제시하고 있다.

• The Journal of Society for e-Business Studies
• /
• v.14 no.4
• /
• pp.75-94
• /
• 2009

Since XML emerged as a standard for data exchange on the web, it has been established as a core component in e-Commerce and efficient query processing over XML data in ubiquitous computing environment has been also receiving much attention. Recently, the techniques were proposed whereby an XML document is fragmented into XML fragments to be streamed and the mobile clients receive the stream while processing queries over it. In processing queries over an XML fragment stream, the average access time significantly depends on the order of fragments in the stream. As such, for query performance, an efficient organization of XML fragment stream is required as well as the indexing for energy-efficient query processing due to the reduction of tuning time. In this paper, a technique of XML fragment stream organization based on query frequencies, fragment size, fragment access frequencies, and an active XML-based indexing scheme are proposed. Through implementation and performance experiments, our techniques were shown to be efficient compared with the conventional XML fragment stream organizations.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.359-366
• /
• 2003

Although the reuse of the cached data for scrolling the map reduces the amount of passed data between client and server, it needs the conversions of data coordinates, selective deletion of objects, cache compaction and object structuring step in the clients. The conversion is a time- intensive operation due to limited resources of mobile phones such as low computing power, small memory. Therefore, in order to control the map efficiently in the vector map service based mobile phones, it is necessary to study the methods which reuse cached objects for reducing wireless network bandwidth and overwhelming the limited resources of mobile phones as well. This paper proposes the methods of reusing pre-received spatial objects for map control in the mobile vector map service system based on client-server architecture. The experiments conducted on the Web GIS systems with real data show that the proposed method is appropriate to map services for mobile phone. We also analyze the advantages and drawbacks between the reuse of cached data and transmission of raw data respectively.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.6
• /
• pp.687-692
• /
• 2004

In this paper, we proposed an efficient cache hoarding method in mobile computing environments using collaborative filtering. This method is used for solving the difficult problem of mobile computing, which is the vacuum of information service depending on low bandwidth, long delay, and frequent network disconnection. Many previous researches have been studied a cache hoarding approach for solving these problems of mobile client. But, the research of history information of mobile client did not support all informative requests for mobile clients. In our research, collaborative filtering model using history information and location data of mobile client is proposed. This proposed model supports an efficient service of necessary items for client's requirement. For the performance evaluation of proposed model, we make an experiment of simulation data using SAS enterprise miner. According to objective evaluation using cache hit ratio, we show that our model has a good result.

• Journal of KIISE:Databases
• /
• v.29 no.4
• /
• pp.285-296
• /
• 2002

When a client requests a set of data items at once, it is crucial to reduce the total time elapsed till the client receives all data items requested. This paper describes a data broadcasting technique that reduces access time for multiple data accesses from clients. The impact of the relative position of each data item in a broadcast schedule is dependent on the degree of data replication between data requests from clients. The relative broadcast frequencies for data items are affected by the degree of access skewness from clients. This paper proposes a technique for generation of a hierarchical data broadcast schedule, which can support multiple data accesses effectively by considering the data sharing among client requests and data access skewness together. Simulation results show that the proposed technique consistently performs better than the previous research results in various environments.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.416-428
• /
• 2005

In the paper we propose an index method for XML streaming services, where a server broadcasts XML data to a lot of clients in wireless information systems. In order to control the access and tuning time of mobile clients, the proposed method constructs the XML stream through replicating partial index intermixed with parts of data. For this purpose, we propose a two-level tree structure for separating index and XML data into two parts: replicated vs. non-replicated. We analyze the performance of the proposed method with respect to access time and tuning time. With the analysis result, we derive the optimal level value.

• International Journal of Advanced Culture Technology
• /
• v.4 no.3
• /
• pp.13-19
• /
• 2016

The growth of mobile devices in Internet of Things (IoT) leads to a number of remote and controlling system related IoT applications. For instance, home automation controlling system uses client system such web apps on smartphone or web service to access the home server by sending control commands. The home server receives the command, then controls for instance the light system. The web service gateway responsible for handling clients' requests attests an internet latency when an increasing number of end users requests submit toward it. Therefore, this web service gateway fails to detect several commands, slows down predefined actions which should be performed without human intervention. In this paper, we investigate the performance of a web server-side platgorm based event-driven, non-blocking approach called Node.js against traditional thread-based server side approach to handle a large number of client requests simultaneously for remote and controlling system in IoT remote monitoring applications. The Node.JS is 40% faster than the traditional web server side features thread-based approach. The use of Node.js server-side handles a large number of clients' requests, then therefore, reduces delay in performing predefined actions automatically in IoT environment.

• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.663-673
• /
• 2002

Server-side anti-viruses are useful to protect their domains, because they can detect malicious codes at the gateway of their domains. In prevailing local network, all clients cannot be perfectly controlled by domain administrators, so server-side inspection, for example in e-mail server, is used as an efficient technique of detecting mobile malicious codes. However, current server-side anti-virus systems perform only signature-based detection for known malicious codes, simple filtering, and file name modification. One of the main reasons that they don't have detection features, for unknown malicious codes, is that activity monitoring technique is unavailable for server machines. In this paper, we propose a detection technique that is executed at the server, but it can monitor activities at the clients without any anti-virus features. we describe its implementation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.183-186
• /
• 2013

Modern day despite technology advancements that manufacture a new generation of mobile devices with generous resources, the fact that they can offer only limited processing capacity still remains a painful experience. So far, a number of research studies have been carried out, trying to eliminate problems arising from shortcomings in the connection between thin clients and cloud networks, yet little have been found efficient. In this paper, we present a novel approach, taking advantage of collaboration of thin and thick clients, particularly aiming at optimizing data distribution by splitting data and utilizing cloud computing (CC) resources so that expected Quality-of-Service (QoS) requirements can be met. Moreover, we conduct simulations to evaluate our approach. Our results evaluation shows that our approach has better performance than existing approaches.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.17 no.5
• /
• pp.297-307
• /
• 2022

The simple procedural segment selection algorithm commonly used in Dynamic Adaptive Streaming over HTTP (DASH) reveals severe weakness to provide high-quality streaming services in the integrated mobile networks of various wired and wireless links. A major issue could be how to properly cope with dynamically changing underlying network conditions. The key to meet it should be to make the segment selection algorithm much more adaptive to fluctuation of network traffics. This paper presents a system architecture that replaces the existing procedural segment selection algorithm with a deep reinforcement learning algorithm based on the Asynchronous Advantage Actor-Critic (A3C). The distributed A3C-based deep learning server is designed and implemented to allow multiple clients in different network conditions to stream videos simultaneously, collect learning data quickly, and learn asynchronously, resulting in greatly improved learning speed as the number of video clients increases. The performance analysis shows that the proposed algorithm outperforms both the conventional DASH algorithm and the Deep Q-Network algorithm in terms of the user's quality of experience and the speed of deep learning.