• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.9
• /
• pp.626-636
• /
• 2009

In Mobile IP-enabled wireless LAN (WLAN), packet flows are corrupted due to the handoff of a mobile node (MN) at the link and network layers, which results in burst packet losses and can cause temporary buffer underflow in a streaming client at the MN. This transient behavior hurts time-sensitive streaming media applications severely. Among many suggestions to address this handoff problem, few studies are concerned with empirical issues regarding the practical validation of handoff options on the time-sensitive streaming media applications. In this paper, targeting seamless streaming over Mobile IP-enabled WLAN, we introduce a seamless media streaming framework that estimates accurate pre-buffering level to compensate the handoff latency. In addition, we propose a link-layer (L2) assisted seamless media streaming system as a preliminary version of this framework. The proposed system is designed to reduce the handoff latency and to overcome the playback disruption from an implementation viewpoint. A packet buffering and forwarding mechanism with L2 trigger is implemented to reduce the handoff latency and to eliminate burst packet losses generated during the handoff. A pre-buffering adjustment is also performed to compensate the handoff latency. The experimental results show that the proposed approach eliminates packet losses during the handoff and thus verify the feasibility of seamless media streaming over Mobile IP-enabled WLAN.

• Journal of Korea Multimedia Society
• /
• v.24 no.1
• /
• pp.51-57
• /
• 2021

In this paper, we propose a task distribution scheme in fog computing environment considering opportunistic fog computing nodes. As latency is one of the important performance metric for IoT(Internet of Things) applications, there have been lots of researches on the fog computing system. However, since the load can be concentrated to the specific fog computing nodes due to the spatial and temporal IoT characteristics, the load distribution should be considered to prevent the performance degradation. Therefore, this paper proposes a task distribution scheme which considers the static as well as opportunistic fog computing nodes according to their mobility feature. Especially, based on the task requirements, the proposed scheme supports the delay sensitive task processing at the static fog node and delay in-sensitive tasks by means of the opportunistic fog nodes for the task distribution. Based on the performance evaluation, the proposed scheme shows low service response time compared to the conventional schemes.

• Sleep Medicine and Psychophysiology
• /
• v.11 no.2
• /
• pp.80-83
• /
• 2004

Objectives: The multiple sleep latency test (MSLT) is commonly used as a valid objective measure of sleepiness. The procedure of MSLT is well standardized but the sleep onset criterion is somewhat variable. One epoch of stage 1 sleep is the most commonly used criterion, and the criterion of three epochs of stage 1 sleep is also used. The purpose of this study was to compare the two criteria used to determine sleep onset. Methods: We retrospectively analyzed 60 consecutive MSLT that were performed according to a standaridized protocol. We scored each test using the two different criteria for sleep onset and then statistically analyed the results. Results: Using the different criteria, 20 patients among 60 showed changes in mean sleep latency (33.3%). The extent of change ranged from 1.3% to 38.5% (mean 15.9%). Non-narcoleptic patients showed a significantly higher incidence of change than other sleep disorder patients. Conclusion: Changes in mean sleep latency occurred according to the different criteria of sleep onset. But the difference arising from different criteria was statistically not significant in patients with moderate to severe sleepiness. Considering that 1 epoch criterion for sleep onset is more sensitive in detecting clinically significant sleepiness, the authors suggest that the 1 epoch criterion is more reliable than the 3 epochs criterion.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.8
• /
• pp.3399-3419
• /
• 2020

In the Vehicular Ad-hoc Network (VANET), the data transmission of time-sensitive applications requires low latency, such as accident warnings, driving guidance, etc. However, frequent changes of topology in VANET will result in data transmission failures. In order to improve the efficiency of VANETs data transmission and increase the timeliness of data, this paper proposes a relay scheme based on Recurrent Neural Network (RNN) trajectory prediction, which can be used to select the optimal relay vehicle to transmit data. The proposed scheme learns vehicle trajectory in a distributed manner and calculates the predicted trajectory, and then the optimal vehicle can be selected to complete the data transmission, which ensures the timeliness of the data. Finally, we carry out a set of simulations to demonstrate the performance of the algorithm. Simulation results show that the proposed scheme enhances the timeliness of the data and the accuracy of the predicted driving trajectory.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.79-95
• /
• 2016

