• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.10
• /
• pp.1194-1199
• /
• 2010

In this paper, for a relay-based cellular network, a interference avoidance beamforming technique is proposed to enhance direct link capacity while minimizing loss in the capacity of concurrent relaying link. A direct link is transmitted by beamforming at the transmitter, and the relaying link with the least interference to the direct link is scheduled to transmit data by a collision avoidance scheduling algorithm. Simulation results show that the proposed IA beamforming provides a considerable direct link capacity enhancement while minimizing relaying link capacity loss by effectively mitigating inference between concurrent direct and relaying links only with limited feedback.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1610-1618
• /
• 1998

In this paper, we present the FB(Fair Buffering) mechanism for the efficient support of TCP traffic over UBR connections in the subnet ATM model. We show that both throughput and fairness may be improved with the FB mechanism. The FB mechanism is founded on the observation that the performance of TCP over UBR connections is optimal when the buffer space is allocated in proportion to the connection's bandwidth-delay product. We compare through simulation the performance of the existing drop-tail, EB(Equal Buffering) and the proposed FB buffer management schemes, with and without RR(Roung-Robin) scheduling, and demonstrate that the proposed FB mechanism is most effective when used in conjunction with the RR scheduling scheme.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.3
• /
• pp.105-112
• /
• 1997

The performance of a shared memory multiprocessor system is very sensitive to process scheduling. w can enhance the performance of a whole system as well as of an individual process by taking the multiprocessor characteristics into account in the design of the process scheduler. In this paper, we proposed a general purpose scheduler for a shared memory multiprocessor, called the Two-Level Multi-Scan (TLMS) process scheduler, that considers the processor affinity loosely and decreases the interference among multiple processors greatly. The TLMS scheduler is composed of a local scheduler at each processor and a semi-global scheduler that balances the load among processors. In particular, the semi-global scheduler tries to minimize priority inversion, which is an important factor of the system performance. The TLMS scheduler also tries to reduce the number of resources to be shared and improves the processor utilization. to meet these requirements, th semi-global scheduler interacts with the operation of the local scheduler when a need arises, thus the name is loose processor-affinity. We also show that the proposed scheduling technique can be extended for other types of resources making it a general purpose resource management queue.

• Journal of Digital Convergence
• /
• v.10 no.4
• /
• pp.251-256
• /
• 2012

In this paper, we addressed the problem of upstream bandwidth in EPONs. We presented a wavelength division EPON supporting QoS in the differentiated services framework. It was shown that the bandwidth allocation by priority scheduling, under our assumptions for traffic behavior, will result in an unexpected behavior for high priority class and we suggested the use of weighted priority scheduling to alleviate this problem. Our wavelength division EPON supporting QoS allocates effectively and fairly bandwidths and wavelengths between ONUs in the differentiated services framework. Moreover, we showed better performance in terms of average and maximum end-to-end delay, as well as network throughput, utilization compared with some other algorithms. We used simulation experiments to study the performance and validate the effectiveness of the proposed network and algorithm.

• Journal of Sensor Science and Technology
• /
• v.22 no.4
• /
• pp.268-275
• /
• 2013

Efficient energy management becomes a critical design issue for complex WSN (Wireless Sensor Network). Most of complex WSN employ the sleep mode to reduce the energy dissipation. However, it should cause the reduction of sensing coverage. This paper presents new wake-up algorithm for reducing energy consumption in complex WSN. The proposed wake-up algorithm is devised using geometric probability. It determined which node will be waked-up among the nodes having overlapped sensing coverage. The only one sensor node will be waked-up and it is ready to sense the event occurred uniformly. The simulation results show that the lifetime is increased by 15% and the sensing coverage is increased by 20% compared to the other scheduling methods. Consequently, the proposed wake-up algorithm can eliminate the power dissipation in the overlapped sensing coverage. Thus, it can be applicable for the various WSN suffering from the limited power supply.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.1
• /
• pp.27-34
• /
• 2014

The paper proposed a sizing method of an energy storage system(ESS) for peak shaving of high-speed railway substations based on load profile patterns of substations. A lithium based battery ESS was selected since it can produce high-power at high speed that peak shaving requires, and also takes up a relatively smaller space for installation. Adequate size of the ESS, minimum capacity which can technically meet a peak shaving target, was determined by collectively considering load patterns of a target substation, characteristics of the ESS to be installed, and optimal scheduling of the ESS. In case study, a local substation was considered to demonstrate the proposed sizing method. Also economic analysis with the determined size of ESS was performed to calculate electricity cost savings of the peak shaving ESS, and to offer pay-back period and return on investment.

• IE interfaces
• /
• v.24 no.1
• /
• pp.78-86
• /
• 2011

To mitigate space restriction and to raise productivity, some shipbuilding companies use floating-docks on the sea instead of dry-docks on the land. In that case, a floating-crane that can lift very heavy objects (up to 3,600 tons) is used to handle the blocks which are the basic units in shipbuilding processes, and so, very large blocks (these are called the mega-blocks) can be used to build a ship. But, because these mega-blocks can be made only in the area near the floating-dock and beside the sea, the space is very important resource for the process. Therefore, our problem is to make an efficient spatial schedule for the mega-block assembly yard. First of all, we formulate this situation into a mathematical model and find optimal solution for a small problem using a commercial optimization software. But, the software could not give optimal solutions for practical sized problems in a reasonable time, and so we propose a GA-based heuristic algorithm. Through a numerical experiment, finally, we show that the spatial scheduling algorithm can provide a very good performance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.7
• /
• pp.1614-1620
• /
• 2009

The overlay multicast that has been recently presented as an alternative for the IP multicast has been getting much persuasion by the system resource and the network bandwidth and the advancement of the network cost. we propose a overlay multi_casting network policy for efficient multimedia services with P2P join scheduling. In order to evaluate the performance of proposed scheme, We test the performance of multi_casting nodes with average join count, the maximum guaranteed waiting time and buffer starvation ratio with similar techniques. The result of simulation shows improved about 15${\sim}$20% of performance.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.11
• /
• pp.22-35
• /
• 1999

The block assembly process takes more than half of the total shipbuilding processes. Therefore, it is very important to have a practically useful block assembly process planning system which can build plans of maximum efficiency with minimum man-hours required. However, the process plans are often not readily executable in the assembly shops due to severe imbalance of workloads. This problem arises because the process planning is done on block by block basis in current practice without paying any attention to the load distribution among the assembly shops. this paper presents the development of an automated hull block assembly process planning system which results in the most effective use of production resources and also produces plans that enable efficient time management. If the load balance of assembly shops is to be considered at the time of process planning, the task becomes complicated because of the increased computational complexity. To solve this problem, a new approach is adopted in this research in which the load balancing function and process planning function are iterated alternately providing to each other contexts for subsequent improvement. The result of case study with the data supplied from the shipyard shows that the system developed in this research is very effective and useful.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.3
• /
• pp.217-226
• /
• 2006

Intensive studies have been made in the area of N-VOD server Multimedia files in the N-VOD sever are characterized with the large volume of data, the requirements of synchronization and real-time playback of streams. The basic goal of the study is to find an efficient mechanism to allow maximum number of users under the limited resources such as Buffer size and disk bandwidth. we propose a efficient VCR-LIKE operations and buffer, disk scheduling policy for multimedia services with management of VOD sever resources. Simulation results show that the rate of buffer usage and service time of proposed scheme are about 18% performance improved than that of traditional methods. This implies that our method can allow much more users for given resources.