• Journal of Korea Game Society
• /
• v.10 no.3
• /
• pp.83-92
• /
• 2010

The command that game users give should be reflected to the game immediately and should be transferred to several objects at once. Also, all game users who participate in game should keep the same progress situation in Real-Time Strategy game. But it takes a certain amount of time to get the command pass to other users, and it is important issue that many commands are synchronized in a short amount of time on server of RTS game. Therefore we propose a scheme for an efficient synchronization based on event locking method on RTS game in this paper. We design and implement the gaming server applying to our proposed scheme. Also, we show efficiency of our proposed scheme by performance analysis in this paper.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.4
• /
• pp.457-467
• /
• 2002

In order to simulate cyber attacks and predict network behavior by attacks, we should represent attributes of network components in the simulation model, and should express characteristics of systems that carry out various cyber attacks and defend from these attacks. To simulate how network load may change under the cyber attacks, we extended SSF[9, 10] that is process-based event-oriented simulation system. We added a firewall class and a packet manipulator into the SSFNet that is a component of SSF. The firewall class, which is related to the security, is to simulate cyber attacks, and the packet manipulator is a set of functions to write attack programs for the simulation. The extended SSFNet enables to simulate a network with the security systems and provides advantages that make easy to port already exsiting attack programs and apply them to the simulation evironment. We made a vitual network model to verify operations of the added classes, and simulated a smurf attack that is a representative denial of sevive attack, and observed the network behavior under the smurf attack. The results showed that the firewall class and packet manipulator developed in this paper worked normaly.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.4
• /
• pp.399-422
• /
• 2009

Although current wireless mesh network (WMN) applications experience a perceptually uninterrupted hand-off, their throughput after the hand-off event may be significantly degraded due to the low available bandwidth of the mobile client's new master. In this paper, we propose a novel mobility management scheme for 802.11-based WMNs that enables both seamless hand-off for transparent communications, and bandwidth awareness for stable application performance after the hand-off process. To facilitate this, we (i) present a new buffer moment in support of the fast Layer-2 hand-off mechanism to cut the packet loss incurred in the hand-off process to zero and (ii) design a dynamic admission control to grant joining accepts to mesh clients. We evaluate the benefits and drawbacks of the proposal for both UDP and TCP traffic, as well as the fairness of the proposal. Our results show that the new scheme can not only minimize hand-off latency, but also maintain the current application rates of roaming users by choosing an appropriate new master for joining.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.157-166
• /
• 2001

A simulation package has been developed as an event-driven system that can handle the hardware configuration of STC104 and algorithm proposed in the sister paper of ‘Study on High Speed Routers(II).’After various STC104 topology of meshes, torus, and hypercubes are constructed using up to 512 switches, the performance of each topology has been analyzed under different message generation rate in terms of throughputs, latency, and packet blocking time. Modified multicast algorithms for STC104 have been proposed for STC104 after U-mesh and U-torus in order to overcome the multicasting difficulty because of the point-to-point communication method found in STC104. The performance of the multicast algorithms have been analyzed over meshes and torus configuration. Throughput gets higher in the order of mesh, torus, and hypercube. Throughput difference among topology were distinctive in the zone of high message generation rate. Latency and blocking time increased in the order of hypercube, torus, and mesh. U-mesh and U-torus of software multicast showed similar throughput, however, U-mesh peformed slightly better result. These algorithms showed eight to ten times better results compared to individual message pass for 90 destination nodes. Multi-link environment also showed better performance than single-link environment because multi-link network used the extra links for communication.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.619-622
• /
• 2004

For recent years, hacking is in the trends of making excessive traffic unnecessarily to obstruct the service by getting a system's performance down. And we can also see systems paralyzed in service ability due to the flash crowds of normal traffic to a popular website. This is an important problem certainly solved in the point of QoS guarantee for the clients. It is known that the former is DDoS(Distributed Denial of Service) attack and the latter is FE(Flash Event). These two are samely anomalous traffic because these make excessive congestion on the network or system and downgrade the system's service ability. In this paper, we propose a scheme for protecting the system against anomalous traffic and for guaranteeing the QoS. For this, a server records and maintains the information of clients accessed more than one time before when it is in normal condition. When it falls into the congestion, the records are used for filtering the spoofed IP. We send and receive the ICMP request/reply packet to know whether the IP is spoofed. And we also propose for applying the object spliting of CDN to guarantee the QoS in the initial FE situation.

• Journal of the Korea Society for Simulation
• /
• v.11 no.2
• /
• pp.1-16
• /
• 2002

