• 한국정보통신설비학회:학술대회논문집
• /
• 2006.08a
• /
• pp.77-81
• /
• 2006

Because of the rapid increasing of network user, there are some problems to tolerate the network overhead. Recently, the research and technology of the user-level for high performance and low latency than TCP/IP which relied upon the kernel for processing the messages. For example, there is an Infiniband technology. The Infiniband Trade Association (IBTA) has been proposed as an industry standard for both communication between processing node and I/O devices and for inter-processor communication. It replaces the traditional bus-based interconnect with a switch-based network for connecting processing node and I/O devices. Also Infiniband uses RDMA (Remote DMA) for low latency of CPU and OS to communicate between Remote nodes. In this paper, we develop the SRP (SCSI RDMA Protocol) which is Storage Access Protocol on Infiniband network. And will compare to FC (Fibre Channle) based I-SCSI (Internet SCSI) that it is used to access storage on Etherent Fabric.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5174-5190
• /
• 2016

Recent years have witnessed an explosive growth of mobile devices, mobile cloud computing services offered by these devices and the remote clouds behind them. In this paper, we noticed ultra-low latency service, as a type of mobile cloud computing service, requires extremely short delay constraints. Hence, such delay-sensitive applications should be satisfied with strong QoS guarantee. Existing solutions regarding this problem have poor performance in terms of throughput. In this paper, we propose an end-to-end bandwidth resource reservation via software defined scheduling inspired by the famous SDN framework. The main contribution of this paper is the end-to-end resource reservation and flow scheduling algorithm, which always gives priority to delay sensitive flows. Simulation results confirm the advantage of the proposed solution, which improves the average throughput of ultra-low latency flows.

• Electronics and Telecommunications Trends
• /
• v.33 no.5
• /
• pp.51-63
• /
• 2018

Mobile cellular technology is evolving to accommodate a variety of vertical services, expanding the application from human-to-human communication to the Internet of Things(IoT). In particular, the fourth industrial revolution, bringing in a new vision in future smart factory, necessitates a new paradigm shift in wireless communication. Low latency and high reliability is a key issue in wireless applications for industrial IoT such as factory automation. In this paper, we review the recent progress in 5G URLLC (Ultra-Reliable Low Latency Communication) and discuss use cases, requirements, challenging technical issues, and potential solutions to support wireless factory automation such as discrete automation and process automation.

• Electronics and Telecommunications Trends
• /
• v.36 no.6
• /
• pp.13-24
• /
• 2021

Industrial networks has been developing various technologies from fieldbus technology to industrial Ethernet and time-sensitive networking. The industry expects that the 5G mobile network will solve the diverse and highly specific industrial site requirements. Accordingly, 3GPP has been developing standard functions to provide ultra-high reliability, ultra-high speed, ultra-connection, and ultra-low latency services, and 3GPP Rel-16 began developing ultra-low latency and ultra-high reliability communication functions for 5G mobile networks to support vertical industries. In this paper, we show the related standardization trends and requirements to apply industrial IoT service scenarios to 5G mobile networks, and in particular, we introduce 5G system features and extended 5G system architecture to provide time sensitive communication and time synchronization services.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.620-632
• /
• 2004

IP is not suitable for mobile nodes by network-based routing because mobile nodes are dynamically change their network attachment point. Mobile-IP is an IETF standard providing continuous access to the Internet for mobile nodes, but it has the triangle routing problem. Also it has a performance degradation problem by massive packet loss during layer 3 handoff of mobile nodes. Especially, two IETF multicast support schemes for Mobile-IP do not guarantee the quality of realtime multimedia services because they have several problems such as long routing path, packet duplication(hi-directional tunneling) and massive packet loss(remote subscription). In this paper, we propose a lossless remote subscription scheme that guarantees the quality of realtime multimedia services over Mobile-IP. From the result of simulation, we verified that the proposed scheme in this paper can reduce the delay time of remote subscription by the effect of the low latency handoff scheme that is extended to apply to the multicast group management and it requires only 0.58% buffer spaces of the previously proposed lossless remote subscription scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.1
• /
• pp.180-186
• /
• 2017

