• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.9
• /
• pp.36-48
• /
• 1999

Controlled transfer (CT) service has been recently proposed as a new ATM transfer capability for high-speed data applications, which used a credit-based flow control. This paper investigates buffer allocation schemes for CT service and proposes an improved dynamic bugger allocation scheme. In order to improve the responsiveness to a congestion, the proposed method is considered the load factor of a link when determining the amounts of virtual connection (VC)s buffer allocation. Also, in this paper we compare the performance of the proposed method with those of the existing buffer allocation methods such as flow controlled virtual channels (FCVC) and zero queueing flow control (ZQFC) through simulation. Simulation results show tat the proposed scheme exhibits a better performance than the existing schemes in terms of throughput, fairness, queue length and link utilization.

• Smart Media Journal
• /
• v.8 no.4
• /
• pp.46-52
• /
• 2019

The size of data generated and collected at industrial sites or in public institutions is growing rapidly. The existing data processing server often handles the increasing data by increasing the performance by scaling up. However, in the big data era, when the speed of data generation is exploding, there is a limit to data processing with a conventional server. To overcome such limitations, a distributed cluster computing system has been introduced that distributes data in a scale-out manner. However, because distributed cluster computing systems distribute data, inefficient use of network bandwidth can degrade the performance of the cluster as a whole. In this paper, we propose a scheme that compresses data when transmitting data in a Hadoop cluster considering network bandwidth. The proposed scheme considers the network bandwidth and the characteristics of the compression algorithm and selects the optimal compression transmission scheme before transmission. Experimental results show that the proposed scheme reduces data transfer time and size.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.7
• /
• pp.1-5
• /
• 2012

At the present time when the limits of the magnetic storage systems appear, the holographic data storage (HDS) devices with high data transfer rate and high recording density are emerging as attractive candidates for next-generation optical storage devices. In this paper, to effectively improve the detection performance that is degraded by the two-dimensional inter-symbol interference under the HDS channel environment and the pixel misalignment, an iterative two-dimensional equalization scheme is proposed based on the contraction mapping theorem. In order to evaluate the performance of the proposed scheme, for various holographic channel environments we measure the BER performance using computer simulation and compare the proposed one with the conventional threshold detection scheme, which verifies the superiority of the proposed scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.2
• /
• pp.288-299
• /
• 1993

This paper proposes the new bus protocol in the tightly coupled multiprocessor system. The bus protocol uses the pipelined data transfer and block transfer scheme to increase the bus bandwidth, The bus also has the independent transfer lines for the address and data respectively, and it can transfer the data up to maximum 264 Mbytes /sec. This paper also models the multiprocessor system where each processor boards have the private cache. Simulation evaluates the bus and system performance according to hit ratio of the reference data in cache memory, In the case of using this bus, the bus is evaluated not to be saturated when up to 10 processor boards are connected to the bus. As for up to 4 memory interleavng, the performance increases linearly.

• Journal of Internet of Things and Convergence
• /
• v.10 no.3
• /
• pp.19-24
• /
• 2024

Recent advances in large-scale data processing technologies such as big data, cloud computing, and artificial intelligence have increased the demand for high-performance storage devices in data centers and enterprise environments. In particular, the fast data response speed of storage devices is a key factor that determines the overall system performance. Solid state drives (SSDs) based on the Non-Volatile Memory Express (NVMe) interface are gaining traction, but new bottlenecks are emerging in the process of handling large data input and output requests from multiple hosts simultaneously. SSDs typically process host requests by sequentially stacking them in an internal queue. When long transfer length requests are processed first, shorter requests wait longer, increasing the average response time. To solve this problem, data transfer timeout and data partitioning methods have been proposed, but they do not provide a fundamental solution. In this paper, we propose a dual queue based scheduling scheme (DQBS), which manages the data transfer order based on the request order in one queue and the transfer length in the other queue. Then, the request time and transmission length are comprehensively considered to determine the efficient data transmission order. This enables the balanced processing of long and short requests, thus reducing the overall average response time. The simulation results show that the proposed method outperforms the existing sequential processing method. This study presents a scheduling technique that maximizes data transfer efficiency in a high-performance SSD environment, which is expected to contribute to the development of next-generation high-performance storage systems

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.49 no.3
• /
• pp.62-68
• /
• 2012

