• Journal of the Korean Data and Information Science Society
• /
• v.21 no.3
• /
• pp.605-619
• /
• 2010

Caching of frequently accessed data in multi-hop ad hoc environment is a technique that can improve data access performance and availability. Cooperative caching, which allows sharing and coordination of cached data among several clients, can further en-hance the potential of caching techniques. In this paper, we propose a fuzzy cooperative caching scheme in mobile ad hoc networks. The cache management of the proposed caching scheme not only uses adaptively CacheData or CachePath based on data sim-ilarity and data utility, but also uses the replacement manager based on data pro t. Also, the proposed caching scheme uses a prefetch manager. When the TTL of the cached data expires, the prefetch manager evaluates the popularity index of the data. If the popularity index is larger than a threshold, the data is prefetched. Otherwise, its space is released. The performance of the proposed scheme is evaluated analytically and is compared to that of other cooperative caching schemes.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.6
• /
• pp.1177-1190
• /
• 2009

In this paper, we propose a fuzzy proxy cache scheme for caching web documents in mobile base stations. In this scheme, a mobile cache model is used to facilitate data caching and data replication. Using the proposed cache scheme, the individual proxy in the base station makes cache decisions based solely on its local knowledge of the global cache state so that the entire wireless proxy cache system can be effectively managed without centralized control. To improve the performance of proxy caching, the proposed cache scheme predicts the direction of movement of mobile hosts, and uses various cache methods for neighboring proxy servers according to the fuzzy-logic-based control rules based on the membership degree of the mobile host. The performance of our cache scheme is evaluated analytically in terms of average response delay and average energy cost, and is compared with that of other mobile cache schemes.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.2
• /
• pp.269-285
• /
• 2011

Caching of frequently accessed data in mobile ad-hoc networks is a technique that can improve data access performance and availability. Cooperative caching, which allows sharing and coordination of cached data among several clients, can further enhance the potential of caching techniques. In this paper, we propose a cluster-based fuzzy cooperative caching method for mobile ad-hoc networks. The performance of the proposed caching method is evaluated through an analytical model and is compared to that of other cooperative caching methods.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.13-21
• /
• 2012

Mobile data caching is usually used as an effective way to improve the speed of local transaction processing and reduce server load. In mobile database environment, due to its characters - low bandwidth, excessive latency and intermittent network, caching is especially crucial. A lot of mobile data caching strategies have been proposed to handle these problems over the last few years. However, with smart phone widely application these approaches cannot support vast data requirements efficiently. In this paper, to make full use of cache data, lower wireless transmission quantity and raise transaction success rate, we design a new mobile data caching synchronization strategy based on in-demand and replacement priority. We experimentally verify that our techniques significantly reduce quantity of wireless transmission and improve transaction success rate, especially when mobile client request a large amount of data.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.668-679
• /
• 2004

When users of mobile environments move fast or slow into a number of base stations(BS) and request the services of continuous media data such as video or audio, this study examines what the caching has the usefulness in mobile environments. Namely, to reduce packet disconnections and network overheads in mobile environments and minimize transmission delay time, we propose domain-based hierarchical caching structure and study whether application of caching has the usefulness. So we have a model based on user environments and hierarchical network structure to process continuous media services, and analyze the usefulness of caching which depends on the mobile patterns of user and the locations of caching nodes. And then, we research whether caching offers the usefulness in mobile environments. As the result, we are able to see that an adaptable application of caching is needed because the hit ratio and the number of replacement vary in large according to mobile patterns of user and locations of caching.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1238-1259
• /
• 2024

