• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1B
• /
• pp.101-110
• /
• 2011

With the deployment of broadband networking technology, many clients are enabled to receive various Video on Demand (VoD) services. To support many clients, the network should be designed by considering the following factors: viewer's waiting time, buffer requirement at each client, number of channel required for video delivery, and video segmentation complexity. Among the currently available VoD service approaches, the Polyharmonic and Staircase broadcasting approaches show best performance with respect to each viewer's waiting time and buffer requirement, respectively. However, these approaches have the problem of dividing a video into too many segments, which causes very many channels to be managed and used at a time. To overcome this problem, we propose Polyharmonic-Staircase-Staggered (PSS) broadcasting approach that uses the Polyharmonic and Staircase approaches for the head part transmission and the Staggered approach for the tail part transmission. It is simple and bandwidth efficient. The numerical results demonstrate that our approach shows viewer's waiting time is comparable to that in the Harmonic approach with a slight increase in the bandwidth requirement, and saves the buffer requirement by about 60\% compared to the Harmonic broadcasting approach by simply adjusting the video partitioning coefficient factor. More importantly, our approach shows the best performance in terms of the number of segments and the number of channels managed and used simultaneously, which is a critical factor in real operation of VoD services. Lastly, we present how to configure the system adaptively according to the video partitioning coefficient.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.68-78
• /
• 2010

As the IP multicast function is very slowly deployed in Internet due to its scalability problem and inter-domain interoperability problem, interest in the P2P(Peer-to-Peer) streaming technologies for the realtime multimedia multicast applications such as IPTV is highly growing. This paper proposes a P2P streaming method for the QoS-sensitive multimedia multicast applications such as highly-interactive personal IPTV and video conferences. The proposed P2P streaming method allows an application to construct a reliable streaming tree in which a proper number of backup peers are placed according to its reliability requirement. The reliable streaming tree reduces the reconnection delay, occurred in the case of a normal and/or abnormal peer leave, so as to minimize the loss of streaming data. In the proposed P2P streaming method, the join delay of a peer called startup delay is also substantially reduced because the bandwidth and end-to-end delay information of every peer kept in a distributed way allows the target peer for a joining peer to be able to be quickly determined. Moreover, the proposed method's peer admission control mechanism based on the bandwidth and end-to-end delay enables the delay-bounded streaming services to be provided for its corresponding applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.598-612
• /
• 2004

Client requests have increased with the improvement of network resources at client side, whereas network resources at server side could not keep pace with the increased client request. Therefore, it is primary factor of the Qos that efficiently utilize network resources at server side. In this paper, we proposed a new model that peer-to-peer transfer scheme for partial multimedia stream based on CIWP which it decrease server network bandwidth by utilizing client disk resources saves additional server network resources. Especially, adapting Threshold_Based Multicast scheme guarantees to do that data transfer within clients never exceed service time of previous peer by restriction of which data size transferring from previous peer less than data size transferring from server. Peer-to-peer transfer within clients is limited in same group classified as ISPs. Our analytical result shows that proposed scheme reduces appling network resources at server side as utilizing additional client disk resource. furthermore, we perform various simulation study demonstrating the performance gain through comparing delay time and proportion of waiting requesters. As a result, when we compared to Threshold_Based Multicast scheme, the proposed scheme reduces server network bandwidth by 35%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.444-460
• /
• 2009

In this paper, we propose an expanded patching technique in order to reduce the server network bandwidth requirements to support true VoD services in VoD Systems. Double Patching, which is a typical multicast technique, ensures that a long patching stream delivers not only essential video data for the current client but also extra video data for future clients. Since the extra data may include useless data, it results in server network bandwidth wastage. In order to prevent a server from transmitting useless data, the proposed patching technique uses a new kind of stream called a linking stream. A linking stream is transmitted to clients that have received short patching streams, and it plays a linking role between a patching stream and a regular stream. The linking stream enables a server to avoid transmitting unnecessary data delivered by a long patching stream in Double Patching, so the server never wastes its network bandwidth. Mathematical analysis shows that the proposed technique requires less server network bandwidth to support true VoD services than Double Patching. Moreover, simulation results show that it has better average service latency and client defection rate compared with Double Patching.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2871-2877
• /
• 2014

Real-time communication and diversification of multimedia application services using high-capacity data over the Internet demand high speed connection, and real-time and high-speed access internet service such as multimedia make Internet traffic increase rapidly. Meanwhile, QoS (Quality of Service) of internet service is not satisfied. In this situation, ISP (Internet Service Provider) has been required to improve service quality and extend network according to the user's needs. This request includes issue of extending network focused on increasing router and the number of routing table as well as simply extending bandwidth.

• Journal of KIISE:Information Networking
• /
• v.27 no.4
• /
• pp.476-481
• /
• 2000

