• Journal of information and communication convergence engineering
• /
• v.8 no.4
• /
• pp.377-382
• /
• 2010

With the advent of flash memory based new storage device (SSD), there is considerable interest within the computer industry in using flash memory based storage devices for many different types of application. The dynamic index structure of large text collections has been a primary issue in the Information Retrieval Applications among them. Previous studies have proven the three approaches to be effective: In- Place, merge-based index structure and a combination of both. The above-mentioned strategies have been researched with the traditional storage device (HDD) which has a constraint on how keep the contiguity of dynamic data. However, in case of the new storage device, we don' have any constraint contiguity problems due to its low access latency time. But, although the new storage device has superiority such as low access latency and improved I/O throughput speeds, it is still not well suited for traditional dynamic index structures because of the poor random write throughput in practical systems. Therefore, using the experimental performance evaluation of various index maintenance schemes on the new storage device, we propose an efficient index structure for new storage device that improves significantly the index maintenance speed without degradation of query performance.

• Journal of Communications and Networks
• /
• v.11 no.3
• /
• pp.240-247
• /
• 2009

The results of performance analysis by adopting the channel scenarios characterized as Weibull fading for an multicarrierdirect sequence-coded division multiple access (MC-DS-CDMA) system are proposed in this investigation. On the other hand, an approximate simple expression with the criterion of bit error rate (BER) versus signal-to-noise ratio (SNR) method is derived for an MC-DS-CDMA system combining with maximal ratio combining (MRC) diversity based on the moment generating function (MGF) formula of Weibull statistics, and it associates with an alternative expression of Gaussian Q-function. Besides, the other point of view on the BER performance evaluation of an MC-DS-CDMA system is not only the assumption of both single-user and multi-user cases applied, but the phenomena of partial band interference (PBI) is also included. Moreover, in order to validate the accuracy in the derived formulas, some of the system parameters, such as Weibull fading parameter (${\beta}$), user number (K), spreading chip number (N), branch number (L), and the PBI (JSR) values, etc., are compared with each other in the numerical results. To the best of author's knowledge, it is a brand new idea which proposes the evaluation of the system performance for an MC-DS-CDMA system over the point of view with Weibull fading channel.

• ETRI Journal
• /
• v.39 no.4
• /
• pp.546-557
• /
• 2017

In a long term evolution-advanced (LTE-A) system, the traffic overload of machine type communication devices is a challenge because too many devices attempt to access a base station (BS) simultaneously in a short period of time. We discuss the challenge of the gap between the theoretical maximum throughput and the actual throughput. A gap occurs when the BS cannot change the number of preambles for a random access channel (RACH) until multiple numbers of RACHs are completed. In addition, a preamble partition approach is proposed in this paper that uses two groups of preambles to reduce this gap. A performance evaluation shows that the proposed approach increases the average throughput. For 100,000 devices in a cell, the throughput is increased by 29.7% to 114.4% and 23.0% to 91.3% with uniform and Beta-distributed arrivals of devices, respectively.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.7
• /
• pp.55-63
• /
• 1996

In this paper, a multiple-access algorithm for PCN is proposed. The proposed algorithm provides th integrated service of information soruces and can be operated stably in high load state. Given bandwidth is efficiently used for it in the microcell environment. And system performance can be improved through the statistical-multiplexing technque. In order to process the speech signal usually requiring real-tiem processing, we adopt a random access of AlOHA type for th ebasic protocol sturcture and assume the form of ALOHA-reservation. We have analyzed the performance of the proposed algorithm through system throughput and packet delay in the microcell environment.

• Journal of Communications and Networks
• /
• v.15 no.6
• /
• pp.606-613
• /
• 2013

This paper proposes a complete solution of a contention-based medium access control in wireless local networks to provide station level quality of service guarantees in both downstream and upstream directions. The solution, based on the mature distributed coordination function protocol, includes a new fixed contention window backoff scheme, a tuning procedure to derive the optimal parameters, a super mode to mitigate the downstream bottleneck at the access point, and a simple admission control algorithm. The proposed system guarantees that the probability of the delay bound violation is below a predefined threshold. In addition, high channel utilization can be achieved at the same time. The numerical results show that the system has advantages over the traditional binary exponential backoff scheme, including efficiency and easy configuration.

