• Journal of the Korea Society of Computer and Information
• /
• v.6 no.2
• /
• pp.116-122
• /
• 2001

A conventional multicast secure protocol. MVMRP, CBT is designed for a large scaled r protocol so the PIM-SM (protect Independent Multicst-Sparse Mode) routing protocol which small number of clients, long distance path among the hosts and shortest path routing chara weak point of require it's own Core tree and re-keying when the traffic is pass through the ro In this study, proposes a architect for a licit information secure of join/leave to all the user or on-service user. With proposed architect, subgroups for multicast secure group mana will be divided by RP (Rendezvous-Point) unit and each RP has a subgroup manager. As a result, the transmitting time is shortened because there is no need to data translation by group key on data sending and the whole architecture size is samller than the other multicast secure architecture.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.2
• /
• pp.77-85
• /
• 2015

This paper presents our performance evaluation after the way of minimizing waiting times between channel switching for eMBMS(evolved Multimedia Broadcast/Multicast Services) technique in LTE-Advanced systems. Existing composition of MBMS using IGMP(Internet Group Management Protocol) transfers the data with Multicast from BM-SC(Broadcast Multicast Service Center) to eNB(evolevd Node B) and with Broadcast from eNB to UE(User Equipment). Therefore, in case of channel switching, IGMP Join report should be transferred to BM-SC and then wait user's contents to be retransferred from eNB. To achieve this, Subscriber Channel technique of priorities is used for minimizing waiting times between channel switching as UE broadcasts favorite channels in advance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1037-1043
• /
• 2006

This work presents an effective overlay multicast tree construction algorithm for synchronized real-time media multicast service over the Internet. The proposed algorithm is designed to minimize delay variance among group members to provide the synchronized service as well as average delay of group members in order to support the service in real-time. Basically, of orthogonal genetic algorithm is employed to obtain the near optimal tree with a low computational complexity since the given problem is NP-complete. Finally, experimental results are provided to show the superior performance of the proposed algorithm.

• Convergence Security Journal
• /
• v.17 no.5
• /
• pp.87-92
• /
• 2017

MANET is a network composed itself because mobile nodes are connected wirelessly. It has been applied to various fields for group communication. However, the dynamic topology by the movement of the nodes causes routing failure frequently because it is difficult to maintain the position information of the nodes participating in the group communication. Also, it has a problem that network performance is decreased due to high overhead for managing information of member nodes. In this paper, we propose a multicast technique using location-based 2-tier virtual group that is flexible and reliable in management of member nodes. The network is composed of cellular zones and the virtual group is constructed using the location information of the nodes in the proposed technique. The virtual group management node is selected to minimize the overhead of location information management for member nodes in the virtual group. In order to improve the reliability for management of member nodes and multicast data transmission, it excludes the gateway node with low transfer rate when setting the route after the packet transmission rate of the member nodes is measured. The excellent performance of the proposed technique can be confirmed through comparative experiments with AMroute method and PAST-DM method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.253-263
• /
• 2005

This paper proposed a mobile multicast technique to satisfy end-to-end QoS for various user requirements in mobile network environment. In order to provide seamless mobility, fast handoff technique was applied. By using L2 mobile trigger, it was possible to minimize remarkable amount of packet loss by delay occurred during handoff. To provide efficient multicast, concept of hierarchy was introduced to Xcast++, which results in a creation of HXcast++. HXcast++ optimized transfer path of multicast and reduced expensive multicast maintenance costs caused by frequent handoff. Suggestion of GMA (Group Management Agent) mechanism allows joining to group immediately without waiting IGMP Membership query during handoff. GMA mechanism will minimize the delay for group registration process and the resource usage due to delay of withdrawal process. And also use of buffering & forwarding technique minimized packet loss during generation of multicast tree. IntServ/RSVP was used to provide End-to-End QoS in local domain and DiffServ was used in global domain. To minimize reestablishment of RSVP session delay, extended HXcast++ control messages ware designed to require PATH message. HXcast++ proposed in this thesis is defined as multicast technique to provide end-to-end QoS and also to satisfy various user requirements in mobile network environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.878-894
• /
• 2013

