• Title/Summary/Keyword: Cloud Game

Search Result 67, Processing Time 0.031 seconds

Improving Game Character Design Identity : Focus on Game Character Design Method through Semiotic Analysis (게임 캐릭터의 아이덴티티 개선방안 : 게임 캐릭터 제작방식의 기호학적 분석 중심으로)

  • Lee, Je;Kyung, Byung-Pyo;Ryu, Seuc-Ho;Lee, Wan-Bok
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.2
    • /
    • pp.162-169
    • /
    • 2011
  • This paper proposed an efficient game character design method through semiotic analysis of character. It inquired into the characteristics of game character of various contents characters, added the concept of "Iconic abstraction" of Scott McCloud to its characteristics, and studied on the relation between the character and the semiotics. The semiotic character from the factual character, seized the strong and weak point of each character, and divided them in the designer's character production process and gamer's character recognition process step by step for its semiotic interpretation. As a result, two processes were reversely progressed, and the character designing process considering this gamer's semiotic recognition process is expected to be the efficient character design element that can deliver the whole characteristics of game contents.

Real Object Recognition Based Mobile Augmented Reality Game (현실 객체 인식 기반 모바일 증강현실 게임)

  • Lee, Dong-Chun;Lee, Hun-Joo
    • Journal of Korea Game Society
    • /
    • v.17 no.4
    • /
    • pp.17-24
    • /
    • 2017
  • This paper describes the general process of making augmented reality game for real objects without markers. In this paper, point cloud data created by using slam technology is edited using a separate editing tool to optimize performance in mobile environment. Also, in the game execution stage, a lot of load is generated due to the extraction of feature points and the matching of descriptors. In order to reduce this, optical flow is used to track the matched feature points in the previous input image.

A Hybrid Cloud-P2P Architecture for Scalable Massively Multiplayer Online Games (확장가능한 대규모 멀티플레이어 온라인 게임을 위한 클라우드와 P2P 하이브리드 구조)

  • Kim, Jin-Hwan
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.3
    • /
    • pp.73-81
    • /
    • 2020
  • Today's massively multiplayer online games(MMOGs) can contain millions of synchronous players scattered across the world and participating with each other within a single shared game. The increase in the number of players in MMOGs has led to some issues with the demand of server which generates a significant increase in costs for the game industry and impacts to the quality of service offered to players. In dealing with a considerable scale of MMOGs, we propose a cloud computing and peer-to-peer(P2P) hybrid architecture in this paper. Given the two nearly independent functionalities of P2P and cloud architectures, we consider the possibility of fusing these two concepts and researching the application of the resultant amalgamation in MMOGs. With an efficient and effective provisioning of resources and mapping of load, the proposed hybrid architecture relieves a lot of computational power and network traffic, the load on the servers in the cloud while exploiting the capacity of the peers. The simulation results show that MMOGs based on the proposed hybrid architecture have better performance and lower traffic received compared with MMOGs based on traditional client-server system.

Hypergraph Game Theoretic Solutions for Load Aware Dynamic Access of Ultra-dense Small Cell Networks

  • Zhu, Xucheng;Xu, Yuhua;Liu, Xin;Zhang, Yuli;Sun, Youming;Du, Zhiyong;Liu, Dianxiong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.494-513
    • /
    • 2019
  • A multi-channel access problem based on hypergraph model in ultra-dense small cell networks is studied in this paper. Due to the hyper-dense deployment of samll cells and the low-powered equipment, cumulative interference becomes an important problem besides the direct interference. The traditional binary interference model cannot capture the complicated interference relationship. In order to overcome this shortcoming, we use the hypergraph model to describe the cumulative interference relation among small cells. We formulate the multi-channel access problem based on hypergraph as two local altruistic games. The first game aims at minimizing the protocol MAC layer interference, which requires less information exchange and can converge faster. The second game aims at minimizing the physical layer interference. It needs more information interaction and converges slower, obtaining better performance. The two modeled games are both proved to be exact potential games, which admit at least one pure Nash Equilibrium (NE). To provide information exchange and reduce convergecne time, a cloud-based centralized-distributed algorithm is designed. Simulation results show that the proposed hypergraph models are both superior to the existing binary models and show the pros and cons of the two methods in different aspects.

