• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4287-4306
• /
• 2016

Network resilience provides an effective way to overcome the problem of network failure and is crucial to Internet protocol (IP) network management. As one of the main challenges in network resilience, recovering from link failure is important to maintain the constancy of packets being transmitted. However, existing failure recovery approaches do not handle the traffic engineering problem (e.g., tuning the routing-protocol parameters to optimize the rerouting traffic flow), which may cause serious congestions. Moreover, as the lack of QoS (quality of service) restrictions may lead to invalid rerouting traffic, the QoS requirements (e.g., bandwidth and delay) should also be taken into account when recovering the failed links. In this paper, we first develop a probabilistically correlated failure model that can accurately reflect the correlation between link failures, with which we can choose reliable backup paths (BPs). Then we construct a mathematical model for the failure recovery problem, which takes maximum rerouting traffic as the optimizing objective and the QoS requirements as the constraints. Moreover, we propose a heuristic algorithm for link failure recovery, which adopts the improved k shortest path algorithm to splice the single BP and supplies more protection resources for the links with higher priority. We also prove the correctness of the proposed algorithm. Moreover, the time and space complexity are also analyzed. Simulation results under NS2 show that the proposed algorithm improves the link failure recovery rate and increases the QoS satisfaction rate significantly.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.21 no.6
• /
• pp.679-688
• /
• 2015

Stability and security of energy resources are one of the most important factors for a national-development. In this research, we analyzed the Republic of Korea's policy making system on energy security and identified the problems from an innovation system perspective. In terms of the actors, they had limitations that ROK's navy do not have enough strategic plan for energy transportation. The links between innovation actors except defense area were relatively good, but links between the military area(navy) and other innovation actors had weak linkage. The infrastructure did't have enough consideration for military force development. For the institution; the role of the military area on energy security was not completely established. Therefore, participation of the defense area(navy) is required to be stated institutionally.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.1986-1993
• /
• 2015

We investigate the optimal resource and power allocation for device-to-device (D2D) communications in a multicell environment. When D2D links reuse the cellular radio resources, each D2D user will interfere with a cellular link and other D2D links, in its own cell as well as in adjacent cells. Under such situation, we propose a coordinated resource allocation scheme that can handle the intercell interferences as well as the intracell interference. For a given resource allocation, we also formulate a power optimization problem and present an algorithm for finding the optimal solution. The resource and power allocation algorithms are designed to maximize the achievable rate of the D2D link, while limiting the generated interference to the cellular link. The performance of the proposed algorithms is evaluated through simulations in a multicell environment. Numerical results are presented to verify the coordination gain in the resource and power allocation.

• Journal of Information Management
• /
• v.32 no.1
• /
• pp.23-49
• /
• 2001

The purpose of this study is to examine how corporate names are treated in the OPACs in Korea, and to find out how well the authority control is implemented. A corporate body often has different names and different forms of names which should be properly linked in the OPACs. Without the help of either references or internal links among such names and forms of names in the OPACs, users are likely to fail in getting the right results, In this study, the OPACs from the five major libraries, the National Assembly Library, KISTI, Yonsei University, the National Central Library, and the KERIS were examined. Major common findings include (1) the lack of consistency in applying cataloging rules, (2) the lack of proper authority control in treating corporate names, and (3) the lack of references or links among names and variant forms of names. Because of the small scale of this study, more comprehensive and thorough study seems to be needed. However, the overall improvement of cataloging practices and application of authority control is strongly suggested, based upon the findings.

• Cross-Cultural Studies
• /
• v.49
• /
• pp.33-58
• /
• 2017

As a living space, house constitutes a good part of inhabitants' life, making the rhythm of life. This rhythm tends to be reflected into the house, establishing a sort of intercommunications between the house and its inhabitants. Becoming a living element, the house can endow the writer with literary resources. It is interrelated with its inhabitants. Thus, Duras' work preserves many invisible and fusional traces of links between her characters and the house. With her writing, the house displays important traces of life, with which a body of meaning is to be formed. It implies habits, imprints, links, and so on. Here, its projection into the imaginary also takes place for our writer. With this perspective in view, Duras is supposed to objectify her characters as physical and imaginary bodies. This introduces the passage from the real to the imaginary and vice versa. Unknown stories hidden behind the living places can come to manifest themselves through her writing.

