• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.558-561
• /
• 2004

Currently, most IP multicasting applications are implemented based on Any-Source Multicast (ASM) model that supports many to many multicast services. However, it is known that current ASM-based multicast architecture has several deployment problems such as address allocation, lack of access control, and inefficient handling of well-known multicast sources. Source-Specific Multicast (SSM) working group in IETF proposed SSM architecture to overcome the weaknesses of ASM architecture. The architecture of SSM is based on one to many multicast services. Also, in order to provide SSM service, Multicast Listener Discovery Version 2 (MLDv2) protocol should be supported. In this paper, we introduce the architecture of SSM protocol and multicast group management protocol. After that, we present the architecture and implementation of IPv6 SSM and MLDv2 protocols in Linux systems.

• Electronics and Telecommunications Trends
• /
• v.16 no.2 s.68
• /
• pp.1-9
• /
• 2001

인터넷 멀티캐스트 기술은 IETF의 중점 표준화 분야중의 하나로써, 많은 연구에도 불구하고 아직까지 널리 보급되지 못하고 있다. 이는 멀티캐스트 기술에 대한 기술적 복잡성 및 관련 서비스의 수익모델 부재에서 그 원인을 찾아볼 수 있다. 한편, 최근 국내.외적으로 선풍적인 인기를 끌고 있는 인터넷 방송 서비스의 경우, 멀티캐스트 Killer 응용서비스로써 간주할 만하며, 멀티캐스트 전송에 대한 요구사항은 성숙 단계에 있다고 볼 수 있다. 본 고에서는 Simple Multicast, Source Specific Multicast 및 Overlay Multicast 등 최근에 제안되고 있는 기술 동향에 대하여 살펴보고자 한다.

• IE interfaces
• /
• v.11 no.1
• /
• pp.155-163
• /
• 1998

In multiparty multimedia communication, each participant not only receives information from other participants but also generates real-time data streams to distribute to others and therefore the difference between source and destination is not clear in terms of data transmission. During a teleconference session, many sub-multicast trees may be generated to exchange information to specific members within the multicast group and if those sub-multicast trees use the same fixed multicast tree, the blocking probability will be high and it is hard to provide QoS for each sub-multicast group. Also, even though there exits some shortcuts between each sub-multicast group, fixed multicast tree does not allow to use those shortcuts. Thus to overcome these problems. We propose a network resource reservation protocol and show that its effectiveness in terms of blocking probability and network resources usage.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.370-372
• /
• 2001

인터넷에서 멀티캐스팅을 지원하기 위해 제안된 기존의 Any Source Multicast(ASM)는 실제 망에의 적용시 멀티 캐스팅 세션 관리 문제, 주소 할당 문제 등과 같은 구현상의 문제를 가지고 있다. 이러한 문제를 해결하기 위한 새로운 관점의 다양한 메커니즘들이 제안되고 있다. 현재 제안되고 있는 메커니즘은 크게 Source Specific Multicast(SSM). Small Group Multicast(SGM)이 있다. 하지만, SGM은 많은 수의 사용자들에게 지원이 어렵고 새로운 헤더가 추가되어야 하는 부담이 있으며, SSM은 <송신자 주소, 그룹 주소>의 쌍으로 멀티캐스트 세션을 식별하게 하여 기존 ASM의 주소 할당 문제를 해결하였으나 경로 상의 모든 라우터에서 <송신자 주소, 그룹 주소> 별로 멀티캐스트 세션 정보를 유지해야 하는 측면에서 확장성의 문제점이 있다. 본 논문은 멀티캐스트 지원을 위하여 인터넷의 계층적인 구조를 이용하여 SSM을 확장한 멀티캐스트 지원 방안을 제안한다. 제안된 메커니즘은 확장성 문제를 해결하기 위하여 송신자로부터 칵 도해인의 경계 라우터까지 터널링 메커니즘을 도입하고 도메인 내에서는 다양한 멀티캐스트 제공 메커니즘을 지원한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.27-38
• /
• 2005

IP Multicast has not been deployed because of hardware problems. So a new scheme that is called Overlay Multicast for group communication has been emerged. It supports IP Multicast functions, which is located on application level. For developing it, we have been focused on efficient overlay tree construction among group members with low stretch and stress. However, we should consider a variety of transmission or receipt condition since a real internet environment has users with various transmission/receipt rates. Thus, we make one-time source specific tree depending on required bandwidth informationof group members when a member requests data transmission. Our mechanism provides satisfied data quality limited maximum transmission rate of the source to each group members. Furthermore, we manage a large group enough as distributing control information to cores that are designated membersfor maintaining host member information. Lastly, we prove that our tree guarantees data quality to each group members, and show low tree consruction time is required. In addition, for evaluating group scalability, we analyze control information increasing rate via group size, and validate its scalability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5191-5211
• /
• 2016