The need for network security is being increasing due to the development of information communication and internet technology. In this paper, firewall models, operating system models and other network component models are constructed. Each model is defined by basic or compound model, referencing DEVS formalism. These models and the simulation environment are implemented with MODSIM III, a general purpose, modular, block-structured high-level programming language which provides direct support for object-oriented programming and discrete-event simulation. In this simulation environment with representative attacks, the following three attacks are generated, SYN flooding and Smurf attack as an attack type of denial of service, Mail bomb attack as an attack type of e-mail. The simulation is performed with the models that exploited various security policies against these attacks. The results of this study show that the modeling method of packet filtering system, proxy system, unix and windows NT operating system. In addition, the results of the simulation show that the analysis of security performance according to various security policies, and the analysis of correlation between availability and confidentiality according to security empowerment.

• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.212-218
• /
• 2021

Low-power and Lossy Networks (LLNs) have become the common network infrastructure for a wide scope of Internet of Things (IoT) applications. For efficient routing in LLNs, IETF provides a standard solution, namely the IPv6 Routing Protocol for LLNs (RPL). It enables effective interconnectivity with IP networks and flexibly can meet the different application requirements of IoT deployments. However, it still suffers from different open issues, particularly in large-scale setups. These include the node unreachability problem which leads to increasing routing losses at RPL sink nodes. It is a result of the event of memory overflow at LLNs devices due to their limited hardware capabilities. Although this can be alleviated by the establishment of multi-sink topologies, RPL still lacks the support for effective load balancing among multiple sinks. In this paper, we address the need for an efficient multi-sink load balancing solution to enhance the performance of PRL in large-scale scenarios and alleviate the node unreachability problem. We propose a new RPL objective function, Multi-Sink Load Balancing Objective Function (MSLBOF), and introduce the Memory Utilization metrics. MSLBOF enables each RPL node to perform optimal sink selection in a way that insure better memory utilization and effective load balancing. Evaluation results demonstrate the efficiency of MSLBOF in decreasing packet loss and enhancing network stability, compared to MRHOF in standard RPL.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.211-217
• /
• 2008

Recently, there are many efforts to support seamless mobility in 802.11 WLANs using IP Layer mobility protocols. The IP layer mobility protocols are the most efficient mechanism to guarantee the service session continuity when IP subnet is changed during handover. Even if the IP layer mobility protocols are quite efficient, the feature of the protocols that had been designed to consider only L3 layer makes it difficult to improve the performance of hand over more and more. Nowadays, to overcome this limitation of IP mobility protocols, many researchers have worked on the mobility protocols integration of different layers (e.g., L2 layer). In this paper, we propose the enhanced Proxy MIPv4 to minimize the latency of handover using MIH protocol in 802.11 WLANs. The proposed mechanism minimizes the latency of authentication by exchanging security keys between Access Routers during handover. Moreover, it also minimizes packet losses by Inter-AP Tunneling and data forwarding.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.6
• /
• pp.261-270
• /
• 2017

With the development of smart on-devices and communication technology, demand for non-stop services is increasing. Therefore, the high availability for continuously providing services in the event of system failure has been spotlighted. Meanwhile, because most internet-based services are provided by using TCP, an efficient TCP session recovery technique for providing non-stop services is required. However, the existing TCP session recovery techniques are inefficient because it has a high recovery cost or does not support failover operation, To solve these problems, in this paper, we propose a TCP session recovery technique for high availability in smart on-devices. For this, we first recover the TCP session without re-establish the TCP session by correcting a sequence number and a acknowledgment number. Second, we synchronize the TCP session recovery data between the master and the server, and then we operate the failover operation when master server fails. Finally, we provide the non-stop service to peer by using the virtual IP number and the transmission of GARP (Gratuitous ARP) packet.

• The Journal of the Korea Contents Association
• /
• v.11 no.2
• /
• pp.69-78
• /
• 2011

Recently, the bandwidth available to an end user has been dramatically increasing with the advancing of network technologies. This high-speed network naturally requires faster and/or stable data transmission techniques. The UDT(UDP based Data Transfer protocol) is a UDP based transport protocol, and shows more efficient throughput than TCP in the long RTT environment, with benefit of rate control for a SYN time. With a NAK event, however, it is difficult to expect an optimum performance due to the increase of fixed sendInterval and the flow control based on the previous RTT. This paper proposes a rate control method on following a NAK, by adjusting the sendInterval according to some degree of RTT period which calculated from a set of experimental results. In addition, it suggests an improved flow control method based on the TCP vegas, in order to predict the network congestion afterward. An experimental results show that the revised flow control method improves UDT's throughput about 20Mbps. With combining the rate control and flow control proposed, the UDT throughput can be improved up to 26Mbps in average.