• Journal of the Korea Society for Simulation
• /
• v.18 no.4
• /
• pp.39-47
• /
• 2009

Recently, the threat of DDoS attacks is increasing and many companies are planned to deploy the DDoS defense solutions in their networks. The DDoS attack usually transmits heavy traffic data to networks or servers and they cannot handle the normal service requests because of running out of resources. Since it is very hard to prevent the DDoS attack beforehand, the strategic plan is very important. In this work, we have conducted modeling and simulation of the DDoS attack by changing the number of servers and estimated the duration that services are available. In this work, the modeling and simulation is conducted using OPNET Modeler. The simulation result can be used as a parameter of trade-off analysis of DDoS defense cost and the service's value. In addition, we have presented a way of estimating the cost effectiveness in deployment of the DDoS defense system.

• The Journal of Bigdata
• /
• v.8 no.1
• /
• pp.131-156
• /
• 2023

The traditional retail industry significantly changed over the past decade due to the mobile and online technologies. This change has been accompanied by a shift in consumer behavior regarding purchasing patterns. Despite the rise of online shopping, there are still specific categories of products, such as "Processed food" in Mongolia, for which traditional shopping remains the preferred purchase method. To prepare for the inevitable future of retail businesses, firms need to closely analyze the performance of their offline stores to plan their further actions in a new multi-channel environment. Retailers must integrate diverse channels into their operations to stay relevant and adjust to the shifting market. In this research, we have analyzed the performance data such as sales, profit, and amount of sales of offline stores by using clustering approach. From the clustering, we have found the several distinct insights by comparing the circumstances and performance of retail stores. For the certain retail stores, we have proposed three different strategies: a fulfillment hub store between online and offline channels, an experience store to elongate customers' time on the premises, and a merge between two non-related channels that could complement each other to increase traffic based on the store characteristics. With the proposed strategies, it may enhance the user experience and profit at the same time.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.34 no.4
• /
• pp.747-761
• /
• 2024

Recently, modern vehicles have been controlled by Electronic Control Units (ECUs), by which the safety and convenience of drivers are highly improved. It is known that a luxury vehicle has more than 100 ECUs to electronically control its function. However, the modern vehicles are getting targeted by cyber attacks because of this computer-based automotive system. To address the cyber attacks, automotive manufacturers have been developing some methods for securing their vehicles, such as automotive Intrusion Detection System (IDS). This development is only allowed to the automotive manufacturers because they have databases for their in-vehicle network (i.e., DBC Format File) which are highly confidential. This confidentiality poses a significant challenge to external researchers who attempt to conduct automotive security researches. To handle this restricted information, in this paper, we propose a method to partially understand the DBC Format File by analyzing in-vehicle network traffics. Our method is designed to analyze Controller Area Network (CAN) traffics so that checksum signals are identified in CAN Frame Data Field. Also, our method creates a Lookup Set by which a checksum signal is correctly estimated for a given message. We validate our method with the publicly accessible dataset as well as one from a real vehicle.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.22 no.1
• /
• pp.1-18
• /
• 2019

This research measured and visualized the spatial dependency and the spatial heterogeneity of the small business in Cheonan-si, Asan-si with $100m{\times}100m$ grids based on global and local spatial autocorrelation. First, we confirmed positive spatial autocorrelation of small business in the research area using Moran's I Index, which is ESDA(Exploratory Spatial Data Analysis). And then, through Getis-Ord $GI{\ast}$, one kind of LISA(Local Indicators of Spatial Association), local patterns of spatial autocorrelation were visualized. These verified that Spatial Regression Model is valid for the location factor analysis on small business commercial buildings. Next, GWR(Geographically Weighted Regression) was used to analyze the spatial relations between the distribution of small business, hourly mobile traffic-based floating population, land use attributes index, residence, commercial building, road networks, and the node of traffic networks. Final six variables were applied and the accessibility to bus stops, afternoon time floating population, and evening time floating population were excluded due to multicollinearity. By this, we demonstrated that GWR is statistically improved compared to OLS. We visualized the spatial influence of the individual variables using the regression coefficients and local coefficients of determinant of the six variables. This research applied the measured population information in a practical way. Reflecting the dynamic information of the urban people using the commercial area. It is different from other studies that performed commercial analysis. Finally, this research has a differentiated advantage over the existing commercial area analysis in that it employed hourly changing commercial service population data and it applied spatial statistical models to micro spatial units. This research proposed new framework for the commercial analysis area analysis.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.3
• /
• pp.603-612
• /
• 2010

Recently, with the advance of computing and networking technique, the high speed internet becomes widespread, however, it is still hard job to do streaming the media which requires high network bandwidth over the internet. Previous VoD system researches for streaming over the internet mainly proposed techniques that controls the QoS(Quality of Service) of the media in proportion to the network status. Though, this could be the solution for the service provider while the service user who wants constant QoS may not satisfy with variable QoS. In the paper, we propose greedy precedent frame transmission technique, GPFT, for guarantee of constant QoS. In GPFT, Streaming VoD server prefetches precedent frames and transmits the frame greedily by increasing the frame transmission rate while the available network bandwidth is high. The GPFT uses the prefetched precedent frames to guarantee the QoS while the available network bandwidth is low. The experiment result shows that the proposed GPFT could guarantee the constant QoS by prefetching the frames adaptively to the network bandwidth with the characteristic of video stream.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.4
• /
• pp.65-77
• /
• 2013

