• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.310-318
• /
• 2012

Detecting intrusion attacks accurately and rapidly in wireless networks is one of the most challenging security problems. Intrusion attacks of various types can be detected by the change in traffic flow that they induce. Wireless industrial networks based on the wireless networks for industrial automation-process automation (WIA-PA) standard use a superframe to schedule network communications. We propose an intrusion detection system for WIA-PA networks. After modeling and analyzing traffic flow data by time-sequence techniques, we propose a data traffic prediction model based on autoregressive moving average (ARMA) using the time series data. The model can quickly and precisely predict network traffic. We initialized the model with data traffic measurements taken by a 16-channel analyzer. Test results show that our scheme can effectively detect intrusion attacks, improve the overall network performance, and prolong the network lifetime.

• Journal of the Korea Society for Simulation
• /
• v.14 no.1
• /
• pp.33-42
• /
• 2005

Service Level Agreement (SLA) is a service providing scheme by a service class agreement between a user and a service provider SLA allows that a user can select an expected service class in various service classes provided from a service provider. Recently, SLA management is adapted to support the end-to-end Qos for service users in Beyond 3 Generation (B3G) networks. In B3G networks, SLA provides multiple service classes on access networks so that service classes should be managed to assure the service satisfaction for users. In this paper, we propose a dynamic Qos management scheme by IP traffic class controlling based on SLA in B3G networks. Also, to manage dynamic traffic service, we consider Differentiated services (Diffserv) mechanism for the resource management by SLA. An If service traffic class on SLA can be dynamically changed by Diffserv traffic management to support dynamic end-to-end Qos. Hence, in this paper, we consider the buffer threshold scheme for controlling traffic loads and the traffic level control scheme for implementing the dynamic traffic management by the SLA.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.777-786
• /
• 2006

Since the introduction of competition in the telecommunication market due to the growth of the interconnection between heterogeneous networks, particularly fixed and mobile networks, the interconnection charge based on traffic-sensitive (TS) and non-traffic-sensitive (NTS) costs has become more important. Although there have been many studies of the public switched telephone network (PSTN), previous studies of TS and NTS costs in mobile networks are very few. In this paper, as a pilot study, we propose three criteria and a procedure for the classification of TS and NTS costs based on mobile systems. The three criteria are the following: function type, investment requirement, and main exhaust driver. Moreover, for a CDMA mobile system, strongly TS, strongly NTS, and mixed components are classified by the proposed criteria and procedure. The proposed criteria, procedure, and classification can provide a systematic and useful guideline to decide the scope of mobile facilities and to determine the terminating cost on mobile networks from fixed networks.

• Journal of Communications and Networks
• /
• v.9 no.1
• /
• pp.93-104
• /
• 2007

Traffic grooming, in which low-rate circuits are multiplexed onto wavelengths, with the goal of minimizing the number of add-drop multiplexers (ADMs) and wavelengths has received much research attention from the optical networking community in recent years. While previous work has considered various traffic models and network architectures, protection requirements of the circuits have not been considered. In this paper, we consider survivable traffic grooming, or grooming traffic which contains a mix of circuits that need protection and that do not need protection. We assume a unidirectional ring network with all-to-all symmetric traffic with $t\geq1$ circuits between each node pair, of which s require protection. As it turns out, survivable traffic grooming presents a significant tradeoff between the number of wavelengths and the number of ADMs, which is almost non-existent in non-survivable traffic grooming for this type of traffic. We explore this tradeoff for some specific cases in this paper. We also present some new results and solution methods for solving certain non-survivable traffic grooming problems.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.123-131
• /
• 2016

The high-availability seamless redundancy (HSR) protocol is one of the most important redundancy IEC standards that has garnered a great deal of attention because it offers a redundancy with zero recovery time, which is a feature that is required by most of the modern substation, smart grid, and industrial field applications. However, the HSR protocol consumes a lot of network bandwidth compared to the Ethernet standard. This is due to the duplication process for every sent frame in the HSR networks. In this paper, a novel algorithm known as the reducing multicast traffic (RMT) is presented to reduce the unnecessary redundant multicast traffic in HSR networks by limiting the spreading of the multicast traffic to only the rings that have members associated with that traffic instead of spreading the traffic into all the network parts, as occurs in the standard HSR protocol. The mathematical and the simulation analyses show that the RMT algorithm offers a traffic reduction percentage with a range of about 60-87% compared to the standard HSR protocol. Consequently, the RMT algorithm will increase the network performance by freeing more bandwidth so as to reduce HSR network congestion and also to minimize any intervention from the network administrator that would be required when using traditional traffic filtering techniques.

