• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.8
• /
• pp.11-18
• /
• 2001

In this paper, we propose a multicast routing scheme for an efficient and reliable support of multicast service to mobile hosts in IPv6 based networks. The purpose of this paper is to develop an algorithm to reduce both the number or multicast tree reconstruction and the multicast service disrupt time. The proposed multicast routing scheme is a hybrid method using the advantages of the bi-directional tunneling and the remote subscription proposed by the IETF Mobile IP working group. The proposed scheme satisfies the maximum tolerable transfer delay time and supports the maximum tunneling service. The simulation results show that the proposed scheme has better performance in the number of multicast tree reconstruction and the time of multicast service disrupt than the previous schemes does.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.508-516
• /
• 2001

This paper proposes multicast routing algorithm that operates for non-interactive multimedia applications such as VOD(Video On Demand) and real-time data broadcasting. It is possible that there exist multiple senders in non-interactive multimedia applications. This paper designs multicast routing algorithm in this environment. The simulation of algorithm proposed in this paper shows much better performancetcost, delay) than that of only one source. To guarantee the performance of algorithm, Broadband ATM network is modelled in simulation.

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

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.286-296
• /
• 2009

A major challenge in next generation optical Internet (NGOI) networks based on dense-wavelength division multiplexing (DWDM) is the provision of guaranteed quality-of-service (QoS) for a wide variety of multimedia applications. One of the critical issues in NGOI is the routing and wavelength assignment problem that is embossed as very important and plays a key role in improving the global efficiency for capacity utilization. But the previous researches had the delay problem, and the path routed by higher priority nodes may be congested and interfere with potential future multicast session requests. To overcome these problems, in this research we suggest a Priority-based Minimum Interference Path Multicast Routing (PMIPMR) algorithm, a new routing algorithm which finds alternative routes based on node priorities and Virtual Source (VS) nodes that has both splitting and wavelength conversion, and then chooses a path that does not interfere with potential future multicast session requests when congestions occur in the network. The PMIPMR algorithm reduces blocking rate significantly and increases the wavelength utilization by avoiding congestion in future multicast session requests.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.15-23
• /
• 2002

We present a new MDA-based Mobile-IPv6 multicast routing algorithm for wirelese service operators to offer Mobile-IP over IMT-2000 service under IMT-2000 network by taking advantage of the existing infrastructure for IMT-2000 multimedia application services. The extended IMT-2000 system architectures use an PDSNs (i.e. IWFs), and the home network (i.e. Internet) backbone and intermediate network are composed of ATM entities. A key feature of the new protocol is the use of MDA(Multicast Delivery Agent) to reduce delivery path length of the multicast datagram. We show that proposed protocol is efficient in terms of various performance measures such as multicast traffic load, multicast related handoff, and average routing length when we implement it using the Mobile-IPv6. Particularly, the number of tunneling and average routing length of datagram are reduced relatively, the multicast traffic load is also decreased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1100-1105
• /
• 2003

In this paper, we propose a solution, called DQDMR, for generating delay-constrained bandwidth- appropriated multicast routing trees to reduce end-to-end delay and conserved bandwidth resources. At the current router system the router keep the information of link which neighboring node in the routing table to guarantee QoS(Quality of Service). When we construct multicast tree, DQDMR algorithm dynamically adjusts the path in the least delay and appropriate bandwidth. Through simulations comparing to another multicast algorithms, we reach a conclusion that DQDMR algorithm can simply and dynamically adjusts the construction of multicast tree in hight-speed and conserve bandwidth resources.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.3
• /
• pp.81-89
• /
• 2000

The real-time multicast problem is to construct a multicast tree starting from a source node and including multiple destination nodes and that has minimum network cost with delay constraints. It is known that to find a tree of the minimum network cost is the Steiner Tree problem which is NP-complete. In this paper, we propose a genetic algorithm to solve the multicast tree with minimum network cost and the delay constraints. The computational results obtained by comparing an existing algorithm. Kompella algorithm, and the proposed algorithm show that our algorithm tends to find lower network cost on the average than Kompella algorithm does.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.785-788
• /
• 2012

There has been growing interest in multicast technologies for wireless mesh networks with increasing demand for enjoying seamless multimedia broadcast service such as mobile IPTV anytime anywhere for any content on any device. This paper addressed the factors that should be considered when designing multicast algorithm in WMNs. Several routing metrics which are adapted for WMNs based multicast are described in detail to show that the main design goal for multicast metric is to achieve high throughput. Those metrics that take into account the characteristics of WMNs such as wireless broadcast advantage or channel diversity can arrange load balancing more effectively.

• Journal of KIISE:Information Networking
• /
• v.33 no.6
• /
• pp.461-472
• /
• 2006

In this paper, we propose a novel on-demand multicasting algorithm, 'Durable Distance Vector Multicasting(DDVM),' for Mobile Ad hoc Network(MANET). DDVM has a more efficient routing-control complexity than Link State Routing(LSR) and with the smaller complexity, DDVM provides a high delivery ratio for MANET with high mobility by adapting to dynamic topological changes. This is achieved by adding 'combined path durability' statistic into the routing-control information of Distance Vector Routing(DVR). The routing-path duration statistic is computed in a fully distributed manlier at each node in the network based on only local information from neighbour nodes. We show by simulation studies the effectiveness of DDVM compared with On-demand Multicast Routing Protocol(ODMRP).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3138-3150
• /
• 2021

Multimedia services on the Internet are continuously increasing. Accordingly, the demand for a technology for efficiently delivering multimedia traffic is also constantly increasing. The multicast technique, that delivers the same content to several destinations, is constantly being developed. This technique delivers a content from a source to all destinations through the multicast tree. The multicast tree with low cost increases the utilization of network resources. However, the finding of the optimal multicast tree that has the minimum link costs is very difficult and its calculation complexity is the same as the complexity of the Steiner tree calculation which is NP-complete. Therefore, we need an effective way to obtain a multicast tree with low cost and less calculation time on SDN-based smart network platforms. In this paper, we propose a new multicast tree generation algorithm which produces a multicast tree using an agent trained by model-based meta reinforcement learning. Experiments verified that the proposed algorithm generated multicast trees in less time compared with existing approximation algorithms. It produced multicast trees with low cost in a dynamic network environment compared with the previous DQN-based algorithm.