Previous studies on joint optimization of computation offloading and service caching policies in Mobile Edge Computing (MEC) have often neglected the impact of dependency-aware subtasks, edge server resource constraints, and multiple users on policy formulation. To remedy this deficiency, this paper proposes a many-objective joint optimization dependency-aware task offloading and service caching model (MaJDTOSC). MaJDTOSC considers the impact of dependencies between subtasks on the joint optimization problem of task offloading and service caching in multi-user, resource-constrained MEC scenarios, and takes the task completion time, energy consumption, subtask hit rate, load variability, and storage resource utilization as optimization objectives. Meanwhile, in order to better solve MaJDTOSC, a many-objective evolutionary algorithm TSMSNSGAIII based on a three-stage mating selection strategy is proposed. Simulation results show that TSMSNSGAIII exhibits an excellent and stable performance in solving MaJDTOSC with different number of users setting and can converge faster. Therefore, it is believed that TSMSNSGAIII can provide appropriate sub-task offloading and service caching strategies in multi-user and resource-constrained MEC scenarios, which can greatly improve the system offloading efficiency and enhance the user experience.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.11
• /
• pp.1511-1517
• /
• 2018

Mobile Device-to-Device (D2D) caching networks can transmit multimedia data to users directly without passing through any network infrastructure by storing popular multimedia contents in advance that are popular among many mobile users at caching server devices (CSDs) in distributed manners. Thus, mobile D2D caching networks can significantly reduce backhaul traffic in wired networks and service latency time of mobile users. In this paper, we propose an efficient transmission scheme that can enhance the transmission efficiency of mobile D2D caching networks by using multiple CSDs that are caching the contents that are popular among mobile users. By sorting the multiple CSDs that are caching a content that mobile users want to receive according to their channel gains, the proposed scheme can reduce the complexity of algorithm significantly, compared to an optimal scheme based on Brute-force searching, and can also obtain much higher network transmission efficiency than the existing Blanket and Opportunistic transmission schemes.

• Journal of Industrial Technology
• /
• v.27 no.B
• /
• pp.185-192
• /
• 2007

Transcoding video proxy is necessary to support various bandwidth requirements for mobile multimedia and to provide adapting video streams to mobile clients. Caching algorithms for proxy are to reduce the network traffic between the content servers and the proxy. This paper proposes a Meta-tailed caching for transcoding proxy that is efficient to lower network load and CPU load. Caching of two different data types - transcoded video, and metadata - provides a foundation to achieve superior balance between network resource and computation resource at transcoding proxies. Experimental results show that the Meta-tailed caching lowers at least 10% of CPU-load and at least 9% of network-load at a transcoding proxy.

• Journal of Information Technology Services
• /
• v.8 no.1
• /
• pp.179-192
• /
• 2009

In wireless environments, it is very effective to introduce a data broadcast system for providing a number of clients with mobile data services. In particular, an efficient broadcast scheduling and a caching strategy are very important for performance of data broadcast systems in wireless environments which have such inherent restrictions as low bandwidth, frequent disconnections, and short battery life. In this paper, we present a data broadcast scheduling strategy using bit vectors to cope with dynamic request patterns of clients. In addition, we also propose an efficient caching strategy, 2FWT, that takes characteristics of the broadcast scheduling strategy into account. Finally, we evaluate performance of the data broadcast system. According to the results, the proposed system generally shows better performance than others.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.2
• /
• pp.43-50
• /
• 2022

As the use of mobile data increases, the proportion of video content is increasing steeply. In order to solve problems that arise when mobile users receive data from geographically remote cloud servers, methods of caching data in advance to edge servers geographically close to the users are attracting lots of attention. In this paper, we present a caching policy that stores data on Small Cell Base Station(SBS) to effectively provide content files to mobile users by applying a delayed offloading scheme in a cellular network. The goal of the proposed policy is to minimize the size of data transmitted from Macro Base Station(MBS) because the delayed offloading scheme requires more cost than when downloaded from MBS than from SBS. The caching policy is proposed to determine the size of content file and which content file to be cached to SBS using the probability of mobile users' paths and the popularity of content files, and to replace content files in consideration of the overlapping coverage of SBS. In addition, through performance evaluation, it has been proven that the proposed policy reduces the size of data downloaded from MBS compared to other algorithms.