• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.6
• /
• pp.265-278
• /
• 2013

With the recent advancements in various wireless communication technologies, the importance of mobile multicasting is coming to the fore, in an effort to use network resources more efficiently. In the past, when various mobile IP-based multicast techniques were proposed, the focus was put on the costs needed for network delivery for providing multicast services, as well as on minimizing the multicast handover delay. For techniques using MIPv6 (Mobile IPv6), a host-based mobility management protocol, however, it is fundamentally difficult to resolve the problems of handover delay and tunnel convergence. To resolve these problems, a network-based mobility management protocol called PMIPv6 (Proxy Mobile IPv6) was standardized. Although performance is improved in PMIPv6 over MIPv6, it still suffers from the problems of handover delay and tunnel convergence. In this paper, to overcome these limitations, a technique called LFH (Low-cost and Fast Handoff) is proposed for fast and low-cost mobility management with multicasting support in PMIPv6 networks. To reduce the interactions between the complex multicast routing protocol and the multicast messages, a simplified proxy method called MLD (Multicast Listener Discovery) is implemented and modified. Furthermore, a TCR (Tunnel Combination and Reconstruction) algorithm was used in the multicast handover procedure within the LMA (Local Mobility Anchor) domain, as well as in the multicast handover procedure between domains, in order to overcome the problem of tunnel convergence. As a result, it was found that LFH has reduced multicast delay compared to other types of multicast techniques, and that it requires lower costs as well.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.3
• /
• pp.93-103
• /
• 2000

This paper describes Internet multicast routing protocols over MPLS (Multiprotocol Label Switching) networks. Internet multicast routing protocols are divided into 3 categories in terms of tree types and tree characteristics: a shortest path tree, a shared tree and hybrid tree types. MPLS should support various multicast mechanisms because of extremely different IP multicast architectures, such as uni-/bi-directional link, Flooding/prune tree maintenance mechanism, the existence of different tree types with the same group, etc. There are so many problems over MPLS multicast that the solutions can't be easily figured out. In this paper, we make a few assumptions on which the solutions of IP multicast routing protocols over MPLS networks are given. A broadcasting label is defined for the shortest path tree types. Cell interleaving problems of the shared tree types is solved by using block-based transmission mechanism. Finally, the existing hybrid-type multicast routing protocol is reasonably modified to support MPLS multicast.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.77-86
• /
• 2003

This paper describes the new method for Internet multicast routing protocols using MPLS (Multiprotocol Label Switching) networks. Internet multicast routing protocols are divided into three categories in terms if tree types and tree characteristics : a shortest path tree a shared tree and hybrid tree types. MPLS should support various multicast mechanisms because of extremely different IP multicast architectures, such as uni-/bi-directional link, Flooding/prune tree maintenance mechanism. the existence of different tree types with the same group, etc. There are so many problems over MPLS multicast that the solutions can't be easily figured out. In this Paper, we make a few assumptions on which the solutions of IP multicast routing protocols over MPLS networks are given. A broadcasting label is defined for the shortest path tree types. Cell interleaving problems of the shared tree types is solved by using block-based transmission mechanism. Finally, the existing hybrid-type multicast routing protocol is reasonably modified Shortest Path tree type to support MPLS multicast. It has been shown that these modifications give better performance (transmission delay) than the orignal method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1214-1221
• /
• 2007

Ad-hoc network is soft wireless communication network that is consisted of mobile node and clusters without helping of infrastructure. We propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. Proposed structure is consisted of context awareness parameters as like distance between each nodes. The proposed architecture performs two types of routing discovery. One is Flooding Discovery Routing(FDR) for comparing analysis step and Local Discovery Routing(LDR) to compose path of node forecast(preservation) step from node's state value. The inference network structure of proposed RODMRP(Resilient Ontology-based Dynamic Multicast Routing Protocol) adopts a tree structure to enhance an efficient packet in various environment between mobile node. We will have developed an algorithm that will desist multi-hierarchy Layered networks to simulate a desired system.

• The Journal of Korean Association of Computer Education
• /
• v.13 no.5
• /
• pp.81-90
• /
• 2010

Cloud computing is an Internet-based computing paradigm that provides services in a virtualized form composed of plenty of resources sharable. In Cloud computing environments, gossip protocols are engaged as a method to rapidly disseminate the state information for innumerable resources. Although gossip protocols provide a robust and scalable multicast, there is a drawback that requires redundant messages in satisfying 100% of reachability. In our study, we propose a Group-based Gossip Multicast Protocol in order to reduce the message overhead while delivering the state information efficiently. Furthermore, we verified the performance of the proposed protocol through experiments.

• 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 the Korea Contents Association
• /
• v.6 no.11
• /
• pp.295-301
• /
• 2006

The scope ID field of IPv6 multicast address indicates the zone of the destination for which a multicast traffic is intended. Without any further examination on the header field, the scope ID enables a router to determine whether the traffic will be forwarded to a subnet or not. For the graceful migration from IPv4 networks to IPv6 networks, various IPv6 applications working through IPv4 networks are indispensable during the migration period. This paper describes development of an interactive remote lecture system providing service integration on voice, image, and data of teaching materials. Access right to the network for dialog among multicast group members is controlled via additional TCP (Transmission Control Protocol) session. A jitter buffer algorithm was implemented to improve the voice communication jitters.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.37-45
• /
• 2004

In this paper we propose Clustered Group Multicast by Clustering Algorithm in Wireless Mobile Ad-hoc Network. The proposed scheme applies to Weighted Cluster Algorithm Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base station. In ad hoc network muting protocol because of limited bandwidth and high mobility robust, simple and energy consume minimal. WCGM method uses a base structure founded on combination weighted value and applies combination weight value to cluster header keeping data transmission by seeped flooding, which is the advantage of the exiting FGMP method. Because this method has safe and reliable data transmission, it shows the effect to decrease both overhead to preserve transmission structure and overhead for data transmission.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.605-609
• /
• 2002

Reliable multicast data transmission in a 1:N environment needs more sophisticated error control mechanism than that of in 1:1 environment due to ACK implosion and duplicated retransmission. Although there have been many related research on error control in reliable multicast, real implemented protocols are rare. As one of the reliable multicast transport protocols, ECTP is selected as an international standard reliable multicast protocol by ITU-T and ISO and implemented on RedHat 7.2 machine by us. In this paper, we evaluate the performance of the error control mechanism in the respect of throughput and generated control packet numbers with a real implementation code. From the results, it is concluded that the suitable values of error control parameters can be obtained from the local group size and network environments.

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

This paper proposes an IP(Internet Protocol) multicast routing method by multiple tree routes. Multiple trees, instead of a single tree, improve the quality of multicast services with nonlinear link cost and huge traffic demand. The proposed method adds tree routes until it satisfies target conditions, and it splits the multicast traffic demand into the chosen tree routes. We develop a mathematical model and optimal conditions for traffic splitting. The method works on the problems with many different simultaneous multicast traffic. Various experiments were carried and the results show that the new multicasting is fairly effective on end-to-end quality of services.