• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.149-153
• /
• 2012

We propose a traffic information service for which traffic data are collected over ad-hoc networks from neighbor vehicles, processed to minimize the data size, and eventually provided to its destination. The proposed scheme simply relies on the existing navigtion systems in vehicles and wireless communication devices for vehicle-to-vehicle communication, rather than on a separately established server. It allows collecting and analyzing traffic status of large areas without incorporating separated monitoring systems, e.g., probe cars and enables to provide accurate traffic information to drivers in timely manner. We also evaluate its performance by ns-3 simulation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.81-88
• /
• 2014

These days the researches using IT technologies have been done to decrease the traffic accident. Especially, the optimal safety speed considering the weather conditions have to be calculated in real time to protect the traffic accident on the high way in the case of the rain and snow. In this paper, we have simulated the automatic warning broadcasting system for the freezing and foggy regions based on Web to protect the traffic accident. Also, we have developed the simulator that can provide the drivers with the optimal safety speed in real time to protect the traffic accident even under the worst weather conditions using the Fuzzy Reasoning rules.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.8
• /
• pp.5256-5262
• /
• 2014

Recently, Distributed Denial of Service (DDoS) attacks, such as spreading malicious code, cyber-terrorism, have occurred in government agencies, the press and the financial sector. DDoS attacks are the simplest Internet-based infringement attacks techniques that have fatal consequences. DDoS attacks have caused bandwidth consumption at the network layer. These attacks are difficult to detect defend against because the attack packets are not significantly different from normal traffic. Abnormal traffic is threatening the stability of the network. Therefore, the abnormal traffic by generating indications will need to be detected in advance. This study examined the abnormal traffic detection technique using a forecasting model-based trend model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.5
• /
• pp.368-376
• /
• 2013

The importance of application traffic identification is emphasized for the efficient network management with recent rapid development of internet. In this paper, we present the application traffic identification method using the behavior based signature to improve the previous limitations. The behavior based signature is made by combining the existing various traffic features, and uses the Inter-Flow unit that is combination of the first request packet of each flow. All signatures have 100% precision when measured the accuracy of 5 applications using at home and abroad to prove the feasibility of the proposed signature.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.225-230
• /
• 2015

This study presents a method for generating IEC 61850 Sampled Values(SV) traffic by combining the emulation function of network simulator ns-3 with the actual communication equipment. For the SV traffic generation and reception, the emulation function of the network simulator ns-3 is used, while as a communication network, the actual communication equipment, switches are used. In addition, the SV traffic frames generated are analyzed, using Wireshark, and it is confirmed that the SV traffic frames are generated accurately. The method for the SV traffic generation proposed in the present study will be very useful when various SV traffics are generated under the environment of an actual substation.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.48-56
• /
• 2002

This paper proposes an IP(Internet Protocol) multicast routing method by multiple tree routes. Multiple trees, instead of a single tree, improve the quality of multicast services with nonlinear link cost and huge traffic demand. The proposed method adds tree routes until it satisfies target conditions, and it splits the multicast traffic demand into the chosen tree routes. We develop a mathematical model and optimal conditions for traffic splitting. The method works on the problems with many different simultaneous multicast traffic. Various experiments were carried and the results show that the new multicasting is fairly effective on end-to-end quality of services.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3789-3809
• /
• 2015

In this paper, we deal with the problem of M2M gateways' network selection for different types of M2M traffic in heterogeneous wireless networks. Based on the difference in traffic's quality of service (QoS) requirements, the M2M traffic produced by various applications is mainly classified as two categories: flexible traffic and rigid traffic. Then, game theory is adopted to solve the problem of network-channel selection with the coexistence of flexible and rigid traffic, named as flexible network access (FNA). We prove the formulated discrete game is a potential game. The existence and feasibility of the Nash equilibrium (NE) of the proposed game are also analyzed. Then, an iterative algorithm based on optimal reaction criterion and a distributed algorithm with limited feedback based on learning automata are presented to obtain the NE of the proposed game. In simulations, the proposed iterative algorithm can achieve a near optimal sum utility of whole network with low complexity compared to the exhaustive search. In addition, the simulation results show that our proposed algorithms outperform existing methods in terms of sum utility and load balance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.759-761
• /
• 2016

ICMP(Internet Control Message Protocol) supports the processing of error in the communication network based TCP/IP. If a problem is occurred in a data transmission process, router or receiving host sends ICMP message containing the error cause to sending host. However, in this process an attacker sends a fake ICMP message to the host so that the communication between the hosts can be abnormally terminated. In this paper, we performed a study to prevent several attacks related to ICMP. To this, we have designed outbound traffic controller so that attack packet is not transmitted to network in operating system of host.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2589-2609
• /
• 2021

Segment routing (SR) is a highly implementable approach for traffic engineering (TE) with high flexibility, high scalability, and high stability, which can be established upon existing network infrastructure. Thus, when a network failure occurs, it can leverage the existing rerouting methods, such as rerouting based on Interior Gateway Protocol (IGP) and fast rerouting with loop-free alternates. To better exploit these features, we propose a high-performance and easy-to-deploy method SRUF (Segment Routing under Uncertain Failures). The method is inspired by the Value-at-Risk (VaR) theory in finance. Just as each investment risk is considered in financial investment, SRUF also considers each traffic distribution scheme's risk when forwarding traffic to achieve optimal traffic distribution. Specifically, SRUF takes into account that every link may fail and therefore has inherent robustness and high availability. Also, SRUF considers that a single link failure is a low-probability event; hence it can achieve high performance. We perform experiments on real topologies to validate the flexibility, high-availability, and load balancing of SRUF. The results show that when given an availability requirement, SRUF has greater load balancing performance under uncertain failures and that when given a demand requirement, SRUF can achieve higher availability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4372-4394
• /
• 2020

The distribution of popular videos incurs a large amount of traffic at the base stations (BS) of networks. Device-to-multi-device (D2MD) communication has emerged an efficient radio access technology for offloading BS traffic in recent years. However, traditional studies have focused on synchronous user requests whereas asynchronous user requests are more common. Hence, offloading BS traffic in case of asynchronous user requests while considering their time-varying characteristics and the quality of experience (QoE) of video request users (VRUs) is a pressing problem. This paper uses social stability (SS) and video loading duration (VLD)-tolerant property to group VRUs and seed users (SUs) to offload BS traffic. We define the average amount of data transmission (AADT) to measure the network's capacity for offloading BS traffic. Based on this, we formulate a time-varying bipartite graph matching optimization problem. We decouple the problem into two subproblems which can be solved separately in terms of time and space. Then, we propose the socially aware D2MD user selection (SA-D2MD-S) algorithm based on finite horizon optimal stopping theory, and propose the SA-D2MD user matching (SA-D2MD-M) algorithm to solve the two subproblems. The results of simulations show that our algorithms outperform prevalent algorithms.