• 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.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.3
• /
• pp.37-47
• /
• 2010

In this paper, we propose an UCC broadcasting system in P2P based IPTV environments. Proposed system applies P2P based multiple chain architecture. UCC broadcasting system transfers data from not ISP server but UCC server peer that is included in DSLAM to joined peers. Therefore an algorithm to manage join and departure of peers have to modified. In this paper we propose an algorithm that does not increase an uplink bandwidth of DSLAM that include UCC server when peer joins to the UCC channel. We will show the improved performance of proposed scheme rather than general method with respect to the uplink bandwidth of DSLAM that include UCC server.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6A
• /
• pp.918-926
• /
• 2000

A huge storage and broad bandwidth are required to provide subscribers with VoD services. Hence, there is a huge amount of cost in establishing networks for VoD services. To determine how to reduce the cost, a number of studies involving such as distributed server systems, multicasting, program caching, stream sharing, are currently in progress. In this paper, a request criterion for multicast service and the ratio of required bandwidth for unicast to multicast are generated. The effect of multicast service on network bandwidth, server bandwidth, and buffer size was analyzed and validated through computer simulation. The results of this study could be applied to efficient designing networks for VoD services.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.166-172
• /
• 2020

Video streaming application such as YouTube is one of the most popular mobile applications. To adjust the quality of video for available network bandwidth, a streaming server provides multiple representations of video of which bit rate has different bandwidth requirements. A streaming client utilizes an adaptive bit rate scheme to select a proper video representation that the network can support. The download behavior of video streaming client player is governed by several parameters such as maximum buffer size. Especially, the size of the maximum playback buffer in the client player can greatly affect the user experience. To tackle this problem, in this paper, we propose the maximum buffer size optimization according to available network bandwidth and buffer status. Our simulation study shows that our proposed buffer size optimization scheme successfully mitigates playback stalls while preserving the similar quality of streaming video compared to existing ABR schemes.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.435-446
• /
• 2001

In this paper, a new fairness control method is proposed to distribute DQDB-SR (Distributed-Queue Dual-Bus with Slot Reuse) network bandwidth fairly to all stations on client-server environments. By using an access limit that follows a characteristic of client-sever load patterns and a bandwidth borrowing and returning mechanism, the proposed mechanism imparts fairness bandwidth control capability to DQDB-SR. To implement the proposed mechanism, we find the optimal placement of erasure nodes that maximizes network capacity for DQDB-SR, and calculate the access limit. At overload conditions, simulation results show that the proposed mechanism does not deteriorate network throughput, and outperforms other fairness control mechanisms in a success rate and an average packet transfer delay.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.145-152
• /
• 2012

Due to the large sizes of streaming media, previous delivery techniques are not providing optimal performance. For this purpose, video proxy server is employed for reducing the bandwidth consumption, network congestion, and network traffic. This paper proposes a fast distributed network file system using state transition model in the media streaming system for efficient utilization of video proxy server. The proposed method is composed of three steps: step 1. Training process using state transition model, step 2. base and decision probability generation, and step 3. storing and deletion based on probability. In addition, storage space of video proxy server is divided into each segment area in order to store the segments efficiently and to avoid the fragmentation. The simulation results show that the proposed method performs better than other methods in terms of hit rate and number of deletion. Therefore, the proposed method provides the lowest user start-up latency and the highest bandwidth saving significantly.

• Smart Media Journal
• /
• v.8 no.4
• /
• pp.46-52
• /
• 2019

The size of data generated and collected at industrial sites or in public institutions is growing rapidly. The existing data processing server often handles the increasing data by increasing the performance by scaling up. However, in the big data era, when the speed of data generation is exploding, there is a limit to data processing with a conventional server. To overcome such limitations, a distributed cluster computing system has been introduced that distributes data in a scale-out manner. However, because distributed cluster computing systems distribute data, inefficient use of network bandwidth can degrade the performance of the cluster as a whole. In this paper, we propose a scheme that compresses data when transmitting data in a Hadoop cluster considering network bandwidth. The proposed scheme considers the network bandwidth and the characteristics of the compression algorithm and selects the optimal compression transmission scheme before transmission. Experimental results show that the proposed scheme reduces data transfer time and size.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.49 no.1
• /
• pp.39-46
• /
• 2012

We can adapt telemedicine systems in advancement of information technology capabilities and increase of network bandwidth. The telemedicine service can be applied to a public health center, a school, a prison and islands in lacks of medical equipments and medical staffs. The telemedicine services which can be provided high quality medical services. We designed the multiple control server system consisting 3 sub-function, patients and doctors name list, network types, connection states and computer equipments. The telemedicine link configuration was decided as 'Flowing', or 'By-passing' in accordance the network type and bandwidth of patient systems or doctor systems. The multiple control server system was performed the best communication configuration over heterogeneous networks. This system was achieved high quality telemedicine services through dynamic wired and wireless networks at any time. This study represented a hybrid multimedia telemedicine system over heterogeneous networks. We expected that the designed system could provide not only the high quality services, tele-diagnosis and tele-consultation, but also the effective emergency telemedicine services to multi-patients in the heterogeneous network environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8B
• /
• pp.1150-1158
• /
• 2010

At present multimedia service composed of voice, data, and video service is prevalent in the Internet. As such, wide-scale penetration of Internet service imposes tremendous pressure to the network infrastructure such as the media servers and links as well as the nodes. In addition, users from a large-scale population require broad bandwidth and high level of QoS. This requires a network with reliable and scalable services to customers, which also necessitates a realistic method for the design of the a media server. In this work, we explore the influence of user's behavior about delay on the performance of media server that takes into account the system and user attributes in a realistic manner. By incorporating user's behavior about the delay-sensitivity, we present an analytic framework for the evaluation of the performance of the media server, via which we illustrate a meaningful intuition in the provision of Internet multimedia service.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.815-817
• /
• 2000

근래 Web Server의 안정된 운용의 중요성이 급증하는 Network Traffic과 더불어 점차 증대되고 있다. 기본적인 Network 구성망은 Ethernet으로 표준적인 프로토콜은 TCP/IP로 기반을 잡고 있다. 날로 증가하는 Network Traffic을 효과적으로 처리하기 위해서는 Network의 bandwidth 및 서버가 처리할 수 있는 데이터 양을 분석하여 병목현상을 줄이고 데이터의 흐름을 원활히 하기 위한 데이터 buffer들의 설치와 적절한 운영 방법에 관한 연구가 필요하다. 본 논문에서는 Web Server로부터 image 데이터를 전송 받아 이를 원활히 display하기 위한 Application Layer에서의 buffer 크기 및 제어방법에 관한 연구를 수행하고 특히 연속적인 이미지의 전송과 재생에 관한 buffer management에 관하여 고찰한다.