Secure multimedia multicast applications involve group communications where group membership requires secured dynamic key generation and updating operations. Such operations usually consume high computation time and therefore designing a key distribution protocol with reduced computation time is necessary for multicast applications. In this paper, we propose a new key distribution protocol that focuses on two aspects. The first one aims at the reduction of computation complexity by performing lesser numbers of multiplication operations using a ternary-tree approach during key updating. Moreover, it aims to optimize the number of multiplication operations by using the existing Karatsuba divide and conquer approach for fast multiplication. The second aspect aims at reducing the amount of information communicated to the group members during the update operations in the key content. The proposed algorithm has been evaluated based on computation and communication complexity and a comparative performance analysis of various key distribution protocols is provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication time significantly.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1145-1157
• /
• 1999

본 논문에서는 RFC 2022에서 제안한 MARS 모델을 기반으로 하여 단일 대규모 클러스터를 가지는 ATM 망에서 다중의 멀티캐스팅 서버(MCS)를 이용한 멀티캐스팅 방안을 제안하고 그 성능을 평가하였다. 클러스터 내의 한 ATM 호스트가 특정 IP 멀티캐스트 그룹에 가입할 경우 ATM 호스트의 위치와 이미 존재하는 멀티캐스팅 서버들 사이의 전송 지연을 고려하여 가능한 한 종단간 전송 지연을 최소화하는 멀티캐스팅 서버를 선택하는 방안을 기술하였다. 이 방안은 최단거리 경로 알고리즘(shortest path algorithm)에 기반하여 최적의 MCS를 선정하고 송수신자 사이의 최소 지연을 가지는 멀티캐스트 트리를 구성한다. 다양한 망 위상에서 MCS의 분포 패턴을 다르게 할 경우에도 이 방안은 멀티캐스트 트리의 평균 전달 지연을 줄이는 것을 시뮬레이션을 통하여 확인하였다.Abstract In this paper, we proposed a scheme to support multiple MCSs over a single and large cluster in ATM networks, evaluated its performance by simulation. When an ATM host requests joining into a specific multicast group, the MARS designate a proper MCS among the multiple MCSs for the group member to minimize the average path delay between the sender and the group members. This scheme constructs a multicast tree through 2-phase partial multicast tree construction based upon the shortest path algorithm.We reduced the average path delay in multicast tree using our scheme under various cluster topologies and MCS distribution scenarios.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2626-2634
• /
• 1997

The purpose of multicasting is to reduce the network costs for transmitting the same traffic to multiple destinations. In this paper, an efficient delay-bounded multicasting routing algorithm is proposed, which satistifies the network conditions of cost minimization and can adjust the dynamic events, such as 'leave and/or join ones' from the multicast group. Also, our algorithm is designed for various network requirements such as the efficiet dynamic group support, high-quality data distribution, and adaptability to variable situation. After the delay tolerance and the maximum group size are determined according to network state and requirements for delay and cost, the dynamic delay-bounded multicast tree is constructed using partial multicast routing. We evaluate the performance of the proposed algorithm by running simulations on randomly generated test networks using a Sun Sparc 20 workstation. We were able to obtain good simulation resutls, which means solutions that lies between the minimum cost solution and the minimum delay one.

• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.419-428
• /
• 2004

Due to the deployment problem of the IP Multicast service, the Application Layer Multicast (or Overlay Multicast) has appeared as an alter-native of the If Multicast. However, even though plenty of the Application Layer Multicast (ALM) Protocols were designed and their applications were developed according to the diverse requirements of each multicast service, researches on the ALM Protocols are focused on only a protocol design or an efficient multicast group management algorithm. And there is little effort to provide a unified guideline for development of the ALM Protocols and provide an environment for running multiple protocols simultaneously in a system. In this paper, we propose socket APIs to be a reference in developing new ALM Protocols which enables a system to support multiple protocols in a system with other ALM Protocols and which gives an environment to support efficient protocol management.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.88-97
• /
• 2000

Applied with multicast transmission techniques in mobile computing environments, a mobile host will experience join and graft delay, happened when a host wants to join a multicast group in the fixed network, if there are no same multicast group member in the new cell the mobile host enters. Due to low bandwidth and higher error rate, there happens many additional traffic. In this paper, we propose a pre-join technique which new mobile support station joins the multicast group in advance based on signal strength hint in the current cell. We use the multiple level acknowledgement strategy that executes acknowledgment separately between the fixed part and the wireless transmission path. Using our strategy, it is an efficient technique in case there are more cells that has no multicast group members and less mobile host movements.