• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.416-419
• /
• 2004

Computer simulation has used to a area of military training in recent years. Computer simulation endow a military nan with field raining such as combat experience without operating combat strength or capabilities. To samely construct simulation environment against actual combat environment is to well construct ㏈ to operate war game model, associate among federates on network. we construct virtual combat environment enabling to efficiently manage network traffic among federates(or active nodes) on active network that construct virtual military training spare such as urgent combat field needed to rapidly transfer combat information including image and video.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.83-91
• /
• 2022

This paper proposes a scalable hybrid P2P(peer-to-peer) cloud architecture for MMOGs(massively multiplayer online games) which includes load management schemes for each region. A game world is divided into several game regions and each game region is serviced by at least one peer(player) in this MMOG cloud environment. The load must be managed regionally to support smooth interactions among them even in the presence of a high concentration of players in a specific region. In the proposed architecture where an efficient and effective provisioning of resources is realized, it is suitable for players to interact with cloud servers effectively and it avoids bottlenecks of the current client-server MMOG architecture. This architecture also relieves a lot of computational power and network traffic, the load on the servers in the cloud by exploiting the capacity of the players. Simulation results show that the proposed hybrid P2P cloud 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.991-1000
• /
• 2010

The Hierarchical Mobile IPv6 (HMIPv6) has been proposed to accommodate frequent mobility of the Mobile Node. HMIPv6 can effectively reduce the signaling overhead and latency. However, it has a problem that the registration of a mobile node concentrates on the furthest MAP(Mobility Anchor Point) when the mobile node enters into a new domain. This paper proposes a new load distribution mechanism by using the concept of Nash Bargaining Solution. The main advantage of the proposed scheme can prevent load concentration from being registered to the specified MAP based on the weight value according to the available resource-ratio of a MAP. With a simulation study, the proposed scheme can improve network performance under widely diverse traffic load intensities.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5322-5342
• /
• 2016

In vehicle-to-vehicle (V2V) networks, where selfishness degrades node activity, countermeasures for collaboration enforcement must be provided to enable application of a sage and efficient network environment. Because vehicular networks feature both high mobility and various topologies, selfish behavior judgment and establishment of a stable routing protocol become intensely challenging. In this paper, a two-phase-based generous cooperative routing protocol (called GEC) is presented for V2V networks to provide resistance to selfishness. To detect selfish behaving vehicles, a packet forwarding watchdog and an average connection rate based on the multipath weight method are used, where evidence is gathered from different watchdogs. Then, multihop relay decisions are made using a generous cooperative algorithm based on game theory. Finally, through buffering of the multiple end-to-end paths and judicious choice of optimal cooperative routes, route maintenance phase is capable of dealing with congestion and rapidly exchanging traffic. Specifically, it is proved that the GEC is theoretically subgame perfect. Simulation results show that for V2V networks with inherently selfish nodes, the proposed method isolates uncooperative vehicles and is capable of accommodating both the mobility and congestion circumstances by facilitating information dissemination and reducing end-to-end delay.

• Electronics and Telecommunications Trends
• /
• v.8 no.3
• /
• pp.39-52
• /
• 1993

This study involves a Common Cause Failure (CCF) problem on the ultra-high reliability required system development such as war game operations, nuclear power control, air traffic control, space shuttle missions, and large scale network communication system. The system situation problems are defined according to CCF, reliability and system fault identifications for the development cast verifications in the multi-version redundant software system. Then, CCF analysis of redundant system, system principles and statistical dependence are also described. This validation oh the CCF in the human software interaction system will notify software engineers to conceive what really is CCF contribution factor, not only the internal but the external ones.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1201-1204
• /
• 2002

인터넷의 폭발적인 발전과 더불어 온라인 게임은 인터넷 산업을 주도하는 원동력이 되고 있다. 최근 온라인 게임은 유선통신망에서 무선통신망으로 사업범위를 넓혀 핸드폰이나 PDA 등의 무선단말기에서도 게임을 즐길 수 있게 되었다. 그러나, 온라인 게임의 전송프로토콜로 이용되고 있는 TCP 프로토콜은 무선통신 환경의 높은 비트 오류율로 인하여 폭주제어 알고리즘이 오동작을 일으키며 이로 인하여 전체적인 게임 서비스의 성능이 저하된다. 따라서 본 논문에서는 무선 온라인 게임 네트워크에서 TCP 프로토콜의 성능을 개선시키기 위한 응답패킷 분할 기법을 제안하였다. 제안된 기법은 컴퓨터 시뮬레이션을 통해 성능을 분석하였으며, 그 결과 기존의 TCP 프로토콜에 비하여 성능이 향상되었음을 확인하였다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.10
• /
• pp.299-308
• /
• 2023

