• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.8
• /
• pp.3900-3916
• /
• 2019

The modern mobile devices are typically equipped with multiple network interfaces, e.g., 4G LTE, Wi-Fi, Bluetooth, but the current implementation of TCP can support only a single path at the same time. The Multipath TCP (MPTCP) leverages the multipath feature and provides (i) robust connection by utilizing another interface if the current connection is lost and (ii) higher throughput than single path TCP by simultaneously leveraging multiple network paths. However, if the performance between the multiple paths are significantly diverse, the receiver may have to wait for packets from the slower path, causing reordering and buffering problems. To solve this problem, previous MPTCP schedulers mainly focused on predicting the latency of the path beforehand. Recent studies, however, have shown that the path latency varies by a large margin over time, thus the MPTCP scheduler may wrongly predict the path latency, causing performance degradation. In this paper, we propose a new MPTCP scheduler called, choose fastest subflow (CFS) scheduler to solve this problem. Rather than predicting the path latency, CFS utilizes the characteristics of these paths to reduce the overall flow completion time by redundantly sending the last part of the flow to both paths. We compare the performance through real testbed experiments that implements CFS. The experimental results on both synthetic packet generation and actual Web page requests, show that CFS consistently outperforms the previous proposals in all cases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.514-535
• /
• 2019

Information-centric networks operate under the assumption that all network components have built-in caching capabilities. Integrating the caching strategies of information centric networking (ICN) with wireless virtualization improves the gain of virtual infrastructure content caching. In this paper, we propose a framework for software-defined information centric virtualized wireless device-to-device (D2D) networks. Enabling D2D communications in virtualized ICN increases the spectral efficiency due to reuse and proximity gains while the software-defined network (SDN) as a platform also simplifies the computational overhead. In this framework, we propose a joint virtual resource and cache allocation solution for latency-sensitive applications in the next-generation cellular networks. As the formulated problem is NP-hard, we design low-complexity heuristic algorithms which are intuitive and efficient. In our proposed framework, different services can share a pool of infrastructure items. We evaluate our proposed framework and algorithm through extensive simulations. The results demonstrate significant improvements in terms of visiting latency, end user QoE, InP resource utilization and MVNO utility gain.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.4
• /
• pp.163-176
• /
• 2013

Cloud-based streaming game service has numerous merits, but it may suffer from presentation latency in a thin-client. It is an important issue especially for game service which needs instantaneous response to user inputs. This research proposes the methods for reducing the presentation latency between the server unit and the thin-client unit. The approaches proposed to be employed with server unit include the source/sync video format equalization, encoding format configuration according to the media type, and the S/W implementation for transmitting clock periodically. The methods for the thin-client unit include the decreasing the number of instructions, use of light encryption algorithm, and improvement on H/W decoding. The proposed schemes are tested with a commercialized streaming service platform, which reveals the reduction of presentation latency as large as a few hundred milliseconds and reaches the acceptable level (about 100 milliseconds).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.3
• /
• pp.59-64
• /
• 2023

Fire and disaster broadcasting systems are divided into analog, digital, and network-based digital public address systems, and important specifications in network-based digital public address systems are low-latency audio, high sampling rate, and multi-channel input and output. In the past, it has been widely used to the AoE method for distinguishing based on the MAC address of the data link layer. However, this method has a problem of increasing complexity and cost. This proposal is an AoIP/UDP method, which allows communication to be easily distinguished by IP address without the need for a separate redundant network, so that the network can be freely used and configured, and cost can be reduced by reducing complexity. After implementing the AoIP/UDP method, the experimental results showed that the cost was improved with the equivalent performance with 2.66ms latency.

• The Journal of Society for e-Business Studies
• /
• v.14 no.4
• /
• pp.119-131
• /
• 2009

During a decade, e-Commerce environments supporting real-time transaction processing have been getting larger. In telecommunication and financial environments, research and building for main memory database systems have been doing to support real-time transaction processing. A research on indexing for fast transaction support focuses on reducing cache misses or reducing memory access latency when cache misses happen. In the paper, we propose a prefetch method for tree index structures to reduce memory access latency. We present a prefetch-efficient pCST-tree and show superiority of the proposed tree by experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2433-2452
• /
• 2017