멀티캐스트 데이터의 기밀성을 유지하기 위해서는 멀티캐스트 데이터를 그룹의 공동키로 암호화하여 전송하여야 한다. 그러나 멤버가 멀티캐스트 그룹에 동적으로 가입하거나 탈퇴하는 경우에는 그룹의 공통키를 변경하기 위해 필요한 계산량과 메시지의 수가 그룹의 크기에 비례해 커지는 규모확장성 문제에 봉착하게 된다. 이러한 문제를 해결하기 위해 그룹의 멤버나 키에 계층 구조를 두는 여러 가지 방법들이 제안된바 있으나 계층 멀티캐스트에 적용할 수 있는 방법은 아직 제안된 바가 없다. 본 논문에서는 계층 비디오 멀티캐스트 환경에 적용할 수 있는 두가지의 그룹 키 분배 방법을 제안한다. 첫 번째 방법은 각 계층에 대해 별도의 키 계층 구조를 유지하는 계층별 키트리 방법이며 두 번째 방법은 하나의 공통 키트리를 유지하고 각 계층을 공통 키트리상의 서브트리로 유지하는 통합 키트리 방법이다. 성능분석결과 멤버가 그룹에 가입해 있는 동안 계층 상승을 자주하는 경우는 계층별 키트리 방법이 유리하며 계층의 개수가 많고 계층 상승이 잦지 않은 경우는 통합 키트리 방법이 효율적이다.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.127-131
• /
• 2007

본 논문에서 제안하고자 하는 IPTV 채널캐슁 서비스는 IPTV 서비스의 품질요소인 QoE(Quality of Experience)의 개선을 목적으로 하고 있다. IPTV 채널캐슁 방법은 IPTV 서비스가 실시간 방송 및 VOD(Video On Demand)등 다양한 패턴의 서비스를 선택하는 사용자의 채널요구 패턴을 반영한 인접채널(adjacent-channel)을 멀티캐스트하면, 사용자의 채널전환요구시 제어메시지 전송 및 스위칭에 소요되는 대기시간을 줄여 사용자의 채널전환지연시간을 개선할 수 있다. 이를 위하여 본 논문에서는 LRFU(Least Recently Frequently Used) 알고리즘에 기반한 MCA(Multicast Channel Agent)을 제안하며, MCA을 구성모듈에 대한 설명을 기술한다.

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

IPv4 주소 공간의 부족으로 IPv6라는 새로운 해결책이 등장하였으나 아직은 널리 보급되지 못하고 6BONE과 같은 실험망에서만 사용되고 있는 실정이다. 그러나 IPv6는 가까운 미래에 IPv4를 대체할 차세대 인터넷 기술이며 본 논문은 이러한 배경에서 IPv6 멀티캐스트 환경에서 동작하는 화상회의 툴을 소개한다. 이 툴은 화상에는 MPEG4 코덱을 적용하고 음성에는 MP3 코덱을 적용하여 사용자당 1Mbps이하의 대역폭에서 고품질의 화상회의를 가능하도록 한다. 본 논문에서는 화상회의 응용의 전체적인 구조와 DirectShow 기술을 사용한 화상과 음성 정보의 압축과 스트리밍에 대해서 중점적으로 설명한다.

• Journal of Industrial Technology
• /
• v.24 no.B
• /
• pp.177-186
• /
• 2004

The main bottleneck for a VOD system is bandwidth of storage or network I/O due to the high bandwidth requirements and long-lived nature of digital video. Patching is one of the most efficient techniques to overcome the bottleneck of the VOD system through the use of multicast scheme. In this paper, we propose a new patching scheme, P2P proxy patching, for improving the typical patching technique by jointly using the proxy prefix caching scheme and the P2P proxy. In our proposed scheme, each client play a role in a proxy for multicasting a regular stream to other clients that request the same stream. Due the use of the P2P proxy and the prefix caching, the server bandwidth is required significantly less than that of the typical patching technique. In the performance study, we show that our patching scheme can reduce the server bandwidth requirements compared with the existing patching techniques.

• Information and Communications Magazine
• /
• v.17 no.3
• /
• pp.123-136
• /
• 2000

데이터(Data), 영상(Video) 그리고 음성(Audio)을 특정 사용자 그룹에게만 전송하는 데이터 전송기술인 멀티캐스트(Multicast)는 효과적인 그룹 접근 제어의 결려와 단일 유니캐스트 통신보다 많은 통신 링크 때문에, 부당한 공격자에게 많은 공격 기회를 제공하고 있다. 이것은 그룹의 수신자에게만 영향을 미치는 것이 아니라 잠재적으로 대부분의 네트워크에 연결된 사용자에게 영향을 미친다. 특히 참가자의 가입과 탈퇴 시에 신분위장, 재전송, 부인공격에 노출되어있기 때문에 이러한 부단한 공격 위협에 대한 보안대책이 필요하다. 본 논문에서는 안전한 멀티캐스트 트래픽 전송을 위한 보안 메커니즘 설계를 위한 기반 기술로서 멀티캐스트에서 보안의 필요성과 멀티캐스트에서 고려해야할 보안 서비스를 분석하고 단일 송신자와 다중 그룹에서 구성될 수 있는 보안 구조 및 보안 구성요소를 연구하였다.