A Method for Client-Server Allocation for Maximum Load Balancing and Automatic Frame Rate Adjustment in a Game Streaming Environment (게임 스트리밍 환경에서 최대 부하 균등 및 자동 프레임 레이트 조절을 위한 클라이언트-서버 배정 방법)

  • Kim, Sangchul
    • Journal of Korea Game Society
    • /
    • v.20 no.4
    • /
    • pp.77-88
    • /
    • 2020
  • Recently, interest in game streaming is high in cloud-based gaming. In game streaming, remote game servers perform graphics rendering and stream the resulting scene images to clients' device on the Internet. We model the client-server allocation (CSA) problem for balancing the GPU load between servers in a game streaming environment as an optimization problem, and propose a simulated annealing-based method. The features of our method are that the method takes into account the constraints on network delay and has the ability to automatically adjust the frame rate of game sessions if necessary.

Reduction of Presentation Latency in Thin-Client of Cloud System (클라우드 시스템의 씬 클라이언트에서의 표시 지연 절감)

  • Kang, Seung Soo;Ko, Hyun;Yoon, Hee Yong
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.4
    • /
    • pp.163-176
    • /
    • 2013
  • Cloud-based streaming game service has numerous merits, but it may suffer from presentation latency in a thin-client. It is an important issue especially for game service which needs instantaneous response to user inputs. This research proposes the methods for reducing the presentation latency between the server unit and the thin-client unit. The approaches proposed to be employed with server unit include the source/sync video format equalization, encoding format configuration according to the media type, and the S/W implementation for transmitting clock periodically. The methods for the thin-client unit include the decreasing the number of instructions, use of light encryption algorithm, and improvement on H/W decoding. The proposed schemes are tested with a commercialized streaming service platform, which reveals the reduction of presentation latency as large as a few hundred milliseconds and reaches the acceptable level (about 100 milliseconds).

Depth-based Mesh Modeling for Virtual Environment Generation (가상 환경 생성을 위한 깊이 기반 메쉬 모델링)

  • 이원우;우운택
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.111-114
    • /
    • 2003
  • In this paper, we propose a depth-based mesh modeling method to generate virtual environment. The proposed algorithm constructs mesh model from unorganized point cloud obtained from a multi-view camera. We separate the point cloud consisting objects from the background. Then, we apply triangulation to each object and background. Since the objects and the background are modeled independently, it is possible to construct effective virtual environment. The application of proposed modeling method is applicable to entertainment, such as movie and video game and effective virtual environment generation.

  • PDF

A Cloud-Edge Collaborative Computing Task Scheduling and Resource Allocation Algorithm for Energy Internet Environment

  • Song, Xin;Wang, Yue;Xie, Zhigang;Xia, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2282-2303
    • /
    • 2021
  • To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

Management Techniques of Interest Area Utilizing Subregions in MMORPG based on Cloud and P2P Architecture (클라우드와 P2P 구조 기반의 MMORPG에서 소영역을 활용하는 관심 구역의 관리 기법)

  • Jin-Hwan Kim
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.3
    • /
    • pp.99-106
    • /
    • 2023
  • In this paper, we propose subregion-based area of interest management techniques for MMORPG(massively multiplayer online role playing games) integrating P2P(peer-to-peer) networking and cloud computing. For the crowded region, the proposed techniques partition it into several subregions and assign a player to manage each subregion as a coordinator. These techniques include a load balancing mechanism which regulates communication and computation overhead of such player below the specified threshold. We also provide a mechanism for satisfying the criterion, where subregions overlapped with each player's view must be switched quickly and seamlessly as the view moves around in the game world. In the proposed techniques where an efficient provisioning of resources is realized, they relieve a lot of computational power and network traffic, the load on the servers in the cloud by exploiting the capacity of the players effectively. Simulation results show that the MMORPG based on cloud and P2P architecture can reduce the considerable bandwidth at the server compared to the client server architecture as the available resources grow with the number of players in crowding or hotspots.

Constructing AR Game Space through Cuboid Detection in Indoor Environment (실내 환경에서 직육면체 검출을 통한 AR 게임 공간 구성)

  • Kim, Ki-Sik;Park, Jong-Seung
    • Journal of Korea Game Society
    • /
    • v.21 no.5
    • /
    • pp.3-16
    • /
    • 2021
  • In this paper, we propose a method of constructing AR game spaces through cuboid detection in indoor environment. Conventional spatial recognition methods can detect planes only in limited spaces that can be well observed. They are also vulnerable in density and noise. The proposed method overcomes the limitations of the conventional method by constructing AR game spaces by a method of detecting OBBs from spherical videos. Experimental results showed that the proposed method is faster than the conventional method and it is also robust against environmental constraints such as changes in density and noisy.