• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.459-465
• /
• 2002

Ad-hoc networks have the dynamic topology characteristics and most of the applications on ad-hoc networks require the group communication capability. Previously proposed multicast mechanisms on mobile ad-hoc networks build multicast-infrastructures like the tree or mesh for the group communication and these infrastructures nay cause significant overhead especially in a highly dynamic mobile ad-hoc network environment. Therefore, in this paper, we propose a new multicast mechanism supporting multicast services based on only the underlying unicast routing tables, hence any multicast-related infrastructures like trees and meshes are not required to be constructed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.180-187
• /
• 2002

Many real-time multimedia applications, such as video conferencing have stringent end-to-end delay constraints and consume large amount of network resources. In order to support these applications efficiently, multicast routing algorithms computing least cost multicast trees that satisfy a given end-to-end delay constraint are needed. However, finding such a tree is known to be computationally expensive. Therefore, we propose a heuristic distributed multicast routing algorithm that reduces a “finding multicast tree”that satisfies a given end-to-end delay constraint and minimizes the average resulting tree cost. Also, simulation results show that the proposed algorithm has much better average cost performance than other existing algorithms.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.342-352
• /
• 2021

Multicast Routings is a big challenge due to limitations such as node power and bandwidth Mobile Ad-hoc Network (MANET). The path to be chosen from the source to the destination node requires protocols. Multicast protocols support group-oriented operations in a bandwidth-efficient way. While several protocols for multi-cast MANETs have been evolved, security remains a challenging problem. Consequently, MANET is required for high quality of service measures (QoS) such infrastructure and application to be identified. The goal of a MANETs QoS-aware protocol is to discover more optimal pathways between the network source/destination nodes and hence the QoS demands. It works by employing the optimization method to pick the route path with the emphasis on several QoS metrics. In this paper safe routing is guaranteed using the Secured Multicast Routing offered in MANET by utilizing the Ant Colony Optimization (ACO) technique to integrate the QOS-conscious route setup into the route selection. This implies that only the data transmission may select the way to meet the QoS limitations from source to destination. Furthermore, the track reliability is considered when selecting the best path between the source and destination nodes. For the optimization of the best path and its performance, the optimized algorithm called the micro artificial bee colony approach is chosen about the probabilistic ant routing technique.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.905-912
• /
• 2006

Depending on the location of the rendezvous point (RP), the network efficiency is determined in the core based tree (CBT) or protocol independent multicast-sparse mode (PIM-5M) multicasting protocol to provide the multicast services based on the shared tree. In this paper, a new algorithm to allocate the RP using the estimated values of the total cost and the size(number of entries) of the routing tables is proposed for efficiently controlling the cost and the number of routing table entries. The numerical results show that the proposed algorithm reduces the total cost in 5.37%, and the size of routing tables in 13.35% as compared to the previous algorithm.

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.500-508
• /
• 2009

We have designed an algorithm for a problem in multicast communication. The problem is to construct a multicast tree while minimizing its cost, which is known to be NP-complete. Our algorithm, which employs new concepts defined as potential cost and spanning cost, generates a multicast tree more efficiently than the well-known heuristic called Takahashi and Matsuyama (TM) [1] in terms of tree cost. The time complexity of our algorithm is O($kn^2$) for an n-node network with k members in the multicast group and is comparable to the TM. Our empirical performance evaluation comparing the proposed algorithm with TM shows that the enhancement is up to 1.25%~4.23% for each best case.

• ETRI Journal
• /
• v.33 no.3
• /
• pp.355-365
• /
• 2011

IPTV broadcast channels and video content distribution are increasingly saturating network paths. New solutions based on inter-domain multicast protocols could contribute to the enhancement of multimedia content distribution over the Internet. The aim of this paper is to propose new capabilities for an existing inter-domain multicast protocol, the Protocol Independent Multicast-Sparse Mode. We describe the modified protocol and analyze its behavior using newly developed tools based on an open-source software simulator. The resulting protocol does not require topology information, which is advantageous for easier deployment. In addition, the adopted solution avoids inherent problems with inter-domain multicast routing, such as multiple paths and path asymmetries.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.85-94
• /
• 2015

In this paper, an enhanced QoS multicast routing scheduling scheme is proposed to adapt to a dynamic mobile traffic condition for wireless mesh networks (WMNs). It handles the network QoS by controlling the delay constraints for multimedia applications. The group size will be controlled according to both the current network state and QoS requirements. The dynamic reconstruction of QoS multicast tree can be obtained from preprocessing with both the partial multicast routing scheme and the traffic estimation. Performance evaluation of the proposed scheme is carried out on randomly generated graph derived from the wireless mesh network, by choosing the optimal value related to the appropriate delay bounds. Simulation results show that the proposed scheme can improve the performance of QoS multicast routing for WMNs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1B
• /
• pp.80-86
• /
• 2003

High speed networking applications like video-on-demand require the support of switches that can handle very high multicast loads. Switches studied in the past can support multicast loads of 25${\sim}$30% To overcome this limitation, Tandem Expanded Delta Network(TEDN) multicast switch was proposed to support more higher multicast load by 85${\sim}$90% without degradation in the performance But there is tremendous routing capacity that is not used in the series of routing network blocks. This paper presents modified TEDN multicast switches to save the excessive routing capacity. by recirculating packets in last routing network, we can achieve the acceptable packet loss ratio with the smaller number of routing network blocks. Extensive simulations show that our proposed switches have the acceptable packet loss ratio with reduced hardware cost.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.5
• /
• pp.525-532
• /
• 2004

In this paper, we proposed a multicast routing algorithm for QoS improvement in the wire/wireless integrated environment. We analyzed requests and characteristics of QoS, and then proposed a new algorithm that can improve QoS by adding node mobility to wire environment. This new algorithm constructs a dynamic multicast tree that can prevent a loss of packet and save the bandwidth. As a result of simulations comparing to another multicast algorithms, we showed that this new algorithm can simply and dynamically adjusts the construction of multicast tree with little delay and the most reducible bandwidth resources.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1355-1358
• /
• 2001

IP Multicast can efficiently provide enormous bandwidth savings by enabling sources to send a single copy of a message to multiple recipients who explicitly want to receive the information. But due to the complexity of IP multicast and its fundamental differences from unicast, there are not very many tools available fer monitoring and debugging multicast networks, and only a few experts understand the tools that do exist. This thesis proposes a Multicast Routing Debugger (MRD) system that monitor the status of a multicast network. This system is aimed to multicast-related faults detection. In thesis, first, we define the set of information that should be monitored. Second, the method is developed to take out such information from multicast routers. Third, MRD system is prototyped to collect, process information from heterogeneous routers on a multicast network and to display the various status of the network comprehensively. The prototype of MRD system is implemented and deployed. We perform experiments with several scenarios. Experimental results show we can detect various problems as information that we define is monitored. The MRD system is simple to use, web-based and intuitive tool that can monitor the status of a specific multicast network.