• Korean Journal of Agricultural Science
• /
• v.45 no.2
• /
• pp.298-307
• /
• 2018

The aim of this study was to enhance the value of the chestnut industry by analyzing the value chain structure. Based on the value chain theory, it is divided into primary activities and support activities. Thus, in total, 27 subjects from Gongju, Buyeo, and Cheongyang were interviewed and self-administered questionnaire. Regarding the value chain structure of the chestnut industry, the primary activities consisted of production followed by cultivation and storing, sorting and packaging, transportation and marketing sales. The support activities were divided into production infrastructure, policy, R&D, and systematization. The primary activities are able to maximize profits through cost reductions. The production was divided into general and environmentally friendly cultivation. Depending on the labor force, it is family-centered labor. However, the installation of harvest nets depends on a hired labor force (40 - 60%) such that it would be necessary to have a mechanized harvest to replace the manpower for the cost reduction. Transportation, marketing sales, and backdoor selling (38.1%) were higher than the existing channels (31.0%) using the National Agricultural Cooperative Federation. The enhancement of value could be created by maximizing profits through the reinforcement of the links between each subject. The production showed strong connections with cultivation/storing, sorting/packing, and backdoor selling and the National Forestry Cooperative Federation. The processing stage is a very simple structure, it would be necessary to have R&D and to support promotions, infrastructure, machines, and sales increases, which should be expanded by connections with other industries like the food industry.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.23-34
• /
• 2005

In a large scale parallel computation, failures of some nodes or communication links end up with waste of computing resources, Several fault-tolerant MPI libraries have been proposed so far, but the programs written by using such libraries have a portability problem since fault-tolerant features are not supported by the MPI standard yet, In this paper, we propose an application-level fault-tolerant linear system solver that uses the asynchronous iteration algorithm and the standard MPI functions only, which does not have a portability problem and is more efficient by adopting a simplified recovery mechanism.

• ETRI Journal
• /
• v.30 no.5
• /
• pp.674-684
• /
• 2008

This paper proposes a dual addressing scheme (DAS) for IPv6 over IEEE 802.15.4 wireless sensor networks (WSN). DAS combines a global unicast address to cope with association link changes and node mobility, and it links local addresses to lighten the overhead of the system to save energy and resources. This paper describes DAS address formats, address autoconfiguration, and address translation tables in the gateway. A detailed description of DAS is provided through examples. Simulations are performed to demonstrate the performance improvements of the DAS compared with the IPv6-based WSN, which uses the conventional single address.

• ETRI Journal
• /
• v.28 no.4
• /
• pp.517-520
• /
• 2006

In this letter, a new sharing mechanism, SRLG sharing, is proposed, which allows the links of the same shared risk link group (SRLG) in a primary light tree to share protections in WDM optical networks. In previous studies, how to share spare resources with SRLG constraints has not been studied in multicast optical networks. In this letter, considering SRLG sharing, we propose a novel algorithm -multicast with SRLG sharing (MSS)- to establish a protection light tree. Finally, the algorithm MSS and the algorithm multicast with no SRLG sharing (MNSS) are compared through a simulation to show that our new sharing scheme of SRLG sharing is more efficient than that of no SRLG sharing in terms of spare resource utilization and blocking probability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5694-5711
• /
• 2017

The technology of cloud computing is growing very quickly, thus it is required to manage the process of resource allocation. In this paper, load balancing algorithm based on honey bee behavior (LBA_HB) is proposed. Its main goal is distribute workload of multiple network links in the way that avoid underutilization and over utilization of the resources. This can be achieved by allocating the incoming task to a virtual machine (VM) which meets two conditions; number of tasks currently processing by this VM is less than number of tasks currently processing by other VMs and the deviation of this VM processing time from average processing time of all VMs is less than a threshold value. The proposed algorithm is compared with different scheduling algorithms; honey bee, ant colony, modified throttled and round robin algorithms. The results of experiments show the efficiency of the proposed algorithm in terms of execution time, response time, makespan, standard deviation of load, and degree of imbalance.