• Title/Summary/Keyword: 게임 서버

Search Result 311, Processing Time 0.027 seconds

High Efficient Game Server using ACE Network Framework (ACE 네트워크 프레임워크를 이용한 고효율성 게임서버)

  • Park, Sung-Jun;Choo, Kyo-Sung;Park, Chang-Hun
    • Journal of Korea Game Society
    • /
    • v.9 no.1
    • /
    • pp.75-84
    • /
    • 2009
  • In this paper, we propose a game server using public network library ACE, which has been developed in various fields for a long time. ACE network library has been considered not only in the area of high efficient real-time communication library but also in the area of application development, and it provides various facilities. We logically reorganized the part, which is necessary to develop games, among various functions of ACE and optimized it, and developed real battlenet server using verify the reorganized library. As the method of experiment, the battlenet server and test client were set and interface request test and data electrical transmission test were conducted. As the result of the experiment, the conclusion that it is possible to develop games by using ACE, which is verified network library, has been obtained.

  • PDF

Implementation of Multi-games using Photon Server (Hide and Escape) (포톤 서버를 사용한 멀티게임 구현(Hide & Escape))

  • Shim, Han-Moi;Bang, Jin-Wook;Kim, In-Ho
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2022.01a
    • /
    • pp.69-70
    • /
    • 2022
  • 본 논문에서는 Photon Network를 사용하여 경찰과 도둑 컨셉으로 5명이 함께 즐길 수 있는 Multi Game을 구현하였다. 서버는 리슨 서버 방식으로 Master Client가 게임을 시작하면 Game에 참가한 모든 Player는 Photon Network의 RPC 기능을 사용하여 Player의 동작, Game 진행 상황 등을 실시간으로 Server에 동기화한다.

  • PDF

Development of Mobile Game Content through Interoperability between Wired and Wireless - Focused on Interoperability Types - (유무선 연동유형별 모바일게임 콘텐츠 개발)

  • Kim, Ki-Il;Kim, Mi-Jin
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.8
    • /
    • pp.76-85
    • /
    • 2007
  • The mobile content which adopts the subject matter of wired online game with interoperability element is in service. This is one of the plans which are the possibility of benefiting wired online game in game industry. In this paper, interoperability method of game content between wired and wireless classifies this with three branches and it tries to analyze the interrelationship of the interoperability element and interoperability types adopted in many wired online games. And, the development of interoperability server is composed of mobile server which takes charge of I/O process of mobile device and game server records all information of users in the game. With developing the content which is suitable in specific game(Ran-Online), this paper presents the development method of game content through interoperability between wired and wireless.

Network Game System Design (네트워크 게임 시스템 설계)

  • 장동찬;최성
    • Proceedings of the KAIS Fall Conference
    • /
    • 2000.10a
    • /
    • pp.354-359
    • /
    • 2000
  • 네트워크게임은 오락, 교육, 비즈니스를 포함하며 오늘날 우리의 생활 속에 다양한 관점에서 중요한 역할을 하기 시작하였으며, 최근의 네트워킹기술은 신뢰성 있는 게임을 요구하게 되었다. 네트워크게임은 전송방식 에 따라 피어 투피어방식, 커뮤니케이션 서버 방식, 중앙서버 방식 등 세 가지 방식으로 나눌 수 있는데 네트워크의 신뢰성이 매우 중요한 요인이다. 현재 이러한 문제를 해결하기 위한 노력들이 여러 분야에서 연구가 진행되고 있으며 특히, 네트워크 게임 시스템 운영체제, 네트워크 설계 등의 여러 분야에서 연구되고있다.

Delayed-constrained scheduling for a game server virtual machine (게임서버 가상머신을 위한 지연 제약 스케줄링)

  • kang, Kiwook;Ko, Cherl-hong;Hong, Jiman;Paik, Doowon
    • Journal of Korea Game Society
    • /
    • v.16 no.4
    • /
    • pp.57-68
    • /
    • 2016
  • As the size of the data used in the game application increase gradually, the physical resources of game server grow. Accordingly, it is necessary to/it is required to introduce I/O virtualization in game server to improve I/O performance of the server. But it is difficult to ensure high responsiveness in game server where I/O delay change from time to time. To maximize the benefit of I/O virtualization, guaranteeing I/O response time is very important and it is necessary to have I/O scheduling techniques to manage the I/O latency in the order of priority of virtual machines. In this paper, we propose an efficient delay-constrained scheduling algorithm in a virtualization environment to ensure maximum I/O latency. In addition, a reduced amount of loss of the packet was found to increase the fairness of scheduling in the experiments with the proposed scheme.

