• The Journal of the Korea Contents Association
• /
• v.9 no.3
• /
• pp.49-57
• /
• 2009

This paper has proposed Flow Holding Time based Link State Update(LSU) Algorithm that can improve the performance of the existing LSU algorithms. As the existing LSU algorithms are based on the network traffic information, the proposed algorithm is based on flow holding time so we can minimize the LSU message overhead and has not had a strong influence on the depreciation of QoS routing performance. We apply a flow holding time in order to decrease the number of LSU message. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.3
• /
• pp.55-62
• /
• 2014

This paper has proposed Hybrid QoS Routing Link State Update(LSU) Algorithm that has had a both advantage of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. Hybrid LSU algorithm can adapt the threshold based network traffic information and has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed algorithm and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm that it can diminish to 10% of the LSU message count.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.75-81
• /
• 2012

This paper has proposed Message Count Control Mechanism based Link State Update(LSU) Algorithm that has not had a strong influence on the depreciation of QoS routing performance. Most existing LSU algorithms have the limit that cannot control the count of LSU message. Especially, adaptive algorithms have a bad performance when traffic are excessive and fickle. We classify as the importance of LSU message that have a influence on available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.17-24
• /
• 2016

In this paper, we propose a AH LSU(Advanced Hybrid QoS Routing Link State Update) Algorithm that improves the performance of Hybrid LSU(Hybrid QoS Link State State Update) Algorithm with statistical information of flow holding time in network. AH LSU algorithm has had both advantages of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. It has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and include MLMR(Meaningless LSU Message Removal) mechanism. MLMR mechanism can remove the meaningless LSU message generating repeatedly in short time. We have evaluated the performance of the MLMR mechanism, the proposed algorithm and the existing algorithms on MCI simulation network. We use the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.395-401
• /
• 2008

In order to determine path(s) satisfied with bandwidth-guaranteed in the Internet, routers should have information on network topology and link state. The information is stored in Link State Database (LSDB) located in each router and managed. If link states information is changed, routers inform their neighbor of link state information changed by sending Link State Update (LSU) messages. However, there is trade-off between reflection of actual link state information on LSDB and cost of sending LSU messages. To find a bandwidth-guaranteed path effectively, it is important to decide whether LSU messages are sent or not for the change of link sate. In this paper, we propose a threshold-based LSU algorithm using statistic to effectively decide for sending LSU messages and evaluates its performance by intensive simulations. Simulation results show that the performance of proposed scheme is superior to the existing LSU schemes.

• Korean Journal of Optics and Photonics
• /
• v.10 no.5
• /
• pp.364-368
• /
• 1999

We investigate the evaluation items of LSU (Laser Scanning Unit), such as beam size, f$\theta$ characteristics, linearity, skew and bow, optical power ratio between image height of 0mm and $\pm$108 mm, pitch error, Jitter and shift of printing position. Through the measurement of LSU using BSH (Beam Scan Head) installed on LMC (Linear Motion Controller) which moves linearly within the whole scanning range (-108 mm~+108 mm), we can ascertain plastic f$\theta$ lenses, which are manufactured by TVLP (Two-step Variable Low Pressure) molding method, to satisfy 600DPI(Dots Per Inch) performance.

• Ocean Science Journal
• /
• v.40 no.3
• /
• pp.155-166
• /
• 2005

New PCR primers (N=18) were designed for the isolation of complete SSU to LSU rDNA sequences from the dinoflagellate Alexandrium tamarense. Standard PCR, employing each primer set selected for amplifications of less than 1.5 kb, successfully amplified the expected rDNA regions of A. tamarense (Korean isolate, HY970328M). Complete SSU, LSU rDNAs and ITS sequences, including 5.8S rDNA, were recorded at 1,800 bp, 520 bp and 3,393 bp, respectively. The LSU rDNA sequence was the first report in Alexandrium genus. No intron was found in the LSU rRNA coding region. Twelve D-domains within the LSU rDNA were put together into 1,879 bp (44.4% G+C), and cores into 1514 bp (42.8% G+C). The core sequence was significantly different (0.0867 of genetic distance, 91% sequence similarity) in comparison with Prorocentrum micans (GenBank access. no. X16108). The D2 region was the longest in length (300 bp) and highly variable among the 12 D-domains. In a phylogenetic analysis using complete LSU rDNA sequences of a variety of phytoplankton, A. tamarense was clearly separated with high resolution against other species. The result suggests that the sequence may resolve the taxonomic ambiguities of Alexandrium genus, particularly of the tamarensis complex.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1387-1390
• /
• 2003

The superscalar architecture shows limit in performance improvement recently. While, SMT(Simultaneous Multi-Threading) architecture is receiving remark. The purpose of SMT architecture is to improve the performance of superscalar microprocessors by executing multi threads at the same time. In this paper, a load/store unit(LSU) suitable for ARM-compatible SMT microprocessors is presented. This LSU supports load instructions and store instructions of ARM ISA. This LSU keeps away the degradation of SMT by cache miss.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.133-139
• /
• 2009

This paper has proposed Flow Holding Time based Link State Update(LSU) Algorithm that has minimized the LSU message overhead in QoS routing and has not had a strong influence on the depreciation of QoS routing performance. We apply a flow holding time in order to decrease the number of LSU message. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

• Korean Journal of Optics and Photonics
• /
• v.10 no.1
• /
• pp.15-20
• /
• 1999

Laser Scanning Unit (LSU), which is one of the core parts of laser printer, consists of LD Module, cylinder lens, polygon mirror and f$\theta$ lens. After making an initial design on each part, we optimized the one which satisfies the user specification. The optimized optical system has diffraction limited performance for the slit size of 2.7 mm$\times$1.6 mm, f$\theta$ characteristics less than 0.3% and field curvature less 1.2 mm. We also calcurate tolerance of each part based on RSS(Root Sum Square) method to manufacture LSU for mass production.