• Title/Summary/Keyword: hierarchical network

Search Result 975, Processing Time 0.037 seconds

A Hierarchical Model for Mobile Ad Hoc Network Performability Assessment

  • Zhang, Shuo;Huang, Ning;Sun, Xiaolei;Zhang, Yue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3602-3620
    • /
    • 2016
  • Dynamic topology is one of the main influence factors on network performability. However, it was always ignored by the traditional network performability assessment methods when analyzing large-scale mobile ad hoc networks (MANETs) because of the state explosion problem. In this paper, we address this problem from the perspective of complex network. A two-layer hierarchical modeling approach is proposed for MANETs performability assessment, which can take both the dynamic topology and multi-state nodes into consideration. The lower level is described by Markov reward chains (MRC) to capture the multiple states of the nodes. The upper level is modeled as a small-world network to capture the characteristic path length based on different mobility and propagation models. The hierarchical model can promote the MRC of nodes into a state matrix of the whole network, which can avoid the state explosion in large-scale networks assessment from the perspective of complex network. Through the contrast experiments with OPNET simulation based on specific cases, the method proposed in this paper shows satisfactory performance on accuracy and efficiency.

Emergent damage pattern recognition using immune network theory

  • Chen, Bo;Zang, Chuanzhi
    • Smart Structures and Systems
    • /
    • v.8 no.1
    • /
    • pp.69-92
    • /
    • 2011
  • This paper presents an emergent pattern recognition approach based on the immune network theory and hierarchical clustering algorithms. The immune network allows its components to change and learn patterns by changing the strength of connections between individual components. The presented immune-network-based approach achieves emergent pattern recognition by dynamically generating an internal image for the input data patterns. The members (feature vectors for each data pattern) of the internal image are produced by an immune network model to form a network of antibody memory cells. To classify antibody memory cells to different data patterns, hierarchical clustering algorithms are used to create an antibody memory cell clustering. In addition, evaluation graphs and L method are used to determine the best number of clusters for the antibody memory cell clustering. The presented immune-network-based emergent pattern recognition (INEPR) algorithm can automatically generate an internal image mapping to the input data patterns without the need of specifying the number of patterns in advance. The INEPR algorithm has been tested using a benchmark civil structure. The test results show that the INEPR algorithm is able to recognize new structural damage patterns.

Performability Analysis of Token Ring Networks using Hierarchical Modeling

  • Ro, Cheul-Woo;Park, Artem
    • International Journal of Contents
    • /
    • v.5 no.4
    • /
    • pp.88-93
    • /
    • 2009
  • It is important for communication networks to possess the capability to overcome failures and provide survivable services. We address modeling and analysis of performability affected by both performance and availability of system components for a token ring network under failure and repair conditions. Stochastic reward nets (SRN) is an extension of stochastic Petri nets and provides compact modeling facilities for system analysis. In this paper, hierarchical SRN modeling techniques are used to overcome state largeness problem. The upper level model is used to compute availability and the lower level model captures the performance. And Normalized Throughput Loss (NTL) is obtained for the composite ring network for each node failures occurrence as a performability measure. One of the key contributions of this paper constitutes the Petri nets modeling techniques instead of complicate numerical analysis of Markov chains and easy way of performability analysis for a token ring network under SRN reward concepts.

Multiple fault diagnosis method by using HANN (계층신경망을 이용한 다중고장진단 기법)

  • 이석희;배용환;배태용;최홍태
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1994.10a
    • /
    • pp.790-795
    • /
    • 1994
  • This paper describes multiple fault diagnosis method in complex system with hierarchical structure. Complex system is divided into subsystem, item, component. For diagnosing this hierarchical complex system, it is necessary to implement special neural network. We introducd to Hierarchical Artificial Neural Network(HANN) for this purpose. HANN consists of four level neural network, first level for symptom classification, second level for item fault diagnosis, third level for component symptom classification,forth level for component fault diagnosis. Each network is multi layer perceptron with 7 inputs, 30 hidden node and 7 outputs trainined by backpropagation. UNIX IPC(Inter Process Communication) is used for implementing HANN with multitasking and message transfer between processes in SUN workstation. We tested HANN in reactor system.

  • PDF

HIERARCHICAL CLUSTER ANALYSIS by arboART NEURAL NETWORKS and its APPLICATION to KANSEI EVALUATION DATA ANALYSIS

  • Ishihara, Shigekazu;Ishihara, Keiko;Nagamachi, Mitsuo
    • Proceedings of the Korean Society for Emotion and Sensibility Conference
    • /
    • 2002.05a
    • /
    • pp.195-200
    • /
    • 2002
  • ART (Adaptive Resonance Theory [1]) neural network and its variations perform non-hierarchical clustering by unsupervised learning. We propose a scheme "arboART" for hierarchical clustering by using several ART1.5-SSS networks. It classifies multidimensional vectors as a cluster tree, and finds features of clusters. The Basic idea of arboART is to use the prototype formed in an ART network as an input to other ART network that has looser distance criteria (Ishihara, et al., [2,3]). By sending prototype vectors made by ART to one after another, many small categories are combined into larger and more generalized categories. We can draw a dendrogram using classification records of sample and categories. We have confirmed its ability using standard test data commonly used in pattern recognition community. The clustering result is better than traditional computing methods, on separation of outliers, smaller error (diameter) of clusters and causes no chaining. This methodology is applied to Kansei evaluation experiment data analysis.

  • PDF

