• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.380-383
• /
• 1999

This paper proposes a basic framework of tight management of the group membership for Internet Multicast applications. At first, this paper describes and summary requirements for group management in multicast applications. So, tile framework model is designed to support the requirements. In the framework model, the CM (Croup Manage.) plays a main .ole. The CM has the four functionality: group creation, group announce, group query, group enroll, and group notification. Consequently, the proposed framework should support the new protocol for group management.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4343-4355
• /
• 2014

Multicast group communication has many advantages in data centers and thus is widely used by many applications. It can efficiently reduce the network traffic and improve the application throughput. For the multicast application in data centers, an essential problem is how to find a minimal multicast tree, which has been proved to be NP-hard. In this paper, we propose an approximation tree-building method for the minimal multicast problem, named HD（Hamming Distance）-based multicast tree. Consider that many new network structures have been proposed for data centers. We choose three representative ones, including BCube, FBFLY, and HyperX, whose topological structures can be regarded as the generalized hypercube. Given a multicast group in BCube, the HD-based method can jointly schedule the path from each of receiver to the only sender among multiple disjoint paths; hence, it can quickly construct an efficient multicast tree with the low cost. The experimental results demonstrate that our method consumes less time to construct an efficient multicast tree, while considerably reduces the cost of the multicast tree compared to the representative methods. Our approach for BCube can also be adapted to other generalized hypercube network structures for data centers after minimal modifications.

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

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.973-981
• /
• 1997

This paper identifies the main features and problems which have to be considerde when providing multicast services for mobile hosts.We also present a schme for solving these problems.To do this,we intreduce the ieda of the group view with a host status and present a multicast algorithm based on the group view concept.This paper mainly fouces on the exactly-once semantic for multicast delivery.It will provide basis for build-ing multicast servies for mobile hosts.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.336-340
• /
• 2007

This paper proposes a multicast scheme over IEEE 802.16 networks which support multiple upper layer protocols such as ATM, IPv4 packets, IPv6 packets, IEEE 802.3 over IPv4 and so on. The multicast capabilities over IEEE 802.16 are important both control plane and data plane. The proposed multicast scheme can be divided into two types: direct mapping and indirect mapping. The direct mapping scheme is that layer 3 address is directly mapped into CID information which is used for connection identifier at IEEE 802.16 link layer. The indirect mapping scheme has two steps for mapping between layer 3 address and layer 2 CID. Firstly, a layer 3 address translates to Ethernet MAC address with group MAC address. Secondly, a group MAC address is mapped into CID. The mapping scheme depends on the upper layer protocols.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.248-256
• /
• 2002

In this paper, new multicast scheduling algorithms are proposed for the WDM single－hop broadcast－and－select networks. The existing multicast scheduling algorithms do not concerned the previous state of receivers, but the proposed method call H－EAR and PGM that partition a multicast group to subgroups using the tunable transmitter, state information of receivers, and pseudo group concept. the performance of proposed algorithms are evaluated through the computer simulation. They show the better Performance comparing with the existing multicast scheduling algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.924-927
• /
• 2003

To support emerging group applications such as network games and Internet live-casting efficiently, IP multicast mechanism is highly needed. But IP multicast still has not been deployed in the current Internet because of its difficulty to manage. RMCP is designed to deliver multicast data in the unicast environment with the help of SM and MA mechanism. In this paper we discuss on RMCP design and test on APAN network.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.919-926
• /
• 2002

In this paper, new multicast scheduling algorithms are proposed for the WDM single-hop broadcast-and-select networks. The existing multicast scheduling algorithms are focused on the partitioning a multicast group into several subgroups to reduce the delay time of each receiver. These partitioning algorithms are grouping method of the receivers already tuned to the transmitter's wavelength. However, these algorithms ignore the state of receivers, which leads to increase the number of subgroups and the delay time. Therefore, 1 propose two new multicast scheduling algorithms called H_EAR and PGM that partition a multicast group to subgroups using the tunable transmitter, state information of receivers, and pseudo group concept. The performance of proposed algorithms are evaluated through the computer simulation. They show the better performance comparing with the existing multicast scheduling algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.3
• /
• pp.75-88
• /
• 2011

Messages need to transmit to the neighbors securely in wireless sensor network, because a sensor node is deployed in hostile area. Thus it is necessary to support secure communication. One of the most important communication part is secure multicast. Especially, group rekeying is a big problem for multicast key management. So, group rekeying must be proceed securely when secrete information is exposed by attacker. Many group rekeying schemes have been studied for ad hoc networks. However, these schemes are Ill1desirable in WSNs. In this paper, we proposed a novel group rekeying scheme in WSNs that it has very powerful security.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.627-634
• /
• 2006

Overlay network eliminates the need to change the application-layer tree when the underlying network changes and enables the overlay network to survive in environments where nonmember nodes do not support multicast functionality. An overlay protocol monitors group dynamics, while underlying unicast protocols track network dynamics, resulting in more stable protocol operation and low control overhead even in a highly dynamic environment. But, if overlay multicast protocols does not know the location information of node, this makes it very difficult to build an efficient multicasting tree. So, we propose a Hierarchical Overlay Multicast Architecture (HOMA) with the location information. Because proposed architecture makes static region-based dynamic group by multicast members, it is 2-tired overlay multicasts of application layer that higher layer forms overlay multicast network between members that represent group, and support multicast between multicast members belonging to region at lower layer. This use GPS, take advantage of geographical region, and realizes a region-sensitive higher layer overlay multicast tree which is impervious to the movements of nodes. The simulation results show that our approach solves the efficiency problem effectively.