It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation networks. The present study proposes a QoS-driven multicast scheme for wireless networks in which the transmission rate and end-to-end delay are assumed to be bounded during a multiple multicast session. A distributed algorithm was used to identify a cost-efficient sub-graph between the source and destination which can satisfy QoS constraints of a multicast session. The model was then modified as to be applied for wireless networks in which satisfying interference constraints is the main challenge. A discrete power control scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. We also proposed random power allocation (RPA) and gradient power allocation (GPA) algorithms to efficient resource distribution each of which has different time complexity and optimality levels. Experimental results confirm that the proposed power allocation techniques decrease the number of unavailable links between intermediate nodes in the sub-graph and considerably increase the chance of finding an optimal solution.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.453-456
• /
• 2007

본 논문에서는 IPTV의 라이브 TV 서비스를 지원하기 위해서 반드시 필요한 IP 멀티캐스팅 방식과 이를 위한 주소 확보 방안에 대해 정리한다. 원래의 IP 멀티캐스트 방식은 RFC 1112에서 정의된 호스트 기능 확장으로 지원하는 것인데, RFC 3569에서 주소나 보안 문제를 해결하기 위한 SSM 방식이 제안된 바 있다. 따라서 기존의 멀티캐스트 주소 확보는 한시적인 해결 방안으로 모색될 수 있으며 궁극적으로는 SSM 방식의 멀티캐스트 도입이 타당하다고 판단된다.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.424-436
• /
• 2003

In this paper, we propose the Centroid-based Backbone Core Tree(CBCT) generation algorithm for the shared tree-based IP multicasting. The proposed algorithm is based on the Core Based Tree(CBT) protocol. Despite the advantages over the source-based trees in terms of scalability, the CBT protocol still has the following limitations; first, the optimal core router selection is very difficult, and second, the multicast traffic is concentrated near a core router. The Backbone Core Tree(BCT) protocol, as an extension of the CBT protocol has been proposed to overcome these limitations of the CBT Instead of selecting a specific core router for each multicast group, the BCT protocol forms a backbone network of candidate core routers which cooperate with one another to make multicast trees. However, the BCT protocol has not mentioned the way of selecting candidate core routers and how to connect them. The proposed CBCT generation algorithm employs the concepts of the minimum spanning tree and the centroid. For the performance evaluation of the proposed algorithm, we showed the performance comparison results for both of the CBT and CBCT protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1050-1061
• /
• 2009

The Tactical Internet(TI) managed by Infantry Brigades is used for the purpose of sharing information of Command Control and Situation Awareness. When there are more than two destinations to transmit data in the TI system, a multicasting is utilized based on pre-defined multicast groups. However even in the case when a source node needs to send some messages like weathercast and attack alarm etc to only a part of Battalion or Brigades in a specific geographical region (destination region), the current TI multicasting protocol is designed to transmit the messages to the pre-defined group or all of the Battalion/Brigade nodes, resulting in inefficiency in terms of end-to-end delay and overhead. In this paper, we propose more efficient protocol for such cases, named as "Tactical Internet Geocasting (TIG)". The proposed scheme firstly checks whether the destination region belongs to one Battalion region or more than two Battalion regions using location information, and then performs a greedy forwarding from the source node to the destination region, followed by a local flooding inside of the destination region. With performance analysis and simulations using NS-2, TIG is compared to the current TI multicasting protocol (i.e., Simplified MDP) and the LBM (Location-based Multicast). The simulation results show that the proposed TIG is more efficient than both in terms of delay and network overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5C
• /
• pp.493-505
• /
• 2003

A new inter-client synchronization framework for multicast media streaming is proposed employing a server-client coordinated adaptive playout control. The proposed adaptive player controls the playback speed of audio and video by adopting the time-scale modification of audio. Based on the overall synchronization status as well as the buffer occupancy level, the playout speed of each client is manipulated within a perceptually tolerable range. Additionally, the server implicitly helps increasing the time available for retransmission while the clients perform an interactive error recovery mechanism with the assistance of playout control. The network-simulator based simulations show that the proposed framework can reduce the playout discontinuity without degrading the media quality, and thus mitigate the client heterogeneity.