Recently, the pipeline-forwarding has been proposed as a new technique to resolve the end-to-end latency problem of the duty-cycle MAC protocols in Wireless Sensor Networks (WSNs). Some protocols based on this technique such as PMAC and PRI-MAC have shown an improvement not only in terms of reducing end-to-end latency but also in terms of reducing power consumption. In these protocols, however, the sensor nodes still waste a significant amount of energy for unnecessary idle listening during contention period of upstream nodes to check the channel activity. This paper proposes a new pipeline-forwarding duty-cycle MAC protocol, named RP-MAC (Reduced Pipelined duty-cycle MAC), which tries to reduce the waste of energy. By taking advantage of ACK mechanism and shortening the handshaking procedure, RP-MAC minimizes the time for checking the channel and therefore reduces the energy consumption due to unnecessary idle listening. When comparing RP-MAC with the existing solution PRI-MAC and RMAC, our QualNet-based simulation results show a significant improvement in term of energy consumption.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.8
• /
• pp.34-42
• /
• 2009

Mobile communication traffic is changing from voice to data/internet, e.g. wireless internet access, SMS/MMS. more and more. Therefore many data services are coming out over 3G, Mobile WiMAX(WIBRO), LTE etc. Wireless internet market is growing and MIPv6 is more important and many protocols being studied and developed from MIPv6 to Fast MIPv6, Hierachical MIPv6, Proxy MIPv6, etc. The significant factor over MIPv6 is Hand-over latency and Packet-loss PMIPv6 is efficient for reducing mobility related messages and hand-over latency, but it considers single LMA domain. If mobile node is moving inter-LMAs, hand-over delay time affects the real-time communications. To overcome this hand-over delay, we propose present and new enhanced schemes and analize the performance and show the results.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.7
• /
• pp.131-139
• /
• 2013

To overcome the limitations in performance and power consumption of traditional electrical interconnection based network-on-chips (NoCs), a hybrid optical network-on-chip (HONoC) architecture using optical interconnects is emerging. However, the HONoC architecture should use circuit-switching scheme owing to the overhead by optical devices, which worsens the latency unfairness problem caused by frequent path collisions. This resultingly exert a bad influence in overall performance of the system. In this paper, we propose a new task mapping algorithm for optimizing latency by reducing path collisions. The proposed algorithm allocates a task to a certain processing element (PE) for the purpose of minimizing path collisions and worst case latencies. Compared to the random mapping technique and the bandwidth-constrained mapping technique, simulation results show the reduction in latency by 43% and 61% in average for each $4{\times}4$ and $8{\times}8$ mesh topology, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2A
• /
• pp.142-152
• /
• 2010

When a mobile station(MS) performs a handover, in the IEEE 802.11 WLAN, MS's channel scanning for discovering new available APs is the dominating factor in handover latency, accounting 90% of overall latency. In order to reduce such a scanning latency, we focus on the method for reducing the number of channels for the MS in handover process to scan. With the help of IEEE 802.21 information server(IS), a proper order of groups of channels to be scanned is offered by the current AP depending on the information of neighbor APs in terms of the distance from serving AP, traffic load and network topology. By using this scanning order, the passive scanning of a MS in normal operation enables the MS to filter out the unavailable channels, and thus to classify the candidate channels of neighbor APs into three groups. Then, a handover-imminent MS can perform the active scanning from the most reliable group of channels. Simulation results show that the proposed scanning scheme reduce the scanning latency in comparison with the conventional scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.57-60
• /
• 2008

During communication between wireless users, disconnection may occur during the handover process. The high handover latency during the process of handover degrades the service quality of the wireless communications. This problem becomes more crucial if the operation network is transmitting real-time multimedia applications. This paper studies the hanover procedure of mobile IPv6 and investigates various factors affecting the handover latency through mobile IPv6 testbed and evaluates the various parameters for reducing the handover latency.