• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.1
• /
• pp.77-87
• /
• 2017

Even though current LTE/LTE-A mobile networks provide enough high data rate and low latency to support conventional wireless services, to support ultra-low delay services, such as virtual reality and remote control, in the next generation mobile communication network, it is required to provide very low delay about several ms. However, in the uplink transmission of the LTE/LTE-A system, the process of scheduling grant is required to obtain uplink resources for uplink transmission from the eNB. The process of granting uplink resources from eNB brings additional fixed latency, which is one of the critical obstacles to achieve low delay in uplink transmissions. Thus, in this paper, we propose a novel uplink transmission scheme called Cut-in uplink transmission, to reduce uplink latency. We provide the performance of the proposed uplink transmission scheme through simulations and show the proposed uplink transmission scheme provides lower uplink transmission delay than conventional uplink transmission scheme in LTE/LTE-A mobile networks.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.12
• /
• pp.44-55
• /
• 2001

MAC(Multiply and ACcumulate) is the core operation of multimedia data processing. Because MAC units implemented on traditional DSP units or embedded processors have latency of three cycles and cannot operate on multiple data simultaneously, then, performances are seriously limited. Many high end general purpose microprocessors have SIMD MAC unit as a functional unit. But these high end MAC units must support pipeline structure for various operation modes and high clock frequency, which makes control logic complex and increases chip area. In this paper, a 64bit SIMD MAC unit for embedded processors is designed. It is implemented to have a latency of one clock cycle to remove pipeline control logics and a minimal area overhead for SIMD support is added to existing Booth multipliers.

• Journal of KIISE:Information Networking
• /
• v.34 no.2
• /
• pp.88-99
• /
• 2007

P2P systems are distributed data sharing systems, and each node in them plays the role of client as well as server. There are several studies using Distributed Hash Table, such as Chord, CAN, Tapestry, Pastry, but these systems don't consider the physical latency, therefore they have a weakness of difficulty to guarantee stable performance. To improve this problem, we present the TP2P system. This system is a self-organizing hierarchical overlay system and it uses Chord routing mechanism for lookup data. This system is organized by several subnets, each subnet is organized by physically close nodes, and global network organized by all nodes. In each subnet, one node finds a data, it saves in a node in the subnet, therefore it has higher probability to reduce physical lookup latency than Chord system. And each node has global information of some nodes in its subnet, and it is used to lookup data, therefore the number of hops decrease about 25% as well as the physical lookup latecy are reduced.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.5
• /
• pp.725-730
• /
• 2022

Named Data Networking (NDN) is a representative technology of ICN that realizes the future Internet architecture. NDN searches for data by its content and not by its host IP address. The consumer generates an interest packet and sends it to the NDN network. The NDN network uses three tables such as CS, FIB, and PIT and forwards the received interest packet to the next hop. The producer transmits the data packet to the consumer through a name-based forwarding scheme. In this paper, we design and implement an ndnSIM-based NDN network and perform performance evaluation. We analyze the ndnSIM structure and develop a 6-node congested NDN network and a 9-node grid NDN network using ndnSIM. In the simulation, the performance of latency and throughput of the interest packet rate are measured. We analyze the effect of congestion on the latency and throughput of the NDN network. This approach will help researchers in the future.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1002-1015
• /
• 2018

The advent of Internet of Things (IoT) and the evident inadequacy of Cloud networks concerning management of numerous end nodes have brought about a shift of paradigm giving birth to Fog computing. Fog computing is an extension of Cloud computing that extends Cloud resources at the edge of the network, closer to the user. Cloud computing has become one of the essential needs of people over the Internet but with the emerging concept of IoT, traditional Clouds seem inadequate. IoT entails extremely low latency and for that, the Cloud servers that are distant and unknown to the user appear to be unsuitable. With the help of Fog computing, the Fog devices installed would be closer to the user that will provide an immediate storage for the frequently needed data. This paper discusses data migration between different storage types especially between Cloud devices and then presents a mechanism to migrate data between Cloud and Fog Layer. We call this mechanism Adaptive Deadline-Aware Scheme (ADAS) for Data migration between Cloud and Fog. We will demonstrate that we can access and process latency sensitive "hot" data through the proposed ADAS more efficiently than with a traditional Cloud setup.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2196-2203
• /
• 2000

