• Korean Management Science Review
• /
• v.18 no.2
• /
• pp.107-116
• /
• 2001

In the ring leading problem with demand splitting, traffic demands are given for each pair of nodes in an undirected ring network and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the problem is to minimize the maximum link load on the ring. Recently, four different optimal a1gorithms have been developed for solving the problem. In this paper, we compare those algorithms in a single framework and conduct a computational study to evaluate the practical performance of those algorithms.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.136-147
• /
• 2002

In this paper, the maximal capacity of the data network link has attempted to be exploited by using the dynamic allocation strategy. We propose a new methodology based on the economic models for competing traffic classes (classes of sessions) in packet networks. As the demand for network services accelerates, users' satisfaction to the service level might decrease due to the congestion at the network nodes. To prevent this, efficient allocation of a networks resources, such as available bandwidth and switch capacity, is needed. By using the so-called user profile as well as the utility (e.g., data rate) functions, it is possible to allocate data rates and other utilities using the arbitrary number of QoS classes, say $0.01,...,$10.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.426-433
• /
• 2002

This paper deals with an offline routing problem, which can be used as an explicit routing procedure in MPLS(Multiprotocol Label Switching) network, for traffic engineering. This problem is formulated as an MIP(Mixed Integer Programming) with the objective function which is to minimize the sum of the maximum link utilization for load balancing (link utilization) and the routing cost. Constraints arc composed of link capacity restriction and demand requirement that has origin-destination pair, bandwidth requirement and hop restriction. The problem is proved to be NP-hard so that the Lagrangean relaxation method is applied to propose a Lagrangean heuristic. To test the effectiveness & efficiency of the proposed algorithm, computational experiments are performed with numerical instances. The experiment results show that the proposed algorithm solves the problem within a reasonable time.

• International Journal of Quality Innovation
• /
• v.8 no.1
• /
• pp.1-14
• /
• 2007

The Six Sigma and Lean Production methodologies suggest that creating value for customers is the objective of a production process or an organisation. In the production context, "added value" dominates the discussion about the creation of value to customers. However, "added value" is often only defined conceptually or discussed at a strategic level, and the link between added value and customer value has not yet been well conceptualised. Therefore, the purpose of the paper is to develop a methodology to measure added value in order to complement the existing performance measures in Six Sigma and Lean Production by conceptualising the link between customer value and added value. The conceptual link "confirms" that quality, time, and costs are the elements of added value, which are transformed into a metric to express customer value. The implementation of the metric recommends the adoption of Lean (Six) Sigma and Lean Accounting (Activity Based Costing), which thus implies that "leanness" is an important "feature" of added value.

• Knowledge Management Research
• /
• v.15 no.4
• /
• pp.207-221
• /
• 2014

Due to the awareness for the importance of social capital, many researches have investigated that social capital contributes to the successful implementation of product innovation. Although most researchers tried to model the effect of social capital on product innovation as a linear relation, we consider it too simplistic and fuzzy because knowledge utilization which ultimately leads to product innovation should exist in the relationship between social capital and product innovation. Using 107 survey data, this study found there is a partial mediating effect of knowledge utilization on the link between structure aspect of social capital and product innovation (i.e., new product development and improvement in existing products). Next, this study reported knowledge utilization does act as a perfect mediating variable on the link between awareness aspect of social capital and improvement of existing products, but act as a partial mediating variable on the link between awareness aspect of social capital and new product development. Finally, this study found that knowledge utilization does not act as a mediating variable on the link between relation aspect of social capita and product innovation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3766-3788
• /
• 2017

A blockchain is an underlying technology and basic infrastructure of the Bitcoin system. At present, blockchains and their applications are developing rapidly. However, the basic research of blockchain technology is still in the early stages. The efficiency and reliability of blockchain communication is one of the research problems that urgently need to be studied and addressed. Existing algorithms may be less feasible for blockchain-based communication because they only consider a single communication factor (node communication capability or node trust degree) and only focus on a single communication performance parameter(communication time or communication reliability). In this paper, to shorten the validation time of blockchain transactions and improve the reliability of blockchain-based communication, we first establish a multi-link concurrent communication model based on trust degree, and then we propose a novel integrated factor communication tree algorithm (IFT). This algorithm comprehensively considers the node communication link number and the node trust degree and selects several nodes with powerful communication capacity and high trust as the communication sources to improve the concurrency and communication efficiency. Simulation results indicate that the IFT algorithm outperforms existing algorithms. A blockchain communication routing scheme based on the IFT algorithm can increase communication efficiency by ensuring communication reliability.

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

In P2P streaming management, peer's churning and finding efficient topology architecture optimization algorithm that reduces streaming delay is important. This paper studies a topology optimization algorithm based on the P2P streaming using peer's link information. The proposed algorithm is based on the estimation of peer's upload bandwidth using peer's link information on mesh-network. The existing algorithm that uses the information of connected links is efficient to reduce message overload in the point of resource management. But it has a risk of making unreliable topology not considering upload bandwidth. And when some network error occurs in a server-closer-peer, it may make the topology worse. In this paper we propose an algorithm that makes up for the weak point of the existing algorithm. We compare the existing algorithm with the proposed algorithm using test data and analyze each simulation result.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.633-635
• /
• 2018

The compensation characteristics of the distorted WDM channels compensated for by dispersion management (DM) and optical phase conjugation in the long-haul (50 fiber spans ${\times}$ 80 km) transmission link with the randomly distributed single mode fiber (SMF) length and residual dispersion per spans (RDPS) are investigated as a function of the arrangement of SMF and dispersion compensating fiber (DCF) and the control position of net residual dispersion (NRD).

• Journal of Platform Technology
• /
• v.11 no.5
• /
• pp.3-15
• /
• 2023

Requirements traceability link information is the basis for determining whether requirement change requested throughout the software development life cycle should be reflected in the system. Setting up complete requirements traceability links requires considerable effort. However, the commensurate benefits can be obtained in later development or further maintenance phases. For this reason, setting up and managing requirements traceability links in the software development phase are tasks that cause considerable resistance to developers. This study proposes a method for generating requirement traceability links in business applications. The key feature of the proposed method is that the traceability link from the requirements element, which is the basis of the corresponding element to the analysis element, is automatically established at the same time the elements of the analysis model are identified. This can be a way to reduce developer effort while increasing the efficiency of the traceability model. A case study on a Course Registration System demonstrates the feasibility of applying the proposed requirements traceability management method to actual software development.

• Journal of Advanced Navigation Technology
• /
• v.12 no.3
• /
• pp.201-207
• /
• 2008

Design rule of optical transmission link consisted of dispersion management (DM) controlling accumulated dispersion in total fiber length by precompensation and postcompensation, and optical phase conjugator (OPC) positioned at mid-way are proposed. DM schemes investigated in this paper are 2 types depending on the position of precompensation and postcompensation; bi-end type and concentration type. It is confirmed that effective residual dispersion ranges, as a design parameter of optical link, of transmission section from transmitter to OPC and transmission section from OPC to receiver are independence on the positions of dispersion compensating fiber (DCF) accomplishing precompensation and postcompensation, if both DCF position is symmetry with respect to OPC.