• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.375-381
• /
• 2010

A flooding attack, such as DoS or Worm, can be easily created or even downloaded from the Internet, thus, it is one of the main threats to servers on the Internet. This paper presents an online real-time network response system, which can determine whether a LAN is suffering from a flooding attack within a very short time unit. The detection engine of the system is based on the incremental mining of fuzzy association rules from network packets, in which membership functions of fuzzy variables are optimized by a genetic algorithm. The incremental mining approach makes the system suitable for detecting, and thus, responding to an attack in real-time. This system is evaluated by 47 flooding attacks, only one of which is missed, with no false positives occurring. The proposed online system belongs to anomaly detection, not misuse detection. Moreover, a mechanism for dynamic firewall updating is embedded in the proposed system for the function of eliminating suspicious connections when necessary.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.5
• /
• pp.326-328
• /
• 2014

In this paper we propose an efficient algorithm for LSA(Link State Advertisements) flooding. Link state routing protocols have been widely adopted in wired networks. When link state change occurs, a LSA is flooded into the whole network. The overhead of LSA flooding may be a big problem in wireless networks because their link states can be changed frequently. We propose an efficient flooding method that optimizes the flooding processes in wireless networks.

• Journal of the military operations research society of Korea
• /
• v.18 no.2
• /
• pp.126-139
• /
• 1992

In this paper, the computational problems of packet transmission probability (PTP) in a computer communication network (CCN) under flooding routing are investigated. To avoid a congestion under this routing, two control methods are considerd, i. e., copy storage control and hop count control. Problems of PTP under flooding routings with these two control methods are respectively shown to be equivalent to those of source-to-terminal reliability(STR) with an exception for a case of hop count control where the hop count is less than the length of the longest path. For this exceptional case, an efficient computational algorithm for PTP is developed. This algorithm is proposed as an efficient tool for the determination of hop count which satisfies a given reliability constraint. A numerical example illustrates a proposed algorithm.

• Journal of the Korea Society for Simulation
• /
• v.15 no.1
• /
• pp.69-75
• /
• 2006

P2P services occupy more then 50% of the internet traffics. A huge number of query packets are generated since pure P2P based models rely on message flooding for their query mechanisms. In this study, the numbers of query messages generated in the pure P2P and hybrid P2P model are analyzed. The results show that hybrid P2P models also could suffer from message flooding. To reduce the message flooding, this study proposes an interest based clustering mechanism for hybrid P2P services. By applying this clustering algorithm, it could reduce 99.998% of the message flooding. The proposed algorithm also reduces the cost of the joining operations by storing previous supernodes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.907-910
• /
• 2007

본 논문에서는 Ad-hoc 네트워크에서 패킷 flooding에 의해 발생하게 되는 broadcast storm problem [1]을 해결하기 위한 크로스 레이어 기반의 flooding 기법을 제안한다. 제안된 flooding 기법은 크로스 레이어 프로토콜을 기반으로 하여 물리계층과 MAC (Medium Access Control) 계층에서 이웃 노드들에 대한 정보를 수집하고, 이를 이용하여 효율적인 재전송 노드의 수를 결정한다. 모의 실험을 통한 성능평가에서는 전체 네트워크 노드에 대한 수신 비율이 simple flooding 에 근접하며, 전송 비율 및 평균중복패킷 수에서도 좋은 성능을 보임으로서 broadcast storm problem을 해결할 수 있다.

• The KIPS Transactions:PartC
• /
• v.17C no.6
• /
• pp.499-504
• /
• 2010

The flooding is the simplest and effective way to disseminate a packet to all nodes in a wireless sensor network (WSN). However, basic flooding makes all nodes transmit the packet at least once, resulting in the broadcast storm problem in a serious case, in turn network resources become severely wasted. Particularly, power is one of the most valuable resources of WSNs as nodes are powered by battery, then the waste of energy by the basic flooding lessens the lifetime of WSNs. In order to solve the broadcast storm problem, this paper proposes a dynamic probabilistic flooding that utilizes the neighbor information like the number of child and sibling nodes. Simulation results show that the proposed method achieves a higher packet delivery ratio with the similar number of duplicate packets as compared to existing schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8B
• /
• pp.797-804
• /
• 2009

Recently, SIP(Session Initiation Protocol) is used to set up and manage sessions for multimedia applications such as VoIP(Voice over IP) and IMS(IP Multimedia Subsystem). However, because SIP operates over the Internet, it is exposed to pre-existed internet security threats such as service degradation or service disruptions. Multimedia applications which are delay sensitive even suffers more from the threats mentioned above. The proposed methods so far to detect SIP INVITE flooding are CUSUM(Cumulative Sum), Hellinger distance and adaptive threshold, but among methods only take normal state into consideration. So, it is not capable of adapting the condition of the network congestion which are dynamically changing. In this paper, SIP INVITE flooding detection algorithm considering network congestion which enables efficient detections of such attacks is proposed. The proposed algorithm is expected to detect other types of attacks such as BYE and CANCEL more precisely compared to other methods.

• Journal of Navigation and Port Research
• /
• v.29 no.10 s.106
• /
• pp.865-870
• /
• 2005

Because there are only a limited number of means of action that are available for the master to pursue in the event of flooding, onboard decision support system has been required. The majority of systems activated during a flooding emergency (such as watertight and semi-watertight doors, bulkhead valves, dewatering pumps etc.) almost exclusively aim to restore a sufficiently high level of subdivision to prevent flooding from spreading through the ship. Even though assuming the flooding scenario is not catastrophic, the use of ballast tanks can be an additional and very effective tool to ensure both prevention of flooding spreading and also improve ship stability. This paper describes an optimization algorithm devised to choose the set of ballast tanks that should be filled in order to achieve an optimal response to a flooding accident.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2005.10a
• /
• pp.75-80
• /
• 2005

Because there are only a limited number of means of action that are available for the master to pursue in the event of flooding, onboard decision support system has been required The majority of systems activated during a flooding emergency (such as watertight and semi-watertight doors, bulkhead valves, dewatering pumps etc.) almost exclusively aim to restore a sufficiently high level of subdivision to prevent flooding from spreading through the ship. Even though assuming the flooding scenario is not catastrophic, the use of ballast tanks can be an additional and very effective tool to ensure both prevention of flooding spreading and also improve ship stability. This paper describes an optimization algorithm devised to choose the set of ballast tanks that should be filled in order to achieve an optimal response to a flooding accident.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3B
• /
• pp.123-134
• /
• 2008

In this paper, a routing algorithm for wireless sensor networks is proposed to improve the efficiency of energy consumption in sensor nodes. Each sensor node has the value called ‘Flooding Level’ obtained through the initial flooding from a sink node instead of sending beacon messages in multi-hop sensor field. This value can be used for guaranteeing the sensor nodes to connect with a sink node and determining the roles of cluster-head and cluster-gateway node efficiently and simply during the clustering. If different algorithms are added to our protocol, it will work better in the side of energyefficiency. This algorithm is evaluated through analysis and extensive simulations.