• Journal of the Korea Society of Computer and Information
• /
• v.17 no.5
• /
• pp.41-48
• /
• 2012

A Vehicular Ad-hoc Network (VANET) is a vehicular specific type of a mobile ad-hoc network, to provide temporary communications among nearby vehicles. Mobile node of VANET consumes energy and resource with participating in the member of network. In a VANET, data replication and cooperative caching have been used as promising solutions to improve system performance. Existing cooperative caching scheme in a VANET mostly focuses on weak consistency is not always satisfactory. In this paper, we propose an efficient cache management scheme to maintain strong data consistency in a VANET. We make an adaptive scheduling scheme to broadcast Invalidation Report (IR) in order to reduce query delay and communication overhead to maintain strong data consistency. The simulation result shows that our proposed method has a strength in terms of query delay and communication overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.3135-3148
• /
• 2013

The popularization of streaming networks and mobile devices brings a new kind of network called mobile peer-assisted streaming network. In this network, service provider not only offers downloading services, but also pre-pushes resources to users for caching. Users can download their demanded resources while working as servers for uploading the cached data. Also the mobile characteristic makes high package losing probability in this network. So we study how the service provider pre-pushes or the user downloads resources efficiently and effectively while considering the package losing in this paper. We build utility models for service provider and user, and solve the models using Bellman's theory to achieve Nash Equilibrium which shows the service provider's optimal pre-pushing speed and user's optimal downloading speed. The numerical simulation demonstrates the efficiency and effectiveness of our proposed pre-pushing and downloading scheme by comparing to the traditional scheme.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.5
• /
• pp.799-806
• /
• 2020

The rapid growth of smartphone-to-Internet of Things (IoT) connections and the explosive demand for data usage centered on mobile video are increasing day by day, and this increase in data usage creates many problems in the IP system. In a full-based environment, in which information requesters focus on information providers to receive information from specific servers, problems arise with bottlenecks and large data processing. To address this problem, CCN networking technology, a future network technology, has emerged as an alternative to CCN networking technology, which reduces bottlenecks that occur when requesting popular content through caching of intermediate nodes and increases network efficiency, and can be applied to military information and communication networks to address the problem of traffic concentration and the use of various surveillance equipment in full-based networks, such as scientific monitoring systems, and to provide more efficient content.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.2904-2918
• /
• 2020

With a huge demand for replicated content on the Internet, a new networking paradigm called information-centric networking (ICN) has been introduced for efficient content dissemination. In ICN, named content is distributed over the network cache and it is accessed by name instead of a location identifier. These aspects allow users to retrieve content from any of the nodes having replicas, and consequently 1) network resources are more efficiently utilized by avoiding redundant transmission and 2) more scalable services are provided by distributing server loads. However, in-network caching in ICN brings about a new type of security issues, called content poisoning attacks, where fabricated content is located in the network cache and interferes with the normal behavior of the system. In this paper, we look into the problems of content poisoning in ICN and discuss security architectures against them. In particular, we reconsider the state-of-the-art schemes from the perspective of feasibility, and propose a practical security architecture.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1066-1077
• /
• 2004

Dramatic increase in the number of Internet users want highly qualified service of continuous media contents on the web. To solve these problems, we present two network caching schemes(PPC, PPCwP) which consider the characteristics of continuous media objects and user access pattern in this paper. While there are plenty of reasons to create rich media contents, delivering this high bandwidth contents over the internet presents problems such as server overload, network congestion and client-perceived latency. PPC scheme periodically calculates the popularity of objects based on the playback quantity and determines the optimal size of the initial fraction of a continuous media object to be cached in proportion to the calculated popularity. PPCwP scheme calculates the expected popularity using the series information and prefetches the expected initial fraction of newly created continuous media objects. Under the PPCwP scheme, the initial client-perceived latency and the data transferred from a remote server can be reduced and limited cache storage space can be utilized efficiently. Trace-driven simulation have been performed to evaluate the presented caching schemes using the log-files of iMBC. Through these simulations, PPC and PPCwP outperforms LRU and LFU in terms of BHR and DSR.

