• Journal of Korea Game Society
• /
• v.15 no.6
• /
• pp.97-106
• /
• 2015

In an Unity engine for multi-player online games, the main thread processing game logic must be separated from the network thread that is responsible for network packet communication. Packet communication between the network threads needs to drop packets that overlap in order to improve the rendering speed. In this paper, the packet discard policy of network thread is proposed for an Unity engine for multi-player online games. The proposed method is the hybrid method of both Partial Packet Discard and Periodic Packet Discard methods to improve the rendering speed by periodically discarding overlapped network packets managed by the queue. The rendering speed of the proposed method is analyzed and its effectiveness is verified by various packet generating simulations of the Unity engine for multi-player online games.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.2
• /
• pp.97-104
• /
• 2013

This paper introduces waiting time based periodic packet discard policy for frame based scheduler. This policy can be used with conventional packet discard policy or buffer management schemes, such as drop-tail or random early detection. Proposed discard policy discards packets, which are stayed in the buffer longer than threshold, at every period of scheduling. This decision of discard is based on waiting time of packet. In this paper, mathematical analysis is performed with situation of network congestion. Also, the simulation is performed to evaluate the performance of proposed discard policy. In the result, proposed discard policy can limit queuing delay by threshold. Also, if the packet discard is performed before scheduling and threshold is set with smaller value than frame length, it can limit the throughput of traffic.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.18 no.4
• /
• pp.423-431
• /
• 2015

A leased line modem usability was evaluated and investigated in the wireless internet protocol(IP) network. The signal of the modem in the circuit switching network was translated to IP packet by using several voice codecs (PCM, G.711A, $G.711{\mu}$, and etc.) and transmitted through the wireless IP network. The wireless IP network was simulated by the Tactical information and communication network Modeling and simulation Software(TMS). The performance and usability of the leased line modem are simulated using the system-in-the-loop(SITL) function of TMS with respect to packet delay, jitter, packet discard ratio, codecs, and wireless link BER.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.06a
• /
• pp.49-54
• /
• 1997

For the purpose of a flexible coded video transmission over a heterogeneous network, we propose a new packetization method for coded video data. The proposed method achieves small degradation of coded picture quality in case of packet discard at the network node and does not require heavy processing load for bitrate control operation. Computer simulation results show that the bitrate reduction from 384 kb/s to 192 kb/s does not cause severe degradation in picture quality.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.221-224
• /
• 2000

The issue of supporting TCP traffic over ATM networks is currently one of the most important issues in the field of data networks. One important part of this issue is congestion control. In general, congestion control uses method such as packet drop to relieve network resource when the network is congested so as to maintain high throughput and low delay. In addition, congestion control is required to ensure fair sharing of resources among all users during congestion. In this paper we propose a new congestion control method using WRED & per-VC accounting mechanism. This packet discard scheme is proposed with the goal to provide both good performance in terms of throughput and fairness in terms of bandwidth exploitation of the output link among all virtual circuits.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.2
• /
• pp.35-38
• /
• 1998

We need the packet transmission of voice, data and video according to the development of ATM technology and packet network. In ATM, packet is parted to the constant length data, we called cell, the method is needed to minimize data loss. Because over ATM, we discard error cell without correction in transmission. So, about video, there is layered coding method. We simulated the coding using wavelet transform, which is structurally layed coded, so need not the additional coder.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.9A
• /
• pp.1535-1541
• /
• 2001

TCP is the most widely-used transport layer protocol in current Internet, while ATM technology is used to increase the data communication speed at data link layer and network layer. In the TCP-over-ATM architecture, the most significant problems are (i) the partial packet discarding problem, and (ii) the TCP window timeout problem. Several approaches have been proposed to solve the partial packet discard problem and the timeout problem individually, but none of them considered the two problems together. In this paper, we propose an enhanced UBR+ scheme which supports fairness among the TCP connections using UBR+ scheme, and provides protection of damaged VC from the multiple packet losses in the same TCP sliding window. To analyze its performance, we simulate the proposed scheme using OPNET. The simulation results show that the proposed scheme supports fairness, and also increases the throughput by reducing the probability of multiple cell losses in the same TCP window.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2027-2034
• /
• 1997

Frame relay is a fast packet switching technology that performs relaying and multiplexing frames with variable lengths over a wide area link at the T1 or E1 speed, by elminating error and flow control in the network. In frame relay networks, congestion control is typically performed through the rate enforcement with a discard eligibility (DE) bit, and the explicit negative feedback meachanisms using explicit congetion notification bits. In this paper, we consider the congestiong control scheme using the rate enforcement mechanism with DE bit for frame relay network. Assuming that each frame with exponentially distributed length arrives according to the Poission fashion, we can treat the frame relay switch as an M/M/1/K priority queueing system with pushout basis. We analyze and present the blocking probabilities and waiting time distributions of frames.

• Convergence Security Journal
• /
• v.14 no.7
• /
• pp.17-22
• /
• 2014

Wireless Ad hoc Network is threatened from many types of attacks because of its open structure, dynamic topology and the absence of infrastructure. Attacks by malicious nodes inside the network destroy communication path and discard packet. The damage is quite large and detecting attacks are difficult. In this paper, we proposed attack detection technique using secure authentication infrastructure for efficient detection and prevention of internal attack nodes. Cluster structure is used in the proposed method so that each nodes act as a certificate authority and the public key is issued in cluster head through trust evaluation of nodes. Symmetric Key is shared for integrity of data between the nodes and the structure which adds authentication message to the RREQ packet is used. ns-2 simulator is used to evaluate performance of proposed method and excellent performance can be performed through the experiment.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.199-202
• /
• 2001

In this paper, we proposed and analyzed a new class of irregular fault-tolerant multistage interconnection network named as Extended-QT(Quad Tree) network. E-QT network is extended QT network. A unique path MIN usually is low hardware complexity and control algorithm. So we proposes a class of multipath MIN which are obtained by adding self-loop auxiliary links at the a1l stages in QT(Quad Tree) networks so that they can provide more paths between each source-destination pair. The routing of proposed structure is adaptived and is based by a routing tag. Starting with the routing tag for the minimum path between a given source-destination pair, routing algorithm uses a set of rules to select switches and modify routing tag. Trying the self-loop auxiliary link when both of the output links are unavailable. If the trying is failure, the packet discard. In simulation, an index of performance called reliability and cost are introduced to compare different kinds of MINs. As a result, the prouosed MINs have better capacity than 07 networks.