• Journal of Korea Game Society
• /
• v.19 no.3
• /
• pp.5-14
• /
• 2019

The gaming server is based on a distributed server. In order to distribute workloads of gaming servers, distributed gaming servers apply some algorithms which divide each of gaming server's workload into balanced workload among the gaming servers and as a result, efficiently manage response time and fusibility of server requested by the clients. In this paper, we propose a load balancing agent using PPO(Proximal Policy Optimization) which is one of the methods from a greedy algorithm and Policy Gradient which is from Reinforcement Learning. The proposed load balancing agent is compared with the previous researches based on the simulation.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.775-782
• /
• 2002

This paper introduces Policy Management Tool which was implemented based on Policy Information Model in network suity system. Network security system consists of policy terror managing and sending policies to keep a specific domain from attackers and policy clients detecting and responding intrusion by using policies that policy server sends. Policies exchanged between policy server and policy client are saved in database in the form of directory through LDAP by using Policy Management Tool based on network security policy information model. NSPIM is an extended policy information model of IETF's PCIM and PCIMe, which enables network administrator to describe network security policies. Policy Management Tool based on NSPIM provides not only policy management function but also editing function using reusable object, automatic generation function of object name and blocking policy, and other convenient functions to user.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.668-670
• /
• 2000

병렬 VOD서버를 구성하기 위해서는 서버의 확장성과 서버 결함의 복구문제 등이 충분히 고려되어야 한다. 본 논문에서는 서버의 확장성을 고려한 병렬 VOD서버를 설계한다. 또 기존의 병렬 VOD서버에 새로운 서버가 추가될 경우 부하 불균형 문제를 방지하기 위한 데이터 분배 방법을 고려한다. 이 문제를 해결하기 위해서 로드밸런스를 유지하면서, 서버에 저장되어 있는 최소한의 데이터만을 이동시킴으로써 각 서버의 사용 가능한 디스크 공간을 조정하는 스트라이핑 방법을 제시한다. 그리고 제시한 스트라이핑 방법을 모의 실험을 통해 분석한다.

• Journal of the Korea Society for Simulation
• /
• v.20 no.3
• /
• pp.29-39
• /
• 2011

The appointment system is widely used to facilitate customer access to service in many industries including healthcare and others. Because of its importance, much research has investigated how to build an effective appointment policy under various environments. However, most research has considered a single-server service system. The objective of this work is to evaluate several appointment policies in a two-stage service system in which multiple servers are available and build separate appointments at the second-stage. In such a system, we propose and evaluate the staggering appointment policy. Simulation experiments indicate that the proposed staggering appointment policy outperforms other traditional appointment policies in terms of customer waiting time, server idle time, and the number of customers who are later to scheduled appointments.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.556-568
• /
• 2003

This paper presents and analyzes the performance of a weighted-window based cache replacement policy for the efficient media caching in streaming media cache servers. The proposed policy makes, for each cached object, use of the reference count, reference time, amount of media delivered to clients and, in particular, the periodic patterns of user requests. Also, by giving weights to the recently referenced media contents, the replacement policy adequately and swiftly reflects the ever-changing characteristics of users preferences. The simulation studies show that the performance of the proposed policy has improved over the conventional policies such as LRU, LFU and SEG - in terms of hit ratio, byte hit ratio, delayed start and cache input.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.141-149
• /
• 2002

Recently, a number of network systems are developed rapidly and network architectures are more complex than before, and a policy-based network management should be used in network system. Especially, a new paradigm that policy-based network management can be applied for the network security is raised. A security policy server in the management layer can generate new policy, delete. update the existing policy and decide the policy when security policy is requested. The security server needs to analyze and manage the alert message received from server Policy enforcement system in the enforcement layer for the available information. In this paper, we implement an alert analyzer that analyze the stored alert data for making of security policy efficiently in framework of the policy-based network security management. We also propose a data mining system for the analysis of alert data The implemented mining system supports alert analyzer and the high level analyzer efficiently for the security.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1652-1660
• /
• 1999

One of the most important goals in VOD servers is to provide services to more clients with services which clients request. In order to provide service efficiently and rapidly, though considering a few of policies, efficient placement of data when they are stored is direct cause to improve efficiency of retrievals. In this paper, we propose a efficient placement policy, encoded video data being stored in clustered VOD servers. In the proposed placement policy, partitioning a large disk array into smaller disk groups which consists of a few of disks with similar performances, specially disk I/O bandwidth. In last chapter, we compare proposed placement policy with conventional policies, and show the results of improved performances with proposed policy.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.06a
• /
• pp.89-96
• /
• 2002

In this paper, we present the functional architecture for the traffic engineering capable policy based network management system. In this paper, we also examine the traditional approach to network management, contrast it with the policy based approach. The architecture includes the traffic engineering facilities, especially MPLS traffic engineering functions, to provide maximum network resource utilization. The policy server should communicate with the traffic engineering server and network manager to enforce the network policy efficiently. The interfaces and interworking methods are described in this paper.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.838-840
• /
• 2003

본 논문에서는 안전한 리눅스 개발을 위한 보안 정책 서버에 대해 연구하였다. 리눅스가 소스가 공개된 운영체제라는 장점을 제공하는 반면, 소스의 공개로 인해 보안상의 취약점 또한 공개되어 있다. 즉, 리눅스는 소스가 공개된 운영체제이기 때문에 보안상의 취약점을 이용하여 수많은 공격을 당하고 있다. 많은 전문가들이 이를 보완하고 있지만, 아직까지 리눅스에서 완벽한 보안을 제공하고 있지는 않다. 이러한 보안상의 문제를 해결하기 위하여 본 논문에서는 효율적인 정책관리를 위한 보안 정책 서버를 분석하여 리눅스에 적용함으로써, 리눅스가 가지는 보안상의 취약점을 해결하고자 하였다. 보안 정책 서버를 통하여 기존 리눅스 커널의 수정을 최소화하면서, 다른 접근제어 모델을 사용할 때에는 관련 모듈만 교체만 하면 되기 때문에 이미 설정된 보안 정책을 손쉽게 변화 할 수 있다.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.677-684
• /
• 2003

Most policies of VOD services are mainly studied about server system, and make no touch on clients buffer stabilization which is the basis of guaranteeing playback quality and playing without cut off. In this paper, we proposed a skipping frame transfer policy that can sending dynamic buffer control signal to server in accordance with clients buffer state of starvation or overrun, and server transfers a skipped frame to client after receive the control signal. And through a simulation, we show the suggested policy is more efficiency on playback quality by buffer stabilization which is by preventing loss and miss for receiving frame due to grow worse client buffer state.