• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.522-541
• /
• 2016

Network virtualization provides an effective way to overcome the Internet ossification problem. As one of the main challenges in network virtualization, virtual network embedding refers to mapping multiple virtual networks onto a shared substrate network. However, existing heuristic embedding algorithms evaluate the embedding potential of the nodes simply by the product of different resource attributes, which would result in an unbalanced embedding. Furthermore, ignoring the hops of substrate paths that the virtual links would be mapped onto may restrict the ability of the substrate network to accept additional virtual network requests, and lead to low utilization rate of resource. In this paper, we introduce and extend five node attributes that quantify the embedding potential of the nodes from both the local and global views, and adopt the technique for order preference by similarity ideal solution (TOPSIS) to rank the nodes, aiming at balancing different node attributes to increase the utilization rate of resource. Moreover, we propose a novel two-stage virtual network embedding algorithm, which maps the virtual nodes onto the substrate nodes according to the node ranks, and adopts a shortest path-based algorithm to map the virtual links. Simulation results show that the new algorithm significantly increases the long-term average revenue, the long-term revenue to cost ratio and the acceptance ratio.

• KIISE Transactions on Computing Practices
• /
• v.22 no.1
• /
• pp.1-7
• /
• 2016

When multiple applications are running concurrently on a multi-processor system, interferences between applications make it difficult to guarantee real-time constraints. We propose a novel interference analysis technique that allows sharing of share processors among dataflow applications, while satisfying real-time constraints. Based on the interference analysis, we develop a co-scheduling technique that aims to minimize the resource usage. Compared to an existent technique that involves converting application graphs to real-time tasks, the proposed technique shows better results in terms of resource usage, especially when it is applied to applications with tight time constraints.

• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.36-54
• /
• 2014

Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clustered mobile ad hoc networks (MANETs). The mechanism that is adapted to handle token passing at the inter-cluster level is different from that at the intra-cluster level. It makes our algorithm message efficient and thus suitable for MANETs. In the interest of efficiency, we implemented a centralized token passing scheme at the intra-cluster level. The centralized schemes are inherently failure prone. Thus, we have presented an intra-cluster token passing scheme that is able to tolerate a failure. In order to enhance reliability, we applied a distributed token circulation scheme at the inter-cluster level. More importantly, the message complexity of the proposed algorithm is independent of N, which is the total number of nodes in the system. Also, under a heavy load, it turns out to be inversely proportional to n, which is the (average) number of nodes per each cluster. We substantiated our claim with the correctness proof, complexity analysis, and simulation results. In the end, we present a simple approach to make our protocol fault tolerant.

• The Journal of the Korea Contents Association
• /
• v.16 no.10
• /
• pp.467-476
• /
• 2016

With the development of information technology, Small office Home office(SOHO) is picking up. SOHO generally uses Wi-Fi. The wireless LAN environment using 802.11 protocol is easily affected by DoS attacks. To deal with these threats, there is Wireless Intrusion Detection System(WIDS). However, legacy products of WIDS cannot be easily used by SOHO because they are expensive and require management burden. In this paper, Smart WIDS for SOHO is proposed and implemented on Raspberry Pi2. And, it provides the interface for attack detection notice to android smart phone. Smart WIDS detects Masquerading DoS and Resource Depletion DoS based on IEEE 802.11 so that we notice the attempt of cracking Pre-shared Key(PSK), Man-In-The-Middle(MITM), and service failure.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.6
• /
• pp.337-343
• /
• 2006

The Stack Resource Policy (SRP) is a real-time synchronization protocol with some distinct properties. One of such properties is early blocking; the execution of a job is delayed instead of being blocked when requesting shared resources. If SRP is used with dynamic priority scheduling such as Earliest Deadline First (EDF), the early blocking requires that a scheduler should select the highest-priority job among the jobs that will not be blocked, incurring runtime overhead. In this paper, we analyze the runtime overhead of EDF scheduling when SRP is used. We find out that the overhead of job search using the conventional implementations of ready queue and job search algorithms becomes serious as the number of jobs increases. To solve this problem, we propose an alternative data structure for the ready queue and an efficient job-search algorithm with O([log$_2n$]) time complexity.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.890-894
• /
• 2005

