• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.525-527
• /
• 2005

the multicast services with multiple senders is interested according to the internet services such as multiple audio/video conference services. With the N-plex multicast protocols, multicast session manager is also needed for membership control and session control. RMCP-3 is designed for N:N group communications which is standardizing in ITU-T and supports multiple senders who join sessions. In this paper, we consider requirements of multicast manager for multiplex multicast communication protocol which many a joiner has a role in sender such conference application.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.487-494
• /
• 2009

VOD(Video On Demand) that provides streaming service according to the user's requirement in real time, consists of the video streaming server and the client system. Since it is very hard to apply the traditional server-client model that a server communicates with many clients through 1:1 connection to VOD system because it requires very high network bandwidth, many researches have been done to address this problem. Batching technique is one of VOD system based on Multicast that requires very small network bandwidth. However, the batching based VOD system has a limitation that it is very hard to provide VCR(Video Cassette Recorder) ability. In this paper, we propose a technique that reduces the required network bandwidth to provide VCR function by using the characteristic of MPEG, one of international video compression standard. In the proposed technique, a new video stream for VCR function is constructed with I pictures that is able to be decoded independently. The new video stream for VCR function is transmitted with the video stream for normal play together in Batching manner. The performance evaluation result shows that the proposed technique not only reduces the required network bandwidth and memory usage but also decreases the CPU usages.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.523-532
• /
• 2003

Video on Demand(VOD) services cause high resource consumption in a video seuer, because multimedia are characterized by continuous playback, a high bandwidth requirement, and long playback duration. Patching has been proposed to save the network I/O bandwidth of a video server. To achieve true VOD, patching uses multicasting to share video streams, thereby providing immediate VOD services to users without any service latency. A communication channel is used to either multicast the entire video as a regular channel or multicast only the leading portion of a video as a Patching channel. This paper Proposes a buffering patching technique that divides regular channels, as used in patching, into sub-regular channels and regular channels to shorten the holding time of the channels. In the proposed technique, the last portion of video data, corresponding to the size of the buffering window, is not transferred by sub-regular channels, but rather downloaded and buffered in the user buffer from the latest regular channel. When simulations were performed to compare the performance of the proposed technique with that of conventional patching, the results indicated that the proposed technique was superior in terms of the defection rate, average service latency, and fairness, although the amount of video data buffered at each user station was higher than that with patching.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.235-246
• /
• 2002

While the Internet is suffering from the massive data such as video stream, IP multicast can ease the load of the Internet by enabling one copy of digital information to be received by multiple computers simultaneously. But If multicast is based on UDP, packets are delivered using a best-effort Policy without any reliability, congestion control or flow control. Multicast group members can join or leave a multicast group at will, and multicast uses broadcast mechanism, it's very hard to keep security from unauthorized members. In this paper, we introduce a new reliable multicast protocol TRDMF proper for one-to-many multicast model with reliability, flow control, congestion control and key management.

• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1597-1604
• /
• 2005

Recursive Patching is an efficient multicast technique for large-scale video on demand systems and recursively shares existing video streams with asynchronous clients. When Recursive Patching initiates a transition stream, it always makes a transition stream have additional data for the worst future request. In order to share a VOD server's limited network bandwidth efficiently, this paper proposes Practical Patching that removes the unnecessary data included in the transition stream. The proposed Practical Patching dynamically expands ongoing transition streams when a new request actually arrives at the server. As a result, the transition streams never have unnecessary data. Simulation result confirmed that the proposed technique is better than Recursive Patching in terms of service latency and defection rate.

• ETRI Journal
• /
• v.35 no.2
• /
• pp.234-244
• /
• 2013

Internet protocol television (IPTV) service depends on the network quality of service (QoS) and bandwidth of the broadband service provider. IEEE 802.16j mobile multihop relay Worldwide Interoperability for Microwave Access networks have the opportunity to offer high bandwidth capacity by introducing relay stations. However, to actually satisfy QoS requirements for offering IPTV services (HDTV, SDTV, Web TV, and mobile TV) for heterogeneous users' requests, providers must use a video server for each IPTV service type, which increases the network load, especially bandwidth consumption and forwarding time. In this paper, we present a solution for forwarding IPTV video streaming to diverse subscribers via an 802.16j broadband wireless access network. In particular, we propose a new multicast tree construction and aggregation mechanism based on the unique property of prime numbers. Performance evaluation results show that the proposed scheme reduces both bandwidth consumption and forwarding time.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.180-187
• /
• 2002

Many real-time multimedia applications, such as video conferencing have stringent end-to-end delay constraints and consume large amount of network resources. In order to support these applications efficiently, multicast routing algorithms computing least cost multicast trees that satisfy a given end-to-end delay constraint are needed. However, finding such a tree is known to be computationally expensive. Therefore, we propose a heuristic distributed multicast routing algorithm that reduces a “finding multicast tree”that satisfies a given end-to-end delay constraint and minimizes the average resulting tree cost. Also, simulation results show that the proposed algorithm has much better average cost performance than other existing algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1241-1248
• /
• 1998

The multicast scheme can improve the efficiency of multimedia retrieval service system, assuming that video transmission speed is faster than the playback rate and the store-and-play scheme. To best exploit the multicast benefits under bandwidth heterogeneous environment, we develop a multicast scheduling algorithm called MTS(Maximum Throughput Scheduling) which tries to maximize the amount of information transferred at each scheduling with subgrouping method. The MTS method compromises the multiple unicast method and the multicast method with lowest transmission rate. we compare the performance of MTS with that of MMS(Most Multicasting Scheduling) and EDS(Earliest Deadine Scheduling) via computer simulation. The performance results show that the MTS requires less number of service handlers to service the same number of subscribers.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1078-1085
• /
• 2004

The SARLM(Source Adaptive Receiver-Driven Multi-Layered Multicast) has been proposed to address heterogeneous bandwidth constraints through layer merging and splitting. However, this method causes that receivers subscribing to the higher layer drop down to the lower layer and hence may decrease utilization of available bandwidth after layer merging. In this paper, we proposed a multicast regrouping method considering distributive status of receivers according to loss rates. The proposed method weights receivers according to loss rates. And then it groups higher layer with receivers subscribing to lower layer have extra bandwidth and lower layer with receivers subscribing to higher layer have high loss rate. Experimental results show that receivers subscribing to higher layer can receive in high transmission rate and consequently the proposed method effectively improves utilization of available bandwidth.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4B
• /
• pp.713-720
• /
• 2010

Lately, IPTV is in the limelight using a broadband information service to provide video content and broadcast services. Current IPTV system is combining CAS and DRM system for VOD contents to protect transmitting contents and authentication, but it has drawbacks such as system's complexity and high construction costs. Multicast DRM system emerged as a method to improve them, but, in the multicast DRM system, if the key is intercepted by a malicious user, it can be viewed by an unauthorized user of illegal broadcasting which can be a problem. In this paper, we suggest to protect content from a malicious user by applying the techniques using user authentication in the multicast DRM system.