As the spectrum shortage problem has accelerated by the emergence of various services, New Radio-Unlicensed (NR-U) has appeared, allowing users who communicated in licensed bands to communicate in unlicensed bands. However, NR-U network users reduce the performance of Wi-Fi network users who communicate in the same unlicensed band. In this paper, we aim to simultaneously maximize the fairness and throughput of the unlicensed band, where the NR-U network users and the WiFi network users coexist. First, we propose an optimal power allocation scheme based on Monte Carlo Policy Gradient of reinforcement learning to maximize the sum of rates of NR-U networks utilizing rate-splitting multiple access in unlicensed bands. Then, we propose a channel occupancy time division algorithm based on sequential Raiffa bargaining solution of game theory that can simultaneously maximize system throughput and fairness for the coexistence of NR-U and WiFi networks in the same unlicensed band. Simulation results show that the rate splitting multiple access shows better performance than the conventional multiple access technology by comparing the sum-rate when the result value is finally converged under the same transmission power. In addition, we compare the data transfer amount and fairness of NR-U network users, WiFi network users, and total system, and prove that the channel occupancy time division algorithm based on sequential Raiffa bargaining solution of this paper satisfies throughput and fairness at the same time than other algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1074-1086
• /
• 2015

We Relay-assisted cellular network architecture has been developed to cover cell-edge users and to improve capacity. However, the deployment of relay stations (RSs) in cellular networks may increase the total energy consumption. Though energy efficiency has become a major concern in cellular networks, little work has studied the energy efficiency of relay-assisted cellular networks by sleep scheduling. In this paper, a distributed base stations (BSs) sleep scheduling scheme in relay-assisted cellular networks is proposed. The goal is to maximize the energy efficiency under the spectral efficiency constraint. Firstly, whether the BSs should be sleeping or active is determined by the traffic profile. Then, the transmission powers of the active BSs are optimized within the game-theoretic framework, by using an interior-point method, so as to maximize the energy efficiency. Simulation results demonstrate that the effectiveness of the proposed scheme is superior to that turning on all the BSs without sleep scheduling.

• Proceedings of the Korea Port Economic Association Conference
• /
• 2006.08a
• /
• pp.1-12
• /
• 2006

As national economies globalize, demand for intercontinental container shipping services is growing rapidly, providing a potential economic boon for the countries and communities that provide port services. On the promise of profits, many governments are investing heavily in port infrastructure, leading to a possible glut in port capacity, driving down prices for port services and eliminating profits as ports compete for business. Further, existing ports are making strategic investments to protect their market share, increasing the chance new ports will be overcapitalized and unprofitable. Governments and port researchers need a tool for understanding how local competition in their region will affect demand for port services at their location, and thus better assess the profitability of a prospective port. We propose to develop such a tool by extending our existing simulation model of global container traffic to incorporate demand-side shipper preferences and supply-side strategic responses by incumbent ports to changes in the global port network, including building new ports, scaling up existing ports, and unexpected port closures. We will estimate shipper preferences over routes, port attributes and port services based on US and international shipping data, and redesign the simulation model to maximize the shipper's revealed preference functions rather than simply minimize costs. As demand shifts, competing ports will adjust their pricing (short term) and infrastructure (long term) to remain competitive or defend market share, a reaction we will capture with a game theoretic model of local monopoly that will predict changes in port characteristics. The model's hypotheses will be tested in a controlled laboratory experiment tailored to local port competition in Asia, which will also serve to demonstrate the subtle game theoretic concepts of imperfect competition to a policy and industry audience. We will apply the simulation model to analyze changes in global container traffic in three scenarios: addition of a new large port in the US, extended closure of an existing large port in the US, and cooperative and competitive port infrastructure development among Korean partner countries in Asia.

• Journal of Internet of Things and Convergence
• /
• v.10 no.2
• /
• pp.77-84
• /
• 2024

Over the past few years, IoT edges have begun to emerge based on new low-latency communication protocols such as 5G. However, IoT edges, despite their enormous advantages, pose new complementary threats, requiring new security solutions to address them. In this paper, we propose a cloud environment-based IoT edge architecture model that complements IoT systems. The proposed model acts on machine learning to prevent security threats in advance with network traffic data extracted from IoT edge devices. In addition, the proposed model ensures load and security in the access network (edge) by allocating some of the security data at the local node. The proposed model further reduces the load on the access network (edge) and secures the vulnerable part by allocating some functions of data processing and management to the local node among IoT edge environments. The proposed model virtualizes various IoT functions as a name service, and deploys hardware functions and sufficient computational resources to local nodes as needed.