• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.313-320
• /
• 2005

The increasing popularity of multimedia streaming services introduces new challenges in content distribution. Especially, it is important to provide the QoS guarantees as they are increasingly expected to support the multimedia applications. Multimedia streams typically experience the high start-up delay due to the large protocol overhead, the delay, and the loss properties of the wireless networks. The service providers can improve the performance of multimedia streaming by caching the initial segment (prefix) of the popular streams at proxies near the requesting clients. The proxy can initiate transmission to the client while requesting the remainder of the stream from the server. In this paper, we propose the traffic based caching algorithm (TSLRU) to improve the performance of caching proxy. TSLRU classifies the traffic into three types, and improve the performance of caching proxy by reflecting the several elements such as traffic types, recency, frequency, object size when performing the replacement decision. In simulation, TSLRU performs better than the existing schemes in terms of byte hit rate, hit rate, startup latency, and throughput.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.2
• /
• pp.645-655
• /
• 2008

As wireless connectivity is integrated into many handheld devices, streaming multimedia content among mobile ad-hoc peers is becoming a popular application. In this paper, we propose a dynamic service replication algorithm for providing guaranteed continuous streaming services to all nodes in mobile ad-hoc networks (MANETs). First, a MANET is comprised of logical grid hierarchy, and a streaming service is replicated to a lower server region of the logical grid hierarchy by considering the link availability between a mobile node and the streaming server within a server region or the popularity of the streaming service. We evaluate analytically the performance of the proposed algorithm, and compared with that of existing Qin's algorithm. Evaluation results show that our algorithm can achieve better streaming performance than Qin's algorithm. Therefore, the proposed algorithm not only improves the sharing availability of replicated streaming services but also controls efficiently the number of streaming service replications.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.412-414
• /
• 2004

대용량의 멀티미디어 데이터들을 다수의 시용자가 동시에 요구할 경우 접속이 끊기거나 데이터의 손실과 같은 접속 성능이 현저하게 저하되는 문제가 발생할 수 있다. 이는 대부분의 사용자들의 요청을 원거리의 Central Server가 단독으로 처리하기 때문에 발생하는 문제이다. 띠라서 Central Sever의 Load 감소와 초기 지연시간 및 비디오 패킷의 손실의 문제점을 해결하기 위해 프록시 서버를 사용자의 근거리에 위치시키는 방법을 이용한다. 대용랑의 멀티미디어 데이터들을 복잡한 인터넷의 중간경로를 거치지 않고 다수의 사용자들에게 직접 전달함으로써 데이터의 손실을 방지함과 동시에 보다 안정적이고 빠른 속도로 제공하는 것이 가능하다. 특징적으로 프록시 서버는 Central Server에 비해 비교적 제한된 용랑을 가지고 있다. 따라서 본 논문에서는 사용자의 선호도를 기반으로 하여 앞으로 요구학 것이라고 예측되는 비디오 데이터들만을 선별적으로 저장하도록 하는 알고리즘을 제안한다. 시뮬레이션을 통해 제안하는 캐쉬 교환 알고리즘을 기존의 알고리즘과 비교, 관찰한 결과 상대적으로 높은 Hit rate가 나타남을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.451-453
• /
• 2001

오늘날 네트워크의 대역특이 커지고 동시에 실시간 처리를 요하는 다양한 멀티미디어 애플리케이션들이 생성되고 있다. 그러나 문제는 고속 LAN 환경에서 많은 사용자들이 멀티미디어 애플리케이션들을 비롯한 다양한 네트워크 서비스들을 사용하고 있지만, WAN 환경으로의 선로로 전송하는데 있어서의 차별화가 없다는 것이다 따라서 경성 실시간(hard real time) 처리를 요하는 멀티미디어 데이터 들의 시간 제한을 지켜줄 수 없고, 비교적 지연시간의 제약을 받지 않는 HTML, FTP, e-Mail, 등의 연성 실시간(soft real time) 처리를 요하는 애플리케이션들에 대해 불필요한 대역폭 낭비를 일으킨다. 이러한 문제를 최소화하기 위해 본 논문에서는 엔터프라이즈 네트워크 등과 같은 고속 네트워크 망을 사용하는 환경에서 다양한 멀티미디어 데이터 패킷들을 고정적으로 할당된 대역폭에 따라 우선적으로 서비스되도록 하여 지연시간 제한을 최대한 보장해 주기 위한 리눅스 상에서 구현된 QoServer 개발 기술을 소개한다.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.3 no.2
• /
• pp.72-80
• /
• 2004

