• Title/Summary/Keyword: Network Traffic

Search Result 4,265, Processing Time 0.034 seconds

Damaged Traffic Sign Recognition using Hopfield Networks and Fuzzy Max-Min Neural Network (홉필드 네트워크와 퍼지 Max-Min 신경망을 이용한 손상된 교통 표지판 인식)

  • Kim, Kwang Baek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.11
    • /
    • pp.1630-1636
    • /
    • 2022
  • The results of current method of traffic sign detection gets hindered by environmental conditions and the traffic sign's condition as well. Therefore, in this paper, we propose a method of improving detection performance of damaged traffic signs by utilizing Hopfield Network and Fuzzy Max-Min Neural Network. In this proposed method, the characteristics of damaged traffic signs are analyzed and those characteristics are configured as the training pattern to be used by Fuzzy Max-Min Neural Network to initially classify the characteristics of the traffic signs. The images with initial characteristics that has been classified are restored by using Hopfield Network. The images restored with Hopfield Network are classified by the Fuzzy Max-Min Neural Network onces again to finally classify and detect the damaged traffic signs. 8 traffic signs with varying degrees of damage are used to evaluate the performance of the proposed method which resulted with an average of 38.76% improvement on classification performance than the Fuzzy Max-Min Neural Network.

The study on Traffic management in Mobile Ad-hoc Network (이동 Ad-hoc 네트워크에서의 트래픽 관리에 관한 연구)

  • 강경인;박경배;유충렬;문태수;정근원;정찬혁;이광배;김현욱
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2002.05a
    • /
    • pp.121-127
    • /
    • 2002
  • In this paper, we propose traffic management support and evaluate the performance through simulation. We suggest traffic management routing protocol that can guarantee reliance according to not only reduction of the Network traffic congestion but also distribution of the network load that prevents data transmission. For performance evaluation, we analyzed the average data reception rate and network load, considering the node mobility. We found that in the mobile Ad Hoc networks, the traffic management service increased the average data reception rate and reduced the network traffic congestion and network load in Mobile Ad Hoc Networks.

  • PDF

Improvement of Network Traffic Monitoring Performance by Extending SNMP Function

  • Youn Chun-Kyun
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.171-175
    • /
    • 2004
  • Network management for detail analysis can cause speed decline of application in case of lack band width by traffic increase of the explosive Internet. Because a manager requests MIB value for the desired objects to an agent by management policy, and then the agent responds to the manager. Such processes are repeated, so it can cause increase of network traffic. Specially, repetitious occurrence of sending-receiving information is very inefficient for a same object when a trend analysis of traffic is performed. In this paper, an efficient SNMP is proposed to add new PDUs into the existing SNMP in order to accept time function. Utilizing this PDU, it minimizes unnecessary sending-receiving message and collects information for trend management of network efficiently. This proposed SNMP is tested for compatibility with the existing SNMP and decreases amount of network traffic largely

  • PDF

Traffic Analysis and Modeling for Network Games (네트워크 게임 트래픽 분석 및 모델링)

  • Park Hyo-Joo;Kim Tae-Yong
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.5
    • /
    • pp.635-648
    • /
    • 2006
  • As the advances of Internet infra structure and the support of console and mobile for network games, the industry of online game has been growing rapidly, and the online game traffic in the Internet has been increasing steadily. For design and simulation of game network, the analysis of online game traffic have to be preceded. Therefore a number of papers have been proposed for the purpose of analyzing the traffic data of network games and providing the models. We make and use GameNet Analyzer as a dedicated tool for game traffic measurement and analysis in this paper. We measure the traffic of FPS Quake 3, RTS Starcraft and MMORPG World of Warcraft (WoW), and analyze the packet size, packet IAT(inter-arrival time), data rate and packet rate according to the number of players and in-game behaviors. We also present the traffic models using measured traffic data. These analysis and models of game traffic can be used for effective network simulation, performance evaluation of game network and the design of online games.

  • PDF

Improvement of High-Availability Seamless Redundancy (HSR) Traffic Performance for Smart Grid Communications

  • Nsaif, Saad Allawi;Rhee, Jong Myung
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.653-661
    • /
    • 2012
  • High-availability seamless redundancy (HSR) is a redundancy protocol for Ethernet networks that provides two frame copies for each frame sent. Each copy will pass through separate physical paths, pursuing zero fault recovery time. This means that even in the case of a node or a link failure, there is no stoppage of network operations whatsoever. HSR is a potential candidate for the communications of a smart grid, but its main drawback is the unnecessary traffic created due to the duplicated copies of each sent frame, which are generated and circulated inside the network. This downside will degrade network performance and might cause network congestion or even stoppage. In this paper, we present two approaches to solve the above-mentioned problem. The first approach is called quick removing (QR), and is suited to ring or connected ring topologies. The idea is to remove the duplicated frame copies from the network when all the nodes have received one copy of the sent frame and begin to receive the second copy. Therefore, the forwarding of those frame copies until they reach the source node, as occurs in standard HSR, is not needed in QR. Our example shows a traffic reduction of 37.5%compared to the standard HSR protocol. The second approach is called the virtual ring (VRing), which divides any closed-loop HSR network into several VRings. Each VRing will circulate the traffic of a corresponding group of nodes within it. Therefore, the traffic in that group will not affect any of the other network links or nodes, which results in an enhancement of traffic performance. For our sample network, the VRing approach shows a network traffic reduction in the range of 67.7 to 48.4%in a healthy network case and 89.7 to 44.8%in a faulty network case, compared to standard HSR.

