• 한국정보통신학회논문지
• /
• 제26권11호
• /
• pp.1630-1636
• /
• 2022

현재 교통 표지판 인식 기법들은 다양한 날씨, 빛의 변화 등과 같은 외부환경 뿐만 아니라 교통 표지판이 일부 훼손된 경우에는 인식 성능이 저하되는 경우가 발생한다. 따라서 본 논문에서는 이러한 문제점을 개선하기 위하여 홉필드 네트워크와 퍼지 Max-Min 신경망을 이용하여 손상된 교통 표지판의 인식 성능을 개선하는 방법을 제안한다. 제안된 방법은 손상된 교통 표지판에서 특징들을 분석한 후, 그 특징들을 학습 패턴으로 구성하여 퍼지 Max-Min 신경망에 적용하여 1차적으로 교통 표지판의 특징을 분류한다. 1차적 분류된 특징이 있는 학습 영상들을 홉필드 네트워크에 적용하여 손상된 특징을 복원한다. 홉필드 네트워크를 적용하여 복원된 교통 표지판의 특징들을 다시 퍼지 Max-Min 신경망에 적용하여 최종적으로 손상된 교통 표지판을 분류하고 인식한다. 제안된 방법의 성능을 평가하기 위하여 손상된 정도가 다른 다양한 교통 표지판 8개를 적용하여 실험한 결과, 제안된 방법이 퍼지 Max-Min 신경망에 비해 평균적으로 38.76%의 분류 성능이 개선되었다.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2002년도 춘계학술대회
• /
• 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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• 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

• 한국멀티미디어학회논문지
• /
• 제9권5호
• /
• pp.635-648
• /
• 2006

초고속 인터넷의 보급이 대중화되고 콘솔 게임기와 모바일이 네트워크 게임을 지원하면서 온라인 게임 산업이 빠르게 성장하고 있으며, 온라인 게임으로 인한 인터넷 트래픽이 꾸준히 증가하고 있다. 게임 네트워크의 설계나 시뮬레이션을 위해서는 온라인 게임 트래픽의 분석이 선행되어야 하기 때문에, 온라인 게임의 트래픽에 관련된 연구가 국내 외에서 꾸준히 진행되고 있다. 본 논문은 온라인 게임의 트래픽 측정과 분석을 위하여 게임 전용 트래픽 측정 및 분석 툴인 GameNet Analyzer를 제작하여 사용하였다. 서로 다른 장르의 게임인 Quake 3, Starcraft, WoW(World of Warcraft)의 트래픽을 측정하여 플레이어의 수와 게임 플레이 방식에 따른 패킷 크기, 패킷 IAT(inter-arrival time), 데이터 전송률과 패킷 전송률을 분석하고, 측정된 데이터를 이용하여 트래픽을 모델링한다. 이러한 게임 트래픽의 분석이나 트래픽 모델은 효율적인 네트워크 시뮬레이션, 게임 네트워크의 성능 평가, 온라인 게임의 설계 등에 활용될 수 있다.

• Journal of Communications and Networks
• /
• 제14권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.

• Journal of information and communication convergence engineering
• /
• 제20권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.

• International Journal of Computer Science & Network Security
• /
• 제23권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.

• 한국위성정보통신학회논문지
• /
• 제7권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.

• Journal of Communications and Networks
• /
• 제7권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.

• 대한전자공학회논문지TC
• /
• 제47권3호
• /
• pp.39-49
• /
• 2010

애드혹(Ad hoc)네트워크는 각 노드에 의하여 네트워크의 토폴로지가 구성되는 인프라스트럭처래스(infrastructureless) 네트워크이다. 전용의 네트워크 디바이스가 없기 때문에 각 노드들이 디바이스 기능 즉, 네트워크 제어와 관리기능을 수행한다. 애드혹 네트워크는 어떤 노드가 네트워크 토폴로지에 참여하거나 탈퇴하는 것이 임의적이기 때문에 토폴로지의 확장이 용이하고, 트래픽이 먼 거리를 가는 경우에는 중간 노드들의 경로를 경유해야 하는데, 이러한 요인들이 성능변동에 영향을 준다. 따라서 각 노드들은 자신의 트래픽을 안정적으로 유지하기 위하여 주변의 트래픽, 네트워크를 구성하는 경로들의 상태, 자신의 트래픽야 경유할 노드에서 트래픽 몇 혼잡제어 등을 고려할 필요가 있다. 본 논문은 경로의 대역을 유한자원으로 가정하고 경로를 점유하기 위하여 발생하는 트혜픽 경쟁이 전송성능에 미치는 영향과 이러항 경쟁모델을 구성하는 인자가 성능에 미치는 영향을 분석하고 그 결과를 제시하였다. 이러한 결과는 네트워크에서 관리정책과 기법 등에 기여할 것으로 기대한다.