• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1184-1192
• /
• 2000

Multicast has communication mechanism that is able to transfer voice, video for only the specific user group. As compared to unicast, multicast is more susceptive to attack such as masquerading, malicious replay, denial of service, repudiation and traffic observation, because of the multicast has much more communication links than unicast communication. Multicast-specific security threats can affect not only a group's receivers, but a potentially large proportion of the internet. In this paper, we proposed the multicast security model that is able to secure multi-group communication in CBT(Core Based Tree), which is multicast routing. And designed the multicast key distribution protocol that can offer authentication, user privacy using core (be does as Authentication Server) in the proposed model.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.120-127
• /
• 2002

The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols and construct multicast routing graphs for a single multicast group. However. there have been few researches about the relation between multiple and concurrent multicast groups. In this paper, the multiple multicast tree allocation algorithm to avoid congestion is proposed. The multicast group with different bandwidth requirement is also considered. A two-phase algorithm is proposed. The first phase is for basic search and the second phase for further improvement. The performance of the proposed algorithm is experimented with computational results. Computational results show that the proposed algorithm outperforms an existing algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1330-1336
• /
• 2014

QoS techniques and transmitted in real-time communication with the advancement of technology a variety of applications and services are available these days, mobile devices bogeuphwa LTE technology to the development of multimedia services with high quality can be realized. In order to satisfy this condition simply with a router with an increased bandwidth expansion by considering the increase in the routing table of the network scalability problems included. Burst traffic data to be distributed according to the environment is to be centered. To do this, the destination -based routing method to transmit the current paper -based (Source routing) routing settings are required. In this paper, published by the IETF, IP switching system based on standardized protocol Label Switching Multi-Protocol Label Switching (MPLS) network by using the existing Best Effect is difficult to guarantee QoS for multimedia transmission in MPLS network environment using optimized QoS guarantees to transmit the multicast.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3138-3150
• /
• 2021

Multimedia services on the Internet are continuously increasing. Accordingly, the demand for a technology for efficiently delivering multimedia traffic is also constantly increasing. The multicast technique, that delivers the same content to several destinations, is constantly being developed. This technique delivers a content from a source to all destinations through the multicast tree. The multicast tree with low cost increases the utilization of network resources. However, the finding of the optimal multicast tree that has the minimum link costs is very difficult and its calculation complexity is the same as the complexity of the Steiner tree calculation which is NP-complete. Therefore, we need an effective way to obtain a multicast tree with low cost and less calculation time on SDN-based smart network platforms. In this paper, we propose a new multicast tree generation algorithm which produces a multicast tree using an agent trained by model-based meta reinforcement learning. Experiments verified that the proposed algorithm generated multicast trees in less time compared with existing approximation algorithms. It produced multicast trees with low cost in a dynamic network environment compared with the previous DQN-based algorithm.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.383-389
• /
• 2003

In this paper, we propose a solution, called M_DQDMR, for generating delay-constrained boundwidth-appropriated multicast routing trees to reduce the delay and conserved boundwidth resources of nodes in mobile computing environment. At the current router installation, we according the routing table and the information of link which neighboring rude to guarantee QoS(Quality of Service). When we construct multicast tree, M_DQDMR algorithm dynamically adjusts its appropriate tree construction policy based on how far the destination node from the delay bound and boundwidth our QoS requirement. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that M_DQDMR can simply and dynamically adjusts the construction of multicast tree in hight-speed and conserve boundwidth resources.

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