Coordination between supply chain partners is viewed critical to effective supply chain management. In many situations such as mutual investments or developing infrastructures for their operations related with each other, the coordination issue arises. Depending on the bargaining power balance between them, it is determined who will be able to exert more influence in making decisions related with such coordination. We consider two cases of the decision-making structure in the context of a simple supply chain consisting of two players, i.e., (1) the first case in which a supply chain partner dominates the decision-making process and the other passively follows the dominant player's decision, and (2) the other case in which the two players share the decision-making process equally. We examine which of the cases is better for the companies and where comes the value of the better case. To answer the research questions, we set up an optimal control theory model and derive an analytical solution. The analysis outcome indicates that the shared decision-making in general produces better results for both companies in the supply chain, and the value of the shared decision-making comes from more effective resource utilization than the dominated case.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.1-11
• /
• 2000

Recently, the explosive popularity of Internet gave birth to researches on Distributed Virtual Environments(DVE). They aim at providing a shared application data environment at realtime for users participating in the same application session across Internet. As more users join the session, and as more multimedia data are shared, because of network resource limitation, it is more difficult to maintain the quality of DVE, such as users' satisfaction level. Previous works mainly tried to solve the scalability, synchronization and data transport issues at the application level, with limited success. We suggest a new network centric solution, that consists of a novel network architecture and protocols upon which any large-scale DVE application can be easily developed. The performance of the proposed scheme, called GAIA, is verified by simulation.

• ETRI Journal
• /
• v.22 no.1
• /
• pp.30-37
• /
• 2000

Existing tree construction mechanisms are classified into source-based trees and center-based trees. The source-based trees produce a source-rooted tree with a low delay. However, for the applications with multiple senders, the management overheads for routing tables and resource reservations are too high. The center-based trees are easy to implement and manage, but a priori configuration of candidate center nodes is required, and the optimization mature such as tree cost and delay is not considered. In this paper, we propose a new multicast tree building algorithm. The proposal algorithm basically builds a non-center based shared tree. In particular, any center node is not pre-configured. In the purposed algorithm, a multicast node among current tree nodes is suitably assigned to each incoming user: Such a node is selected in a fashion that tree cost and the maximum end-to-end delay on the tree are jointly minimized. The existing and proposed algorithms are compared by experiments. In the simulation results, it is shown that the proposed algorithm approximately provides the cost saving of 30% and the delay saving of 10%, compared to the existing approaches. In conclusion, we see that the cost and delay aspects for multicast trees can be improved at the cost of additional computations.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.535-538
• /
• 2004

Coordination between supply chain partners is viewed critical to effective supply chain management. Depending on the bargaining power balance between them, it is determined who will be able to exert more influence in making decisions related with such coordination. We consider two cases of the decision-making structure in the context of a simple supply chain consisting of two players, i.e., (1) the first case in which a supply chain partner dominates the decision-making process and the other passively follows the dominant player's decision, and (2) the other case in which the two players share the decision-making process equally. In this paper, we examine which of the cases is better for the companies and where comes the value of the better case. To answer the research questions, we set up an optimal control theory model and derive an analytical solution. The analysis outcome indicates that the shared decision-making in general produces better results for both companies in the supply chain, and the value of the shared decision-making comes from more effective resource utilization than the dominated case.

• Knowledge Management Research
• /
• v.13 no.1
• /
• pp.25-39
• /
• 2012

According to knowledge-based view, knowledge is an essential strategic resource for a firm to retain sustainable competitive advantage. As knowledge is created and disseminated throughout the firm, the firm can enhance its capability to respond to new and unusual situations. Thus, a lot of companies actively manage their knowledge and intellectual capital. Especially, knowledge management (KM) activities in R&D organizations play a critical role in enhancing R&D performances such as innovation capability. In this regard, this study develops a theoretical model to examine the effects of R&D KM activities on R&D performance. The research model posits KM participation, knowledge management system (KMS) use, and community of practice (CoP) as the main activities of R&D KM. This study proposes that R&D shared knowledge quality and R&D KM satisfaction play a mediating role between R&D KM activities and its performance. The proposed research model was tested by using survey data collected from 248 employees in an R&D department. PLS (partial least squares) was employed for the analysis of the data. The findings of this study showed that R&D KM activities play a significant role in enhancing R&D performance. The findings revealed that R&D shared knowledge quality is not significantly related to R&D performance, while R&D KM satisfaction significantly influences R&D performance. The theoretical and practical implications of the findings were described.