A Study on the Verification of Traffic Flow and Traffic Accident Cognitive Function for Road Traffic Situation Cognitive System

  • Am-suk, Oh
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.4
    • /
    • pp.273-279
    • /
    • 2022
  • Owing to the need to establish a cooperative-intelligent transport system (C-ITS) environment in the transportation sector locally and abroad, various research and development efforts such as high-tech road infrastructure, connection technology between road components, and traffic information systems are currently underway. However, the current central control center-oriented information collection and provision service structure and the insufficient road infrastructure limit the realization of the C-ITS, which requires a diversity of traffic information, real-time data, advanced traffic safety management, and transportation convenience services. In this study, a network construction method based on the existing received signal strength indicator (RSSI) selected as a comparison target, and the experimental target and the proposed intelligent edge network compared and analyzed. The result of the analysis showed that the data transmission rate in the intelligent edge network was 97.48%, the data transmission time was 215 ms, and the recovery time of network failure was 49,983 ms.

Cyber Threat Intelligence Traffic Through Black Widow Optimisation by Applying RNN-BiLSTM Recognition Model

  • Kanti Singh Sangher;Archana Singh;Hari Mohan Pandey
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.11
    • /
    • pp.99-109
    • /
    • 2023
  • The darknet is frequently referred to as the hub of illicit online activity. In order to keep track of real-time applications and activities taking place on Darknet, traffic on that network must be analysed. It is without a doubt important to recognise network traffic tied to an unused Internet address in order to spot and investigate malicious online activity. Any observed network traffic is the result of mis-configuration from faked source addresses and another methods that monitor the unused space address because there are no genuine devices or hosts in an unused address block. Digital systems can now detect and identify darknet activity on their own thanks to recent advances in artificial intelligence. In this paper, offer a generalised method for deep learning-based detection and classification of darknet traffic. Furthermore, analyse a cutting-edge complicated dataset that contains a lot of information about darknet traffic. Next, examine various feature selection strategies to choose a best attribute for detecting and classifying darknet traffic. For the purpose of identifying threats using network properties acquired from darknet traffic, devised a hybrid deep learning (DL) approach that combines Recurrent Neural Network (RNN) and Bidirectional LSTM (BiLSTM). This probing technique can tell malicious traffic from legitimate traffic. The results show that the suggested strategy works better than the existing ways by producing the highest level of accuracy for categorising darknet traffic using the Black widow optimization algorithm as a feature selection approach and RNN-BiLSTM as a recognition model.

RLP : An Efficient HSR Traffic Reduction Algorithm

  • Nsaif, Saad Allawi;Jun, Je Hyun;Shin, Sang Heon;Rhee, Jong Myung
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.3
    • /
    • pp.47-53
    • /
    • 2012
  • In this paper, we present an algorithm called redundant logical paths (RLP) for efficient HSR traffic reduction. It creates redundant logical paths between each HSR node and all the other nodes. Eventually, a logical full-meshed network or paths will be established among all HSR node types, except the Quadbox type, which is used only for interconnection. The logical full-meshed network will be used instead of using the standard HSR protocol that depends on the concepts of the duplication and forwarding of the received frame until it reaches the destination node. The RLP algorithm results in significantly less frame traffic because there is no random forwarding as in the standard HSR protocol. For the sample network in this paper simulation results showed a 61.5-80% reduction in network frame traffic compared to the standard HSR. Our algorithm will avoid latency issues in the network and even network congestion, thus improving network efficiency.

Traffic Engineering Based on Local States in Internet Protocol-Based Radio Access Networks

  • Barlow David A.;Vassiliou Vasos;Krasser Sven;Owen Henry L.;Grimminger Jochen;Huth Hans-Peter;Sokol Joachim
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.377-384
    • /
    • 2005
  • The purpose of this research is to develop and evaluate a traffic engineering architecture that uses local state information. This architecture is applied to an Internet protocol radio access network (RAN) that uses multi-protocol label switching (MPLS) and differentiated services to support mobile hosts. We assume mobility support is provided by a protocol such as the hierarchical mobile Internet protocol. The traffic engineering architecture is router based-meaning that routers on the edges of the network make the decisions onto which paths to place admitted traffic. We propose an algorithm that supports the architecture and uses local network state in order to function. The goal of the architecture is to provide an inexpensive and fast method to reduce network congestion while increasing the quality of service (QoS) level when compared to traditional routing and traffic engineering techniques. We use a number of different mobility scenarios and a mix of different types of traffic to evaluate our architecture and algorithm. We use the network simulator ns-2 as the core of our simulation environment. Around this core we built a system of pre-simulation, during simulation, and post-processing software that enabled us to simulate our traffic engineering architecture with only very minimal changes to the core ns-2 software. Our simulation environment supports a number of different mobility scenarios and a mix of different types of traffic to evaluate our architecture and algorithm.

A Study of Sensitivity Analysis and Traffic Performance by Competition in the Ad hoc Network (애드혹(Ad hoc) 네트워크에서 경쟁에 의한 트래픽성능 및 민감성 분석)

  • Cho, Hyang-Duck;Kim, Woo-Shik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.3
    • /
    • pp.39-49
    • /
    • 2010
  • Ad hoc network is infrastructureless network, that the network topology is configured by each node. Each node capacity device function namely, accomplishes a network control and a function of management because not being Network device of the exclusively. Ad hoc networks what kind of node join or leave the network topology to facilitate the expansion of arbitrary topology, to the case which is the distance whose traffic is distant the place must overtake through the route of intermediate nodes, like these facts give an effect to performance fluctuation. Consequently, each node in order to maintain traffic of oneself stably there is a necessity which will consider traffic and congestion control from the node which traffic of a condition and oneself of traffic of the circumference and the route which compose the network will overtake through. This paper assumes the path of the band with a finite resource, and path traffic to occupy the competition and its impact on transmission performance of these competing arguments to configure the model factor to analyse the performance impact on the results presented. Like this result with the fact that from the study, it will contribute in network management policy and the technique.