• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1597-1608
• /
• 2016

Recently, a number of solutions were proposed to address the challenges and issues of vehicular networks. Vehicular Cloud Computing (VCC) is one of the solutions. The vehicular cloud computing is a new hybrid technology that has a remarkable impact on traffic management and road safety by instantly using vehicular resources. In this paper, we study an important vehicular cloud service, content-based delivery, that allows future vehicular cloud applications to store, share and search data totally within the cloud. We design a VCC-based system architecture for efficient sharing of vehicular contents, and propose a Hierarchical Hybrid Content Delivery scheme using Bloom Filter (H2CDBF) for efficient vehicular content delivery in Vehicular Ad-hoc Networks (VANETs). The performance of the proposed H2CDBF is evaluated through an analytical model, and is compared to the proactive content discovery scheme, Bloom-Filter Routing (BFR).

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.4
• /
• pp.406-412
• /
• 2001

IP address lookup is to determine the next hop destination of an incoming packet in the router. The address lookup is a major bottleneck in high performance router due to the increased routing table sizes, increased traffic, higher speed links, and the migration to 128 bits IPv6 addresses. IP lookup time is dependent on data structure of lookup table and search scheme. In this paper, we propose a new approach to build a lookup table that satisfies the memory constraint. The design of lookup table is formulated as an optimization problem. The objective is to minimize average depth from the root node for lookup. We assume that the frequencies with which prefixes are accessed are known and the data structure is level compressed trie with branching factor $\kappa$ at the root and binary at all other nodes. Thus, the problem is to determine the branching factor k at the root node such that the average depth is minimized. A heuristic procedure is proposed to solve the problem. Experimental results show that the lookup table based on the proposed heuristic has better average and the worst-case depth for lookup.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.5
• /
• pp.38-45
• /
• 2012

Finding shortest paths on time dependent networks is an important task for scheduling and routing plan and real-time navigation system in ITS. In this research, one-to-one time dependent shortest path algorithms based on link flow speeds on urban networks are proposed. For this work, first we select three general shortest path algorithms such as Graph growth algorithm with two queues, Dijkstra's algorithm with approximate buckets and Dijkstra's algorithm with double buckets. These algorithms were developed to compute shortest distance paths from one node to all nodes in a network and have proven to be fast and efficient algorithms in real networks. These algorithms are extended to compute a time dependent shortest path from an origin node to a destination node in real urban networks. Three extended algorithms are implemented on a data set from real urban networks to test and evaluate three algorithms. A data set consists of 4 urban street networks for Anaheim, CA, Baltimore, MD, Chicago, IL, and Philadelphia, PA. Based on the computational results, among the three algorithms for TDSP, the extended Dijkstra's algorithm with double buckets is recommended to solve one-to-one time dependent shortest path for urban street networks.

• Journal of Digital Contents Society
• /
• v.17 no.3
• /
• pp.111-118
• /
• 2016

Proxy mobile IPv6 (PMIPv6), which is a centralized mobility management protocol, are dependent on a local mobility anchor (LMA) to process all control and data traffics. Therefore, it has serious problems such as the tremendous traffic concentration into the core network and the triangle routing. In this paper, therefore, in order to alleviate these drawbacks, we propose a PMIPv6-based enhanced distributed mobility management scheme considering a user's traffic locality. Performance evaluation results indicate that in most cases, except for when a user's mobility rate is relatively very higher than the traffic rate, the proposed scheme shows better performance result than that of PMIPv6. Besides, it is demonstrated that the proposed scheme can be an effective alternative that can distribute the significant loads on the LMA of the core networks to the MAGs of the edge networks.

• The Korean Journal of Franchise Management
• /
• v.10 no.2
• /
• pp.33-47
• /
• 2019

Purpose - The purpose of this study is to classify and analyze existing studies from various angles through systematic literature review of how human resources development has been researched in the domestic franchise business. These studies are intended to suggest the direction in which human resource development research should be conducted in the future in the franchise business. Research design, data, and methodology - This study is based on systematic literature review methodology. It has gone through the process of subject language setting, literature search routing, search term selection, literature selection, literature classification and literature analysis. The systematic literature review identified 59 peer-reviewed dissertations and scientific journal publications on the subject of HRD in Korea franchise business. Result - This study analyzed by research methods, research industries, research population and dependent variable using the systematic review process. The literature studied in the 2000s mainly led to research on education and training of franchise employees in beauty franchise business. In the literature studied since 2010, human resources development was mainly studied in the supervisor in the restaurant franchise business, and in the study of competence rather than education and training. According to the research methods, statistical methods were mostly relatively simple, such as t-test or one-way distribution analysis until the 2000s, and after 2010, in-depth and structural studies using multiple return analysis, structural method analysis, path analysis, multi-dimensional scale analysis, AHP, etc were conducted. When classified by study dependant, early research until the 2000s focused on the study of education and training, which is an independent variable, on the satisfaction of education programs, job satisfaction, and immersion. On the other hand, studies conducted since 2010 have produced more complex results using various medium variants, and those related to management performance and relationship performance have been mainly studied, rather than the satisfaction of the education itself. Conclusions - While the domestic franchise business is expanding in terms of quantity, such as the number of franchises and franchises, the development in terms of quality for the joint growth of franchises and franchisees is still lacking. In order for the franchisee to continue to grow with each other, the franchisee must identify and develop their current performance or expected capabilities through capacity modeling at various targets and levels.