• Journal of Korea Multimedia Society
• /
• v.10 no.4
• /
• pp.483-491
• /
• 2007

This paper proposes a Situation Simulation Framework for implementing computer game and describes the possibility of analyzing game with unfolding situation. In last few years game systems have been evolving from the performance of physical engine, network traffic in the on line game to the representation of rendering physical phenomena. In computer game, a situation hierarchy structure which allows the designer for simulating high-level specifications of game structure. Logically simulated environment is created by defining situations and events based on hierarchy structure of the situation. We classify events into explicit event is occurred by user and implicit event is occurred by system. Our study defines the existence of objects is the most prevalent factor applied to any event in game world. The advantages of this approach are able to allow for providing the conceptual design for simulation game and analyzing the situation in the game world. And this method allows us to decrease the complexity of system design and abstraction modeling for the simulation game. Specially, the introduction of the definition of events allows us to approach game design in a structural manner rather than by their classification. The proposed method was implemented in the "Shooting BaDuk" among games.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3474-3497
• /
• 2016

Network Function Virtualization (NFV) and Software Defined Networking (SDN) are recently considered as very promising drivers of the evolution of existing middlebox services, which play intrinsic and fundamental roles in today's networks. To address the virtual service deployment issues that caused by introducing NFV or SDN to networks, this paper proposes an optimal solution by combining quantum genetic algorithm with cooperative game theory. Specifically, we first state the concrete content of the service deployment problem and describe the system framework based on the architecture of SDN. Second, for the service location placement sub-problem, an integer linear programming model is built, which aims at minimizing the network transport delay by selecting suitable service locations, and then a heuristic solution is designed based on the improved quantum genetic algorithm. Third, for the service amount placement sub-problem, we apply the rigorous cooperative game-theoretic approach to build the mathematical model, and implement a distributed algorithm corresponding to Nash bargaining solution. Finally, experimental results show that our proposed method can calculate automatically the optimized placement locations, which reduces 30% of the average traffic delay compared to that of the random placement scheme. Meanwhile, the service amount placement approach can achieve the performance that the average metric values of satisfaction degree and fairness index reach above 90%. And evaluation results demonstrate that our proposed mechanism has a comprehensive advantage for network application.

• Journal of Korean Society of Transportation
• /
• v.23 no.4 s.82
• /
• pp.37-45
• /
• 2005

This paper presents a relationship between Nash bargaining game and Wardrop user equilibrium, which has been widely used in transportation modeling for route choice problem. Wardrop user equilibrium assumes that drivers in road network have perfect information on the traffic conditions and they choose their optimal paths without cooperation each other. In this regards, if the bargaining game process is introduced in route choice modeling, we may avoid the strong assumptions to some extent. For such purpose, this paper derives a theorem that Nash bargaining solution is equivalent to Wardrop user equilibrium as the barging process continues and prove it with some numerical examples. The model is formulated based on two-person bargaining game. and n-person game is remained for next work.

• Journal of Korea Game Society
• /
• v.14 no.5
• /
• pp.35-42
• /
• 2014

In the market of First Person Shooter (FPS) games, Massively Multi-player Online FPS games (MMOFPS) like 'PlanetSide 2' have been popular recently. Dead reckoning has been widely used in order to mitigate the network traffic overload for the game server with hundreds or thousands of people. This paper proposes the efficient analytical method to calculate the tolerable threshold angle of moving direction, which is one of the most important factors for character status updating when dead reckoning is used in MMOFPS games. The experimental results with game testers shows that the proposed method minimizes the position error for character moving and provides natural direction updates of characters.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.1
• /
• pp.114-119
• /
• 2003

An efficient QoS routing scheme for improving on-line games services needs to find a path that satisfies a given noS requirements while consuming as few resources as possible. In this paper, we propose a scheme of calculating resources' costs for precomputation QoS routing schemes. For a domain in the networks. the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load. We. therefore, expect that the paths are better than any other paths in respect to reserving the network resources on paths. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme.

• ETRI Journal
• /
• v.37 no.1
• /
• pp.77-87
• /
• 2015

In wireless networks, cooperation is necessary for many protocols, such as routing, clock synchronization, and security. It is known that cooperator nodes suffer greatly from problems such as increasing energy consumption. Therefore, rational nodes have no incentive to cooperatively forward traffic for others. A rational node is different from a malicious node. It is a node that makes the best decision in each state (cooperate or non-cooperate). In this paper, game theory is used to analyze the cooperation between nodes. An evolutionary game has been investigated using two nodes, and their strategies have been compared to find the best one. Subsequently, two approaches, one based on a genetic algorithm (GA) and the other on learning automata (LA), are presented to incite nodes for cooperating in a noisy environment. As you will see later, the GA strategy is able to disable the effect of noise by using a big enough chromosome; however, it cannot persuade nodes to cooperate in a noisefree environment. Unlike the GA strategy, the LA strategy shows good results in a noise-free environment because it has good agreement in cooperation-based strategies in both types of environment (noise-free and noisy).

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.73-81
• /
• 2011

The WBAN(Wireless Body Area Network) technology is a short distance wireless network which provides each device's interactive communication by connecting devices inside and outside of body located within 3 meters. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. The The WBAN servides consists of both medical and non-medical applications. The medical application service uses the sensor that transfer the periodic traffic and have different data rates. It uses GTS method to guarantee QoS. In this paper, a new method is proposed, which are suitable design for MAC Protocol. Firstly, MAC frame structure and a primitive based on the WBAN are proposed. Secondly, we proposed the GTS algorithm improved the channel utilization based on the WFQ(Weighted Fair Queuing). The proposed scheduling method is improved channel utilization compared with i-Game(Round Robin scheduling method).

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.734-740
• /
• 2010

In this paper, we propose an effective energy management algorithm for wireless networks. The proposed algorithm sets the multiple routing paths and transmits routing packets based on the cooperative game model. This approach can enhance the network performance under different and diversified network situations. The simulation results demonstrate that the proposed algorithm generally exhibits superior performance compared with the other existing scheme under light to heavy traffic loads.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3775-3788
• /
• 2014

With the increasing number of the wireless and mobile networks, the way that people use the Internet has changed substantively. Wireless multimedia services, such as wireless video streaming, mobile video game, and mobile voice over IP, will become the main applications of the future wireless Internet. To accommodate the growing volume of wireless data traffic and multimedia services, cognitive radio (CR) and Information-Centric Network (ICN) have been proposed to maximize the utilization of wireless spectrum and improve the network performance. Although CR and ICN have high potential significance for the future wireless Internet, few studies have been conducted on collaborative operations of CR and ICN. Due to the lack of infrastructure support in multi-hop ad hoc CR networks, the problem is more challenging for video streaming services. In this paper, we propose a Cross-layer Video Streaming Mechanism (CLISM) for Cognitive Radio Ad Hoc Information Centric Networks (CRAH-ICNs). The CLISM included two distributed schemes which are designed for the forwarding nodes and receiving nodes in CRAH-ICNs. With the cross-layer approach, the CLISM is able to self-adapt the variation of the link conditions without the central network controller. Experimental results demonstrate that the proposed CLISM efficiently adjust video transmission policy under various network conditions.