Recently the ratio of the Internet traffic generated by video streaming applications including video-on-demand (VOD) is getting higher and higher, while P2P-based naive content distribution has been the main source of the Internet traffic in the past. As a result, the paradigm of cooperatively distributed systems (e.g., P2P) is changing to support streaming applications. Most P2P assisted approaches for video streaming today are based on Bit Torrent thanks to its simplicity of implementation and easy adaptability. They, however, have immanent vulnerability to free-riding inherited from Bit Torrent, which inevitably hurts their performance under limited system resources with free-riding. This paper studies the weakness to free-riding of existing Bit Torrent-based video streaming applications and investigates the adaptability of T-Chain (which was originally designed to prevent free-riding in cooperatively distributed systems) to video streaming applications. Our experiment results show that the video streaming approach based on T-Chain outperforms most existing Bit Torrent-based ones by 60% on average under limited system resources with free-riding.

• Journal of Digital Convergence
• /
• v.12 no.8
• /
• pp.1-18
• /
• 2014

Recently, many of the mobile network operators or telcos are introducing the LTE service in order to effectively cope with an explosive increasing mobile traffics due to an expansion of the use of smart phones. The 1.8GHz, 2.6GHz, and 800MHz band classes are most widely used for LTE. In particular, the 1.8GHz band class is the most useful one in terms of the reusability of the existing (2G) network, global harmonization, bandwidth, eco-system of equipments and devices, and so on. In recent years, major countries in the world have allocated the 1.8GHz band spectrum in a wide bandwidth unit suitable for the upcoming LTE-Advanced service. This paper surveyed the 1.8GHz band spectrum allocation policies of the 12 OECD countries, including Republic of Korea. From the survey, we have found that they rebuilt or refarmed the existing holders' bands, recovered the public (i.e., military)-use bands, and allocated the bands in a wide bandwidth and in an equal or similar size.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.9
• /
• pp.829-840
• /
• 2012

Recently, in network communication environments, it is changing very fast from wired to wireless. The open shortest path firtst (OSPF), one of link state routing protocols, mainly used in wired networks, is the routing method to select optimal traffic path as identifying the link state of neighbor routers. The traditional OSPF cost functions performs with first fixed cost permanently, unless the router link is changed. However, in wireless networks, the performance of links show big difference by other environment factors. The bit error rate (BER), a parameter which can quite affect link state in wireless networks, is not considered in the traditional OSPF cost functions. Only a link bandwidth is considered in the traditional OSPF cost functions. In this paper, we verify the various parameters which can affect link performance, whether it is permissible to use as the parameter of proposed cost functions. To propose new cost functions, we use the effective bandwidth. This bandwidth is calculated by proposed formula using the BER of the network link and link bandwidth. As applied by the proposed triggering condition, the calculated effective bandwidth decrease the unstable of network by generating less link state update messages in wireless networks that frequently changes the link state. Simulation results show that the proposed cost functions significantly outperforms the traditional cost functions in wireless networks in terms of the services of VoIP and data transmission.

• The KIPS Transactions:PartC
• /
• v.14C no.6
• /
• pp.519-524
• /
• 2007

One of the most important issues on the sensor network with resource limited sensor nodes is prolonging the network lifetime by effectively utilizing the limited node energy. The most representative mechanism to achieve a long lived sensor network is the clustering mechanism which can be further classified into the single hop mode and the multi hop mode. The single hop mode requires that all sensor nodes in a cluster communicate directly with the cluster head(CH) via single hop md, in the multi hop mode, sensor nodes communicate with the CH with the help of other Intermediate nodes. One of the most critical factors that impact on the performance of the existing multi hop clustering mechanism is the cluster size and, without the assumption on the uniform node distribution, finding out the best cluster size is intractable. Since sensor nodes in a real sensor network are distributed non uniformly, the fixed size mechanism may not work best for real sensor networks. Therefore, in this paper, we propose a new dynamic size multi hop clustering mechanism in which the cluster size is determined according to the distance from the sink to relieve the traffic passing through the CHs near the sink. We show that our proposed scheme outperforms the existing fixed size clustering mechanisms by carrying out numerical analysis and simulations.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.947-960
• /
• 1996

The primary goal for developing high performance ATM switching systems is to minimized the probability of cell loss, cell delay and deterioration of throughput. ATM switching element that is the most suitable for this purpose is the shared buffer memory switch executed by common random access memory and control logic. Since it is difficult to manufacture VLIS(Very Large Scale Integrated circuit) as the number of input ports increased, the used of switching module method the realizes 32$\times$32, 150 Mb/s switch utilizing 8$\times$8, 600Mb/s os 16$\times$16, 150Mb/s unit switch is latest ATM switching technology for small and large scale. In this paper, buffer capacity satisfying total-memory-reduction effect by buffer sharing in a shared buffer memory switch are analytically evalu ated and simulated by computer with cell loss level at traffic conditions, and also features of switching network utilizing the switching module methods in small and large-capacity ATM switching system is analized. Based on this results, the structure in outline of 32$\times$32(4.9Gb/s throughput), 150Mb/s switches under research in many countries is proposed, and eventually, switching-network structure for ATM switching system of small and large and capacity satisfying with above primary goals is suggested.