• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.2
• /
• pp.153-172
• /
• 2002

In this paper, we propose an architecture and a protocol fur Secure Mobile Multicast(SMM) offering efficient and secure multicast services to many mobile nodes. In this framework, we use Indirect and Direct Service Mode adaptively, according to the movement of mobile nodes around the overlapped service area, to provide reliably secure multicast with low latency, minimum key update, and minimum data loss.

• Journal of KIISE:Information Networking
• /
• v.27 no.3
• /
• pp.348-359
• /
• 2000

Most of the important real time multimedia applications require multipoint transmissions. To support these applications in ATM based Intermet environments, it is important to provide efficient IP multicast transportations over ATM networks. IETF proposed MARS(Multicast Address Resolution Server) as the service architecture to transport connectionless IP multicast flows over connection oriented ATM VCs. MARS assumes UNI3.0/3.1 signalling. Since UNI3.0/3.1 does not provide any means for receivers to request a join for a multicast ATM VC, MARS provides overlay service to relay join request from IP multicast group members to the sources of the multicast group. Later on, ATM Forum standardized UNI4.0 signalling which is provisioned with a new signalling mechanism called LIJ(Leaf Initiated Join). LIJ enables receivers to directly signal the source of an ATM VC to join. In this paper, we propose a new service architecture providing IP multicast flow transportation over ATM networks deploying UNI4.0 signalling. The proposed architecture is named UNI4MARS. It comprises service components same as those of the MARS. The main functionality provided by the UNI4MARS is to provide source information to the receivers so that the receivers may exploit LIJ to join multicast ATM VCs dynamically. The implementation overhead of UNI4MARS and that of MARS are compared by a course of simulations. The simulation results show that the UNI4MARS supports the dynamic IP multicast group changes more efficiently with respect to processing, memory and bandwidth overhead.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.313-315
• /
• 2002

본 논문에서는 3D Cyber Museum Service에서의 효과적인 Multicast performance monitoring을 위한 receiver 기반의 분산 모델을 제안한다 멀티캐스트 네트워크를 통해 전송되는 멀티미디어 서비스의 효과적인 performance monitoring을 위해서 사용자들이 경험하는 QoS를 사용자의 호스트상에서 보다 직접적으로 측정하고, 멀티캐스트를 사용함으로써 얻어지는 대역폭의 효율적인 사용에 대한 측정을 위한 모델을 설계한다.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.412-414
• /
• 2005

Multimeda service is very big capacity and use not a little network for provide cots. Because in paper introduce new method adaptive to merit of Unicast and Multicast. Propose method service possibility that now Multicast have merit which live broadcasting and Unicast have merit which can provide individually customer manage and good quality by data statistics. And network use to efficient

• The KIPS Transactions:PartC
• /
• v.19C no.2
• /
• pp.153-166
• /
• 2012

Multicast service will be required to be an important form of communication without interruption to the delivery of multicast service in mobile networks increasing MNs. In this paper, we review current status of PMIPv6(Proxy Mobile IPv6) multicast listener support being standardized in the IETF and point out limitations of the current approach and we proposed a fast multicast handover procedure in inter domain PMIPv6 network of network-based mobility management. The proposed Fast multicast handover procedure in inter domain optimizes multicast management by using the context of the MNs. We evaluate the proposed fast multicast handover procedure compared to the based one through the developed analytical models and confirm that introduced fast multicast handover procedure provides the reduced service interruption time and total network overhead compared to the based one during handovers.

• Journal of information and communication convergence engineering
• /
• v.8 no.3
• /
• pp.295-300
• /
• 2010

Recent researches of network structure are moving to high-level networks because there are already many research results of low-level network. Especially, current network services has been changed to the multimedia service using multicast routing such as IPTV(Internet Protocol Television) service. And then previous multicast services were provider oriented. So previous multicast structures were organized server/client model. But future multicast services will make user oriented services. Therefore there will be many service providers in the future. At this point, we study P2P network for supporting multi provider. So we research load balancing and contents lookup protocols in P2P network. In this paper, we propose network protocol and system based on super peer P2P for load balancing and efficiently service search. And we considered mobile environment for mobile IPTV.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2194-2212
• /
• 2013

The multicast routing architectures have become indispensable due to the increasing needs for extreme communication services anywhere and anytime. The most recent approaches are called hierarchical and fully distributed, what have been proposed by O. Said et al. in a previous work. These proposed architectures were introduced to enhance the service-centric approach. In this paper, NS2 is used to build a simulation environment to test the hierarchical and the fully distributed multicast architectures as regards the service-centric one. The results of simulation show that the performance of the hierarchical and the fully distributed architectures outperforms the service-centric architecture. Furthermore, the fully distributed architecture is found to have the best performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.86-89
• /
• 2002

Recently, video conferencing, Web-casting service, and network sane service which use multicast-based service are popular in Internet. In order to support the broadband Internet services efficiently, more communication bandwidth are needed. The WDM single-hop broadcast network topology is coming into the spotlight in next-generation access networks area. In this paper, the new multicast scheduling algorithm, PGM, is proposed and is evaluated through the computer simulation. The PGM method shows the better performance comparing with existing multicast scheduling algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.2
• /
• pp.3-17
• /
• 2007

Receiver access control scheme is proposed to protect multicast distribution tree from DoS(Denial-of Service) attack induced by unauthorized use of IGMP(Internet group management protocol), by extending the security-related functionality of IGMP. Based on a specific network and business model adopted for commercial deployment of IP multicast applications, key management scheme is also presented for bootstrapping the proposed access control as well as accounting and billing for CP(Content Provider), NSP(Network Service Provider), and group members.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2886-2896
• /
• 1996

The Type of Service based multicast routing algorithm is necessary to support efficiently herogeneous applications in ATM network. In this paper I propose the Constrained Multicast Tree with Virtual Destination(DMTVD) heuristic algorithm as least cost multicast routing algorithm. The service is categorized into two types, as delay sensitive and non in CMTVD algorithm. For the delay sensitive service type, the cost optimized route is the Minimum Cost Stenier Tree connecting all the destination node group, virtual destination node group and source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. The other side for the non-delay sensitive service, the cost optimized route is the MCST connecting all the multicast groups with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm is based on the Constrained Multicasting Tree algorithm but regards the nodes branching multiple destination nodes as virtural destination node. The experimental results show that the total route costs is enhanced 10%-15% than the CTM algorithm.