• Journal of Advanced Navigation Technology
• /
• v.27 no.4
• /
• pp.457-462
• /
• 2023

We proposed a flexible link configuration in a system combining mid-span spectral inversion (MSSI) and dispersion management used for long-distance transmission of high-capacity optical signals such as wavelength division multiplexing signals, and examined specific methods to increase chromatic dispersion and nonlinear distortion compensation effects. The dispersion map proposed to increase the flexibility of dispersion-managed link configuration has a 'random-inverse' structure. That is, in the proposed dispersion map, the residual dispersion per span (RDPS) of each fiber span in the first half section up to the optical phase conjugator is randomly distributed, and the RDPS distribution in the second half section reverses the distribution pattern of the first section. Although the proposed dispersion map has a random distribution of RDPS, it was confirmed that the distortion compensation effect is improved due to the fact that the dispersion profile is symmetrical with respect to the optical phase conjugator. In the dispersion map of the 'random-inverse' configuration, it was also confirmed that the compensation effect of the distorted wavelength division multiplexing signal becomes improved when the magnitude of the RDPS allocated to each fiber span is large.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.199-201
• /
• 2021

The Internet of Things (IoT) is a technology that can organically connect people and things without time and space constraints by using communication network technology and sensors, and transmit and receive data in real time. The IoT used in all industrial fields has limitations in terms of storage allocation, such as device size, memory capacity, and data transmission performance, so it is important to manage power consumption to effectively utilize the limited battery capacity. In the prior research, there is a problem in that security is deteriorated instead of improving power efficiency by lightening the security algorithm of the encryption module. In this study, we proposes a low-power security architecture that can utilize high-performance security algorithms in the IoT environment. This can provide high security and power efficiency by using relatively complex security modules in low-power environments by executing security modules only when threat detection is required based on inspection results.

• Journal of Broadcast Engineering
• /
• v.17 no.3
• /
• pp.503-518
• /
• 2012

In this paper, we propose a complexity-based parallelization method of the sample adaptive offset (SAO) algorithm which is one of HEVC in-loop filters. The SAO algorithm can be regarded as region-based process and the regions are obtained and represented with a quad-tree scheme. A offset to minimize a reconstruction error is sent for each partitioned region. The SAO of the HEVC can be parallelized in data-level. However, because the sizes and complexities of the SAO regions are not regular, workload imbalance occurs with multi-core platform. In this paper, we propose a LCU-based SAO algorithm and a complexity prediction algorithm for each LCU. With the proposed complexity-based LCU processing, we found that the proposed algorithm is faster than the sequential implementation by a factor of 2.38 times. In addition, the proposed algorithm is faster than regular parallel implementation SAO by 21%.

• Journal of Broadcast Engineering
• /
• v.3 no.1
• /
• pp.69-84
• /
• 1998

In digital broadcasting, services such as digital satellite TV, cable TV and digital terrestrial TV, several video programs are compressed by MPEG-2, and then simultaneously transmitted over a conventional CBR (Constant Bit Rate) broadcasting channel. In this paper, we propose a joint quality control scheme to be able to accurately control the relative picture quality among the video programs, which is achieved by simdt;,nL'Ously controlling the video encoders to generate the VBR (Variable Bit Rate) compressed video streams. Our quality control scheme can prevent the video buffer overflow and underflow by total target bit allocation process, and also exactly control the relative picture quality in terms of PSNR (Peak Signal to Noise Ratio) between some programs requiring higher picture quality and others by rate-distortion modification. Furthermore we present a rate-distortion estimation method for MPEG-2 video, which is base of our joint quality control, and verify its performance by experiments. The most attractive features of this estimation method are as follows: 1) computational complexity is low because main operation for the estimation is to calculate the histogram of OCT coefficients into quantizer; 2) estimation results are very accurate enough to be applied to the practical MPEG-2 video coding applications. Simulation results show that the proposed joint quality control scheme accurately controls the relative picture quality among the video progran1s transmitted over a single channel as well as provides more consistent and higher picture quality than independent coding scheme that encodes each program independently.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.591-602
• /
• 2003

Delay and discontinuance phenomenon of service are cause by sudden increase of the network communication amount and the quantity consumed of resources when Internet users are driven excessively to a conventional single large database sewer. To solve these problems, spatial database cluster consisted of several single nodes on high-speed network to offer high-performance is risen. But, research about spatial join operation that can reduce the performance of whole system in case process at single node is not achieved. So, in this paper, we propose efficient parallel spatial join processing method in a spatial database cluster system that uses data partitions and replications method that considers the characteristics of space data. Since proposed method does not need the creation step and the assignment step of tasks, and does not occur additional message transmission between cluster nodes that appear in existent parallel spatial join method, it shows performance improvement of 23% than the conventional parallel R-tree spatial join for a shared-nothing architecture about expensive spatial join queries. Also, It can minimize the response time to user because it removes redundant refinement operation at each cluster node.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.121-128
• /
• 2005

Tho existing TCP(Transmission Control Protocol) is known to be unsuitable for a network with the characteristics of high RDP(Bandwidth-Delay Product) because of the fixed small or large buffer size at the TCP sender and receiver. Thus, some trial cases of adjusting the buffer sizes automatically with respect to network condition have been proposed to improve the end-to-end TCP throughput. ATBT(Automatic TCP fluffer Tuning) attempts to assure the buffer size of TCP sender according to its current congestion window size but the ATBT assumes that the buffer size of TCP receiver is maximum value that operating system defines. In DRS(Dynamic Right Sizing), by estimating the TCP arrival data of two times the amount TCP data received previously, the TCP receiver simply reserves the buffer size for the next arrival, accordingly. However, we do not need to reserve exactly two times of buffer size because of the possibility of TCP segment loss. We propose an efficient TCP buffer tuning technique(called TBT-PLR: TCP buffer tuning algorithm based on packet loss ratio) since we adopt the ATBT mechanism and the TBT-PLR mechanism for the TCP sender and the TCP receiver, respectively. For the purpose of testing the actual TCP performance, we implemented our TBT-PLR by modifying the linux kernel version 2.4.18 and evaluated the TCP performance by comparing TBT-PLR with the TCP schemes of the fixed buffer size. As a result, more balanced usage among TCP connections was obtained.

• Journal of Internet Computing and Services
• /
• v.6 no.2
• /
• pp.69-84
• /
• 2005

As the Internet users are increasing rapidly, a cluster web server system is attracted by many researchers and Internet service providers. The cluster web server has been developed to efficiently support a larger number of users as well as to provide high scalable and available system. In order to provide the high performance in the cluster web server, efficient load distribution is important, and recently many content-aware request distribution techniques have been proposed. In this paper, we propose a new content-aware load balancing technique that can evenly distribute the workload to each node in the cluster web server. The proposed technique is based on the hash histogram transformation, in which each URL entry of the web log file is hashed, and the access frequency and file size are accumulated as a histogram. Each user request is assigned into a node by mapping of (hashed value-server node) in the histogram transformation. In the proposed technique, the histogram is updated periodically and then the even distribution of user requests can be maintained continuously. In addition to the load balancing, our technique can exploit the cache effect to improve the performance. The simulation results show that the performance of our technique is quite better than that of the traditional round-robin method and we can improve the performance more than $10\%$ compared with the existing workload-aware load balancing(WARD) method.