• Journal of Digital Contents Society
• /
• v.19 no.1
• /
• pp.43-49
• /
• 2018

Recently, with the rapid increasing demands for data services on the Internet, the need for large-scale data centers has been increased. However, these data centers consume enormous amounts of energy to run numerous servers and equipment. In this paper, we therefore propose a novel scheme to save energy in multimedia servers by concentrating the load on specific servers according to the current load level of the overall system and turning them off immediately. To this end, the number of server groups in which each video is stored is determined according to its popularity so that video playback requests can be evenly distributed to the entire system. Finally, through extensive simulations, we show that our proposed data placement and power management scheme in multimedia servers significantly reduces energy consumption by decreasing the number of servers whose powers are on when compared with the existing method, while maintaining the service quality.

• Journal of Korea Multimedia Society
• /
• v.8 no.11
• /
• pp.1472-1482
• /
• 2005

In this paper, we propose a socket interface layer for large-scale multimedia servers that adopt TCP/IP Offload Engines (TOE). In order to provide legacy network applications with binary level compatibility, the socket interface layer intercepts all socket-related system calls to forward to either TOE or legacy TCP/IP Protocol stack. The layer is designed and implemented as a kernel module in Linux. The layer is located between BSD socket layer and INET socket layer, and passes the application's socket requests to INET socket layer or TOE. The layer provides multimedia servers and web servers with the following features: (1) All standard socket APIs and file I/O APIs that are supported (2) Support for binary level compatibility of existing socket programs (3) Support for TOE and legacy Ethernet NICs at the same time.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1097-1106
• /
• 2004

The typical web cluster architecture consists of replicated real servers and a virtual server that routes client requests among the real servers. In this paper, we proposed an efficient dynamic load distribution method with load prediction for the web cluster systems. The virtual server transmit status request message to real servers in other to get load states. However the load states dose not accurate during load distribution, thus the virtual server predict the load status of real servers and assign a request of the client to the minimum loaded real server. The proposed distribution methods works not related to partial breakdown of real servers, thus the system works with high availability. We also show that the proposed distribution method preserve scalable property and improve the throughput through a set of simulations.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.37-44
• /
• 2009

Recently, as the quality of multimedia data gets higher, multimedia servers require larger storage capacity and higher I/O bandwidth. In these large scale multimedia servers, the load-unbalance problem among disks due to the difference in access frequencies to multimedia objects according to their popularities significantly affects the system performance. To address this problem, many data replication schemes have been proposed. In this paper, we propose a novel data migration/replication scheme to provide better storage efficiency and performance than the dynamic data replication scheme which is typical data replication scheme employed in multimedia servers. This scheme can reduce the additional storage space required for replication, which is a major defect of replication schemes, by decreasing the number of copies per object. The scheme can also increase the number of concurrent users by increasing the caching effect due to the reduced lengths of the intervals among requests for each object.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.33-38
• /
• 2003

Most of the existing algorithms try to disseminate the multimedia contents of internet service provider (ISP), without taking into account characteristics and capacities of duplicated servers. However, they are less reliable without prior information on capacities of duplicated servers. In this paper we propose two algorithms, performance rating algorithm of hardware and capacity algorithm, inspired by the need of improving QoS of delivering multimedia contents without incurring long access delays when the capacities of duplicated servers are significantly different and clients locate in a fixed geographical domain Our simulation results show that they are better than HTTP response time algorithm when the multimedia contents are large and quite different from performances between duplicated servers.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.1
• /
• pp.25-35
• /
• 2002

Many multimedia presentation applications involve retrieval of objects from more than one collaborating server. Presentations of objects from different collaborating servers might be interdependent. This implies that objects should be retrieved from remote servers and delivered continuously according to given time constraints. Such applications need an estimate of the avaliable network resources to each of the collaborating servers and local system resources in order to identify a schedule for retrieving the objects composing the presentation. A collaborating server can suggest modifications of the retrieval schedule depending on its load. these modifications can potentially affect the retrieval schedule for other collaborating applications. Hence, a sequence of negotiations has to be carried out with the collaborating servers in order to commit for a retrieval schedule of the objects composing the presentation. In this paper, we propose an application sub-layer protocol, RLCP(Resource Lock Commit Protocol), for handling the negotiation and commitment of the resources required for a collaborative multimedia presentation and apply it to distributed video presentation application.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.277-285
• /
• 2011

Real-time multimedia streaming over the Internet is rapidly increasing with the popularity of user-created contents, Web 2.0 trends, and P2P (peer-to-peer) delivery support. While many homes today are broadband-enabled, the quality of experience (QoE) of a user is still limited due to frequent interruption of media playout. The vulnerability of TCP (transmission control protocol), the popular transport-layer protocol for streaming in practice, to the packet losses, retransmissions, and timeouts makes it hard to deliver a timely and persistent flow of packets for online multimedia contents. This paper presents TCP-real-time online multimedia environment (ROME), a novel transport-layer framework that allows the establishment and coordination of multiple many-to-one TCP connections. Between one client with multiple home addresses and multiple co-located or distributed servers, TCP-ROME increases the total throughput by aggregating the resources of multiple TCP connections. It also overcomes the bandwidth fluctuations of network bottlenecks by dynamically coordinating the streams of contents from multiple servers and by adapting the streaming rate of all connections to match the bandwidth requirement of the target video.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.795-798
• /
• 1999

To transmit multimedia information efficiently and use it in realtime, it needs a private multimedia terminal for service type. But multimedia information terminal was developped for of offered service type in case by case. Accordingly, general multimedia terminal have not been developed yet. Multimedia database structure and standard communication protocol must be designed first to develop the general multimedia terminal. Multimedia database structure needs to store the various multimedia information consistently and, standard communication protocol access the database transparently. In this paper, we design a multimedia database structure and communication protocol that are able to access the multimedia information on distributed database servers in the network.

• Journal of Korea Multimedia Society
• /
• v.12 no.6
• /
• pp.876-881
• /
• 2009

Online game servers usually has been using the static thread pool system. But this system is not fit for huge online game server because the overhead is always up-and-down. Therefore, in this paper, we suggest the new algorithm for huge online game server. This algorithm is based on the prediction-based dynamic thread pool system. But it was developed for web servers and every 0.1 seconds the system prediction the needed numbers of threads and determine the thread pool size. Some experimental results show that the check time of 0.4 seconds is the best one for online game server and if the number of worker threads do not excess or lack to the given threshold then we do not predict and keep the current state. Otherwise we apply the prediction algorithm and change the number of threads. Some experimental results shows that this proposed algorithm reduce the overhead massively and make the performance of huge online game server improved in comparison to the static thread pool system.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.3
• /
• pp.171-179
• /
• 2014

Among the P2P based multimedia streaming architecture, multiple chain architecture has advantage in adapting to dynamically changing network topology simply and rapidly, so this architecture is used for UCC broadcasting system. In UCC broadcasting system, general peer involved in DSLAM becomes UCC server rather than broadcasting system that transfers data from ISP servers. Therefore UCC data generated from UCC server peers is transmitted to peers through DSLAM, and this transmission uses uplink bandwidth of DSLAM. In this paper, I propose an efficient management method of DSLAM uplink bandwidths through negotiating tracker and UCC server peer or head peers of DSLAM. I propose the method that tracker restricts a bitrate of uplink stream of UCC servers when used uplink bandwidth of DSLAM exceeds a certain point of maximum uplink bandwidths. I will show the improved performance of proposed scheme rather than general method with respect to the uplink bandwidth of DSLAM by numerical analysis and simulation.