In this paper, we propose an efficient transmission scheme for flight data. It is important to reduce amount of flight data transmitted effectively for timely transmission in airplane that the safety is very importantly recognized. Thus, this paper shows the improved technique transmitting after compressing flight data by the lossless compression technique. Because the proposed method improves the transmission speed of the flight data effectively. The processing of flight data and handling can be easily performed in the time to be restricted. The simulation results show that the proposed scheme achieves 25% data transfer gain compared to the ARINC 429 based transmission method.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.639-646
• /
• 2006

Data compression technologies enable us to store and transfer large amount of data efficiently, and become more and more important due to increasing data size and the network traffic. Moreover, as a result of the increase of computing power, volumetric data produced from various applied science and engineering fields has been getting much larger. In this Paper, we present a volume compression scheme which exploits Daubeches wavelet transform. The proposed scheme basically supports lossy compression for 3D volume data, and provides unit-wise random accessibility. Since our scheme shows far lower error rates than the previous compression methods based on Haar filter, it could be used well for interactive visualization applications as well as large volume data compression requiring image fidelity.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.7
• /
• pp.539-546
• /
• 2002

This paper presents a new direct seek control scheme that provides fast data access capability and robust performance for high-speed rotational optical disk drives (ODD). When a disk is rotating at a high speed to obtain fast data transfer in ODD, the magnitude and frequency of velocity disturbance caused by eccentric rotation of the disk increase in proportion to the rotational speed of the disk. Such disturbances make it almost impossible for the conventional seek control scheme to achieve stable and satisfactory seek performance. We analyze the problems that may arise when the conventional seek control scheme is applied to the high-speed rotational ODD and propose a new direct seek control scheme that will solve such problems. In the proposed scheme, a seek control system is designed such that its performance is guaranteed for a set of plants with parameter perturbations. The performance of the proposed seek control scheme is shown by experiments using a high-speed rotational ODD.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.20-39
• /
• 2020

This paper considers a downlink multi-carrier cooperative non-orthogonal multiple access (NOMA) transmission, where no direct link exists between the far user and the base station (BS), and the communication between them only relies on the assist of the near user. Firstly, the BS sends a superimposed signal of the far and the near user to the near user, and then the near user adopts simultaneous wireless information and power transfer (SWIPT) to split the received superimposed signal into two portions for energy harvesting and information decoding respectively. Afterwards, the near user forwards the signal of the far user by utilizing the harvested energy. A minimum data is required to ensure the quality of service (QoS) of the far user. We jointly optimize power allocation, subcarrier allocation, time allocation, the power allocation (PA) coefficient and the power splitting (PS) ratio to maximize the number of data bits received at the near user under the energy causality constraint, the minimum data constraint and the transmission power constraint. The block-coordinate descent method and the Lagrange duality method are used to obtain a suboptimal solution of this optimization problem. In the final simulation results, the superiority of the proposed NOMA scheme is confirmed compared with the benchmark NOMA schemes and the orthogonal multiple access (OMA) scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.9
• /
• pp.121-128
• /
• 2023

To increase the lifetime of the network in wireless sensor networks, energy harvesting from the surrounding environment or wireless power transfer is being used. In addition, to reduce the energy imbalance and increase the amount of data gathered, a method using mobile sink nodes that visit sensor nodes to gather data has been used. In this paper, we propose a technique to reduce the load on the relay node and collect a lot of data evenly in this environment. In the proposed scheme, sensor nodes construct Minimum Depth Trees (MDTs) considering the network environment and energy, and allocate the data collection amount. Simulation results show that the proposed technique effectively suppresses energy depletion and collects more data compared to existing techniques.