• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1161-1164
• /
• 2003

본 논문은 ALAN(Application Level Active Network)상에서 GME(Generic Modeling Environment)라고 불리는 컴포지션 메커니즘을 이용하는 AWCS(Adaptive Web Caching Service)에 관하여 언급하였다. ALAN상의 웹 캐싱의 요구사항은 자치 구성성(self-configuration)과 자치 적응성(self-adaptation)이다 이러한 요구사항을 지원하기 위해서 본 논문에서는 친AN상에서 IN(Intelligent Inetwork)에서 유래된 SCE(Service Creation Environment)와 유사한 서비스 컴포지션 메커니즘인 GME를 이용하여 AWCS 의 설계 및 구현에 관하여 언급하였다

• Journal of Digital Convergence
• /
• v.17 no.9
• /
• pp.153-161
• /
• 2019

Discrimination of media object segments in wireless home proxies has a significant impact on caching delay, and caching delay degrades the performance of the proxy. In this paper, we propose a Single Fetching Smart Caching (SFSC) strategy and a Multi-Fetching Smart Caching (MFSC) strategy to improve the proxy performance of the home network and improve the caching performance for media object segments. The SFSC strategy is a technique that performs caching by sequential fetching of object segments requested by the home node one at a time, which guarantees a faster cache hit rate, and the MFSC strategy is a technique that caches the media object segments by blocking object segments requested by the home node one at a time, which improves the throughput of cache. Simulation results show that the cache hit rate and the caching delay are more efficient than the MFSC technique, and the throughput of the object segment is more efficient than that of the SFSC technique.

• Journal of Advanced Navigation Technology
• /
• v.16 no.3
• /
• pp.463-470
• /
• 2012

This paper proposes a new profit popularity-based segment caching control mechanism for assuring a consecutive streaming QoS (Quality of Service) in the wireless channel. Then, the proposed mechanism operates SSCP (Single Segment Caching Profit) and MSCP (Multiple Segment Caching Profit) for assuring a QoS. SSCP and MSCP is to optimize the cache performance when is performed the streaming in the proxy. The proposed mechanism simulated to evaluate such mechanisms as fixed-partition mechanism, weight-based mechanism, SSCP, and MSCP. Simulation results show that the proposed mechanism has superior performance compared to other mechanisms.

• The Journal of Society for e-Business Studies
• /
• v.13 no.4
• /
• pp.161-171
• /
• 2008

The most important reason for increasing web traffic and overloaded web servers is a dramatic growth of web users which leads to a great dissatisfaction of each individual user. For overcoming this situation, studies for an acceleration of web content have been conducted actively. We use web caching technology for reducing the load of the web system and traffic in the network. In this paper, we proposed a new web caching technology with the related web object which based on the unit of web processing and characteristics of the web object. Also we verified the availability of the proposed system with comparison and experiments.,

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.3
• /
• pp.575-580
• /
• 2017

In these days, the big-size and high resolution multimedia file is widely used through networks. To transfer and service effectively, the internet network technology is necessary to substitute broadcasting. Normally Content Delivery Network(CDN) is widely used in conventional internet for multimedia services. But it has a small bandwidth to service. So to solve this problems, many researchers have suggest the protocol for download, content distribution/saving, server synchronization, caching, pushing rate, and streaming etc. But all of these has some defects like low resolution, packets loss and delay, real application implementations etc. So, this paper suggests a new method of network protocol based on P2P collaboration and user's content using information. And it evaluated the performance of suggested method. As the results, it showed the effectiveness of 4 performances indices : download speed, decreasing rate of connected user in same time, adaptive hit ratio, traffic decreasing rate.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.1
• /
• pp.111-118
• /
• 2021

This paper proposes a novel method of caching contents that can be encoded into multiple quality levels in device-to-device (D2D)-assisted caching networks. Different from the existing caching schemes, the author allows caching fractions of an individual file and considers the self cache hit event, which the user can find the desired content in its device. The author analyzes the tradeoff between the quality of cached contents and the cache hit rate, and proposes the device caching method maximizing the expected quality that the user can enjoy. Depending on the parameter of the relationship between the quality and the file size, the optimal caching method can be obtained by solving the convex optimization problem and the DC programming problem. If the file size increases faster than the quality, the cached fractions of the contents continuously increase as the popularity grows. Meanwhile, if the file size increases slower than the quality, some of the high-popularity files are entirely cached but others are not cached at all.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1766-1777
• /
• 2000

In multimedia new service on the internet, there are problems such as server overload, network congestion and initial latency. To overcome these problems, we propose a proxy push-caching scheme that stores a portion of continuous media stream or entire stream, and a transmission scheme of NOD continuous media, RTP-RR and RTP-nR to exploit push-caching scheme. With the proposed push-caching scheme, NOD server pushes fixed portion of stream to a proxy when new data is generated, and the cached size of each stream changes dynamically according to the caching utility value of each stream. As a result, the initial latency of client side could be reduced and the amount of data transmitted fro ma proxy server to client could be increased. Moreover, we estimate a caching utility value of each stream using correlation between disk space occupied by the stream and the amount of data stream requested by client. And we applied the caching utility value ot replacement policies. The performance of the proxy push-caching and continuous media transmission schemes proposed were compared with other schemes using simulations. In the simulation, these schemes show better results than other schemes in terms of BHR (Byte Hit Rate), initial latency, the number of replacement and packet loss rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.457-464
• /
• 2005

Recently, Portable Internet being standardized provides fast movement with wider service range than wireless LAN does. If Portable Internet service starts, many people will use Portable Internet and thus wireless traffic is going to increase. In Portable Internet, it is important to reduce handover latency to provide user with satisfactory service when handover occurs. In IEEE 802.16e, MSS sends its own security context information to one Base Station which it will move to reduce handover latency. But this is not suitable in the situation that the BS doesn't know the security context. To reduce handover latency of proactive caching method that is to send security context information to adjacency Base Stations in advance has been proposed by[4]. In this paper we propose effective traffic management algorithm to reduce signaling network traffic caused by proactive caching method.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1410-1429
• /
• 2017

Mobility arises naturally in the Internet of Things networks, since the location of mobile objects, e.g., mobile agents, mobile software, mobile things, or users with wireless hardware, changes as they move. Tracking their current location is essential to mobile computing. To overcome the scalability problem, hierarchical architectures of location databases have been proposed. When location updates and lookups for mobile objects are localized, these architectures become effective. However, the network signaling costs and the execution number of database operations increase particularly when the scale of the architectures and the numbers of databases becomes large to accommodate a great number of objects. This disadvantage can be alleviated by a location caching scheme which exploits the spatial and temporal locality in location lookup. In this paper, we propose a hierarchical location caching scheme, which acclimates the existing location caching scheme to a hierarchical architecture of location databases. The performance analysis indicates that the adjustment of such thresholds has an impact on cost reduction in the proposed scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.89-97
• /
• 2011

In semantic web information system like ontology that access distributed information from network, efficient query processing requires an advanced caching mechanism to reduce the query response time. P2P network system have become an important infra structure in web environment. In P2P network system, when the query is initiated, reducing the demand of data transformation to source peer is important aspect of efficient query processing. Caching of query and query result takes a particular advantage by adding or removing a query term. Many of the answers may already be cached and can be delivered to the user right away. In web environment, semantic caching method has been proposed which manages the cache as a collection of semantic regions. In this paper, we propose the semantic caching technique in cluster environment of peers. Especially, using schema data filtering technique and schema similarity cache replacement method, we enhanced the query processing efficiency.