• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1561-1564
• /
• 2005

본 논문에서는 IEEE 802.16 광대역 무선 통신 환경에서 멀티캐스트 서비스를 지원하기 위한 MzMP(MBS zone Management Protocol)를 제안한다. MzMP는 멀티캐스트 그룹을 멀티캐스트 서비스를 구분하는 논리적인 영역인 MBS 존(Multicast Broadcast Service Zone)으로 구분하며 MBS 존의 확장과 축소의 개념으로 그룹 관리를 수행한다. MzMP는 기존의 멀티캐스트 방식과 달리 그룹의 멤버를 말단 노드가 아닌 BS(Base Station)로 본다. 이것은 말단의 이동노드가 기본 셀 영역을 벗어나 다른 셀 영역으로 이동하더라도 그룹의 관리가 말단 이동 노드가 아닌 BS를 기준으로 이루어지기 때문에 멀티캐스트 그룹의 가입과 탈퇴를 위한 메시지의 부하 없이 멀티캐스트 서비스를 제공 할 수 있다.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.402-408
• /
• 2008

This paper considers the problem of minimizing network-wide broadcast latency in multi-rate wireless mesh networks where a node can dynamically adjust its link layer transmission rates to its neighbors. We propose a broadcast algorithm that complements existing broadcast construct algorithm which chooses a multicast node randomly when each candidate node has same metric. We consider the currently accumulated broadcast latency from source node to the each candidate node so far to choose the next broadcast node. The proposed broadcast algorithm for minimizing latency in a multi-rate mesh networks which exploit wireless advantage and the multi-rate nature of the network. Simulation based on current 802.11 parameters shows that proposed MinLink_WCDS algorithm improves overall latency than the previous existing broadcast algorithm.

• ETRI Journal
• /
• v.35 no.6
• /
• pp.1068-1074
• /
• 2013

This paper proposes an additional forward error correction (FEC) layer to compensate for the defectiveness inherent in the conventional FEC layer in the Long Term Evolution specifications. The proposed additional layer is called a graceful degradation (GD)-FEC layer and maintains desirable service quality even under burst data loss conditions of a few seconds. This paper also proposes a non-delayed decoding (NDD)-GD-FEC layer that is inherent in the decoding process. Computer simulations and device-based tests show a better loss recovery performance with a negligible increase in CPU utilization and occupied memory size.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.102-104
• /
• 2011

최근 비디오 스트리밍과 대화형 비디오 서비스 등과 같은 광대역 멀티미디어 서비스를 지원하기 위하여 Wimax와 같은 4G 무선네트워크 시스템 기술이 발전해 왔다. 4G 무선네트워크의 OFDM(Orthogonal Frequency Division Multiplexing)과 MIMO(multi Input Multi Output)은 사용자들에게 매우 유연한 QoS(Quality of Service) 서비스를 제공해 줄 수 있다.[1] 이 논문에서는 다양한 네트워크 상황에서 멀티캐스트 그룹에게 효율적인 방법으로 통신 자원을 할당하기 위해 OFDM 방법을 사용 하였다. 이에 본 논문에서는 한 셀(cell) 내의 서로 다른 멀티캐스트의 그룹의 다른 SNR(Signal to noise Ratio)의 사용자 분포에 따른 적응적인 scalable 비디오 멀티캐스트 방식을 제안한다. 더 나은 수신율을 가진 사용자는 최적의 MCS(Modulation and Coding Scheme) 할당을 통해 서로 다른 화질의 scalable 비디오 계층 중 높은 해상도의 비디오를 받을 수 있다. 논문에서는 전체 전송률을 최적화 하는 대신 전송받은 전체 비디오의 평균 화질을 최적화하는 방법을 제안한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.11a
• /
• pp.220-221
• /
• 2011

방송 및 통신망에서 방송 및 멀티캐스트 데이터를 효율적으로 전송하기 위해 적응변조 방식을 통해 그룹 내의 사용자 개개인의 요구 성능(QoS)을 보장해주는 기술이 고려되고 있으며, 이를 위해서는 피드백 부담을 낮출 수 있는 기술 개발이 필수적이다. 본 논문에서는 멀티캐스트 그룹 내 모든 사용자가 공유하는 1bit 피드백 채널을 사용하여 그룹 내 사용자수에 관계없이 2개 또는 3개의 1bit 피드백채널만을 사용하여 적응변조(Adaptive Modulation and Coding)동작을 하는 방법을 제안하였다. 또한 제안한 방법에 대한 시스템 레벨 모의실험을 수행하여, 사용자별로 피드백 채널을 사용하는 경우와 제안된 방식을 사용하는 경우의 전송 효율을 비교분석 하여 제안된 방식의 실용성을 보였다.