In order to improve the Quality-of-Service (QoS) of latency sensitive applications in next-generation cellular networks, multi-path is adopted to transmit packet stream in real-time to achieve high-quality video transmission in heterogeneous wireless networks. However, multi-path also introduces two important challenges: out-of-order issue and reordering delay. In this paper, we propose a new architecture based on Software Defined Network (SDN) for flow aggregation and flow splitting, and then design a Multiple Access Radio Scheduling (MARS) scheme based on relative Round-Trip Time (RTT) measurement. The QoS metrics including end-to-end delay, throughput and the packet out-of-order problem at the receiver have been investigated using the extensive simulation experiments. The performance results show that this SDN architecture coupled with the proposed MARS scheme can reduce the end-to-end delay and the reordering delay time caused by packet out-of-order as well as achieve a better throughput than the existing SMOS and Round-Robin algorithms.

• 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.

• Journal of Korea Multimedia Society
• /
• v.18 no.2
• /
• pp.189-198
• /
• 2015

Despite the fact that traffic engineering techniques have been comprehensively utilized in the past to enhance the performance of communication networks, the distinctive characteristics of Software Defined Networking (SDN) demand new traffic engineering techniques for better traffic control and management. Considering the behavior of traffic, large flows normally carry out transfers of large blocks of data and are naturally packet latency insensitive. However, small flows are often latency-sensitive. Without intelligent traffic engineering, these small flows may be blocked in the same queue behind megabytes of file transfer traffic. So it is very important to identify large flows for different applications. In the scope of this paper, we present an approach to detect large flows in real-time without even a short delay. After the detection of large flows, the next problem is how to control these large flows effectively and prevent network jam. In order to address this issue, we propose an approach in which when the controller is enabled, the large flow is mitigated the moment it hits the predefined threshold value in the control application. This real-time detection, marking, and controlling of large flows will assure an optimize usage of an overall network.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.117-124
• /
• 2001

At NOW (Networks Of Workstations), the load sharing is very important role for improving the performance. The known load sharing strategy is fixed-granularity, variable-granularity and adaptive-granularity. The variable-granularity algorithm is sensitive to the various parameters. But Send algorithm, which implements the fixed-granularity strategy, is robust to task granularity. And the performance difference between Send and variable-granularity algorithm is not substantial. But, in Send algorithm, the computing time and the communication time are not overlapped. Therefore, long latency time at the network has influence on the execution time of the parallel program. In this paper, we propose the preSend algorithm. In the preSend algorithm, the master node can send the data to the slave nodes in advance without the waiting for partial results from the slaves. As the master node sent the next data to the slaves in advance, the slave nodes can process the data without the idle time. As stated above, the preSend algorithm can overlap the computing time and the communication time. Therefore we reduce the influence of the long latency time at the network and the execution time of the parallel program on the NOW. To compare the execution time of two algorithms, we use the $320{\times}320$ matrix multiplication. The comparison results of execution times show that the preSend algorithm has the shorter execution time than the Send algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.1
• /
• pp.20-24
• /
• 2009

sensor node work limited energy. It is undesirable or impossible to replace the batteries that are depleted of energy because of characteristics of the sensor network. Due to the specific energy constrained environment, MAC design for sensor networks generally has to take energy consumption as one of its primary concerns. But in sensor networks, latency has been a key factor affecting the applicability of sensor networks to some delay-sensitive applications. Therefore, we propose MAC protocols based DSMAC in this paper. Which is able to dynamically change the sleeping and duty cycle of sensors is adjusted to adapt to packet amounts in buffer. Proposed MAC has energy efficiency and low latency, compared DSMAC.

• Journal of Korea Multimedia Society
• /
• v.25 no.8
• /
• pp.1075-1084
• /
• 2022

Internet of Things(IoT) has become a key available technology for efficiently implementing device to device(D2D) services in various domains such as smart home, healthcare, smart city, agriculture, energy, logistics, and transportation. A lightweight publish/subscribe(Pub/Sub) messaging protocol not only establishes data dissemination pattern but also supports connectivity between IoT devices and their applications. Also, a Pub/Sub broker is deployed to facilitate data exchange among IoT devices. A scalable edge-based publish/subscribe (Pub/Sub) broker overlay networks support latency-sensitive IoT applications. In this paper, we design a hypercube grid quorum(HGQ) for distributed Pub/Sub systems based IoT applications. In designing HGQ, the network of hypercube structures suitable for the publish/subscribe model is built in the edge layer, and the proposed HGQ is designed by embedding a mesh overlay network in the hypercube. As their applications, we propose an HGQ-based mechansim for dissemination of the data of sensors or the message/event of IoT devices in IoT environments. The performance of HGQ is evaluated by analytical models. As the results, the latency and load balancing of applications based on the distributed Pub/Sub system using HGQ are improved.