• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.6
• /
• pp.1994-2017
• /
• 2022

In view of the past, the mobility of the multicast source in the mobility networks is seldom discussed in the traditional multicast protocols. It is a heavy cost for the traditional multicast protocols to reconstruct the multicast tree in the Network Mobility (NEMO) environment. This article proposes an alternative multicast protocol, referred to as Mobility-Sensitive Multicast protocol (MSM), for the NEMO environment. The MSM can be considered as an alternative version of the Multicast Listener Discovery (MLD) protocol to maintain the multicast tree in the NEMO. There are two obvious contributions for the MSM. Reconstruct mechanism could rebuild the multicast tree for the mobility of the multicast source. Multi-group suppression mechanism reduce the multicast tree maintaining cost for the mobility of the multicast members. Through the performance evaluations and analyses, the MSM has less cost to maintain the multicast tree than the traditional multicast protocols, especially for a large numbers of multicast groups. Moreover, the MSM allows the mobility of the multicast source to reconstruct the multicast tree easily.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.558-561
• /
• 2004

Currently, most IP multicasting applications are implemented based on Any-Source Multicast (ASM) model that supports many to many multicast services. However, it is known that current ASM-based multicast architecture has several deployment problems such as address allocation, lack of access control, and inefficient handling of well-known multicast sources. Source-Specific Multicast (SSM) working group in IETF proposed SSM architecture to overcome the weaknesses of ASM architecture. The architecture of SSM is based on one to many multicast services. Also, in order to provide SSM service, Multicast Listener Discovery Version 2 (MLDv2) protocol should be supported. In this paper, we introduce the architecture of SSM protocol and multicast group management protocol. After that, we present the architecture and implementation of IPv6 SSM and MLDv2 protocols in Linux systems.

• The Journal of the Korea Contents Association
• /
• v.4 no.4
• /
• pp.197-203
• /
• 2004

In mobile network, the maintenance o( host grouping or the multicast delivery tree for multicasting algorithm becomes a major issues. In this paper, we explore the issues of mobile Multicast scheme using Mobile-IPv6, and addresses case when a mobile host is a source as well as a recipient of a given multicast operation using MLD(Multicast Listener Discovery) scheme, and the proposed MLD-based multicasting protocol asks its HA(Home Agent) to stop forwarding multicast for group using tunneling. We examine and compare our model to existing approaches by proposed cost model, and observe an improved ferformacne.

• Journal of Korea Multimedia Society
• /
• v.2 no.2
• /
• pp.184-194
• /
• 1999

We present a new algorithm to minimize channel contention while sending multiple messages from multiple source to overlapped destination set on Multistage Interconnection Network (MIN) which supports wormhole routed turnaround routing. The multicast tree of the U-MIN(Unicast MIN) algorithm is useful in performing messages from one source to multiple destination but gives rise to a serious channel connection in performing multiple multicast because it has been designed for only single multicast. For multiple multicast communication on MIN, we address how to implement multiple multicast services efficiently. And a SPU-MIN(Source Partitioned Unicast MIN) algorithm is proposed and shown to be superior than the U-MIN algorithm for multiple multicast. The turnaround routing algorithm based on wormhole routing technique is employed as a message sending method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.813-818
• /
• 2015

In this paper, WiMedia Distributed-MAC protocol is adopted for development of a seamless N-screen wireless service. Furthermore, to provide the OSMU (One Source Multi Use) N-screen service through P2P streaming in the seamless D-MAC protocol, a new Multicast-free DRP Availability IE is proposed and analyzed. In this Multicast-free DRP Availability IE, indicating Multicast DRP Owner and Receiver is required. The ACK frame transmissions are not required for Multicast transmissions in P2P N-screen services. Using this property, the Multicast-free DRP Availability IE scheme is proposed to expand the number of time slots available for unicast and multicast DRP reservations. Simulation results show that our Multicast scheme enhances performances in vewpoints of DRP reservation conflict and throughput.

• 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 Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.377-385
• /
• 2010

In this paper, we propose a SInk-initiated geographic Multicast (SIM) protocol to reduce frequent location updates from mobile sinks to a source and to achieve fast multicast tree construction and data delivery. The proposed protocol allows sinks to construct their own data delivery paths to a source node and a multicast tree to be atomically constructed by merging the paths. Then, the source forwards data to the destinations down the multicast tree. This paper also propose a round-based virtual infrastructure with a radial shape for increasing the merging probability of data delivery paths and reducing reconstruction ratio of the multicast tree due to mobility of sinks. Simulation results show that the proposed protocol is superior to previous SOurce-initiated geographic Multicast (SOM) protocols in term of average data delivery delay and average energy consumption.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.538-540
• /
• 2004

차세대 인터넷 어플리케이션으로서 각광받고 있는 다양한 실시간 멀티미디어 서비스들이 기존 인터넷망에서 유니케스트 라우팅 방식으로 제공되면서 사용자수의 한계와 서버의 부하 문제에 따른 여러 문제점을 안고 있다. 이로 인해 한번에 여러 사용자들에게 동일한 데이터를 보내야 하는 멀티미디어 서비스의 경우에는, 각 사용자들에게 데이터를 여러 번 전송하는 유니캐스트 라우팅(Unicaast Routing)방식에 비해 멀티캐스팅(Multicast Routing)방식으로 전송하는 것이 대역폭 활용면에서 더 효율적이다. 그러나 Multicast Routing 을 DWDM 기반의 차세대 광인터넷망에 적용하기에는 optical signal splitter의 사용으로 인한 cost의 증가와 Power Penalty 의 보상 문제 등 해결해야 할 여러가지 문제가 남아있다. 따라서 본 논문은 이러한 제한 사항을 극복하기 위해서 제한된 노드에 대해서만 optical signal splitter 를 사용하는 Virtual Source 기반의 Multicast Routing 알고리즘을 제안한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.12
• /
• pp.2267-2273
• /
• 2016

In this paper, WiMedia Distributed-MAC protocol is adopted for development of an OSMU (One Source Multi Use) N-screen wireless multicast service. But, when considering wireless communication environment where channel error rate is time-variant, N-screen high-speed data is vulnerable to be lost. For this problem, a multicast relay scheme is proposed by analyzing Distributed-MAC protocol. In proposed multicast relay scheme, Multicast-free DRP Availability IE is combined and the relay node suitable for N-screen multicast transmissions is selected. Through this operation, it can avoid wireless channel with high errors and can transmit N-screen high-speed data. In simulation results, the proposed multicast relay scheme is compared with conventional Distributed-MAC multicast scheme in view points of throughput and energy consumption according to various numbers of multicast nodes and BER (Bit Error Rate) values in wireless channel. Through simulation results, it is explained that proposed multicast relay scheme should be adopted in WiMedia Distributed-MAC protocol to realize OSMU N-screen wireless multicast services.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.305-313
• /
• 2004

Group multicast refers to the kind of multicast in which every member of a group is allowed to transmit data to the group. The goal of routing algorithms for group multicast is to construct a set of low cost multicast trees including all the group members with QoS (e.g., bandwidth) constraint. There have been several algorithms proposed: source tree and shared tree approaches. However, the latter approach has a low success rate in constructing a shared multicast tree, and the former approach suffers from high control overhead and low scalability as stoup size increases. In this paper, we present a heuristic algorithm which varies the number of multicast trees according to the network load. The simulation results show not only that our algorithm outperforms the shared tree approach in terms of the success rate, but also that it has lower control overhead than the source tree approach while guaranteeing the same success rate.