• Journal of Information Processing Systems
• /
• v.6 no.4
• /
• pp.575-596
• /
• 2010

Video-on-Demand services are increasing rapidly nowadays. The load on servers can be very high, even exceeding their capacity. For popular contents, we can use a Periodic Broadcast (PB) strategy using multicast to serve all clients. Recent development of PB uses multiple channels broadcasting for segments of movies in certain patterns, so that users only need to wait for a small segment to start the service. However, users need higher download capacity to download multiple segments at a time. In order to compensate for this, a proxy server can help to reduce download bandwidth requirements by holding some segments for a certain time. This research will focus on more recent PB schemes that couldn't be covered by previous Proxy-Assisted Periodic Broadcast strategies.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.625-634
• /
• 2003

More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1141-1153
• /
• 2010

This paper introduces ONLIS(Overlay Multicast Network for Live IPTV Service), a novel overlay multicast network optimized to deliver live broadcast IPTV stream. We analyzed IPTV reference model of ITU-T IPTV standardization group in terms of network and stream delivery from the source networks to the customer networks. Based on the analysis, we divide IPTV reference model into 3 networks; source network, core network and access network, ION(Infrastructure-based Overlay Multicast Network) is employed for the source and core networks and PON(P2P-based Overlay Multicast Network) is applied to the access networks. ION provides an efficient, reliable and stable stream distribution with very negligible delay while PON provides bandwidth efficient and cost effective streaming with a little tolerable delay. The most important challenge in live P2P streaming is to reduce end-to-end delay without sacrificing stream quality. Actually, there is always a trade-off between delay & stream quality in conventional live P2P streaming system. To solve this problem, we propose two approaches. Firstly, we propose DSPT(Distributed Streaming P2P Tree) which takes advantage of combinational overlay multicasting. In DSPT, a peer doesn't fully rely on SP(Supplying Peer) to get the live stream, but it cooperates with its local ANR(Access Network Relay) to reduce delay and improve stream quality. When RP detects bandwidth drop in SP, it immediately switches the connection from SP to ANR and continues to receive stream without any packet loss. DSPT uses distributed P2P streaming technique to let the peer share the stream to the extent of its available bandwidth. This means, if RP can't receive the whole stream from SP due to lack of SP's uploading bandwidth, then it receives only partial stream from SP and the rest from the ANR. The proposed distributed P2P streaming improves P2P networking efficiency.

• Journal of Internet Computing and Services
• /
• v.8 no.2
• /
• pp.77-87
• /
• 2007

A typical VOD service allows that a number of remote clients playback a desired video from a large collection of videos stored in one or more video servers. The main bottleneck for a VOD service is the network bandwidth connecting to the VOD server to the client due to the high bandwidth requirements. Many previous researches have shown that VOD server can be greatly improved through the use of multicast, broadcast, or P2P scheme. Broadcast is one of the most efficient techniques because it can transmit a stream to many users without additional network bandwidth. But the broadcast has long latency time. In order to overcome the drawback, in this paper, we propose P2Prefix broadcast scheme that can solve the service latency time, which is the problem of broadcast scheme, by using P2P caching as well as minimizing the client buffer requirement.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2008.11a
• /
• pp.189-192
• /
• 2008

Modern broadcasting/multicasting networks has the heterogeneous nature in terms of terminals and available bandwidth. Such heterogeneity could be coped by scalable video coding (SVC) standard developed recently. More specifically, spatial layers of an SVC bitstream can be consumed by different terminals and SNR (and temporal) scalability can be used to cope with bandwidth heterogeneity. In this work, we tackle the problem of SVC adaptation for different user groups receiving the same broadcast/multicast video, so as to provide a flexible tradeoff between the groups while also maximizing the overall quality of the users. The adaptation process to truncate an SVC bitstream is first formulated as an optimization problem. Then the problem is represented by MPEG-21 DIA description tools, which can be solved by a universal processing. The results show that MPEG-21 DIA is useful to enable automatic and interoperable adaptation in our scenario.