• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4C
• /
• pp.441-447
• /
• 2004

Information security simulator is required for the study on the cyber intrusion and defense as information security has been increasingly popular Until now, the main purposes of information security simulation are security estimation of small network as well as performance analysis of information protection systems. However, network simulators that can simulate attacks in a huge network are in needs since large scale internet attacks are very common in these days. In this paper we proposed a simulator design and its implementation details. Our simulator is implemented by expanding the SSFNet program to the client-sewer architecture. A cyber attack scenario used in our simulator is composed by the advanced attack tree model. We analyzed the simulation results to show the correctness of our network defense simulator.

• International Journal of Advanced Culture Technology
• /
• v.11 no.2
• /
• pp.315-322
• /
• 2023

Intelligent IoT environments that accommodate a very large number of clients require technologies that provide secure information service regardless of the number of clients. Wireless data broadcast is an information service technique that ensures scalability to deliver data to all clients simultaneously regardless of the number of clients. In wireless data broadcasting, clients access the wireless channel linearly to explore the data, so the access time of clients is greatly affected by the broadcast cycle. Data compression-based data broadcasting can reduce the broadcast cycle and thus reduce client access time. Therefore, a simulation framework that can evaluate the performance of data broadcasting by applying different data compression algorithms is essential and important. In this paper, we propose a simulation framework to evaluate the performance of data broadcasting that can adopt data compression. We design the framework that enables to apply different data compression algorithms according to the data characteristics. In addition to evaluating the performance according to the data, the proposed framework can also evaluate the performance according to the data scheduling technique and the kind of queries the client wants to process. We implement the proposed framework and evaluate the performance of data broadcasting using the framework applying data compression algorithms to demonstrate the performances of data compression broadcasting.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.166-172
• /
• 2020

Video streaming application such as YouTube is one of the most popular mobile applications. To adjust the quality of video for available network bandwidth, a streaming server provides multiple representations of video of which bit rate has different bandwidth requirements. A streaming client utilizes an adaptive bit rate scheme to select a proper video representation that the network can support. The download behavior of video streaming client player is governed by several parameters such as maximum buffer size. Especially, the size of the maximum playback buffer in the client player can greatly affect the user experience. To tackle this problem, in this paper, we propose the maximum buffer size optimization according to available network bandwidth and buffer status. Our simulation study shows that our proposed buffer size optimization scheme successfully mitigates playback stalls while preserving the similar quality of streaming video compared to existing ABR schemes.

• Journal of the Korean Society of Industry Convergence
• /
• v.18 no.2
• /
• pp.75-81
• /
• 2015

This study proposes an articulated robot control system using an on/off-line robot graphic simulator with multiple networks. The proposed robot control system consists of a robot simulator using OpenGL, a robot controller based on a DSP(TMS320) motion board, and the server/client communication by multiple networks. Each client can control the real robot through a server and can compare the real robot motion with the virtual robot motion in the simulation. Also, all clients can check and analyze the robot motion simultaneously through the motion image and data of the real robot. In order to show the validity of the presented system, we present an experimental result for a 6-axis vertical articulated robot. The proposed robot control system is useful, especially, in the industrial fields using remote robot control as well as industrial production automation with many clients.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1209-1218
• /
• 2003

To guarantee client buffer stabilization and visual quality, the VOD service that provides real time video titles on requirements of numerous users, needs a mechanism which transfers frames with dropping or skipping algorithm by network condition. In this paper, we show an algorithm that transfers withdrawed skipped MPEG frames(I, P, B frame) from disk to client dependent on network load. Moreover, we verify through a simulation that adaptive dealing on network load can reduce the network load and stabilize client receiving buffer.

• Journal of Korea Multimedia Society
• /
• v.17 no.4
• /
• pp.433-440
• /
• 2014

Wireless communication offers the flexibility to the node movement at the spatial dimension more than the wire communication not only in IP architecture but also in Content-Centric Networking. Although it gives such advantage, the intra-domain movement of a node especially the data source node affects the communication to the access point node which in the end affects the acceptance ratio of the client node that requests the data packets from the data source node. In this paper, we use time-division access method to maintain the acceptance ratio of the client node as the effect of the intra-domain data source node movement in Content-Centric Networking. The simulation result shows that the acceptance ratio of the client node can be maintained using the time-division access method as long as the interval access time is less than the coherence time.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.65-65
• /
• 2000

For Video on Demand(VoD) servers, a design of an efficient scheduler is important to the support a large number of clients having various playback speeds and receiving rates. In this paper, we propose the scheduling algorithm to handle establishing deadlines and selection using the earliest deadline first. To establish deadlines and selections, the period of the receiving rates for each client is located between the over-max receiving rate and the over-playback rate. To avoid video starvation and the buffer overflow of each client, the proposed algorithm guarantees providing the admission control. Because of establishing deadlines and selection, period of each client receiving is between one over max receiving rate and one over play back rate. Using Virtual Buffer in server, scheduling load is reduced. The efficiency of the proposed algorithm is verified using a Petri Net_Based simulation tool, Exspect.

• Journal of the Semiconductor & Display Technology
• /
• v.3 no.4
• /
• pp.13-17
• /
• 2004

As the usage of wireless LAN becomes common in working environment, the number of database systems that support both wired and wireless users increases rapidly. The characteristics of wireless LAN that its speed is slow relatively comparing to wired network and the users in its environment connects to different communication points as they moves creates another challenge to be resolved in database systems. In the environment of hybrid communication systems, wired and wireless for voluminous data amount and a number of users, the two layer architecture of the conventional client-server database systems has limitation in the system performance. This is due to that server is the only point of data service in client-server database systems. In this paper, we discuss a new extended database system architecture that data services are distributed among servers and clients based on user database access patterns in order to improve system performance. We analyze the expected system performance by using simulation technique and prove the practical utilization of the system by demonstrating experimental results.

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.647-656
• /
• 2001

Video delivery from a server to a client across a network system is an important part of many multimedia applications. Usually, the network system has constraint in both the amount of network bandwidth and the buffer size in the client. While delivering a video stream across such a constrained network system, loss of frames may be unavoidable. The system resources consumed by the dropped frames are wasted, and the losses of frames would result in discontinuous display at the client. In this paper, for delivering hierarchically encoded video stream, we introduce the notion of selective layer discard algorithm at the server which not only preemptively discards data at the server but also drops less important part of a frame instead of the entire frame. By the simulation, we compare the proposed selective layer discard algorithm and the existing selective frame discard algorithm. The simulation results show that the proposed algorithm may improve the quality of decoded video, and decrease the replay discontinuity at the client.

• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.561-572
• /
• 2003

Broadcast-based data delivery has attracted a lot of attention as an efficient way of disseminating data to very large client populations. The main motivation of broadcast-based information systems (BBISs) is that the number of clients that they serve can grow arbitrarily large without any effect on their performance. The performance of BBISs depends mainly on client caching strategies and on data broadcast scheduling mechanisms. This paper addresses the former issue and proposes a new client cache management scheme, named 2Q-CFP, that is suitable to BBISs. This paper also evaluates the performance of 2Q-CFP on the basis of a simulation model. The performance results indicate that 2Q-CFP scheme shows superior performances over GRAY, LRU and CF in the average response time.