• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1060-1065
• /
• 2003

As the Internet continues to grow, network games are widely spreaded. For most network games, many users' meet on a server causes a heavy load to the sewer, which in turn brings inconvenience to the user. Moreover, it demands increased expense to the service provider for deploying additional servers. In this paper, we propose a hybrid distributed system for network games. In our proposed system, a client is independents of the server and exchanges information directly with other clients. The client depends on servers only for the update information. The proposed methodology classifies messages according to the characteristics of information that the message handles and applies either client-to-server and pear-to-pear communication for processing messages which increases the efficiency of systems.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.790-792
• /
• 2001

오늘날 웹서버를 활용한 업무처리 시스템에서는 웹서버의 기능이 중앙집중화된 정보시스템보다는 웹서버가 처리해야 할 기능별로 별도의 웹서버를 두어 부하를 분산시켜 처리하는 시스템 구성이 일반적이다. 이러한 환경에서 자연히 웹서버도 많아지고 사용하려는 사용자도 많아지게 되는데 이때 이러한 사용자가 웹서버에 제공하는 자원에 대한 접근을 제어할 필요가 있게 된다. 이를 위한 효율적인 방안으로 RBAC(Role Based Access Control)을 사용하는 방법을 생각할 수 있다. 그러나 복수개의 서로 다른 서비스를 담당하는 각각의 서버에는 서로 다른 RBAC 구조가 존재할 수 있게 된다. 이러한 시스템환경에서 일반적으로 한사람의 사용자는 각각의 서버마다 서로 다른 역할을 담당하게 되고 자신의 업무를 처리하는데 있어 각각의 서버별로 별도의 역할을 부여받게 된다. 이에 본 논문에서는 동일 도메인내에서의 분산 웹서버들이 존재할 때 현재 접근제어의 가장 적합한 개념인 역할기반 접근제어기법을 응용하여 사용자가 복수개의 이들 웹서버를 사용하여 업무를 처리함에 있어 매번 각 서버에서 인증을 받아야하는 불편을 없애 이 문제를 효율적으로 해결해 보고자하며 이를 위해 기존의 RBAC에 Role의 상위 개념인 Work개념을 도입해 사용자가 자신의 업무를 수행시 Role이 아닌 좀더 추상적이고 포괄적 개념인 Work를 선택할 수 있게 함으로 해서 각 서버에서 선택된 Work에 따라 자신에게 부여되는 권한을 이용해 원활하게 업무를 수행할 수 있도록 하는 방법을 제안한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.9_10
• /
• pp.466-475
• /
• 2008

Owing to the improved wireless communication technologies, it is possible to provide streaming service of multimedia with PDAs and mobile phones in addition to desktop PCs. Since mobile client devices have low computing power and low network bandwidth due to wireless network, the transcoding technology to adapt media for mobile client devices considering their characteristics is necessary. Transcoding servers transcode the source media to the target media within corresponding grades and provide QoS in real-time. In particular, an effective load balancing policy for transcoding servers is inevitable to support QoS for large scale mobile users. In this paper, the transcoding load estimation algorithm is proposed for load balance on the distributed transcoding environments. The proposed algorithm estimates transcoding time from transcoding server information, movie information and target transcoding bit-rate. The estimated transcoding time is proved based on experiments.

• The KIPS Transactions:PartA
• /
• v.14A no.7
• /
• pp.443-450
• /
• 2007

Performance scalability and storage scalability become important in a large scale cluster of wireless internet proxy cache servers. Performance scalability means that the whole performance of the cluster increases linearly according as servers are added. Storage scalability means that the total size of cache storage in the cluster is constant, regardless of the number of cache servers used, if the whole cache data are partitioned and each partition is stored in each server, respectively. The Round-Robin based load balancing method generally used in a large scale server cluster shows the performance scalability but no storage scalability because all the requested URL data need to be stored in each server. The hashing based load balancing method shows storage scalability because all the requested URL data are partitioned and each partition is stored in each server, respectively. but, it shows no performance scalability in case of uneven pattern of client requests or Hot-Spot. In this paper, we propose a novel dynamic hashing method with performance and storage scalability. In a time interval, the proposed scheme keeps to find some of requested URLs allocated to overloaded servers and dynamically reallocate them to other less-loaded servers. We performed experiments using 16 PCs and experimental results show that the proposed method has the performance and storage scalability as different from the existing hashing method.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.15-23
• /
• 2004

