1-6hit |
Sukwon LEE Keyungjin SEO Sungkwon PARK
In providing video programs to a number of clients through networks, a broadcasting approach is more appropriate than a true-video-on-demand approach in efficient use of bandwidth. However, the broadcasting approach also needs excessively wide bandwidth if many video programs are to be transmitted. This study presents a very simple but novel architecture called dynamic channel broadcasting, for video-on-demand systems. The proposed architecture uses both static and dynamic broadcasting channels to improve the efficiency of channels. The proposed architecture eliminates the necessity of dividing each video into segments and switching channels frequently unlike the pyramid broadcasting, the skyscraper broadcasting and the harmonic broadcasting. Also this new architecture needs a smaller buffer size. The numerical results demonstrate that the newly proposed approach in some cases requires only 14% of the bandwidth required for the conventional broadcasting while maintaining the start-up latency.
In designing a video-on-demand system, one of the major challenges is how to reduce the client's waiting time maintaining the concurrently used channels. For this reason, the hybrid architectures which integrate the multicast streams with the unicast streams were suggested in order to improve channel efficiency in recent years. In combining multicast with unicast, the ways to group the channels together are important so that more clients can share the multicast transmission channels. This paper proposes a hybrid video-on-demand system which gathers the unicast and multicast transmission channels efficiently by using dynamic channel allocation architecture. The newly proposed architecture can reduce the average client's waiting time significantly. The numerical results demonstrate that the dynamic channel allocation architecture in some case (e.g., 100-channel and 10-video system at 0.5 requests/second) achieves performance gain of 551% compared to existing architecture. This paper presents procedure of channel release and reuse, performance analysis, and simulation results of the dynamic channel allocation architecture.
We propose a new Internet group management protocol (IGMP) which can be used in passive optical network (PON) especially for IPTV services which dramatically reduces the channel change response time caused by traditional IGMP. In this paper, the newly proposed IGMP is introduced in detail and performance analysis is also included. Simulation results demonstrated the performance of the newly proposed IGMP, whereby, viewers can watch the shared IPTV channels without the channel change response time when channel request reaches a threshold.
With the fast development of mobile communication technologies, mobile multimedia services like mobile Video on Demand (VOD) are becoming prevalent. However, VOD streaming requires dedicated bandwidth to satisfy Quality of Service (QoS), and the limited wireless bandwidth will become insufficient to support the increasing number of mobile VOD users. In order to solve the problem, this paper proposes a Call Admission Control (CAC) approach which can accept new users even when the system bandwidth is insufficient. Our approach also guarantees continuous playback for subscribers by taking into account the service end time and the delay bound of the users. Simulation results demonstrate that the proposed scheme can increase the number of concurrent users and reduce the connection blocking probability significantly without playback interruption.
Hosun LEE Sukyung KIM Sungkwon PARK
Voice activity detection (VAD) determines whether a slice of waveform is voice or silence. The proposed VAD algorithm applying Elliptical Basis Function (EBF) neural networks uses k-means clustering and least mean square for the update algorithm. The error rates achieved by the EBF network have superior performance to those of G.729 Annex B and RBF.
Ad hoc networks are comprised of MAC, routing protocols and physical environments. In this paper, optimum MTU (Maximum Transmission Unit) sizes are studied in the ad hoc network environment. For a performance index, the "throughput rate" is defined. The throughput rate is the ratio between the number of packets received and packets sending through the overall systems. MTUs with the sizes between 250 bytes and 750 bytes have been shown to have better throughput rates in the environment without noise. MTUs with the size of 500 bytes have been found to generate the optimum throughput rate in the environments of 10-4 BER or less. Similar results are obtained in lower BER environments. AODV has slightly better performance than DSR without noise. These results found to be true for practical mobile environment.