• ETRI Journal
• /
• v.5 no.2
• /
• pp.17-28
• /
• 1983

This paper deals with the problem of optimally controlling traffic flows in urban transportation traffic networks. For this, a nonlinear discrete-time model of urban traffic network is first suggested in order to handle the phenomenon of traffic flows such as oversaturatedness and/or undersaturatedness. Then an optimal control problem is formulated and a hierarchical optimization technique is applied, which is based upon a prediction-type two-level method of Hirvonen and Hakkala.

• Journal of Communications and Networks
• /
• v.18 no.4
• /
• pp.559-566
• /
• 2016

Software defined network (SDN) can effectively improve the performance of traffic engineering and will be widely used in backbone networks. Therefore, new energy-saving schemes must take SDN into consideration; this action is extremely important owing to the rapidly increasing energy consumption in telecom and Internet service provider (ISP) networks. Meanwhile, the introduction of SDN in current networks must be incremental in most cases, for technical and economic reasons. During this period, operators must manage hybrid networks in which SDN and traditional protocols coexist. In this study, we investigate the energy-efficient traffic engineering problem in hybrid SDN/Internet protocol (IP) networks. First, we formulate the mathematical optimization model considering the SDN/IP hybrid routing mode. The problem is NP-hard; therefore, we propose a fast heuristic algorithm named hybrid energy-aware traffic engineering (HEATE) as a solution. In our proposed HEATE algorithm, the IP routers perform shortest-path routing by using distributed open shortest path first (OSPF) link weight optimization. The SDNs perform multipath routing with traffic-flow splitting managed by the global SDN controller. The HEATE algorithm determines the optimal setting for the OSPF link weight and the splitting ratio of SDNs. Thus, the traffic flow is aggregated onto partial links, and the underutilized links can be turned off to save energy. Based on computer simulation results, we demonstrate that our algorithm achieves a significant improvement in energy efficiency in hybrid SDN/IP networks.

• The KIPS Transactions:PartC
• /
• v.17C no.4
• /
• pp.379-384
• /
• 2010

Mobile nodes in high mobility ad hoc networks might come together in specific areas. In non-uniformly distributed networks, traffic load can be concentrated to intermediate nodes between dense clusters, and networks performance can be degraded. In this paper, we proposed a cluster based routing protocol that heavy traffic nodes adaptively react according to traffic load. The simulation result shows that the proposed protocol reduce packet loss and end-to-end delay.

• Journal of Communications and Networks
• /
• v.12 no.6
• /
• pp.624-631
• /
• 2010

Effective traffic matrix estimation is the basis of efficient traffic engineering, and therefore, quality of service provision support in IP networks. In this study, traffic matrix estimation is investigated in IP networks and an Elman neural network-based traffic matrix inference (ENNTMI) method is proposed. In ENNTMI, the conventional Elman neural network is modified to capture the spatio-temporal correlations and the time-varying property, and certain side information is introduced to help estimate traffic matrix in a network accurately. The regular parameter is further introduced into the optimal equation. Thus, the highly ill-posed nature of traffic matrix estimation is overcome effectively and efficiently.

• ETRI Journal
• /
• v.42 no.3
• /
• pp.311-323
• /
• 2020

Encrypted traffic classification plays a vital role in cybersecurity as network traffic encryption becomes prevalent. First, we briefly introduce three traffic encryption mechanisms: IPsec, SSL/TLS, and SRTP. After evaluating the performances of support vector machine, random forest, naïve Bayes, and logistic regression for traffic classification, we propose the combined approach of entropy estimation and artificial neural networks. First, network traffic is classified as encrypted or plaintext with entropy estimation. Encrypted traffic is then further classified using neural networks. We propose using traffic packet's sizes, packet's inter-arrival time, and direction as the neural network's input. Our combined approach was evaluated with the dataset obtained from the Canadian Institute for Cybersecurity. Results show an improved precision (from 1 to 7 percentage points), and some application classification metrics improved nearly by 30 percentage points.