• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.179-184
• /
• 2003

One of the remarkable problems in PIM-DM (Protocol Independent Multicast - Dense Mode) is the join latency time, increasing for specific periods. The reason of this problem is proved to the confusion of flooding prune message and leave prune message. We propose a new solution to this problem, reducing the average join latency by 37.4%, and prove the proposed solution by network simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8B
• /
• pp.539-546
• /
• 2007

For better performance and to avoid member service annoyance that results due to joining-clients' waiting durations and time-outs when there are more than one client wanting to join concurrently for Personal Broadcasting System service, there is a need for improving concurrent member joining mechanism. For a more efficient and better performing, this paper apply Overlay Multicast based mini-Overlay Broadcasting Control Protocol(mOBCP) Algorithm on Personal Broadcasting System. mOBCP proposed is performance-effective mechanism, since it considers the case of how fast will children, concurrently, find and join new parents when paths to existing parents are in Failure. The performance comparison, in terms of tree construction time variation and Latency are done through simulations and the results conclude in favour of the Proposed mOBCP.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.301-303
• /
• 2002

One of the remarkable problems in PIM-DM(Protocol Independent Multicast-Dense Mode) is the latency time, increasing for some periods. The reason of this problem is proved to the confusion of flooding prune message and leave prune message. We propose a convincing solution to this confusion and we prove this by network simulation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.1
• /
• pp.33-39
• /
• 2017

In mission-critical applications such as vehicular networks, distributed robotics, and other cyber-physical systems, the requirements for latency are more stringent than traditional applications. Among them, autonomous V2V communication is a rapidly emerging domain of applications with a few milliseconds' latency requirements. Today's systems utilizing 802.11p or LTE-direct standards are not primarily designed for ultra-low latency. Because the medium access function contributes to a significant portion of the total latency, it is necessary to modify Layer2 in order to solve the problem. Focusing on MAC layer, we developed a scalable and latency-guaranteed MAC by devising Autonomous TDMA (ATDMA) in which autonomous joining/leaving is allowed without scheduling by coordinator. We also evaluated the performance of the algorithm by comparing with the WAVE protocol.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.2
• /
• pp.55-62
• /
• 2018

VANET is a rapidly emerging service area with strict requirements of a few milliseconds' latency. Because current systems don't guarantee ultra-low latency, it has been proposed a latency-guaranteed Autonomous ATDMA(ATDMA) in which autonomous joining/leaving is allowed without coordinator's scheduling. In this study, we extended ATDMA to operate in non-perfect decoding environments with existing hidden nodes, channel fading and node density variation, and named it ATDMA revision(ATDMA-R). We also evaluated the performance of ATDMA and ATDMA-R, and showed the robustness of ATDMA-R through various realistic simulation scenarios.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.5
• /
• pp.365-369
• /
• 2009

Overlapping windows are generally used for queries to process continuous data streams. Nevertheless, existing approaches discussed join algorithms only for basic types of windows such as tumbling windows and tuple-driven windows. In this paper, we propose an efficient join algorithm for overlapping windows, which are considered as a more general type of windows. The proposed algorithm is based on an incremental window join. It focuses on producing join results continuously when the memory overflow frequently occurs. It consists of (1) a method to use both of the incremental and full joins selectively, (2) a victim selection algorithm to minimize latency of join processing and (3) an idle time professing algorithm. We show through our experiments that the selective use of incremental and full joins provides better performance than using one of them only.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1031-1040
• /
• 2010

Hash join is one of the core algorithms in databases management systems. If a hash join cannot complete in one-pass because the available memory is insufficient (i.e., hash table overflow), however, it may incur a few sequential writes and excessive random reads. With harddisk as the tempoary storage for hash joins, the I/O time would be dominated by slow random reads in its probing phase. Meanwhile, flash memory based SSDs (flash SSDs) are becoming popular, and we will witness in the foreseeable future that flash SSDs replace harddisks in enterprise databases. In contrast to harddisk, flash SSD without any mechanical component has fast latency in random reads, and thus it can boost hash join performance. In this paper, we investigate several important and practical issues when flash SSD is used as tempoary storage for hash join. First, we reveal the va patterns of hash join in detail and explain why flash SSD can outperform harddisk by more than an order of magnitude. Second, we present and analyze the impact of cluster size (i.e., va unit in hash join) on performance. Finally, we emperically demonstrate that, while a commerical query optimizer is error-prone in predicting the execution time with harddisk as temporary storage, it can precisely estimate the execution time with flash SSD. In summary, we show that, when used as temporary storage for hash join, flash SSD will provide more reliable cost estimation as well as fast performance.

• The Journal of the Korea Contents Association
• /
• v.8 no.10
• /
• pp.20-26
• /
• 2008

The quality of stream remaking is decided the load of a server and Jitter through the traffic of the transmission path between end to end. In order to improve these problems in this paper, I propose tree construction method of low-delay-level-multicast. In this case which the network congestion will be occurred by streaming quality, I also propose the technique which dynamically changes the transmission path. This technique first constructs the overlay structure for relaxing the overload of server. Secondly, in order to decrease Jitter of client, it makes upload bandwidth and low latency balanced. In the evaluation of the performance, this paper showed better enhancement of about $15%{\sim}24%$ than P2CAST[4] in the simulation about node average join count, average bandwidth, service request refusal ratio, RTT measurement of nodes, and node average join count by defect ratio.

• Journal of Internet Computing and Services
• /
• v.6 no.3
• /
• pp.55-70
• /
• 2005

In order to provide mobile hosts with multicast service in mobile communication environment, we proposed a multicast mechanism named HXcast++ which is an extended version of the existing Xcast++ with hierarchical architecture, We assured that mobile hosts could get multicast service through an optimal path regardless of their location by making DR(Designated Router) join a group on behalf of the mobile hosts, In this present research we introduced hierarchical architecture in order to reduce the maintenance cost resulting from frequent handoff. We also proposed a GMA (Group Management Agent) based group management mechanism which enables the mobile hosts to join the group without waiting for a new IGMP Membership Query. A fast handoff method with L2 Mobile Trigger was, in this work, employed in order to reduce the amount of the packet loss which occurs as a result of the handoff, We also managed to curtail the packet loss caused by the latency of the group join by using a buffering and forward mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7A
• /
• pp.597-602
• /
• 2005

This paper proposes an efficient multicast scheme for the hierarchical mobile IPv6(HMIPv6). If a mobility anchor point(MAP) in a new domain does not support multicasting, an entering group member cannot join the multicast group through the new MAP The group member thus keeps receiving multicast packets from its home agent(HA) using Mobile IPv6 (MIPv6). This increases the propagation delay of binding update (BU) messages. However, our scheme enables an entering group member to keep receiving packets from the old multicast MAP. It can also reduce tunneling costs, total delivery costs and handover latency. We simulated the performance of our scheme by comparing it with the seamless multicast handover in a hierarchical mobile Pv6 (M-HMIPv6) using the delivery cost and handover latency factors.