• Journal of Communications and Networks
• /
• v.8 no.3
• /
• pp.257-266
• /
• 2006

The powerful benefits of multi-antenna systems can be obtained by cooperative communications among users in multiple access environments without the need for physical arrays. This paper studies a novel cooperative signaling strategy that achieves high performance and low implementation complexity for synchronous code division multiple access (CDMA) wireless mobile networks. The validity of the proposed strategy under slow flat Rayleigh fading channel plus additive white Gaussian noise (AWGN) is verified through closed-form error probability expressions and MonteCarlo simulations. A variety of analytical results reveal that the new cooperative strategy significantly outperforms direct transmission subject to the same spectral efficiency and transmit power constraint.

• Journal of Information Processing Systems
• /
• v.14 no.5
• /
• pp.1150-1166
• /
• 2018

This paper presents a physical storage design method for image access structures using transformation techniques of multidimensional file organizations in image information systems. Physical storage design is the process of determining the access structures to provide optimal query processing performance for a given set of queries. So far, there has been no such attempt in the image information system. We first show that the number of pages to be accessed decreases as the shape of the given retrieval query region and that of the data page region become similar in the transformed domain space. Using these properties, we propose a method for finding an optimal image access structure by controlling the shapes of the page regions. For the performance evaluation, we have performed many experiments with a multidimensional file organization using transformation techniques. The results indicate that our proposed method is at least one to maximum five times faster than the conventional method according to the query pattern within the scope of the experiments. The result confirms that the proposed physical storage design method is useful in a practical way.

• Journal of Digital Convergence
• /
• v.11 no.2
• /
• pp.317-322
• /
• 2013

Mobile cloud environment is recently becoming popular due to Internet access through various environments. Driven by computer performance improvement and service development, the demand for mobile cloud is increasing and accordingly the damage is on the rise. Therefore, it needs to conduct a study on problems of security necessary in large database that occurs in mobile cloud services. Although various security solutions limiting database access, security strategies about new user environments should be analyzed. This study analyzes weakness of safe data access through database management in mobile cloud environment and examines security requirements for safe data management. In addition, this study looks into threatening factors of security in cloud services and then draws security requirements about safer access control. A study on system application and evaluation of security requirements about access control is required.

• Transactions of the Society of Information Storage Systems
• /
• v.2 no.1
• /
• pp.43-49
• /
• 2006

Fractal/angle multiplexing is a $LiNBO_3$ crystal using a X-Y Galvano mirror, and the random access concept in fractal/angle multiplexing are discussed in this paper. First, the brief introduction of the designed holographic digital data storage system is presented. Then, the average access time concept for the storage system is newly defined, and the comparison of the average access time between the holographic storage and a conventional optical disk is performed. Second, the basic simulation and experiment to find the X-Y Galvano mirror dynamics are conducted. From this analysis, we find that the average access time in our HDDS which has 6 degree scan angle is about 5 msec. This result is very high performance when it compared with the average access time of a conventional optical disk. Finally, some recording results using fractal/angle multiplexing are presented, then, the relationship between bit error rate and angle mismatch for the each multiplexing are discussed.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.49-56
• /
• 2016

Increasing Internet traffic and forwarding table size need high performance IP address lookup engine which is a crucial function of routers. For finding the longest matching prefix, trie-based or its variant schemes have been widely researched in software-based IP lookup. As a software router, we enhance the IP address lookup engine using GPU which is a device widely used in high performance applications. We propose a data structure for multibit trie to exploit GPU hardware efficiently. Also, we devise a novel scheme that the root subtrie is loaded on Shared Memory which is specialized for fast access in GPU. Since the root subtrie is accessed on every IP address lookup, its fast access improves the lookup performance. By means of the performance evaluation, our implemented GPU-based lookup engine shows 17~23 times better performance than CPU-based engine. Also, the fast access technique for the root subtrie gives 10% more improvement.