Research About Design and Implementation of On-Line Game Server for High Availability guarantee using Heartbeat (HeartBeat을 이용한 고가용성(High Availability) 보장 온라인 게임 서버 구축 제안)

  • Kim, Tae-Yul;Kyung, Byung-Pyo;Ryu, Seuc-Ho;Lee, Wan-Bok
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2006.05a
    • /
    • pp.193-198
    • /
    • 2006
  • Providing stable services has been a crucial factor to determine success or failure in current situations, in which online game industry has become one of the important industries. The study proposed a method of establishing a stable game servers using 'Hearbeat', one of the existing (load) balance server techniques for the enhancement of availability of online game servers. In the proposed method, one could provide users with stable game services, by inspecting master server frequently using stand-by servers corresponding to each game server.

  • PDF

Design the Time-Interval Based Fairness Partitioning Method in DVE (DVE에서 시간 기반 균등 부하 분산 방식 설계)

  • Won, Dong-Kee;An, Dong-Un;Chung, Seung-Jong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.1
    • /
    • pp.48-54
    • /
    • 2008
  • MMORPGs may involve a great number of concurrent players, and those servers usually have to manage hundred, or even thousands of avatars co-existing in the same virtual world. So if failing to send a command or an event message, or sending it too late may cause damages to the avatar evolution(death, injury, loss of resources), and may result in unjustified penalties for the player. Many policies could be defined to realize a ranking evaluation of available servers. Unfortunately, due to the highly dynamic characteristics of server loads and network performances, any optimal allocation would soon become sub-optimal. In order to solve those problems we propose the "time-interval based fairness partitioning method"(TIP). TIP will distribute the avatar to the game server equally with time-interval in order to avoid the problems form the unfairness of game servers load.

MMORPG Distributed Game Server using 2Layer-Virtual Cell (2Layer-Virtual Cell 방식을 이용한 분산 MMORPG게임서버)

  • Jang, Su-Min;Park, Yong-Hoon;Yoo, Jae-Soo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2006.05a
    • /
    • pp.189-192
    • /
    • 2006
  • An important application domain for online services is an interactive, multiplayer game. in recent, many increase of users that use on-line services through networks have caused a heavy load to the server. In this paper, we propose a MMORPG distributed game server using 2Layer-Virtual Cell. Our method provides more effective solution of MMORPG distributed game server for large numbers of users.

  • PDF

Dynamic Load Balancing Mechanism for MMORPG (MMORPG를 위한 동적 부하 균등화 기법)

  • Lim, Chae-Gyun;Rho, Kyung-Taeg
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.5
    • /
    • pp.199-203
    • /
    • 2009
  • Recently, Massively Multiplayer Online Role-Playing Games (MMORPGs) has become increasingly popular, which continue to increase the number of game player. The volume of the game world also has been extended on a large scale. Existing Map-based distributed server architecture divides the game world into the rectangular regions and allocates the registered player in each region to the server responsible for that region. Players tend to concentrate in certain regions of the game world, which makes some special server overloaded. This paper proposes to change the boundary between servers to solve such a unbalanced load problem. Our proposed method first finds the overloaded server and then searches for its neighboring lightest loaded server to share with the overload evenly. Finally we implemented performance evaluation to demonstrate the efficiency of this approach.

  • PDF

Fixed Size Memory Pool Management Method for Mobile Game Servers (모바일 게임 서버를 위한 고정크기 메모리 풀 관리 방법)

  • Park, Seyoung;Choi, Jongsun;Choi, Jaeyoung;Kim, Eunhoe
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.9
    • /
    • pp.327-336
    • /
    • 2015
  • Mobile game servers usually execute frequent dynamic memory allocation for generating the buffers that deal with clients requests. It causes to deteriorate the performance of game servers since it increases system workload and memory fragmentation. In this paper, we propose fixed-sized memory pool management method. Memory pool for the proposed method has a sequential memory structure based on circular linked list data structure. It solves memory fragmentation problem and saves time for searching the memory blocks which are required for memory allocation and deallocation. We showed the efficiency of the proposed method by evaluating the performance of dynamic memory allocation, through the proposed method and the memory pool management method based on boost open source library.