• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4B
• /
• pp.444-454
• /
• 2004

To support diverse transmission requirements of multimedia applications, Quality of Service (QoS) should be provided in the Internet, where only the best-effort service is available. In this paper, we describe our recent effort on the implementation and verification of an extendable and flexible QoS allocation and resource management system based on the bandwidth broker model for realizing the IETF differentiated service (DiffServ). Focusing on the bandwidth issue over single administrative domain, the implemented system provides real-time resource reservation and allocation, delayed call admission control, simple QoS negotiation between sewer and users, and simple resource monitoring. The implemented system is verified by evaluating the performance of a resource-intensive application over the real-world testbed network.

• Journal of the Korean Society of Safety
• /
• v.31 no.4
• /
• pp.156-163
• /
• 2016

There exists required safety integrity level (SIL) to assure safety in accordance with international standards for every electrical / electronics / control equipment or systems with safety related functions. The SIL is allocated from lowest level (level 0) to highest level (level 4). In order to guarantee certain safety level that is internationally acceptable, application of methodology for SIL allocation and demonstration based on related international standards is required. However, the theoretical and practical study for safety integrity level is barely under way in the domestic railway industry. This research studied not only the global process of SIL allocation to guarantee safety in accordance with international standards for safety related equipment and system, but the quantitative methodology based on international standard and the semi-quantitative methodology as alternative way for SIL allocation. Specifically, the systematic SIL allocation for platform screen door system of railway is studied applying the semi-quantitative methodology in order to save much time and effort compared to quantitative method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4848-4863
• /
• 2016

The explosive wireless data service requirement accompanied with carbon dioxide emission and consumption of traditional energy has put pressure on both industria and academia. Wireless networks powered with the uneven and intermittent generated renewable energy have been widely researched and lead to a new research paradigm called green communication. In this paper, we comprehensively consider the total generated renewable energy, QoS requirement and channel quality, then propose a utility based renewable energy allocation policy. The utility here means the satisfaction degree of users with a certain amount allocated renewable energy. The energy allocation problem is formulated as a constraint optimization problem and a heuristic algorithm with low complexity is derived to solve the raised problem. Numerical results show that the renewable energy allocation policy is applicable not only to soft QoS, but also to hard QoS and best effort QoS. When the renewable energy is very scarce, only users with good channel quality can achieve allocated energy.

• Journal of the East Asian Society of Dietary Life
• /
• v.18 no.3
• /
• pp.405-414
• /
• 2008

The purpose of this study was to understand the relationship between a chef's physical pain complaints and occupational circumstances. Cause-and-effect analysis of employees whose work was related to cooking was analyzed in relation to, - factor of cooking circumstances (kitchen condition, cooking operation, cooking allocation and distance of movement, cooking facilities) in order to ascertain possible links to physical pain. Cooking operations appeared to causes pain, especially in neck, shoulders, and legs. Cooking allocation and distance of movement, affected backache, eye-tiredness, and change of body-weight. Cooking space and facilities was related to, pain in waist, neck, shoulders, legs, arms, wrists, and back. Because cooking operations require extended concentrations and intensive effort, inappropriate occupational circumstances can lead to employees who usually suffer from accumulated.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.6
• /
• pp.859-866
• /
• 2001

Successful project planning relies on a good estimation of the effort required to complete a project, together with the schedule options that may be available. Despite the extensive research done developing new and better models, existing software effort estimation models are present only the total effort and effort (or manpower： people per unit time) function for the software life-cycle. Also, Putnam presents constant effort rate in each subcycles. However, the size of total efforts are variable according to the software projects under the influence of its size, complexity and operational environment. As a result, the allocated effort in subcycle also differ from project to project. This paper suggests the linear and polynomial effort estimation models in specifying, building and testing phase followed by the project total effort. These models are derived from 128 different projects. This result can be considered as a practical guideline in management of project schedule and effort allocation.

• KDI Journal of Economic Policy
• /
• v.27 no.2
• /
• pp.205-237
• /
• 2005

This paper analyzes a mechanism through which product market competition affects allocation of the managerial efforts. There are two types of firms, incumbents and entrants. Each incumbent firm delegates its control to a manager and cannot observe the manager's total effort. The managers of incumbent firms allocate their effort to two different activities: cost reduction (productive effort) and rent protection (unproductive effort). An increase in competition, measured by the number of incumbent firms, has two effects: an "output effect" which decreases the managerial incentive for productive effort, and an "effort substitution effect" that makes managers exert more productive effort and less unproductive effort. This paper identifies the conditions under which product market competition lowers the cost of providing incentives for productive effort and hence, to the conclusion that increased competition leads to increased efficiency.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.459-461
• /
• 2022

One of the big differences between Network-on-Chip (NoC) and the existing parallel processing system based on an off-chip network is that data packet routing is performed using a centralized control scheme. In such an environment, the best-effort packet routing problem becomes a real-time assignment problem in which data packet arriving time and processing time is the cost. In this paper, the Hungarian algorithm, a representative computational complexity reduction algorithm for the linear algebraic equation of the allocation problem, is implemented in the form of a hardware accelerator. As a result of logic synthesis using the TSMC 0.18um standard cell library, the area of the circuit designed through case analysis for the cost distribution is reduced by about 16% and the propagation delay of it is reduced by about 52%, compared to the circuit implementing the original operation sequence of the Hungarian algorithm.

• Journal of Software Engineering Society
• /
• v.26 no.4
• /
• pp.77-92
• /
• 2013

To plan a software project, the manager (1)make a work breakdown structure (WBS), (2) estimate efforts for each task, (3) assign employee to each task, and (4) estimate overall schedule. When software project becomes complicated, the possible combination of WBS, effort, and employee assignments dramatically becomes larger. Software planning tool can help software project managers to deal with this complexity. In this research, we discuss with a group of experts who work in software industry, to elicit practical requirements that should be considered in the software planning technique. Considering these requirements, we develop a software project planning tool APP (Automatic Project Planner) which provide effort estimation based on historical knowledge data and automatic human resource allocation. Our technique can be the basis of reasonable and practical software project planing.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.41-49
• /
• 2007

Ethernet passive optical network(EPON) is the next-generation technology for supporting services of high-quality at low-cost. In the EPON, all optical network units(ONUs) have to share a limited uplink channel for upstream data. In order to satisfy bandwidth demands of users on high-capacity local access networks(LANs), the optical line terminal(OLT) efficiently divides and allocates time slots of uplink channel to all ONUs. We discuss previous schemes for dynamic bandwidth allocation(DBA), such as interleaved polling with adaptive cycle time(IPACT) and sliding cycle time(SLICT). In this paper, dynamic right sizing of maximum-windows(DRSM), as a novel bandwidth allocation service, is proposed for more effective and efficient time slot allocation of the uplink channel. DRSM which is based on past information of bandwidth allocated by OLT calculates maximum available bandwidth and dynamically alters the maximum window size for the next ONU. This scheme does not only exert every effort to meet bandwidth demands of ONUs with the possible scope, it also seeks fairness of bandwidth allocation among ONUs.

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

The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols and construct multicast routing graphs for a single multicast group. However. there have been few researches about the relation between multiple and concurrent multicast groups. In this paper, the multiple multicast tree allocation algorithm to avoid congestion is proposed. The multicast group with different bandwidth requirement is also considered. A two-phase algorithm is proposed. The first phase is for basic search and the second phase for further improvement. The performance of the proposed algorithm is experimented with computational results. Computational results show that the proposed algorithm outperforms an existing algorithm.