최근 들어 멀티미디어를 지원하는 응용들의 서비스 품질 보장과 멀티캐스트 지원에 대한 요구가 증가되고 있으나 기존의 멀티캐스트 프로토콜로는 이러한 요구를 수용할 수 없는 문제가 발생하고 있다. 현재 인터넷에서 사용되고 있는 라우팅 메커니즘은 네트워크 자원 정보나 세션의 QoS 요구사항을 고려하지 않고 단순히 종단간의 연결에만 초점을 맞추고 있기 때문이다. 따라서 본 논문에서는 멀티캐스트 환경에서 서비스 품질보장을 지원하기 위한 새로운 프로토콜, LayeredQoS을 제안한다. 다중의 CP (Central Point)를 채택하고 각각의 CP에 적절한 QoS 레벨을 부여하여 사용함으로써 대역폭의 공유정도를 높일 뿐만 아니라 전체 트리 비용을 감소시켜 궁극적으로 네트워크 처리량이 증가되도록 하였다. 또한 시뮬레이션 방법을 통하여 다른 프로토콜보다 나은 성능을 가지는 것으로 평가하였다.Abstract Many emerging multimedia applications often require a guaranteed quality of service and multicast connection. But the traditional multicast protocol can't meet the needs since the routing mechanisms deployed in today's Internet are focused on connectivity, not on resource availability in the network or QoS requirements of flows. In this paper, we present LayeredQoS, a new QoS-based multicast routing algorithm. We adopt the multiple CPs(Central Points) and allocate QoS-levels for each CP in order to improve the degree of resource sharing and decrease the total tree cost, and then network throughput is increased. The proposed protocol is verified by simulations and it is shown that the performance of LayeredQoS is much better than the existing protocols.

• The Journal of the Korea Contents Association
• /
• v.2 no.3
• /
• pp.119-126
• /
• 2002

The QoS(Quality of Service) guarantee mechanism is one of critical issues in the wireless network. Real-time applications like VoIP(Voice over IP) in All-IP networks need smooth handoffs in order to minimize or eliminate packet loss as a Mobile Host(MH) transitions between network links. In this paper, we design a new multicasting algorithm using DB(Dynamic Buffering) mechanism for Mobile-IPv6. A key feature of the new protocol is the concepts of the DB and MRA(Multicast Routing Agent) to reduce delivery path length of the multicast datagram. Particularly, the number of tunneling and average routing length of datagram are reduced relatively, the multicast traffic load is also decreased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1100-1105
• /
• 2003

In this paper, we propose a solution, called DQDMR, for generating delay-constrained bandwidth- appropriated multicast routing trees to reduce end-to-end delay and conserved bandwidth resources. At the current router system the router keep the information of link which neighboring node in the routing table to guarantee QoS(Quality of Service). When we construct multicast tree, DQDMR algorithm dynamically adjusts the path in the least delay and appropriate bandwidth. Through simulations comparing to another multicast algorithms, we reach a conclusion that DQDMR algorithm can simply and dynamically adjusts the construction of multicast tree in hight-speed and conserve bandwidth resources.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.578-585
• /
• 2001

IP Multicast that provides best-efforts service does not guarantee reliable delivery of multicast packets. In recent years, there are many approaches to support reliable multicast, but those are insufficient for implementing scalable and reliable multicast over Internet. We propose a Reliable Multicast Architecture(RMA) for scalable and reliable multicast. The RMA model guarantees reliability using a receiver initiated retransmission mechanism, and scalability using a feedback suppression mechanism by Multicast Router(MR). Furthermore, it utilizes underlying multicast routing information to minimize the cost of protocol modification and overheads. Our performance analyses show that RMA is much superior to previous works in the point of scalability and compatibility.

• Journal of Computing Science and Engineering
• /
• v.5 no.4
• /
• pp.316-323
• /
• 2011

Recently, Proxy Mobile IPv6 (PMIPv6) has received much attention as a mobility management protocol in next-generation all-IP mobile networks. While the current research related to PMIPv6 mainly focuses on providing efficient handovers for unicast-based applications, there has been relatively little interest in supporting multicast services with PMIPv6. To provide support for multicast services with PMIPv6, there are two alternative approaches called Mobile Access Gateway (MAG)-based subscription and Local Mobility Anchor (LMA)-based subscription. However, MAG-based subscription causes a large overhead for multicast joining and LMA-based subscription provides non-optimal multicast routing paths. The two approaches may also cause a high packet loss rate. In this paper, we propose an efficient PMIPv6-based multicast protocol that aims to provide an optimal delivery path for multicast data and to reduce handover delay and packet loss rate. Through simulation studies, we found that the proposed protocol outperforms existing multicast solutions for PMIPv6 in terms of end-to-end delay, service disruption period, and the number of lost packets during handovers.