• Proceedings of the KIEE Conference
• /
• 2001.11c
• /
• pp.130-133
• /
• 2001

VoIP(voice over internet protocol) technology is based on IP protocol. The IP protocol can be involved in two types of communication: unicasting and multicasting. Unicasting is the communication between one sender and one receiver. It is one-to-one communication. Multicasting is one-to-many communication. So that, many receivers can get same data from one sender simultaneously. and, the different protocol are proposed for VoIP; H.323, SIP and MGCP. MGCP is perfect server-client protocol, so MGCP is very attractive VoIP protocol to ISP. This paper uses MGCP and offers modified MGCP for conference call. So that, Modified MGCP is compatible to MGCP, and supports conference call using IP-multicast.

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

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.61-64
• /
• 2005

The packet loss problem that occurs in the mobile multicast (MoM) protocol due to designated multicast service provider (DMSP) handoff is investigated through simulation experiments for several DMSP selection policies. Then, two enhanced DMSP schemes are proposed to minimize the packet loss of the MoM protocol with single DMSP. The first scheme uses a backup DMSP and greatly reduces the packet loss rate at the expense of the increased network traffic. The second scheme utilizes the extended DMSP operation and shows many desirable features such as the almost-zero packet loss rate and relatively low network traffic.

• Journal of Korea Game Society
• /
• v.2 no.1
• /
• pp.30-35
• /
• 2002

The deployment of multicast communication services in the Internet is expected to lead a stable packet transfer even in heavy traffic as in On-Line Game environment. The Core Based Tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibit two major deficiencies such as traffic concentration or poor core placement problem. So, measuring the bottleneck link bandwidth along a path is important for understanding the performance of multicast. We propose not only a definition of CBT's core link state that Steady-State(SS), Normal-State(NS) and Bottleneck State(BS) according to the estimation link speed rate, but also the changeover of multicast routing scheme for traffic overload. In addition, we introduce anycast routing tree, a efficient architecture for construct shard multicast trees.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.8
• /
• pp.1083-1093
• /
• 1993

Recently, some applications require the multicast service that transmit messages to multiple destinations in computer communication network enviroment. Multicast service is to send messages to the group which consists of a number of processes. A multicast group is a collection of processes which are destinations of the transmitted messages and these processes may run on one or more hosts. Therefore, it is important to manage each member of process groups in order to provide efficient multicast services. In this paper, we design and implement group management system to support multicast services. Group Management System was designed with Process Group Management System(PGMS) and Host Group Management System(HGMS). We have implemented basic primitives of PGMS, HGMS. Also, membership tree management algorithm is designed and implemented. Membership tree provides the relation of the members of multicast groups and routing Informations.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.12
• /
• pp.109-116
• /
• 2017

Short-lived pseudonym certificates as vehicle identities could satisfy both security and privacy requirements. However, to remove revoked certificates especially in vehicle communications, pseudonym certificate revocation list (CRL) should be distributed resource-efficiently from a practical deployment point of view and in a timely manner. In this paper, we propose a novel CRL distribution scheme capable of CRL multicast to only activated vehicles registered to the CRL multicast group using the group communication system enabler, namely, the GCSE which is being standardized. The scheme is resource efficient by using CRL distribution paths instead of paging processes to find out multicast vehicle(s) within a certain region. The analyzed results show that the proposed scheme outperforms in terms of paging cost, packets transmission cost, and the processing cost at the respective entities compared to the existing four schemes in the literature.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.255-263
• /
• 2000

A multistage interconnection network is a suitable class of interconnection architecture for constructing large-scale multicomputers. Broadcast and multicast communication are fundamental in supporting collective communication operations such as reduction and barrier synchronization. In this paper, we propose a new multicast technique in wormhole-switched bidirectional multistage banyan networks for constructing large-scale multicomputers. To efficiently support broadcast and multicast with simple additional hardware without deadlock, we propose a two-phase multicast algorithm which takes only two transmissions to perform a broadcast and a multicast to an arbitrary number of desired destinations. We encode a header as a cube and adopt the most upper input link first scheme with periodic priority rotation as arbitration mechanism on contented output links. We coalesce the desired destination addresses into multiple number of cubes. And then, we evaluate the performance of the proposed algorithm by simulation. The proposed two-phase multicast algorithm makes a significant improvement in terms of latency. It is noticeable that the two-phase algorithm keeps broadcast latency as efficient as the multicast latency of fanout 2^m where m is the minimum integer satisfying $2^m{\geq} {\sqrt{N}}$ ( N is a network size).

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2936-2938
• /
• 2005

The deployment of multicast communication services in the internet is expected to lead a stable packet transfer even in heavy traffic as in network system environment. The core based tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibit two major deficiencies such as traffic concentration or poor core placement problem. so, measuring the bottleneck link bandwidth along a path is important for understanding th performance of multicast. We propose not only a definition of CBT's core link state that Steady-State, Normal-State and Bottleneck State according to the estimation link speed rate, but also the changeover of multicast routing scheme for traffic overload. In addition, we introduce anycast routing tree, a efficient architecture for construst shard multicast trees.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.7
• /
• pp.41-46
• /
• 2004

Two multicast delivery schemes are proposed to minimize the packet loss that occurs in the mobile multicast (MoM) protocol due to the handoff and relocation. The proposed schemes use a primary designated multicast service provider (DMSP) and a redundant or non-redundant backup DMSP. The simulation results verify that the proposed schemes greatly reduce the packet loss rate at the expense of the increased network traffic or the extra protocol overhead related to the operation of the non-redundant backup DMSP.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.1
• /
• pp.97-104
• /
• 2006

For successfully deploying many multicast service in the mobile environment, security infrastructures must be developed that manage the keys needed to provide access control to content. In this paper, we propose two methods for designing the key management scheme for the mobile multicast environment. The proposed schemes match the key management tree to the mobile multicast environment for localizing the delivery of he rekeying messages, reducing the communication costs, and solving the handoff problem in wireless region.