• Journal of Korea Technology Innovation Society
• /
• v.2 no.3
• /
• pp.118-128
• /
• 1999

This study attempts to provide an efficient method for managing the Nuclear R&D projects. It should be noted that the technology and experiences to develop a well-balanced plan and mon-itoring for the R&D project are not yet well established when compared with the commercial con-structionand engineering projects. This study recommends that the R&D project manager utilize the scheduling techniques to establish an integral management system taking in to account the un-certainties in the research environment. Based upon the results of a case study for the Liquid Metal Reactor Design Technology Development Project which is led by the KAERI this study also con-firms that it is possible to run the national nuclear R&D projects with the Scheduling & Planning.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2010.05a
• /
• pp.131-133
• /
• 2010

As linear scheduling method has been used since 1929, Empire State Building linear schedule, it is being applied in various fields such as construction and manufacturing. When addressing concurrent critical path occurring on linear schedule of construction, the empirical researches stress the resource management which should be applied for optimizing work flow, flexible work productivity and continuos resource allocation. However, work relationships has been usually overlooked for making the linear schedule from existing network schedule. Therefore, this research analyze the previous researches related to linear scheduling model and then propose the method that can be applied for adopting the relationships of network schedule to the linear schedule.

• Journal of Information Technology Applications and Management
• /
• v.23 no.2
• /
• pp.61-80
• /
• 2016

The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

• Management & Information Systems Review
• /
• v.14
• /
• pp.67-77
• /
• 2004

Although project management for new product development is a very important issue, only a few approach from project scheduling has been made. The traditional project scheduling research has focused on the project network with certainty, but the new product development project has some uncertainties in network; Some activities may not need to be peformed, and/or some precedent relationships between activities may not need to be kept. In this paper, a simulation model is introduced in order to reflect uncertainties in project network for new product development. This simulation model can be used as a project scheduling technique for product development. By repeating the simulation, the degree of the risk and the feasibility of the project can be assessed.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.254-260
• /
• 2005

In the guaranteed service, a real-time scheduling algorithm must achieve both high level of network utilization and scalable implementation. Here, network utilization indicates the number of admitted real-time sessions. Unfortunately, existing scheduling algorithms either are lack of scalable implementation or can achieve low network utilization. For example, scheduling algorithms based on time-stamps have the problem of O(log N) scheduling complexity where N is the number of sessions. On the contrary, round-robin algorithms require O(1) complexity. but can achieve just a low level of network utilization. In this paper, we propose a scheduling algorithm that can achieve high network utilization without losing scalability. The proposed algorithm is a Hierarchical Round-Robin (H-RR) algorithm that utilizes multiple rounds with different interval sizes. It provides latency bounds similar to those by Packet-by-Packet Generalized Processor Sharing (PGPS) algorithm using a sorted-Priority queue. However, H-RR requires a constant time for implementation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.46-58
• /
• 2003

The recent Internet is changing from its best-effort service and needs the network structure and traffic engineering, which can support various applications requiring differentiated traffic processing and high quality of service. The extension of the Internet from wired to wireless system generating location-dependent and burst errors make more difficult to support a good service with the existing packet scheduling algorithm. In this paper, we propose a wireless diffserv packet scheduling (WDSPS) algorithm that can provide reliable service in the differentiated wireless internet service network. The proposed scheduling algorithm solves the HOL(head of line) blocking problems of class queue occurred in wireless network, supports the differentiated service for each class which is defined in differentiated service networks and makes possible the gradual and efficient service compensation not only among classes but also among flows to prevent the monopoly of one class or one flow. Through simulations, we show that our proposed WDSPS scheduling algorithm can provide the required QoS differentiation between classes and enhance the service throughput in various wireless network conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.193-214
• /
• 2017

In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.237-252
• /
• 2017

In recent years, data centers have become the core infrastructure to deal with big data processing. For these big data applications, network transmission has become one of the most important factors affecting the performance. In order to improve network utilization and reduce job completion time, in this paper, by real-time monitoring from the application layer, we propose job-aware priority scheduling. Our approach takes the correlations of flows in the same job into account, and flows in the same job are assigned the same priority. Therefore, we expect that flows in the same job finish their transmissions at about the same time, avoiding lagging flows. To achieve load balancing, two approaches (Flow-based and Spray) using ECMP (Equal-Cost multi-path routing) are presented. We implemented our scheme using NS-2 simulator. In our evaluations, we emulate real network environment by setting background traffic, scheduling delay and link failures. The experimental results show that our approach can enhance the Hadoop job execution efficiency of the shuffle stage, significantly reduce the network transmission time of the highest priority job.

• Journal of information and communication convergence engineering
• /
• v.16 no.2
• /
• pp.84-92
• /
• 2018

For large wireless sensor networks running on battery power, the time synchronization of all sensor nodes is becoming a crucial task for waking up sensor nodes with exact timing and controlling transmission and reception timing. However, as network size increases, this synchronization process tends to require long processing time consume significant power. Furthermore, a naïve synchronization scheduler may leave some nodes unsynchronized. This paper proposes a power-efficient scheduling algorithm for time synchronization utilizing the notion of density, which is defined by the number of neighboring nodes within wireless range. The proposed scheduling algorithm elects a sequence of minimal reference nodes that can complete the synchronization with the smallest possible number of hops and lowest possible power consumption. Additionally, it ensures coverage of all sensor nodes utilizing a two-pass synchronization scheduling process. We implemented the proposed synchronization algorithm in a network simulator. Extensive simulation results demonstrate that the proposed algorithm can reduce the power consumption required for the periodic synchronization process by up to 40% for large sensor networks compared to a simplistic multi-hop synchronization method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.8
• /
• pp.2736-2750
• /
• 2022

As demands for the maritime communications increase, a variety of functions and information are required to exchange via elements of maritime systems, which leads communication traffic increases in maritime frequency bands, especially in VHF (Very High Frequency) band. Thus, effective resource management is crucial to the future maritime communication systems not only to the typical terrestrial communication systems. VHF data exchange system (VDES) enables to utilize more flexible configuration according to the communication condition. This paper focuses on the VDES communication system among VDES terminals such as shore stations, ship stations and aids to navigation (AtoN) to address efficient resource allocation. We propose a resource management method considering a MIMO (Multiple Input Multiple Output) technique in VDES, which has been widely used for modern terrestrial wireless networks but not for marine environments by scheduling the essential communication resources. We introduce the general channel model in marine environment and give two metrics, spectral and the energy efficiencies to examine our resource scheduling algorithm. Based on the simulation results and analysis, the proposed method provides a possibility to enhance spectral and energy efficiencies. Additionally, we present a trade-off relationship between spectral and energy efficiencies. Furthermore, we examine the resource efficiencies related to the imperfect channel estimation.