• MALSORI
• /
• no.50
• /
• pp.51-69
• /
• 2004

In this paper, we present a one-pass semi-dynamic network decoding framework that inherits both advantages of fast decoding speed from static network decoders and memory efficiency from dynamic network decoders. Our method is based on the novel language model network representation that is essentially of finite state machine (FSM). The static network derived from the language model network [1][2] is partitioned into smaller subnetworks which are static by nature or self-structured. The whole network is dynamically managed so that those subnetworks required for decoding are cached in memory. The network is near-minimized by applying the tail-sharing algorithm. Our decoder is evaluated on the 25k-word Korean broadcast news transcription task. In case of the search network itself, the network is reduced by 73.4% from the tail-sharing algorithm. Compared with the equivalent static network decoder, the semi-dynamic network decoder has increased at most 6% in decoding time while it can be flexibly adapted to the various memory configurations, giving the minimal usage of 37.6% of the complete network size.

• The Journal of Information Technology and Database
• /
• v.8 no.2
• /
• pp.41-60
• /
• 2001

Despite the growth in Internet users, demand for multi-medial, large data files and resulting explosive growth in data traffic, there has been lack of investment in Middle-Mile, interconnection of various networks, resulting in bottleneck effect, which is acerbating. One strategy to overcome such network bottleneck is Content Delivery Network (CDN). CDN does not achieve efficient delivery of large file data through physical improvement/increase in network capacity, but by delivering large file contents, the cause of bottlenecks, from distributed servers. Since it is impracticable to physically improve networks capacity to accommodate the growth in internet traffic, CON, by strong CPs contents at cache servers deployed at major ISPs networks, is able to deliver requested contents to the requesting Web clients without the loss of data and long latency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.608-618
• /
• 2006

The increasing popularity of multimedia streaming services introduces new challenges in content distribution. Especially, it is important to provide the QoS guarantees as they are increasingly expected to support the multimedia applications. The service providers can improve the performance of multimedia streaming by caching the initial segment (prefix) of the popular streams at proxies near the requesting clients. The proxy can initiate transmission to the client while requesting the remainder of the stream from the server. In this paper, in order to apply the prefix caching service based on IETF's RTSP environment to the wireless networks, we propose the effective RTSP handling scheme that can adapt to the radio situation in wireless network and reduce the cutting phenomenon. Also, we propose the traffic based caching algorithm (TSLRU) to improve the performance of caching proxy. TSLRU classifies the traffic into three types, and improve the performance of caching proxy by reflecting the several elements such as traffic types, recency, frequency, object size when performing the replacement decision. In simulation, TSLRU and RTSP handling scheme performs better than the existing schemes in terms of byte hit rate, hit rate, startup latency, and throughput.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.109-117
• /
• 2009

In this paper, we propose an efficient service discovery scheme that combines peer-to-peer caching advertisement and node ID-based selective forwarding service requests. P2P caching advertisement quickly spreads available service information and reduces average response hop count since service information store in neighbor node cache. In addition, node ID-based service requests can minimize network transmission delay and can reduce network load since do not broadcast to all neighbor node. Proposed scheme does not require a central lookup server or registry and not rely on flooding that create a number of transmission messages. Simulation results show that proposed scheme improved network loads and response times since reduce a lot of messages and reduce average response hop counts using adaptive selective nodes among neighbor nodes compared to traditional flooding-based protocol.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.149-155
• /
• 2004

This paper describes the self-adaptive Content Service Network (CSN) on Application Level Active Network (ALAN). Web caching technology comprises Content Delivery Network (CDN) for content distribution as well as Content Service Network (CSN) for service distribution. The IETF working group on Open Pluggalble Edge Service (OPES) is the works closely related to CSN. But it can be expected that the self-adaptation in ubiquitous computing environment will be deployed. The existing content service on CSN lacks in considering self-adaptation. This results in inability of existing network to support the additional services. Therefore, in order to address the limitations of the existing networks, this paper suggests Self-adaptive Content Service Network (CSN) using the GME and the extended ALAN to insert intelligence into the existing network.