This paper presents distributive web-caching technique on the Head-End-Network (HNET) to solve excessive load of multimedia sever and inefficient use of network resources, The proposed web-caching is not concentration of load for a specific Head-End-Node(HEN), and it has advantage that there is no copy of a specific item on distributive HENs. This technique distributively stores on HENs partial streams of requested videos from clients connected to HENs and the order of store streams follows the order of request of identical video items from HENs. Thus, storing streams on each HEN that requests sevice are different. When a client requests the cached video on some HENs, the HEN that connects him receives streams in the order of store from HENs which stored them and it transmits them to him. These procedures are performed under the control of SA. This technique uses cache replacement algorithm that the combination of LFU, LRU and the last remove for the first stream of videos In order to reduce end-to-end delay.

• Annual Conference of KIPS
• /
• 2012.04a
• /
• pp.1286-1287
• /
• 2012

자원을 효율적으로 관리할 수 있는 분산 처리 분야의 활용도가 높아지고 있는 가운데 P2P 기술의 유용성이 분산 환경에서 입증되고 있다. 이러한 P2P 시스템에서 다양한 컨텐츠를 이용하여 정보 제공의 역할을 하는 서버와 피어들로 구성된 P2P 시스템은 일반적인 자원 보유 서버로 구성된 시스템에 비해 서버의 부하가 적은 것이 사실이다. 본 논문에서는 식당에서 음식 메뉴를 제공함에 있어서 소셜 네트워크 기반의 공동 구매에 있어 개선된 정보와 연계되어 효과적으로 진행되는 P2P 시스템을 제안한다. 소셜 네트워크 기반의 공동 구매 정보는 P2P 시스템을 이용하는 피어에 의해 제공되고, 이러한 중계 정보는 P2P 서버에 의해 제공되는 형태이다.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.199-205
• /
• 2008

The centralized conference model has advantage of conference management and control. however it's scalability has been limited as performance degrades largely with increasing number of conference users. So new distributed conference models which improve scalability of centralized conference model have been suggested recently. In the distributed conference model. as conference users exceed a predefined maximum number, a new conference server is added to the conference dynamically. In this paper, We have proposed a new method which increases efficiency of conference event package processing that primary conference server should charge in the distributed conference environment. The primary conference server exchanges informations with each secondary conference servers and conference users by using conference event package. And from the conference information database it selects SIP(Session Initiation Protocol) UA(User Agent) which will share notification to the conference users, and transfers lists to each conference servers. The conference servers make the selected UAs share processing of conference event package, so loads of SIP signal processing decrease, and improve scalability of distributed conference model. The performance of our proposed model is evaluated by experiments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1524-1531
• /
• 2004

This study analyzes a load balancing technique using Round Robin Algorithm. 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, Server1,2,3), and finds out traffic distribution toward Server1,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. 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.

• Annual Conference of KIPS
• /
• 2002.11a
• /
• pp.151-154
• /
• 2002

갈수록 증가하는 인터넷 사용자의 서비스 요구량에 대처하기 위해, 부하 분산 기능을 갖는 클러스터 시스템의 이용이 늘어가고 있다. 본 연구에서는 클라이언트에게 보다 향상된 응답 성능을 제공하기 위해 사용되는 RR(Round Robin), WRR(Weighted Round Robin), LC(Least Connection), WLC(Weighted Least Connection) 부하 분산 알고리즘에 대해서, 클라이언트로부터 인입되는 7 가지 요구 수신 패턴에 따른 부하 분산 응답 특성을 분석하고 그 결과를 논한다. 이를 위해, 실제 시스템의 측정 결과를 토대로 단위 시간 당 인입되는 클라이언트의 요구량 변화를 7 가지 패턴으로 분류하였고, 리눅스 가상 서버(LVS: Linux Virtual Server) 클러스터 시스템을 대상으로 7 가지 요구 패턴에 대한 부하 분산 응답 특성을 얻었다. 본 연구를 통해서 클라이언트 요구랑 변화 패턴에 따른 최적의 부하 분산 알고리즘을 제시할 수 있었다. 본 연구 결과는 향후 효율적인 동적 부하 분산 연구에 좋은 참고가 될 것이다.

• Journal of Broadcast Engineering
• /
• v.5 no.1
• /
• pp.130-138
• /
• 2000

The paper describes a push system, a broadcasting system in the internet, which is developed for internet and intranet use. In this paper, we carried out research on the method to support the large number of users in the intranet environment. Particularly the paper analyzes the effects on the network traffic according to the number of the user connected to the push system and the frequency of the connections when push servers are distributed over the intranet. Push system described here uses two different kinds of channels, common channel and local channel. Common channel is the channel to be replicated among the push servers in the intranet. This paper shows that the method using the common channel synchronization is efficient in supporting the large number of intranet users. We introduce an algorithm to make the interconnections between channels efficiently amongpush servers distributed over the intranet.