DDoS Attack Tolerant Network using Hierarchical Overlay (계층적 오버레이를 이용한 DDoS 공격 감내 네트워크)

  • Kim, Mi-Hui;Chae, Ki-Joon
    • The KIPS Transactions:PartC
    • /
    • v.14C no.1 s.111
    • /
    • pp.45-54
    • /
    • 2007
  • As one of the most threatening attacks, DDoS attack makes distributed multiple agents consume some critical resources at the target within the short time, thus the extent and scope of damage is serious. Against the problems, the existing defenses focus on detection, traceback (identification), and filtering. Especially, in the hierarchical networks, the traffic congestion of a specific node could incur the normal traffic congestion of overall lower nodes, and also block the control traffic for notifying the attack detection and identifying the attack agents. In this paper, we introduce a DDoS attack tolerant network structure using a hierarchical overlay for hierarchical networks, which can convey the control traffic for defense such as the notification for attack detection and identification, and detour the normal traffic before getting rid of attack agents. Lastly, we analyze the overhead of overlay construction, the possibility of speedy detection notification, and the extent of normal traffic transmission in the attack case through simulation.

Hierarchical network management based on MA+SNMP (MA+SNMP 기반의 계층적인 네트워크 관리구조)

  • Na, Ho-Jin;Cho, Kyung-San
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.5
    • /
    • pp.93-101
    • /
    • 2010
  • Although various network management architectures such as centralized, distributed, and hybrid have been presented, any one is not always efficient in all the environment. In this paper, we propose a hierarchical and split network management architecture based on MA+SNMP in order to manage a network of many small NEs distributed over the wide area. Our hierarchical architecture has MA-based proxy management nodes for the flexibility and overhead reduction in NMS as well as SNMP-based NEs considering NE's capacity. Through the analysis with real experiments, we show that our proposal improves some drawbacks and the processing delay of the existing architectures in the given environment.

SNMP Information based Hierarchical Routing Mechanism for Fast Handoff in Mobile IP (모바일 IP에서 Fast Handoff를 위한 SNMP 정보 기반 계층 라우팅 메커니즘)

  • 류상훈;박수현;이이섭;장한이;백두권
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.2
    • /
    • pp.131-145
    • /
    • 2004
  • Mobile IP has been designed only to maintain communications as mobile devices move from a place to a place, so it does not guarantee Quality of Service (QoS). Hierarchical MIPv6 improved QoS somewhat using Mobility Anchor Point(MAP), but QoS guarantee problem still remains. QoS in mobile IP is important to provide multimedia and real-timeapplications services in a mobile environment, and QoS is closely related to handoff delay. Therefore, handoff delay problem is actively studied as a main issue in mobile IP research area to guarantee QoS. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in an active network in order to resolve such a problem, Suggested QoS controlled method and existing handoff method, simulations are carried out with NS-2 for performance evaluation. The results of simulations show an improvement on handoff delay, and consequently the QoS improvement.

Prediction of Time Series Using Hierarchical Mixtures of Experts Through an Annealing (어닐링에 의한 Hierarchical Mixtures of Experts를 이용한 시계열 예측)

  • 유정수;이원돈
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10c
    • /
    • pp.360-362
    • /
    • 1998
  • In the original mixtures of experts framework, the parameters of the network are determined by gradient descent, which is naturally slow. In [2], the Expectation-Maximization(EM) algorithm is used instead, to obtain the network parameters, resulting in substantially reduced training times. This paper presents the new EM algorithm for prediction. We show that an Efficient training algorithm may be derived for the HME network. To verify the utility of the algorithm we look at specific examples in time series prediction. The application of the new EM algorithm to time series prediction has been quiet successful.

  • PDF

Robot PTP Trajectory Planning Using a Hierarchical Neural Network Structure (계층 구조의 신경회로망에 의한 로보트 PTP 궤적 계획)

  • 경계현;고명삼;이범희
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.39 no.10
    • /
    • pp.1121-1232
    • /
    • 1990
  • A hierarchical neural network structure is described for robot PTP trajectory planning. In the first level, the multi-layered Perceptron neural network is used for the inverse kinematics with the back-propagation learning procedure. In the second level, a saccade generation model based joint trajectory planning model in proposed and analyzed with several features. Various simulations are performed to investigate the characteristics of the proposed neural networks.

  • PDF