As processor's operational frequency increases and processors execute multiple instructions per cycle, the processor performance becomes more dependent on the load operand referencing latency and the data dependency. To reduce the operand fetch latency and to increase ILP by breaking the data dependency, we propose a value-address hybrid predictor using a reasonable size prediction buffer and analyse the performance improvement by the proposed predictor. Through the extensive simulation of 5 benchmark programs, the proposed hybrid prediction scheme accurately predicts 62.72% of all loads which are 12.64% higher than the value prediction scheme and show its cost-effectiveness compared to the address predition scheme. In addition, we analyse the performance improvement achieved by the stride management and the history of previous predictions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1052-1070
• /
• 2016

Wireless Body Area Networks (WBANs) have received a lot of attention as a promising technology for medical and healthcare applications. A WBAN should guarantee energy efficiency, data reliability, and low data latency because it uses tiny sensors that have limited energy and deals with medical data that needs to be timely and correctly transferred. To satisfy this requirement, many multi-radio multi-channel MAC protocols have been proposed, but these cannot be implemented on current off-the-shelf sensor nodes because they do not support multi-radio transceivers. Thus, recently single-radio multi-channel MAC protocols have been proposed; however, these methods are energy inefficient due to data duplication. This paper proposes a TDMA-based single-radio, multi-channel MAC protocol that uses the Unbalanced Star+Mesh topology to satisfy the requirements of WBANs. Our analytical analysis together experiments using real sensor nodes show that the proposed protocol outperforms existing methods in terms of energy efficiency, reliability, and low data latency.

• International Journal of Computer Science & Network Security
• /
• v.23 no.5
• /
• pp.128-134
• /
• 2023

The widespread usage of blockchain technology in cryptocurrencies has led to the adoption of the blockchain concept in data storage management systems for secure and effective data storage and management. Several innovative studies have proposed solutions that integrate blockchain with distributed databases. In this article, we review current blockchain databases, then focus on two well-known blockchain databases-BigchainDB and FalconDB-to illustrate their architecture and design aspects in more detail. BigchainDB is a distributed database that integrates blockchain properties to enhance immutability and decentralization as well as a high transaction rate, low latency, and accurate queries. Its architecture consists of three layers: the transaction layer, consensus layer, and data model layer. FalconDB, on the other hand, is a shared database that allows multiple clients to collaborate on the database securely and efficiently, even if they have limited resources. It has two layers: the authentication layer and the consensus layer, which are used with client requests and results. Finally, a comparison is made between the two blockchain databases, revealing that they share some characteristics such as immutability, low latency, permission, horizontal scalability, decentralization, and the same consensus protocol. However, they vary in terms of database type, concurrency mechanism, replication model, cost, and the usage of smart contracts.

• Journal of information and communication convergence engineering
• /
• v.7 no.2
• /
• pp.199-202
• /
• 2009

Adaptive memory management is a serious issue in data stream management. Data stream differ from the traditional stored relational model in several aspect such as the stream arrives online, high volume in size, skewed data distributions. Data skew is a common property of massive data streams. We propose the predicted allocation strategy, which uses predictive processing to cope with time varying data skew. This processing includes memory usage estimation and indexing with timestamp. Our experimental study shows that the predictive strategy reduces both required memory space and latency time for skewed data over varying time.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1766-1777
• /
• 2000

In multimedia new service on the internet, there are problems such as server overload, network congestion and initial latency. To overcome these problems, we propose a proxy push-caching scheme that stores a portion of continuous media stream or entire stream, and a transmission scheme of NOD continuous media, RTP-RR and RTP-nR to exploit push-caching scheme. With the proposed push-caching scheme, NOD server pushes fixed portion of stream to a proxy when new data is generated, and the cached size of each stream changes dynamically according to the caching utility value of each stream. As a result, the initial latency of client side could be reduced and the amount of data transmitted fro ma proxy server to client could be increased. Moreover, we estimate a caching utility value of each stream using correlation between disk space occupied by the stream and the amount of data stream requested by client. And we applied the caching utility value ot replacement policies. The performance of the proxy push-caching and continuous media transmission schemes proposed were compared with other schemes using simulations. In the simulation, these schemes show better results than other schemes in terms of BHR (Byte Hit Rate), initial latency, the number of replacement and packet loss rate.