This Paper is implementing IPMP system based on Server/client Structured Linux. We referenced OpenIPMP System, which is a reference software of IPMP (Intellectual Property Management and Protection) solution. Using this system, we developed multimedia contents service providing system using MPEG-21's REL(XML), which is applicable to new media service environment.

• Journal of information and communication convergence engineering
• /
• v.3 no.2
• /
• pp.90-92
• /
• 2005

As the result of the study shows, Round Robin Algorithm allows servers to ensure definite traffic distribution, unless incoming data loads differ much. Although error levels are high in some cases, they were eventually alleviated by repeated tests for a long period of time. The study uses two software packages (Packet Capture and Round Robin Test Package) to check packet volume from Virtual Network Structure (data generator, virtual server, Server 1, 2, 3), and finds out traffic distribution toward Server 1, 2, and 3. The functions of implemented Round Robin Load Balancing Monitoring System include round robin testing, system monitoring, and graphical indication of data transmission and packet volume.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.8
• /
• pp.1407-1417
• /
• 2016

In this paper, we propose a multi-level content transmission mechanism for intelligent quality of service (QoS) in social networking services (SNSs). Because existing SNSs and related work send image content to a client with a single fixed mechanism, they cannot consistently support content accessibility according to different conditions of QoS factors such as network congestion and throughput. In the proposed image transmission mechanism, our communication middleware (CM) provides an SNS developer with three transmission modes so that an SNS server or client can dynamically change the quality of images if required. In each transmission mode, an SNS server can send images to a requesting client with original high quality, thumbnail quality, or send only text information. With varying qualities of downloaded images, an SNS developed on top of CM can provide users with consistent QoS for access to SNS content.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.3
• /
• pp.345-354
• /
• 2004

In these days, such services are popularized as E-commerce, E-government, multimedia services, and home networking applications. Most web traffics generated contemporarily basically use the Hyper Text Transfer Protocol(HTTP). Unfortunately, the HTTP is improper for these applications that comprise significant components of the web traffics. In this paper, we introduce a real-time contents compression architecture that maximizes the web service performance as well as reduces the response time. This architecture is built into the linux kernel-based web accelerating module. It guarantees not only the freshness of compressed contents but also the minimum time delay using an server-state adaptive algorithm, which can determine whether the server sends the compressed message considering the consumption of server resources when heavy requests reach the web server Also, We minimize the CPU overhead of the web server by exclusively implementing the compression kernel-thread. The testing results validates that this architecture saves the bandwidth of the web server and that elapsed time improvement is dramatic.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.4
• /
• pp.833-838
• /
• 2014

Recently the use router is to allow multiple computers by one IP can be connect to the Internet. Also, the PC or server in order to use a Web server or a print server, Web Hard, P2P should be settings. In this paper, we are building a multi-functional Web server that using a router supported OpenWRT based on network settings and firewall settings and a variety of services. A web server can be provided the Internet phone and secure multimedia service Web server router based OpenWRT may be provided through a mobile app and the PC application service.

• The Journal of the Korea Contents Association
• /
• v.7 no.3
• /
• pp.17-24
• /
• 2007

SIP-based tightly coupled conference, which has a centrally located conference server for controlling and management, can be classified several models according to location of focus and mixer. These are centralized server model, endpoint server model, media server component model and distributed mixing model. However each model has its strength and weakness. In this paper, we propose and implement a SIP-based effective hybrid-type conference model which decreases amount of SIP signaling messages, lowers load of server media mixer, and can be easily expandable to large scale conference. In this model, when the number of participants exceeds a pre-defined limit, the conference server selects some participants which posses specific functions and let them share functions of notifications of conference state event package and media mixing. When each participant subscribes conference state event package to the server, it can indicates its possession of such functions by a specific header message. The server stores the indication to the conference information database, and later uses it to select participants for load sharing. The performance of our proposed model is evaluated by experiments.