Jin-Han Jeon

Overlay multicast tree recovery scheme using a proactive approach

Overlay multicast scheme has been regarded as an alternative to conventional IP multicast since it can support multicast functions without infrastructural level changes. However, multicast tree reconstruction procedure is required when a non-leaf node fails or leaves. In this paper, we propose a proactive approach to solve the aforementioned defect of overlay multicast scheme by using a resource reservation of some nodes out-degrees in the tree construction procedure. In our proposal, a proactive route maintenance approach makes it possible to shorten recovery time from parent nodes abrupt failure. The simulation results show that proposed approach takes less time than the existing works to reconstruct a similar tree and that it is a more effective way to deal with more nodes that have lost their parent nodes due to failure.

Cluster and Location Based Overlay Multicast in Mobile Ad Hoc and Sensor Networks

We propose a novel overlay multicast protocol over wireless sensor network, CLOM (cluster and location based overlay multicast) which use both cluster based approach and location based approach. A cluster based approach is used to manage multicast group consisting of relatively large number of nodes while a location based approach is used to construct a multicast tree with rapidity and low control overhead by using geometric information taken from GPS device. Additionally, the information of damping area and the scheme for reducing the CH node discovery time and control overhead have been introduced into CLOM to improve the performance of the tree. The simulation results showed that CLOM works properly with low data distribution delay and low control overhead where the number of multicast group members is relatively high.

mTBCP-Based Overlay Construction and Evaluation for Broadcasting Mini-system

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 clients wanting to join concurrently for Broadcasting Mini-systems service, this paper proposes a more efficient and better performing Overlay Tree Building Control Protocol by modifying and extending the basic mechanisms building the conventional TBCP. The modified-TBCP (m TBCP) 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 broken. Besides utilizing partial topology information, m TBCP also does a LAN-out-degree-check. If the selected child-parent-pair falls under the same LAN, that selected parent does not change the out-degree status. The performance comparison, in terms of Overlay-Connection-Throughput and Latency against Group-Size-Growth, between m TBCP, the HMTP, and the traditional TBCP is done through simulations and the results conclude in favour of the proposed m TBCP.

Induced Packet Loss Reduction by Max-Heap Overlay Construction Based on the Bandwidth-Latency Product Measures

Constructing max-heap-form overlay governed by node gain scores (NGSs), earned from requested bandwidth discrepancy ratio (BDR) with respect to available bandwidth, and latency discrepancy ratio (LDR) between the nodes and the source, reduces induced packet loss caused by schemes neglecting these parameters in constructing the tree. This proposal positions nodes using NGSfunction governed by available bandwidth, requested bandwidth, proposed latency to prospective parent, and best latency as advised by the source. BDR and LDR are set with a and (1,000-alpha) respective weights, and arbitrarily chosen a between 0 and 1,000. NGSs, used as nodelDs, maintain uniqueness and balance between the critical factors. Max-heap-form tree is constructed assuming that all the nodes possess NGS less than the source. For load balancing, parent-node can not accept another child until all its able siblings acquire same number. This scheme out-performs the others, like BASE, in packet delivery, link stress, and end-to-end delay.

Predict-and-Quantize Priority in Application-Level Multicast for Distributed Interactive Applications

In Distributed Interactive Applications (DIAs) embedded priority, the sender node forwards data to receivers due to their respective priorities. One application level multicast protocol: the priority-based directed minimum spanning tree (PST) was designed for these DIAs. However, the existing PST has no efficient priority selection mechanism and the system consumes a tremendous amount of resource and becomes unstable and unscalable when its size increases. In this paper we propose a novel application level multicast algorithm: Predict-and-Quantize for Priority with directed minimum Spanning Tree (PQPST), which can efficiently predict priorities for the receivers and quantize the predicted priorities to build a multicast distribution tree. Furthermore, PQPST can easily integrate the quantized priority into game environment and simplify priority deployment. The simulation results show that PQPST is able to efficiently make priority selection and keep system stable with reasonable scalability.

Neural Network's k-means Distance-Based Nodes-Clustering for Enhanced RDMAR Protocol in a MANET

k-means distance-based nodes clustering technique proposed enhance the performance of RDMAR protocol in a Mobile Ad-hoc NETwork (MANET). To limit the flood search to just a circular local area around the source, the Relative Distance Micro-discovery Ad Hoc Routing (RDMAR) protocol uses the Relative Distance (RD). If the distance of flood discovery is further limited by clustering the nodes with similar characters in to one group, different from the dissimilar characters group, the performance of the RDMAR implementation can be elevated. The k-means algorithm, similar to the one in unsupervised learning in pattern classification, can be recursively applied to re-classify the clusters as the MANET environment, resource availability, and node demands change. This technique can be more effective in a MANET with comparatively moderate change of the dynamicity and slow change in nodes demands plus highly accumulated groups of nodes at given sub-areas.

Real-time adaptive tree building in host-based multicast scheme

The main concerns of host-based multicast tree construction algorithm are to minimize the network resource utilization and to meet the need of application programs such as Internet broadcasting or video conferencing. Existing works focused on reducing performance-degrading factors like the duplicate data transmission on the same network link and overhead incurred at host or end-systems. However, they had relatively high RDP (relative delay penalty), which made it difficult to apply such application programs. In this work, we propose a DDTA (data delivery tree adjust) algorithm which can reduce RDP by minimizing the tree depth and finding suitable intermediate node using node-switching. It also suggests schemes for rapid recovery of a data delivery tree. Simulation results show that RDP of proposed scheme is lower than existing work with minimal performance corruption.

The algorithm for constructing an efficient data delivery tree in host-based multicast scheme

To minimize the network resource and to meet the need of related application programs such as Internet Broadcasting or Video conferencing are the main concerns of Host-based Multicast tree construction algorithm. Existing works reduced performance-degrading factors like the duplicate data transmission on the same network link and overhead incurred at host or end-systems. However, they had relatively high RDP(Relative Delay Penalty), which made it difficult to adapt for application programs. In this work, we proposed a DDTA(Data Delivery Tree Adjust) algorithm which can reduce RDP by minimizing the tree depth, but it also could incur performance debasement. Proposed algorithm adapted techniques such as the detection of hosts existing in the same LAN to decrease the RDP and node switching to compensate performance loss. In addition, it suggests schemes for rapid recovery of a data delivery tree and shows that its RDP is lower than existing work.