In this paper we propose a traffic aware Demand Wakeup MAC(TADW-MAC) protocol, in which low data delay and high throughput can be achieved, for wireless sensor networks. With the TADW-MAC protocol, the problem of the DW-MAC protocol, which schedules only one packet to deliver during the Sleep period in a multi-hop transmission is resolved. DW-MAC is not adequate for the applications such as object tracking and fire detection, in which busty data should be transmitted in a limited time when an event occurs [6-8]. When an event occurs, duty cycle can be adjusted in the TADW-MAC protocol to get less energy consumption and low latency. The duty cycle mechanism has been widely used to save energy consumption of sensor node due to idle listening in wireless sensor networks. But additional delay in packet transmission may be increased in the mechanism. Our simulation results show that TADW-MAC outperforms RMAC and DW-MAC in terms of energy efficiency while achieving low latency.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.1
• /
• pp.89-99
• /
• 2017

Many works have attempted to solve the scalability, the availability, and the low-latency problems of peer-to-peer (P2P) live video streaming; yet, the problems still remain. While tree-based systems are vulnerable to churn, the mesh-based systems suffer from high delay and overhead. The DHT-aided chunk-driven overlay (DCO) [1] tried to tackle these problems by using the distributed hash table (DHT), which structures into a mesh-based overlay to efficiently share the video segment. However, DCO fully depends on the capacity of the users' device which is small and unstable, i.e., the users' device may leave and join the network anytime, and the video server's bandwidth can be insufficient when the number of users joining the network suddenly increases. Therefore, cloud assist is introduced to overcome those problems. Cloud assist can be used to enhance the availability, the low-latency, and the scalability of the system. In this paper, the DHT is used to maintain the location of the streaming segments in a distributed manner, and the cloud server is used to assist other peers when the bandwidth which required for sharing the video segment is insufficient. The simulation results show that by using the threshold and cloud assist, the availability and the low-latency of the video segments, and the scalability of the network are greatly improved.

• KIISE Transactions on Computing Practices
• /
• v.22 no.10
• /
• pp.497-503
• /
• 2016

Emerging next-generation storage technologies such as non-volatile memory will help eliminate almost all of the storage latency that has plagued previous storage devices. In conventional storage systems, the latency of slow storage devices dominates access latency; hence, software efficiency is not critical. With low-latency storage, software costs can quickly dominate memory latency. Hence, researchers have proposed the memory mapped file I/O to avoid the software overhead. Mapping a file into the user memory space enables users to access the file directly. Therefore, it is possible to avoid the complicated I/O stack. This minimizes the number of user/kernel mode switchings. In addition, there is no data copy between kernel and user areas. Despite of the benefits in the memory mapped file I/O, its overhead still needs to be addressed, as the existing mechanism for the memory mapped file I/O is designed for slow block devices. In this paper, we identify the overheads of the memory mapped file I/O via experiments.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.3
• /
• pp.91-99
• /
• 2009

Development of high-speed Internet services and the increased supply of mobile devices have become the key factor for the acceleration of ubiquitous technology. WiBro system, formed with lP backbone network, is a MBWA technology which provides high-speed multimedia service in a possibly broader coverage than Wireless LAN can offer. Wireless telecommunication environment needs not only mobility support in Layer 2 but also mobility management protocol in Layer 3 and has to minimize handover latency to provide seamless mobile services. In this paper, we propose a fast cross-layer handover scheme based on signal strength prediction in WiBro environment. The signal strength is measured at regular intervals and future value of the strength is predicted by Exponential Smoothing Method. With the help of the prediction, layer-3 handover activities are able to occur prior to layer-2 handover, and therefore, total handover latency is reduced. Simulation results demonstrate that the proposed scheme predicts that future signal level accurately and reduces the total handover latency.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.1
• /
• pp.11-18
• /
• 2017

Finite field arithmetic has been extensively used in error correcting codes and cryptography. Low-complexity and high-speed designs for finite field arithmetic are needed to meet the demands of wider bandwidth, better security and higher portability for personal communication device. In particular, cryptosystems in GF($2^m$) usually require computing exponentiation, division, and multiplicative inverse, which are very costly operations. These operations can be performed by computing modular AB multiplications or modular $AB^2$ multiplications. To compute these time-consuming operations, using $AB^2$ multiplications is more efficient than AB multiplications. Thus, there are needs for an efficient $AB^2$ multiplier architecture. In this paper, we propose a low latency Montgomery $AB^2$ multiplier using redundant representation over GF($2^m$). The proposed $AB^2$ multiplier has less space and time complexities compared to related multipliers. As compared to the corresponding existing structures, the proposed $AB^2$ multiplier saves at least 18% area, 50% time, and 59% area-time (AT) complexity. Accordingly, it is well suited for VLSI implementation and can be easily applied as a basic component for computing complex operations over finite field, such as exponentiation, division, and multiplicative inverse.